Coverage-adaptive random walks for fast sensory data collection

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6288 LNCS, Issue , 2010, Pages 81-94

  Angelopoulos, Constantinos Marios ^a,b   Nikoletseas, Sotiris ^a,b   Patroumpa, Dimitra ^a,b   Rolim, Jose ^c  

^a University of Patras and Computer Technology Institute   (Greece)

^b UNIVERSITY OF PATRAS   (Greece)

^c UNIVERSITY OF GENEVA   (Switzerland)

Author keywords

data collection; random walks; wireless sensor networks

Indexed keywords

ADAPTIVE RANDOM WALKS; COVER TIME; DATA COLLECTION; MEMORY REQUIREMENTS; NETWORK NODE; NETWORK PARAMETERS; PARTIAL COVER; RANDOM WALK; SENSORY DATA;

AD HOC NETWORKS; DATA ACQUISITION; ENERGY DISSIPATION; RANDOM PROCESSES; SENSOR NETWORKS; ECONOMIC AND SOCIAL EFFECTS; MOBILE AD HOC NETWORKS; WIRELESS NETWORKS; WIRELESS SENSOR NETWORKS;

WIRELESS SENSOR NETWORKS; WIRELESS AD HOC NETWORKS;

EID: 78649864935     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14785-2_7     Document Type: Conference Paper

References (10)

1. Efthymiou, C., Nikoletseas, S., Rolim, J.: Energy balanced data propagation in wireless sensor networks. Wireless Networks (WINET) Journal, 691-707 (2006)
2. 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)
3. 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)
4. 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)
5. 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)
6. Dimitriou, T., Nikoletseas, S.E., Spirakis, P.G.: The infection time of graphs. Discrete Applied Mathematics, 2577-2589 (2006)
7. Nikoletseas, S.E., Raptopoulos, C., Spirakis, P.G.: The survival of the weakest in networks. In: WAOA, pp. 316-329 (2006)
8. 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)
9. 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)
10. Yoon, J., Liu, M., Noble, B.: Random waypoint considered harmful. In: Proceedings of Infocom 2003, pp. 1312-1321 (2003)