Shortest-Latency Opportunistic Routing in Asynchronous Wireless sensor Networks with Independent Duty-Cycling

Cited 3 time in webofscience Cited 0 time in scopus
  • Hit : 30
  • Download : 0
For opportunistic routing in independent duty-cycled wireless sensor networks (WSNs), a sender dynamically determines a relay candidate set depending on the real-time network conditions. Due to independent and varying duty cycle length, the sender may handle different waking-up orders of the potential forwarders when it tries to forward data packets at different time instants. Conventional opportunistic routing protocols overlook the time-varying property of the waking-up order of the candidate nodes. In this paper, we theoretically analyze how to obtain an optimal candidate set for each node in order to minimize the end-to-end latency. Then, considering the realistic scenarios, we propose an opportunistic routing which jointly considers global and localized optimizations. Based on the relatively stable topology and duty-cycle length information, an original candidate set is constructed. Then, by considering the real-time link and duty cycle information in the local context, a further optimization for the original candidate set can be achieved. Simulation results show that our proposed schemes can significantly improve the end-to-end latency compared with the benchmarks.
Publisher
IEEE COMPUTER SOC
Issue Date
2020-03
Language
English
Article Type
Article
Citation

IEEE TRANSACTIONS ON MOBILE COMPUTING, v.19, no.3, pp.711 - 723

ISSN
1536-1233
DOI
10.1109/TMC.2019.2897998
URI
http://hdl.handle.net/10203/274101
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 3 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0