research unit 1
 

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit Aigaion.nl.SourceForge.hetLogo

Publication

Type of publication:Inproceedings
Entered by:
TitleCoverage - Adaptive Random Walks for Fast Sensory Data Collection
Bibtex cite IDRACTI-RU1-2010-30
Booktitle 9th International Conference on Ad Hoc Networks and Wireless (ADHOC-NOW)
Year published 2010
Location Canada
Note to appear
Keywords random walks,wireless sensor networks,data collection
Abstract
Random walks in wireless sensor networks can serve as fully local, very simple strategies for sink motion that reduce energy dissipa- tion a lot but increase the latency of data collection. To achieve satis- factory 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 require- ments. Towards better balances of memory/performance, we propose two new random walks: the Random Walk with Inertia and the Explore-and- Go Random Walk; we also introduce a new metric (Proximity Varia- tion) that captures the different way each walk gets close to the network nodes. We implement the new walks and experimentally compare them to known ones. The simulation findings demonstrate that the new walkĘs performance (cover time) gets close to the one of the (much stronger) biased walk, 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.
Authors
Angelopoulos, Constantinos Marios
Nikoletseas, Sotiris
Patroumpa, Dimitra
Rolim, Jose
Topics
BibTeXBibTeX
RISRIS
Attachments
walks2009.pdf (main file)
 
Publication ID773