Optimizing Opportunistic Routing in Asynchronous Wireless Sensor Networks

Asynchronous sleep schedule and geographical routing are two efficient and scalable solutions for wireless sensor networks (WSNs). However, the schedule may degrade the delay performance of the routing protocol, and the optimal combined utilization of these two solutions is still an open question. I...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE communications letters 2017-10, Vol.21 (10), p.2302-2305
Hauptverfasser: Wang, Xinguo, Wu, Xi, Zhang, Xinming
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 2305
container_issue 10
container_start_page 2302
container_title IEEE communications letters
container_volume 21
creator Wang, Xinguo
Wu, Xi
Zhang, Xinming
description Asynchronous sleep schedule and geographical routing are two efficient and scalable solutions for wireless sensor networks (WSNs). However, the schedule may degrade the delay performance of the routing protocol, and the optimal combined utilization of these two solutions is still an open question. In this letter, we propose a geographical-based opportunistic routing protocol for asynchronous WSNs. Each node maintains multiple relay candidates that make geographical progresses of more than a threshold γ, and opportunistically forwards data packet to the first candidate that wakes up. We can obtain the optimal end-to-end delay performance, by just tuning γ. Analytical and simulation results show that the derived optimal γ can make a good tradeoff between the single-hop delay and the hop count of forwarding path, and minimize the end-to-end delay of forwarding path.
doi_str_mv 10.1109/LCOMM.2017.2729557
format Article
fullrecord <record><control><sourceid>crossref_RIE</sourceid><recordid>TN_cdi_ieee_primary_7986986</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7986986</ieee_id><sourcerecordid>10_1109_LCOMM_2017_2729557</sourcerecordid><originalsourceid>FETCH-LOGICAL-c267t-8ec4964310333b6b3a63d04628849d28aa8d271ccb1d916c142051d35fe849a13</originalsourceid><addsrcrecordid>eNo9kNtKw0AQhhdRsFZfQG_yAqk7u9nTZQlqC6kBD3gZks1GV9ts2E2Q-vQmtgjDzM8w31x8CF0DXgBgdZul-WazIBjEggiiGBMnaAaMyZiM7XTMWKpYCCXP0UUInxhjSRjM0DrveruzP7Z9j_Kuc74fWht6q6MnN_TT1rbRMuxb_eFd64YQvVlvtiaE6Nm0wfno0fTfzn-FS3TWlNtgro5zjl7v717SVZzlD-t0mcWacNHH0uhE8YQCppRWvKIlpzVOOJEyUTWRZSlrIkDrCmoFXENCMIOassaMByXQOSKHv9q7ELxpis7bXen3BeBiklH8ySgmGcVRxgjdHCBrjPkHRh18LPoLk4NcJw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Optimizing Opportunistic Routing in Asynchronous Wireless Sensor Networks</title><source>IEEE Electronic Library (IEL)</source><creator>Wang, Xinguo ; Wu, Xi ; Zhang, Xinming</creator><creatorcontrib>Wang, Xinguo ; Wu, Xi ; Zhang, Xinming</creatorcontrib><description>Asynchronous sleep schedule and geographical routing are two efficient and scalable solutions for wireless sensor networks (WSNs). However, the schedule may degrade the delay performance of the routing protocol, and the optimal combined utilization of these two solutions is still an open question. In this letter, we propose a geographical-based opportunistic routing protocol for asynchronous WSNs. Each node maintains multiple relay candidates that make geographical progresses of more than a threshold γ, and opportunistically forwards data packet to the first candidate that wakes up. We can obtain the optimal end-to-end delay performance, by just tuning γ. Analytical and simulation results show that the derived optimal γ can make a good tradeoff between the single-hop delay and the hop count of forwarding path, and minimize the end-to-end delay of forwarding path.</description><identifier>ISSN: 1089-7798</identifier><identifier>EISSN: 1558-2558</identifier><identifier>DOI: 10.1109/LCOMM.2017.2729557</identifier><identifier>CODEN: ICLEF6</identifier><language>eng</language><publisher>IEEE</publisher><subject>Asynchronous sleep schedule ; delay minimization ; Delays ; geographical routing ; opportunistic forwarding ; Relays ; Routing ; Routing protocols ; Schedules ; Switching circuits ; Wireless sensor networks</subject><ispartof>IEEE communications letters, 2017-10, Vol.21 (10), p.2302-2305</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c267t-8ec4964310333b6b3a63d04628849d28aa8d271ccb1d916c142051d35fe849a13</citedby><cites>FETCH-LOGICAL-c267t-8ec4964310333b6b3a63d04628849d28aa8d271ccb1d916c142051d35fe849a13</cites><orcidid>0000-0002-8136-6834 ; 0000-0002-0689-1735 ; 0000-0002-2579-6805</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7986986$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/7986986$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Wang, Xinguo</creatorcontrib><creatorcontrib>Wu, Xi</creatorcontrib><creatorcontrib>Zhang, Xinming</creatorcontrib><title>Optimizing Opportunistic Routing in Asynchronous Wireless Sensor Networks</title><title>IEEE communications letters</title><addtitle>COML</addtitle><description>Asynchronous sleep schedule and geographical routing are two efficient and scalable solutions for wireless sensor networks (WSNs). However, the schedule may degrade the delay performance of the routing protocol, and the optimal combined utilization of these two solutions is still an open question. In this letter, we propose a geographical-based opportunistic routing protocol for asynchronous WSNs. Each node maintains multiple relay candidates that make geographical progresses of more than a threshold γ, and opportunistically forwards data packet to the first candidate that wakes up. We can obtain the optimal end-to-end delay performance, by just tuning γ. Analytical and simulation results show that the derived optimal γ can make a good tradeoff between the single-hop delay and the hop count of forwarding path, and minimize the end-to-end delay of forwarding path.</description><subject>Asynchronous sleep schedule</subject><subject>delay minimization</subject><subject>Delays</subject><subject>geographical routing</subject><subject>opportunistic forwarding</subject><subject>Relays</subject><subject>Routing</subject><subject>Routing protocols</subject><subject>Schedules</subject><subject>Switching circuits</subject><subject>Wireless sensor networks</subject><issn>1089-7798</issn><issn>1558-2558</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kNtKw0AQhhdRsFZfQG_yAqk7u9nTZQlqC6kBD3gZks1GV9ts2E2Q-vQmtgjDzM8w31x8CF0DXgBgdZul-WazIBjEggiiGBMnaAaMyZiM7XTMWKpYCCXP0UUInxhjSRjM0DrveruzP7Z9j_Kuc74fWht6q6MnN_TT1rbRMuxb_eFd64YQvVlvtiaE6Nm0wfno0fTfzn-FS3TWlNtgro5zjl7v717SVZzlD-t0mcWacNHH0uhE8YQCppRWvKIlpzVOOJEyUTWRZSlrIkDrCmoFXENCMIOassaMByXQOSKHv9q7ELxpis7bXen3BeBiklH8ySgmGcVRxgjdHCBrjPkHRh18LPoLk4NcJw</recordid><startdate>201710</startdate><enddate>201710</enddate><creator>Wang, Xinguo</creator><creator>Wu, Xi</creator><creator>Zhang, Xinming</creator><general>IEEE</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0002-8136-6834</orcidid><orcidid>https://orcid.org/0000-0002-0689-1735</orcidid><orcidid>https://orcid.org/0000-0002-2579-6805</orcidid></search><sort><creationdate>201710</creationdate><title>Optimizing Opportunistic Routing in Asynchronous Wireless Sensor Networks</title><author>Wang, Xinguo ; Wu, Xi ; Zhang, Xinming</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c267t-8ec4964310333b6b3a63d04628849d28aa8d271ccb1d916c142051d35fe849a13</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Asynchronous sleep schedule</topic><topic>delay minimization</topic><topic>Delays</topic><topic>geographical routing</topic><topic>opportunistic forwarding</topic><topic>Relays</topic><topic>Routing</topic><topic>Routing protocols</topic><topic>Schedules</topic><topic>Switching circuits</topic><topic>Wireless sensor networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wang, Xinguo</creatorcontrib><creatorcontrib>Wu, Xi</creatorcontrib><creatorcontrib>Zhang, Xinming</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><jtitle>IEEE communications letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Wang, Xinguo</au><au>Wu, Xi</au><au>Zhang, Xinming</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimizing Opportunistic Routing in Asynchronous Wireless Sensor Networks</atitle><jtitle>IEEE communications letters</jtitle><stitle>COML</stitle><date>2017-10</date><risdate>2017</risdate><volume>21</volume><issue>10</issue><spage>2302</spage><epage>2305</epage><pages>2302-2305</pages><issn>1089-7798</issn><eissn>1558-2558</eissn><coden>ICLEF6</coden><abstract>Asynchronous sleep schedule and geographical routing are two efficient and scalable solutions for wireless sensor networks (WSNs). However, the schedule may degrade the delay performance of the routing protocol, and the optimal combined utilization of these two solutions is still an open question. In this letter, we propose a geographical-based opportunistic routing protocol for asynchronous WSNs. Each node maintains multiple relay candidates that make geographical progresses of more than a threshold γ, and opportunistically forwards data packet to the first candidate that wakes up. We can obtain the optimal end-to-end delay performance, by just tuning γ. Analytical and simulation results show that the derived optimal γ can make a good tradeoff between the single-hop delay and the hop count of forwarding path, and minimize the end-to-end delay of forwarding path.</abstract><pub>IEEE</pub><doi>10.1109/LCOMM.2017.2729557</doi><tpages>4</tpages><orcidid>https://orcid.org/0000-0002-8136-6834</orcidid><orcidid>https://orcid.org/0000-0002-0689-1735</orcidid><orcidid>https://orcid.org/0000-0002-2579-6805</orcidid></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1089-7798
ispartof IEEE communications letters, 2017-10, Vol.21 (10), p.2302-2305
issn 1089-7798
1558-2558
language eng
recordid cdi_ieee_primary_7986986
source IEEE Electronic Library (IEL)
subjects Asynchronous sleep schedule
delay minimization
Delays
geographical routing
opportunistic forwarding
Relays
Routing
Routing protocols
Schedules
Switching circuits
Wireless sensor networks
title Optimizing Opportunistic Routing in Asynchronous Wireless Sensor Networks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T22%3A04%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimizing%20Opportunistic%20Routing%20in%20Asynchronous%20Wireless%20Sensor%20Networks&rft.jtitle=IEEE%20communications%20letters&rft.au=Wang,%20Xinguo&rft.date=2017-10&rft.volume=21&rft.issue=10&rft.spage=2302&rft.epage=2305&rft.pages=2302-2305&rft.issn=1089-7798&rft.eissn=1558-2558&rft.coden=ICLEF6&rft_id=info:doi/10.1109/LCOMM.2017.2729557&rft_dat=%3Ccrossref_RIE%3E10_1109_LCOMM_2017_2729557%3C/crossref_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=7986986&rfr_iscdi=true