Routing, Data Gathering, and Neighbor Discovery in Delay-Tolerant Wireless Sensor Networks
2009 (English)In: 2009 IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL & DISTRIBUTED PROCESSING, 2009, 2775-2780 p.Conference paper (Other academic)
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.
Place, publisher, year, edition, pages
2009. 2775-2780 p.
, International Parallel and Distributed Processing Symposium IPDPS, ISSN 1530-2075
IdentifiersURN: urn:nbn:se:kth:diva-36079DOI: 10.1109/IPDPS.2009.5161191ISI: 000272993601110ScopusID: 2-s2.0-70450028884OAI: oai:DiVA.org:kth-36079DiVA: diva2:430366
23rd IEEE International Parallel and Distributed Processing Symposium Rome, ITALY, MAY 23-29, 2009
QC 201107082011-07-082011-07-082013-09-09Bibliographically approved