Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Routing, Data Gathering, and Neighbor Discovery in Delay-Tolerant Wireless Sensor Networks
KTH, School of Electrical Engineering (EES), Communication Networks.ORCID iD: 0000-0002-3704-1338
2009 (English)In: 2009 IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL & DISTRIBUTED PROCESSING, 2009, 2775-2780 p.Conference paper, Published paper (Other academic)
Abstract [en]

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.
Series
International Parallel and Distributed Processing Symposium IPDPS, ISSN 1530-2075
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-36079DOI: 10.1109/IPDPS.2009.5161191ISI: 000272993601110Scopus ID: 2-s2.0-70450028884OAI: oai:DiVA.org:kth-36079DiVA: diva2:430366
Conference
23rd IEEE International Parallel and Distributed Processing Symposium Rome, ITALY, MAY 23-29, 2009
Note
QC 20110708Available from: 2011-07-08 Created: 2011-07-08 Last updated: 2013-09-09Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Karlsson, Gunnar

Search in DiVA

By author/editor
Karlsson, Gunnar
By organisation
Communication Networks
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 60 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf