Abstract
The simplicity and low-overhead of random walks have made them a popular querying mechanism for Wireless Sensor Networks. However, most of the related work is of theoretical nature and present two important limitations. First, they are mainly based on simple random walks, where at each step, the next hop is selected uniformly at random among neighbors. This mechanism permits analytical tractability but wastes energy by unnecessarily visiting neighbors that have been visited before. Second, the studies usually assume static graphs which do not consider the impact of link dynamics on the temporal variation of neighborhoods.
In this work we evaluate the querying performance of Non-Revisiting Random Walks (NRWs). At each step, NRWs avoid re-visiting neighbors by selecting the next hop randomly among the neighbors with the minimum number of visits. We evaluated Pull-only and Pull-Push queries with NRWs in two ways: (i) on a test-bed with 102 tmotes and (ii) on a simulation environment considering link unreliability and asymmetry. Our main results show that non-revisiting random walks significantly improve upon simple random walks in terms of querying cost and load balancing, and that the push-pull mechanism is more efficient than the push-only for query resolution.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahn, J., Kapadia, S., Pattem, S., Sridharan, A., Zuniga, M., Jun, J., Avin, C., Krishnamachari, B.: Empirical evaluation of querying mechanisms for unstructured wireless sensor networks. SIGCOMM CCR 38(3), 17–26 (2008)
Avin, C., Brito, C.: Efficient and robust query processing in dynamic environments using random walk techniques. In: IPSN 2004 (2004)
Avin, C., Krishnamachari, B.: The power of choice in random walks: An empirical study. Computer Networks 52, 1 (2008)
Braginsky, D., Estrin, D.: Rumor routing algorthim for sensor networks. In: WSNA 2002 (2002)
Burioni, R., Cassi, D.: Random walks on graphs: ideas, techniques and results. J. Phys. A: Math. Gen. 38, R45–R78 (2005)
Cerpa, A., Wong, J.L., Kuang, L., Potkonjak, M., Estrin, D.: Statistical model of lossy links in wireless sensor networks. In: IPSN 2005 (2005)
Cerpa, A., Wong, J.L., Potkonjak, M., Estrin, D.: Temporal properties of low power wireless links: modeling and implications on multi-hop routing. In: MobiHoc 2005. ACM, New York (2005)
Chang, N., Liu, M.: Revisiting the ttl-based controlled flooding search: optimality and randomization. In: MobiCom 2004. ACM, New York (2004)
Chang, N., Liu, M.: Controlled flooding search in a large network. IEEE/ACM Transactions on Networking (TON)Â 15(2), 449 (2007)
Cheng, Z., Heinzelman, W.: Flooding strategy for target discovery in wireless networks. Wireless Networks 11(5), 607–618 (2005)
Friedman, R., Kliot, G., Avin, C.: Probabilistic quorum systems in wireless ad hoc networks. In: IEEE DSN 2008, June 2008, pp. 277–286 (2008)
Lawler, G.F.: A self-avoiding random walk. Duke Math. J. 47(3), 655–693 (1980)
Lovasz, L.: Random walks on graphs: A survey. Combinatorics, Paul Erdos is Eighty 2(1), 1–46 (1993)
Ni, S., Tseng, Y., Chen, Y., Sheu, J.: The broadcast storm problem in a mobile ad hoc network. In: MOBICOM 1999, p. 162. ACM, New York (1999)
Pemantle, R.: Vertex-reinforced random walk. Probability Theory and Related Fields 92(1), 117–136 (1992)
Sadagopan, N., Krishnamachari, B., Helmy, A.: Active query forwarding in sensor networks. Ad Hoc Networks 3(1), 91–113 (2005)
Servetto, S., Barrenechea, G.: Constrained random walks on random graphs: Routing algorithms for large scale wireless sensor networks. In: WSNA 2002 (2002)
Shakkottai, S.: Asymptotics of query strategies over a sensor network. In: IEEE INFOCOM, Citeseer, vol. 1, pp. 548–557 (2004)
Simsek, O., Jensen, D.: Navigating networks by using homophily and degree. PNASÂ 105, 35 (2008)
Sohrabi, K., Manriquez, B., Pottie, G.: Near-ground wideband channel measurements. In: IEEE Proc. VTC, New York (1999)
Srinivasan, K., Kazandjieva, M., Agarwal, S., Levis, P.: The beta-factor: measuring wireless link burstiness. In: SenSys 2008 (2008)
Woo, A., Tong, T., Culler, D.: Taming the underlying challenges of reliable multihop routing in sensor networks. In: SenSys 2003 (2003)
Zeng, X., Bagrodia, R., Gerla, M.: GloMoSim: a library for parallel simulation of large-scale wireless networks. ACM SIGSIM Simulation Digest (1998)
Zhao, J., Govindan, R.: Understanding packet delivery performance in dense wireless sensor networks. In: SenSys 2003, New York, NY, USA (2003)
Zuniga, M., Krishnamachari, B.: An analysis of unreliability and asymmetry in low-power wireless links. ACM Trans. Sen. Netw. 3(2), 7 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zuniga, M., Avin, C., Hauswirth, M. (2010). Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks. In: Silva, J.S., Krishnamachari, B., Boavida, F. (eds) Wireless Sensor Networks. EWSN 2010. Lecture Notes in Computer Science, vol 5970. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11917-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-11917-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11916-3
Online ISBN: 978-3-642-11917-0
eBook Packages: Computer ScienceComputer Science (R0)