DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhang, Xinming | ko |
dc.contributor.author | Tao, Lei | ko |
dc.contributor.author | Yan, Fan | ko |
dc.contributor.author | Sung, Dan Keun | ko |
dc.date.accessioned | 2020-05-06T06:20:27Z | - |
dc.date.available | 2020-05-06T06:20:27Z | - |
dc.date.created | 2019-02-07 | - |
dc.date.created | 2019-02-07 | - |
dc.date.created | 2019-02-07 | - |
dc.date.issued | 2020-03 | - |
dc.identifier.citation | IEEE TRANSACTIONS ON MOBILE COMPUTING, v.19, no.3, pp.711 - 723 | - |
dc.identifier.issn | 1536-1233 | - |
dc.identifier.uri | http://hdl.handle.net/10203/274101 | - |
dc.description.abstract | 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. | - |
dc.language | English | - |
dc.publisher | IEEE COMPUTER SOC | - |
dc.title | Shortest-Latency Opportunistic Routing in Asynchronous Wireless sensor Networks with Independent Duty-Cycling | - |
dc.type | Article | - |
dc.identifier.wosid | 000526539200015 | - |
dc.identifier.scopusid | 2-s2.0-85079640371 | - |
dc.type.rims | ART | - |
dc.citation.volume | 19 | - |
dc.citation.issue | 3 | - |
dc.citation.beginningpage | 711 | - |
dc.citation.endingpage | 723 | - |
dc.citation.publicationname | IEEE TRANSACTIONS ON MOBILE COMPUTING | - |
dc.identifier.doi | 10.1109/TMC.2019.2897998 | - |
dc.contributor.localauthor | Sung, Dan Keun | - |
dc.contributor.nonIdAuthor | Zhang, Xinming | - |
dc.contributor.nonIdAuthor | Tao, Lei | - |
dc.contributor.nonIdAuthor | Yan, Fan | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Routing | - |
dc.subject.keywordAuthor | Wireless sensor networks | - |
dc.subject.keywordAuthor | Relays | - |
dc.subject.keywordAuthor | Delays | - |
dc.subject.keywordAuthor | Media Access Protocol | - |
dc.subject.keywordAuthor | Routing protocols | - |
dc.subject.keywordAuthor | Asynchronous wireless sensor networks | - |
dc.subject.keywordAuthor | independent duty-cycling | - |
dc.subject.keywordAuthor | opportunistic routing | - |
dc.subject.keywordAuthor | shortest latency | - |
dc.subject.keywordPlus | MAC PROTOCOL | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.