By Topic

Improving partial cover of Random Walks in large-scale Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tzevelekas, L. ; Dept. of Inf. & Telecommun., Univ. of Athens, Athens, Greece ; Stavrakakis, I.

Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and do not require topology information. Nevertheless, they are relatively slow in reaching out to the network nodes, particularly when applied to wireless networks (such as Wireless Sensor Networks (WSNs)), where the steps of the walk are of limited range, they reach only physically-close neighbours and are unable to move the walker far away from just covered area; as a consequence, time and resources are wasted in revisits of already covered nodes. In this paper we develop an innovative mechanism (referred to as the Jumping Random Walk (J-RW)) that alleviates drastically the aforementioned problems and is shown to improve substantially (compared to the RW) the cover time/overhead or coverage of WSNs modelled as a random geometric graph.

Published in:

World of Wireless, Mobile and Multimedia Networks & Workshops, 2009. WoWMoM 2009. IEEE International Symposium on a

Date of Conference:

15-19 June 2009