![](bg8.png)
boundary effect of embedding the network. The worst
results in terms of load are obtained when using the
method of the Shortest Paths (c). We can observe that
almost all of the charge is concentrated near the center
of the network. Traditional Rumor Routing (d) with
an infinite memory and DRWs (b) present a similar
distribution of the load. It is quite balanced because
all of the nodes share the charge although some of
them are more used for dissemination than others.
5 CONCLUSION
In this paper, we have identified some of the funda-
mental issues associated to the design of an infor-
mation brokerage system for a sensor network. A
method for the solution of this problem using DRWs
has been presented.
The main result shown in this paper is that the
use of the second neighborhood in the construction
of the DRW is not efficient. It also has been shown
that the use of two branches for the construction of
the DRW improves latency achieving similar results
for depth than DRWs of one branch. Moreover, it has
been proved that higher densities of nodes in the net-
work leads to the construction of paths that use less
nodes in the list of relaying nodes. This means that
less nodes will be needed to transmit to farther zones
in the network.
In this research, we also have conducted experi-
ments to assess the suitability of our method for an
information brokerage system. The results show that
our method is good at balancing the load without
using a large amount of nodes. We prove that our
approach is similar to the use of Rumor Routing with
an infinite memory.
We can conclude that our method is suitable for
its use in an information brokerage system and that
simple strategies in the design of DRWs are efficient.
ACKNOWLEDGEMENT
This work has been developed as part of the POP-
WiN project (Parallel Object Remote Programming
for Heterogeneous Wireless Networks over IPv6) that
is financially supported by the Hasler Foundation in
its SmartWorld - Information and Communication
Technology for a Better World 2020 program.
REFERENCES
Banka, T., Tandon, G., and Jayasumana, A. P. (2005). Zonal
Rumor Routing for Wireless Sensor Networks. In
ITCC ’05: Proceedings of the International Confer-
ence on Information Technology: Coding and Com-
puting (ITCC’05) - Volume II, pages 562–567, Wash-
ington, DC, USA. IEEE Computer Society.
Braginsky, D. and Estrin, D. (2002). Rumor routing al-
gorthim for sensor networks. In Proceedings of the
1st ACM international workshop on Wireless sensor
networks and applications, WSNA ’02, pages 22–31,
New York, NY, USA. ACM.
Fang, Q., Gao, J., and Guibas, L. J. (2006). Landmark-
based information storage and retrieval in sensor net-
works. In In The 25th Conference of the IEEE Com-
munication Society (INFOCOM06, pages 1–12.
Fang, Q., Gao, J., Guibas, L. J., Silva, V., and Zhang, L.
(2005). Glider: Gradient landmark-based distributed
routing for sensor networks. In in Proc. of the 24th
Conference of the IEEE Communication Society (IN-
FOCOM, pages 339–350.
Funke, S., Guibas, L. J., Nguyen, A., and Wang, Y. (2006).
Distance-sensitive information brokerage in sensor
networks. In Proceedings of the Second IEEE interna-
tional conference on Distributed Computing in Sensor
Systems, DCOSS’06, pages 234–251, Berlin, Heidel-
berg. Springer-Verlag.
Funke, S. and Rauf, I. (2007). Information brokerage via
location-free double rulings. In Proceedings of the
6th international conference on Ad-hoc, mobile and
wireless networks, ADHOC-NOW’07, pages 87–100,
Berlin, Heidelberg. Springer-Verlag.
Leone, P. and Mu
˜
noz, C. (2013). Content based routing with
directional random walk for failure tolerance and de-
tection in cooperative large scale wireless networks.
In Proc. 2nd Intl. Workshop on Architecting Safety
in Collaborative Mobile Systems, SAFECOMP’13,
pages 313–324, Berlin, Heidelberg. Springer-Verlag.
Lin, C.-H., Kuo, J.-J., Liu, B.-H., and Tsai, M.-J.
(2012). Gps-free, boundary-recognition-free, and
reliable double-ruling-based information brokerage
scheme in wireless sensor networks. IEEE Transac-
tions on Computers, 61(6):885–898.
Liu, X., Huang, Q., and Zhang, Y. (2004). Combs, nee-
dles, haystacks: balancing push and pull for discov-
ery in large-scale sensor networks. In Proceedings of
the 2nd international conference on Embedded net-
worked sensor systems, SenSys ’04, pages 122–133,
New York, NY, USA. ACM.
Sarkar, R., Zhu, X., and Gao, J. (2009). Double rulings for
information brokerage in sensor networks. IEEE/ACM
Trans. Netw., 17(6):1902–1915.
Shokrzadeh, H., Haghighat, A. T., and Nayebi, A.
(2009). New routing framework base on rumor rou-
ting in wireless sensor networks. Comput. Commun.,
32(1):86–93.