Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Routing, data gathering, and neighbor discovery in delay-tolerant 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

3 Author(s)
Nayebi, A. ; Sharif Univ. of Technol., Tehran, Iran ; Sarbazi-Azad, H. ; Karlsson, G.

This paper investigates a class of mobile wireless sensor networks that are not connected most of the times. The characteristics of these networks is inherited from both delay tolerate networks (DTN) and wireless sensor networks. First, delay-tolerant wireless sensor networks (DTWSN) are introduced. Then, three main problems in the design space of these networks are discussed: Routing, data gathering, and neighbor discovery. An approach is proposed for deployment of DTWSNs based on the traditional opportunistic broadcast in delay tolerant networks with on-off periods. The delay and the throughput of the routing scheme were investigated in the DTN literature. However, the energy consumption was not studied thoroughly, which is focused here. Neighbor discovery in a sparse network could be a major source of energy consumption. Therefore, energy per contact measure is evaluated analytically based on the distribution of physical link duration. The results for 2D constant velocity model and random waypoint model are reported and the average PLD is suggested as an appropriate choice of beacon interval.

Published in:

Parallel & Distributed Processing, 2009. IPDPS 2009. IEEE International Symposium on

Date of Conference:

23-29 May 2009