Abstract
Random walks in wireless sensor networks can serve as fully local, very simple strategies for sink motion that significantly reduce energy dissipation a lot but increase the latency of data collection. To achieve satisfactory energy-latency trade-offs the sink walks can be made adaptive, depending on network parameters such as density and/or history of past visits in each network region; but this increases the memory requirements. Towards better balances of memory/performance, we propose three new random walks: the Random Walk with Inertia, the Explore-and-Go Random Walk and the Curly Random Walk; we also introduce a new metric (Proximity Variation) that captures the different way each walk gets close to the network nodes over time. We implement the new walks and experimentally compare them to known ones. The simulation findings demonstrate that the new walks’ performance (cover time) gets close to the one of the (much stronger) biased walk with memory, while in some other respects (partial cover time, proximity variation) they even outperform it. We note that the proposed walks have been fine-tuned in the light of experimental findings.
This work has been partially supported by EU/FIRE HOBNET project - STREP ICT-257466.
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
Efthymiou, C., Nikoletseas, S., Rolim, J.: Energy balanced data propagation in wireless sensor networks. Wireless Networks (WINET) Journal, 691–707 (2006)
Dhillon, S.S., Mieghem, P.V.: Comparison of random walk strategies for ad hoc networks. In: The Sixth Annual Mediterranean Ad Hoc Networking WorkShop (June 2007)
Kinalis, A., Nikoletseas, S., Patroumpa, D., Rolim, J.: Biased sink mobility and adaptive stop times for low latency data collection in sensor networks. In: GLOBECOM 2009: Proceedings of the 52nd IEEE International Global Communications Conference (2009)
Lima, L., Barros, J.: Random walks on sensor networks. In: WiOpt 2007: 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (April 2007)
Li, X., Nayak, A., Stojmenovic, I.: Sink mobility in wireless sensor networks. In: Wireless Sensor and Actuator Networks: Algorithms and Protocols for Scalable Coordination and Data Communication. Wiley, Chichester (2010)
Dimitriou, T., Nikoletseas, S.E., Spirakis, P.G.: The infection time of graphs. Discrete Applied Mathematics, 2577–2589 (2006)
Nikoletseas, S.E., Raptopoulos, C., Spirakis, P.G.: The survival of the weakest in networks. In: WAOA, pp. 316–329 (2006)
Dimitriou, T., Nikoletseas, S.E., Spirakis, P.G.: Analysis of the information propagation time among mobile hosts. In: Nikolaidis, I., Barbeau, M., Kranakis, E. (eds.) ADHOC-NOW 2004. LNCS, vol. 3158, pp. 122–134. Springer, Heidelberg (2004)
Chatzigiannakis, I., Nikoletseas, S.E., Spirakis, P.G.: An efficient communication strategy for ad-hoc mobile networks. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 285–299. Springer, Heidelberg (2001)
Yoon, J., Liu, M., Noble, B.: Random waypoint considered harmful. In: Proceedings of Infocom 2003, pp. 1312–1321 (2003)
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
Angelopoulos, CM., Nikoletseas, S., Patroumpa, D., Rolim, J. (2010). Coverage-Adaptive Random Walks for Fast Sensory Data Collection . In: Nikolaidis, I., Wu, K. (eds) Ad-Hoc, Mobile and Wireless Networks. ADHOC-NOW 2010. Lecture Notes in Computer Science, vol 6288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14785-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-14785-2_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14784-5
Online ISBN: 978-3-642-14785-2
eBook Packages: Computer ScienceComputer Science (R0)