Optimizing Communication Overhead while Reducing Path Length in Beaconless Georouting with Guaranteed Delivery for Wireless Sensor Networks
Beaconless or contention-based geographic routing algorithms forward packets toward a geographical destination reactively without the knowledge of the neighborhood. Such algorithms allow greedy forwarding, where only the next hop neighbor responds after a timer-based contention using only three mess...
Uloženo v:
| Vydáno v: | IEEE transactions on computers Ročník 62; číslo 12; s. 2440 - 2453 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York
IEEE
01.12.2013
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Témata: | |
| ISSN: | 0018-9340, 1557-9956 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Beaconless or contention-based geographic routing algorithms forward packets toward a geographical destination reactively without the knowledge of the neighborhood. Such algorithms allow greedy forwarding, where only the next hop neighbor responds after a timer-based contention using only three messages (RTS, CTS, and DATA) per forwarding step. However, existing contention-based schemes for recovery from greedy failures do not have this property. In this paper, we show that recovery is possible within this 3-message scheme: the Rotational Sweep (RS) algorithm directly identifies the next hop after timer-based contention and constructs a traversal path that ensures progress after a greedy failure. It uses a traversal scheme (called Sweep Circle) that forwards a message along the α-shape of the network and provides recovery paths shorter or equal to the prominent face routing with Gabriel graph planarization. An alternative traversal scheme (called Twisting Triangle) provides even shorter routes on average, as shown by simulations. They both also reduce per-node overall network contention delays. We prove that both traversal schemes guarantee delivery in unit disk graphs. Our traversal schemes avoid planarization and are easy to implement, based merely on the evaluation of a function of a neighbor node's relative position. They can also be used for boundary detection and improve path-length in conventional beacon-based routing. |
|---|---|
| AbstractList | Beaconless or contention-based geographic routing algorithms forward packets toward a geographical destination reactively without the knowledge of the neighborhood. Such algorithms allow greedy forwarding, where only the next hop neighbor responds after a timer-based contention using only three messages (RTS, CTS, and DATA) per forwarding step. However, existing contention-based schemes for recovery from greedy failures do not have this property. In this paper, we show that recovery is possible within this 3-message scheme: the Rotational Sweep (RS) algorithm directly identifies the next hop after timer-based contention and constructs a traversal path that ensures progress after a greedy failure. It uses a traversal scheme (called Sweep Circle) that forwards a message along the α-shape of the network and provides recovery paths shorter or equal to the prominent face routing with Gabriel graph planarization. An alternative traversal scheme (called Twisting Triangle) provides even shorter routes on average, as shown by simulations. They both also reduce per-node overall network contention delays. We prove that both traversal schemes guarantee delivery in unit disk graphs. Our traversal schemes avoid planarization and are easy to implement, based merely on the evaluation of a function of a neighbor node's relative position. They can also be used for boundary detection and improve path-length in conventional beacon-based routing. Beaconless or contention-based geographic routing algorithms forward packets toward a geographical destination reactively without the knowledge of the neighborhood. Such algorithms allow greedy forwarding, where only the next hop neighbor responds after a timer-based contention using only three messages (RTS, CTS, and DATA) per forwarding step. However, existing contention-based schemes for recovery from greedy failures do not have this property. In this paper, we show that recovery is possible within this 3-message scheme: the Rotational Sweep (RS) algorithm directly identifies the next hop after timer-based contention and constructs a traversal path that ensures progress after a greedy failure. It uses a traversal scheme (called Sweep Circle) that forwards a message along the $(\alpha)$-shape of the network and provides recovery paths shorter or equal to the prominent face routing with Gabriel graph planarization. An alternative traversal scheme (called Twisting Triangle) provides even shorter routes on average, as shown by simulations. They both also reduce per-node overall network contention delays. We prove that both traversal schemes guarantee delivery in unit disk graphs. Our traversal schemes avoid planarization and are easy to implement, based merely on the evaluation of a function of a neighbor node's relative position. They can also be used for boundary detection and improve path-length in conventional beacon-based routing. |
| Author | Stojmenovic, Ivan Ruhrup, Stefan |
| Author_xml | – sequence: 1 givenname: Stefan surname: Ruhrup fullname: Ruhrup, Stefan email: ruehrup@ftw.at organization: Telecommun. Res. Center Vienna (FTW), Vienna, Austria – sequence: 2 givenname: Ivan surname: Stojmenovic fullname: Stojmenovic, Ivan email: ivan@site.uOttawa.ca organization: Sch. of Inf. Technol. & Eng., Univ. of Ottawa, Ottawa, ON, Canada |
| BookMark | eNp10U-L1DAYBvAgKzi7evLoJeBFkI753-ao1R2FwREd8VjS9u1O1jaZTVKH3a_glzazIx4WPL2E_J6HkPccnTnvAKHnlCwpJfrNtl4yQtmSiuoRWlApy0Jrqc7QghBaFZoL8gSdx3hNCFGM6AX6vdknO9k7665w7adpdrYzyXqHN78g7MD0-LCzI-Cv0M_dUX0xaYfX4K7ysA6_A9N5N0KMeAU--Dkd0cHm29VsgnEJoMfvYbS57xYPPuAfNsB94Bu4mM-fIR18-BmfoseDGSM8-zsv0PfLD9v6Y7HerD7Vb9dFx6lIhYS2lYJroaqh7QcuTKVlBZwwOah2ED3petaXTBgpdVt2LWjBNCODYLJsS8Mv0KtT7z74mxliaiYbOxhH48DPsaFCCakZpyzTlw_otZ-Dy6_LSlRKCyF4Vq9Pqgs-xgBDsw92MuG2oaQ5LqbZ1s1xMTlUZU0f6M6m-z9PwdjxP5kXp4wFgH_tijHFFed_AHaSnPk |
| CODEN | ITCOB4 |
| CitedBy_id | crossref_primary_10_1007_s11276_019_02177_2 crossref_primary_10_1109_TCOMM_2015_2477337 crossref_primary_10_1007_s11276_020_02347_7 crossref_primary_10_1016_j_aeue_2015_06_016 crossref_primary_10_1016_j_comnet_2025_111172 crossref_primary_10_1109_TC_2014_2346209 crossref_primary_10_1109_LCOMM_2015_2432019 crossref_primary_10_1016_j_comnet_2017_08_011 crossref_primary_10_1109_MWC_2017_1600193WC crossref_primary_10_1109_TMC_2020_3038628 crossref_primary_10_1109_TPDS_2013_60 crossref_primary_10_1080_09720529_2021_1932932 crossref_primary_10_1145_2968450 crossref_primary_10_1016_j_adhoc_2016_08_006 crossref_primary_10_1109_TMC_2017_2771424 |
| Cites_doi | 10.1016/j.comcom.2004.01.012 10.1109/TMC.2003.1255648 10.1145/313239.313282 10.1109/TC.2010.107 10.1109/TIT.1983.1056714 10.1007/978-3-540-92666-5_2 10.2307/2412323 10.1109/COMST.2007.358971 10.1109/TMC.2008.162 10.1145/778415.778447 10.1023/A:1013985610753 10.21236/ADA180187 10.1016/j.adhoc.2008.12.001 10.1007/s11036-006-4471-y 10.1109/TNET.2009.2022084 10.1109/TWC.2011.060711.100480 10.1109/MCOM.2009.5181897 10.1109/5.163414 10.1109/MOBHOC.2007.4428612 10.1109/IPDPS.2010.5470408 10.1145/501416.501424 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Dec 2013 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Dec 2013 |
| DBID | 97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| DOI | 10.1109/TC.2012.148 |
| DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE/IET Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ANTE: Abstracts in New Technology & Engineering Engineering Research Database |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
| DatabaseTitleList | Technology Research Database Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1557-9956 |
| EndPage | 2453 |
| ExternalDocumentID | 3118397211 10_1109_TC_2012_148 6226363 |
| Genre | orig-research |
| GroupedDBID | --Z -DZ -~X .55 .DC 0R~ 29I 3EH 3O- 4.4 5GY 5VS 6IK 85S 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACIWK ACNCT AENEX AETEA AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD HZ~ H~9 IAAWW IBMZZ ICLAB IEDLZ IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ MVM O9- OCL P2P PQQKQ RIA RIE RNI RNS RXW RZB TAE TN5 TWZ UHB UKR UPT VH1 X7M XJT XOL XZL YXB YYQ YZZ ZCG AAYXX ABUFD CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| ID | FETCH-LOGICAL-c314t-5ebb5439468fbdf34a8958e3025f6bf4d0cd2d724a559b7cbe942920f4257b7a3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 23 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000327409300008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0018-9340 |
| IngestDate | Sun Nov 09 10:27:10 EST 2025 Sun Nov 09 08:05:03 EST 2025 Tue Nov 18 19:41:25 EST 2025 Sat Nov 29 03:57:27 EST 2025 Wed Aug 27 02:49:03 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 12 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c314t-5ebb5439468fbdf34a8958e3025f6bf4d0cd2d724a559b7cbe942920f4257b7a3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23 |
| PQID | 1448694443 |
| PQPubID | 85452 |
| PageCount | 14 |
| ParticipantIDs | ieee_primary_6226363 crossref_primary_10_1109_TC_2012_148 proquest_miscellaneous_1464592312 proquest_journals_1448694443 crossref_citationtrail_10_1109_TC_2012_148 |
| PublicationCentury | 2000 |
| PublicationDate | 2013-12-01 |
| PublicationDateYYYYMMDD | 2013-12-01 |
| PublicationDate_xml | – month: 12 year: 2013 text: 2013-12-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE transactions on computers |
| PublicationTitleAbbrev | TC |
| PublicationYear | 2013 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | bibttc20131224403 bibttc201312244029 bibttc20131224404 bibttc201312244028 bibttc20131224405 bibttc201312244027 bibttc20131224406 bibttc201312244025 bibttc201312244024 bibttc20131224401 frey (bibttc201312244010) 2009 bibttc201312244023 bibttc201312244021 finn (bibttc20131224409) 1987 blum (bibttc20131224402) 2003 kalosha (bibttc201312244020) 2008 rhrup (bibttc201312244026) 2010 fler (bibttc201312244013) 2003 bibttc20131224407 bibttc20131224408 li (bibttc201312244022) 2002 bibttc201312244019 bibttc201312244018 bibttc201312244015 bibttc201312244014 gfeller (bibttc201312244016) 2008 bibttc201312244012 heissenbttel (bibttc201312244017) 2003 frey (bibttc201312244011) 2009 |
| References_xml | – year: 2002 ident: bibttc201312244022 article-title: Distributed Construction of Planar Spanner and Routing for Ad Hoc Wireless Networks publication-title: Proc IEEE InfoCom – ident: bibttc201312244018 doi: 10.1016/j.comcom.2004.01.012 – ident: bibttc201312244029 doi: 10.1109/TMC.2003.1255648 – ident: bibttc20131224403 doi: 10.1145/313239.313282 – year: 2003 ident: bibttc20131224402 article-title: IGF: A State-Free Robust Communication Protocol for Wireless Sensor Networks – ident: bibttc201312244012 doi: 10.1109/TC.2010.107 – ident: bibttc20131224406 doi: 10.1109/TIT.1983.1056714 – year: 2009 ident: bibttc201312244010 article-title: Paving the Way Towards Reactive Planar Spanner Construction in Wireless Networks publication-title: Proc GI/ITG Fachtagung Kommunikation in Verteilten Systemen (KiVS '09) doi: 10.1007/978-3-540-92666-5_2 – ident: bibttc201312244014 doi: 10.2307/2412323 – ident: bibttc20131224404 doi: 10.1109/COMST.2007.358971 – ident: bibttc201312244023 doi: 10.1109/TMC.2008.162 – ident: bibttc201312244021 doi: 10.1145/778415.778447 – ident: bibttc20131224405 doi: 10.1023/A:1013985610753 – year: 2009 ident: bibttc201312244011 publication-title: Guide to Wireless Sensor Networks – year: 1987 ident: bibttc20131224409 article-title: Routing and Addressing Problems in Large Metropolitan-Scale Internetworks doi: 10.21236/ADA180187 – year: 2008 ident: bibttc201312244020 article-title: Select-and-Protest-Based Beaconless Georouting with Guaranteed Delivery in Wireless Sensor Networks publication-title: Proc IEEE InfoCom – start-page: 197 year: 2003 ident: bibttc201312244017 article-title: A Novel Position-Based and Beacon-Less Routing Algorithm for Mobile Ad-Hoc Networks publication-title: Proc IEEE Third Workshop Applications and Services in Wireless Networks – ident: bibttc20131224408 doi: 10.1016/j.adhoc.2008.12.001 – start-page: 197 year: 2008 ident: bibttc201312244016 article-title: A Faster Distributed Approximation Scheme for the Connected Dominating Set Problem for Growth-Bounded Graphs publication-title: Ad Hoc & Sensor Wireless Networks – ident: bibttc20131224407 doi: 10.1007/s11036-006-4471-y – ident: bibttc201312244024 doi: 10.1109/TNET.2009.2022084 – ident: bibttc20131224401 doi: 10.1109/TWC.2011.060711.100480 – ident: bibttc201312244028 doi: 10.1109/MCOM.2009.5181897 – ident: bibttc201312244019 doi: 10.1109/5.163414 – ident: bibttc201312244027 doi: 10.1109/MOBHOC.2007.4428612 – year: 2010 ident: bibttc201312244026 article-title: A New Traversal Scheme for Georouting and Boundary Detection in WSNs – ident: bibttc201312244025 doi: 10.1109/IPDPS.2010.5470408 – start-page: 194 year: 2003 ident: bibttc201312244013 article-title: A Novel Forwarding Paradigm for Position-Based Routing (with Implicit Addressing) publication-title: Proc IEEE 18th Ann Workshop Computer Comm (CCW '03) – ident: bibttc201312244015 doi: 10.1145/501416.501424 |
| SSID | ssj0006209 |
| Score | 2.1866686 |
| Snippet | Beaconless or contention-based geographic routing algorithms forward packets toward a geographical destination reactively without the knowledge of the... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 2440 |
| SubjectTerms | Algorithm design and analysis Algorithm/protocol design and analysis Algorithms Computer networks Computer simulation Design methodology Failure Mathematical models Network topology Networks Planarization Recovery Routing (telecommunications) Routing protocols |
| Title | Optimizing Communication Overhead while Reducing Path Length in Beaconless Georouting with Guaranteed Delivery for Wireless Sensor Networks |
| URI | https://ieeexplore.ieee.org/document/6226363 https://www.proquest.com/docview/1448694443 https://www.proquest.com/docview/1464592312 |
| Volume | 62 |
| WOSCitedRecordID | wos000327409300008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1557-9956 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0006209 issn: 0018-9340 databaseCode: RIE dateStart: 19680101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3BbtQwEB21FQc4UGhBLBRkpJ4QoU7sOPYRFioOaFvBIvUWxfakrLRkUXcXBL_ATzPjzUZU9MIpiTyJIo3neTx-MwNwbHJTuAZl5svoM610mTmpdBZkEy02rjUmpGYT1WRiLy7c-Q68HHJhEDGRz_AV36az_LgIaw6VnRjyFZRRu7BbVWaTqzWgrtnSOXIyYKVln4uXS3cyHTOFqyBQsNdWn9RO5R8MTgvL6f7__dI9uNs7kOL1RuP3YQe7A9jfNmcQva0ewJ2_Kg0ewu8zgoavs1_0IK7lhIgzmssEyFH8-EIAIT5yKVeWOifXUHzA7pIus068Yejs5oSLgsPoizXTpQVHcQXPMtYPRvEW58zz-CnIFRZMrE0vfKKtMj1PNozz5QP4fPpuOn6f9X0YsqByvcpK9L7kDFpjWx9bpRvrSouK3KXWMNFPhljEqtANbU98FTy61ASrZTzwVaMewl636PARCFU0qNqYlxXHm2RwXDLO51EqFytb4ghebPVTh75IOffKmNdpsyJdPR3XrEzastgRHA_C3za1OW4WO2S9DSK9ykZwtFV83dvtksS1NU5rTcPPh2GyOD5GaTpcrFmGC_CQX1w8vvnLT-B2wU0zEunlCPZWV2t8CrfC99VsefUsTds_JP7tmQ |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Rb9MwED6NgQQ8MNhAFAYYaU-IMCd2HPsRCtMQpZugSHuLEvsClUqK1hYEf4E_zZ2bRkzshack8iWKdL7P5_N3dwAHJjWZq1AmdR7qRCudJ04qnXhZBYuVa4zxsdlEMR7bszN3ugXP-1wYRIzkM3zBt_EsP8z9ikNlh4Z8BWXUFbiaa53JdbZWj7tmQ-hIyYSVll02Xird4WTIJK6MYMFeWH9iQ5V_UDguLUc7__dTt-FW50KKl2ud34EtbHdhZ9OeQXTWugs3_6o1uAe_Twgcvk5_0YO4kBUiTmg2EyQH8eMLQYT4wMVcWeqUnEMxwvYzXaateMXg2c4IGQUH0ucrJkwLjuMKnmesIQziNc6Y6fFTkDMsmFobX_hIm2V6Hq8554u78OnozWR4nHSdGBKvUr1McqzrnHNojW3q0ChdWZdbVOQwNYapftKHLBSZrmiDUhe-RhfbYDWMCHVRqXuw3c5bvA9CZRWqJqR5wREn6R0XjavTIJULhc1xAM82-il9V6acu2XMyrhdka6cDEtWJm1a7AAOeuFv6-ocl4vtsd56kU5lA9jfKL7sLHdB4toap7Wm4af9MNkcH6RULc5XLMMleMgzzh5c_uUncP148n5Ujt6O3z2EGxm30IgUmH3YXp6v8BFc89-X08X54ziF_wCfsfDg |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Optimizing+Communication+Overhead+while+Reducing+Path+Length+in+Beaconless+Georouting+with+Guaranteed+Delivery+for+Wireless+Sensor+Networks&rft.jtitle=IEEE+transactions+on+computers&rft.au=Ruhrup%2C+Stefan&rft.au=Stojmenovic%2C+Ivan&rft.date=2013-12-01&rft.pub=IEEE&rft.issn=0018-9340&rft.volume=62&rft.issue=12&rft.spage=2440&rft.epage=2453&rft_id=info:doi/10.1109%2FTC.2012.148&rft.externalDocID=6226363 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9340&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9340&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9340&client=summon |