Asymptotic Critical Transmission Radii for Greedy Forward Routing in Wireless Ad Hoc Networks
In wireless ad hoc networks, greedy forward routing is a localized geographic routing algorithm in which one node discards a packet if none of its neighbors is closer to the destination of the packet than itself, or otherwise forwards the packet to the neighbor closest to the destination. If all nod...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on communications 2009-05, Vol.57 (5), p.1433-1443 |
|---|---|
| Hauptverfasser: | , , , , |
| 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 | 1443 |
|---|---|
| container_issue | 5 |
| container_start_page | 1433 |
| container_title | IEEE transactions on communications |
| container_volume | 57 |
| creator | Wan, P.-J. Yi, C.-W. Wang, L. Yao, F. Jia, X. |
| description | In wireless ad hoc networks, greedy forward routing is a localized geographic routing algorithm in which one node discards a packet if none of its neighbors is closer to the destination of the packet than itself, or otherwise forwards the packet to the neighbor closest to the destination. If all nodes have the same transmission radii, the critical transmission radius for greedy forward routing is the smallest transmission radius which ensures packets can be delivered by greedy forward routing through any source-destination pair. In this paper, we study asymptotic critical transmission radii of randomly deployed wireless ad hoc networks. Assume network nodes are represented by a Poisson point process of density n over a unit-area convex compact region whose boundary curvature is bounded. We show that the ratio of critical transmission radii to radic (lnn/pin) is asymptotically almost surely equal to radic (1/ (2/3 - radic(3)/2pi)) ap 1.6. |
| doi_str_mv | 10.1109/TCOMM.2009.05.070307 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_1031315390</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4939237</ieee_id><sourcerecordid>1031315390</sourcerecordid><originalsourceid>FETCH-LOGICAL-c438t-fe927a6bf59912b4600a675b3ddc3b308029ad7da83daf82787e92c1970a1b353</originalsourceid><addsrcrecordid>eNp9kc1rGzEQxUVJoE7av6A9iEJKLuuONKuVdDQmX5APCC49FaFdaYvS9cqR1gT_91XikEMOPc1hfu8x8x4hXxnMGQP9Y7W8u7mZcwA9BzEHCQjyA5kxIVQFSsgDMis7qBop1UdylPMDANSAOCO_F3m33kxxCh1dplCGHegq2TGvQ84hjvTeuhBoHxO9SN67HT2P6ckmR-_jdgrjHxpG-iskP_ic6cLRy9jRWz89xfQ3fyKHvR2y__w6j8nP87PV8rK6vru4Wi6uq65GNVW911zapu2F1oy3dQNgGyladK7DFkEB19ZJZxU62ysulSyKjmkJlrUo8Jh83_tuUnzc-jyZcn3nh8GOPm6zwVpjI5Qu4Ol_QQbIkAnUUNBv79CHuE1jecMo0WjQqlEFqvdQl2LOyfdmk8Lapl1xMs_dmJduzHM3BoTZd1NkJ6_eNpfA-5J3F_KbljNZcw5N4b7sueC9f1uXZzRHif8AJluXCQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>856909868</pqid></control><display><type>article</type><title>Asymptotic Critical Transmission Radii for Greedy Forward Routing in Wireless Ad Hoc Networks</title><source>IEEE Electronic Library (IEL)</source><creator>Wan, P.-J. ; Yi, C.-W. ; Wang, L. ; Yao, F. ; Jia, X.</creator><creatorcontrib>Wan, P.-J. ; Yi, C.-W. ; Wang, L. ; Yao, F. ; Jia, X.</creatorcontrib><description>In wireless ad hoc networks, greedy forward routing is a localized geographic routing algorithm in which one node discards a packet if none of its neighbors is closer to the destination of the packet than itself, or otherwise forwards the packet to the neighbor closest to the destination. If all nodes have the same transmission radii, the critical transmission radius for greedy forward routing is the smallest transmission radius which ensures packets can be delivered by greedy forward routing through any source-destination pair. In this paper, we study asymptotic critical transmission radii of randomly deployed wireless ad hoc networks. Assume network nodes are represented by a Poisson point process of density n over a unit-area convex compact region whose boundary curvature is bounded. We show that the ratio of critical transmission radii to radic (lnn/pin) is asymptotically almost surely equal to radic (1/ (2/3 - radic(3)/2pi)) ap 1.6.</description><identifier>ISSN: 0090-6778</identifier><identifier>EISSN: 1558-0857</identifier><identifier>DOI: 10.1109/TCOMM.2009.05.070307</identifier><identifier>CODEN: IECMBT</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Ad hoc networks ; Applied sciences ; Asymptotic properties ; Boundaries ; Cities and towns ; Communications Society ; Computer networks ; Computer science ; critical transmission radii ; Curvature ; Density ; Exact sciences and technology ; greedy forward routing ; Mobile ad hoc networks ; Mobile computing ; Networks ; Packets (communication) ; random deployment ; Relays ; Routing ; Routing (telecommunications) ; Switching and signalling ; Systems, networks and services of telecommunications ; Telecommunications ; Telecommunications and information theory ; Transmission and modulation (techniques and equipments) ; Wireless ad hoc networks ; Wireless networks</subject><ispartof>IEEE transactions on communications, 2009-05, Vol.57 (5), p.1433-1443</ispartof><rights>2009 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2009</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c438t-fe927a6bf59912b4600a675b3ddc3b308029ad7da83daf82787e92c1970a1b353</citedby><cites>FETCH-LOGICAL-c438t-fe927a6bf59912b4600a675b3ddc3b308029ad7da83daf82787e92c1970a1b353</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4939237$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27922,27923,54756</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4939237$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=21742206$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Wan, P.-J.</creatorcontrib><creatorcontrib>Yi, C.-W.</creatorcontrib><creatorcontrib>Wang, L.</creatorcontrib><creatorcontrib>Yao, F.</creatorcontrib><creatorcontrib>Jia, X.</creatorcontrib><title>Asymptotic Critical Transmission Radii for Greedy Forward Routing in Wireless Ad Hoc Networks</title><title>IEEE transactions on communications</title><addtitle>TCOMM</addtitle><description>In wireless ad hoc networks, greedy forward routing is a localized geographic routing algorithm in which one node discards a packet if none of its neighbors is closer to the destination of the packet than itself, or otherwise forwards the packet to the neighbor closest to the destination. If all nodes have the same transmission radii, the critical transmission radius for greedy forward routing is the smallest transmission radius which ensures packets can be delivered by greedy forward routing through any source-destination pair. In this paper, we study asymptotic critical transmission radii of randomly deployed wireless ad hoc networks. Assume network nodes are represented by a Poisson point process of density n over a unit-area convex compact region whose boundary curvature is bounded. We show that the ratio of critical transmission radii to radic (lnn/pin) is asymptotically almost surely equal to radic (1/ (2/3 - radic(3)/2pi)) ap 1.6.</description><subject>Ad hoc networks</subject><subject>Applied sciences</subject><subject>Asymptotic properties</subject><subject>Boundaries</subject><subject>Cities and towns</subject><subject>Communications Society</subject><subject>Computer networks</subject><subject>Computer science</subject><subject>critical transmission radii</subject><subject>Curvature</subject><subject>Density</subject><subject>Exact sciences and technology</subject><subject>greedy forward routing</subject><subject>Mobile ad hoc networks</subject><subject>Mobile computing</subject><subject>Networks</subject><subject>Packets (communication)</subject><subject>random deployment</subject><subject>Relays</subject><subject>Routing</subject><subject>Routing (telecommunications)</subject><subject>Switching and signalling</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Transmission and modulation (techniques and equipments)</subject><subject>Wireless ad hoc networks</subject><subject>Wireless networks</subject><issn>0090-6778</issn><issn>1558-0857</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp9kc1rGzEQxUVJoE7av6A9iEJKLuuONKuVdDQmX5APCC49FaFdaYvS9cqR1gT_91XikEMOPc1hfu8x8x4hXxnMGQP9Y7W8u7mZcwA9BzEHCQjyA5kxIVQFSsgDMis7qBop1UdylPMDANSAOCO_F3m33kxxCh1dplCGHegq2TGvQ84hjvTeuhBoHxO9SN67HT2P6ckmR-_jdgrjHxpG-iskP_ic6cLRy9jRWz89xfQ3fyKHvR2y__w6j8nP87PV8rK6vru4Wi6uq65GNVW911zapu2F1oy3dQNgGyladK7DFkEB19ZJZxU62ysulSyKjmkJlrUo8Jh83_tuUnzc-jyZcn3nh8GOPm6zwVpjI5Qu4Ol_QQbIkAnUUNBv79CHuE1jecMo0WjQqlEFqvdQl2LOyfdmk8Lapl1xMs_dmJduzHM3BoTZd1NkJ6_eNpfA-5J3F_KbljNZcw5N4b7sueC9f1uXZzRHif8AJluXCQ</recordid><startdate>20090501</startdate><enddate>20090501</enddate><creator>Wan, P.-J.</creator><creator>Yi, C.-W.</creator><creator>Wang, L.</creator><creator>Yao, F.</creator><creator>Jia, X.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20090501</creationdate><title>Asymptotic Critical Transmission Radii for Greedy Forward Routing in Wireless Ad Hoc Networks</title><author>Wan, P.-J. ; Yi, C.-W. ; Wang, L. ; Yao, F. ; Jia, X.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c438t-fe927a6bf59912b4600a675b3ddc3b308029ad7da83daf82787e92c1970a1b353</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Ad hoc networks</topic><topic>Applied sciences</topic><topic>Asymptotic properties</topic><topic>Boundaries</topic><topic>Cities and towns</topic><topic>Communications Society</topic><topic>Computer networks</topic><topic>Computer science</topic><topic>critical transmission radii</topic><topic>Curvature</topic><topic>Density</topic><topic>Exact sciences and technology</topic><topic>greedy forward routing</topic><topic>Mobile ad hoc networks</topic><topic>Mobile computing</topic><topic>Networks</topic><topic>Packets (communication)</topic><topic>random deployment</topic><topic>Relays</topic><topic>Routing</topic><topic>Routing (telecommunications)</topic><topic>Switching and signalling</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Transmission and modulation (techniques and equipments)</topic><topic>Wireless ad hoc networks</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wan, P.-J.</creatorcontrib><creatorcontrib>Yi, C.-W.</creatorcontrib><creatorcontrib>Wang, L.</creatorcontrib><creatorcontrib>Yao, F.</creatorcontrib><creatorcontrib>Jia, X.</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>Pascal-Francis</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Wan, P.-J.</au><au>Yi, C.-W.</au><au>Wang, L.</au><au>Yao, F.</au><au>Jia, X.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Asymptotic Critical Transmission Radii for Greedy Forward Routing in Wireless Ad Hoc Networks</atitle><jtitle>IEEE transactions on communications</jtitle><stitle>TCOMM</stitle><date>2009-05-01</date><risdate>2009</risdate><volume>57</volume><issue>5</issue><spage>1433</spage><epage>1443</epage><pages>1433-1443</pages><issn>0090-6778</issn><eissn>1558-0857</eissn><coden>IECMBT</coden><abstract>In wireless ad hoc networks, greedy forward routing is a localized geographic routing algorithm in which one node discards a packet if none of its neighbors is closer to the destination of the packet than itself, or otherwise forwards the packet to the neighbor closest to the destination. If all nodes have the same transmission radii, the critical transmission radius for greedy forward routing is the smallest transmission radius which ensures packets can be delivered by greedy forward routing through any source-destination pair. In this paper, we study asymptotic critical transmission radii of randomly deployed wireless ad hoc networks. Assume network nodes are represented by a Poisson point process of density n over a unit-area convex compact region whose boundary curvature is bounded. We show that the ratio of critical transmission radii to radic (lnn/pin) is asymptotically almost surely equal to radic (1/ (2/3 - radic(3)/2pi)) ap 1.6.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TCOMM.2009.05.070307</doi><tpages>11</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0090-6778 |
| ispartof | IEEE transactions on communications, 2009-05, Vol.57 (5), p.1433-1443 |
| issn | 0090-6778 1558-0857 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1031315390 |
| source | IEEE Electronic Library (IEL) |
| subjects | Ad hoc networks Applied sciences Asymptotic properties Boundaries Cities and towns Communications Society Computer networks Computer science critical transmission radii Curvature Density Exact sciences and technology greedy forward routing Mobile ad hoc networks Mobile computing Networks Packets (communication) random deployment Relays Routing Routing (telecommunications) Switching and signalling Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Transmission and modulation (techniques and equipments) Wireless ad hoc networks Wireless networks |
| title | Asymptotic Critical Transmission Radii for Greedy Forward Routing in Wireless Ad Hoc Networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-10T08%3A40%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Asymptotic%20Critical%20Transmission%20Radii%20for%20Greedy%20Forward%20Routing%20in%20Wireless%20Ad%20Hoc%20Networks&rft.jtitle=IEEE%20transactions%20on%20communications&rft.au=Wan,%20P.-J.&rft.date=2009-05-01&rft.volume=57&rft.issue=5&rft.spage=1433&rft.epage=1443&rft.pages=1433-1443&rft.issn=0090-6778&rft.eissn=1558-0857&rft.coden=IECMBT&rft_id=info:doi/10.1109/TCOMM.2009.05.070307&rft_dat=%3Cproquest_RIE%3E1031315390%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=856909868&rft_id=info:pmid/&rft_ieee_id=4939237&rfr_iscdi=true |