Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Opportunistic Routing in Low Duty-Cycle Wireless Sensor Networks
KTH Royal Institute of Technology, Sweden.
Chalmers University of Technology, Sweden.
Huawei Technologies Sweden AB, Sweden.
RISE, Swedish ICT, SICS, Computer Systems Laboratory.ORCID iD: 0000-0001-7592-1048
Show others and affiliations
2014 (English)In: TOSN: ACM Transactions on Sensor Networks, Vol. 10, no 4, article id 67Article in journal (Refereed) Published
Abstract [en]

Opportunistic routing is widely known to have substantially better performance than unicast routing in wireless networks with lossy links. However, wireless sensor networks are heavily duty-cycled, i.e. they frequently enter sleep states to ensure long network life-time. This renders existing opportunistic routing schemes impractical, as they assume that nodes are always awake and can overhear other transmissions. In this paper we introduce ORW, a practical opportunistic routing scheme for wireless sensor networks. ORW uses a novel opportunistic routing metric, EDC, that reflects the expected number of duty-cycled wakeups that are required to successfully deliver a packet from source to destination. We devise distributed algorithms that find the EDC-optimal forwarding and demonstrate using analytical performance models and simulations that EDC-based opportunistic routing results in significantly reduced delay and improved energy efficiency compared to the traditional unicast routing. We compare the performance of the ORW protocol with other alternatives in both simulations and testbed-based experiments. Our results show that ORW reduces radio duty cycles on average by 50% (up to 90% on individual nodes) and delays by 30% to 90% when compared to the state of the art.

Place, publisher, year, edition, pages
2014, 15. Vol. 10, no 4, article id 67
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:ri:diva-24322DOI: 10.1145/2533686Scopus ID: 2-s2.0-84902689671OAI: oai:DiVA.org:ri-24322DiVA, id: diva2:1043402
Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2020-12-01Bibliographically approved

Open Access in DiVA

fulltext(1136 kB)199 downloads
File information
File name FULLTEXT01.pdfFile size 1136 kBChecksum SHA-512
7fb5bdc755320e9afb76b042b73a0d84340ab25111c7edfbcc9cffdcb5169aa7ff68c70e0e64230115b5196de8cb1bf75b83eb9aca1386195a7a506d6a155439
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records

Duquennoy, Simon

Search in DiVA

By author/editor
Ghadimi, EuhannaLandsiedel, OlafDuquennoy, Simon
By organisation
Computer Systems Laboratory
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 199 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • 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