Simple, Practical, and Effective Opportunistic Routing for Short-Haul Multi-Hop Wireless Networks
In this paper, we propose a simple and practical opportunistic routing algorithm, and we analyze its performance along a multi-hop wireless network path, while considering link-level interference among the network nodes. Through our analysis, we show that our algorithm results in significant improve...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on wireless communications 2011-11, Vol.10 (11), p.3583-3588 |
|---|---|
| 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 | 3588 |
|---|---|
| container_issue | 11 |
| container_start_page | 3583 |
| container_title | IEEE transactions on wireless communications |
| container_volume | 10 |
| creator | Goo Yeon Lee Haas, Z. J. |
| description | In this paper, we propose a simple and practical opportunistic routing algorithm, and we analyze its performance along a multi-hop wireless network path, while considering link-level interference among the network nodes. Through our analysis, we show that our algorithm results in significant improvement in throughput, especially for short-haul paths. The proposed algorithm can be easily integrated into most routing protocols with only minor modifications. Consequently, the algorithm provides a practical and effective approach for implementation of opportunistic routing in wireless networks. |
| doi_str_mv | 10.1109/TWC.2011.092711.101713 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_1010883977</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6036020</ieee_id><sourcerecordid>2528620091</sourcerecordid><originalsourceid>FETCH-LOGICAL-c398t-7625d4b5e891b709eb02827220be8fbb718d482556cf53e30087fb9f9017a49c3</originalsourceid><addsrcrecordid>eNqNkUtLJTEQhRsZwecvECQIwizsax6d11IuOldwVHzgMqT7VjTat9OTdDv4782lxcWsZlUJ56tDVZ2iOCR4RgjWpw9P8xnFhMywpjIXgokkbKPYJpyrktJK_Vi_mSgJlWKr2EnpFWdGcL5d2Hu_6ls4QbfRNoNvbHuCbLdE585B_r8Duun7EIex8ynL6C6Mg--ekQsR3b9koVzYsUW_x3bw5SL06MlHaCEldA3D3xDf0l6x6WybYP-r7haPF-cP80V5dfPrcn52VTZMq6GUgvJlVXNQmtQSa6gxVVRSimtQrq4lUctKUc5F4zgDhrGSrtZO501spRu2W_ycfPsY_oyQBrPyqYG2tR2EMZl8FqxUJRX-T5RpKTN69A_6GsbY5UWMzhNQoSueITFBTQwpRXCmj35l40d2MuuMTM7IrDMyU0Zmyig3Hn-525RP76LtGp--uylnhFVqzR1MnAeAb1lgJjDF7BOljpi7</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>908726945</pqid></control><display><type>article</type><title>Simple, Practical, and Effective Opportunistic Routing for Short-Haul Multi-Hop Wireless Networks</title><source>IEEE Electronic Library (IEL)</source><creator>Goo Yeon Lee ; Haas, Z. J.</creator><creatorcontrib>Goo Yeon Lee ; Haas, Z. J.</creatorcontrib><description>In this paper, we propose a simple and practical opportunistic routing algorithm, and we analyze its performance along a multi-hop wireless network path, while considering link-level interference among the network nodes. Through our analysis, we show that our algorithm results in significant improvement in throughput, especially for short-haul paths. The proposed algorithm can be easily integrated into most routing protocols with only minor modifications. Consequently, the algorithm provides a practical and effective approach for implementation of opportunistic routing in wireless networks.</description><identifier>ISSN: 1536-1276</identifier><identifier>EISSN: 1558-2248</identifier><identifier>DOI: 10.1109/TWC.2011.092711.101713</identifier><identifier>CODEN: ITWCAX</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Access methods and protocols, osi model ; Algorithm design and analysis ; Algorithms ; Applied sciences ; capacity ; Computer networks ; Exact sciences and technology ; hidden-terminal problem ; Interference ; link-level interference ; multi-hop wireless network ; Networks ; Opportunistic routing ; Protocol (computers) ; Routing ; Routing (telecommunications) ; Simulation ; Systems, networks and services of telecommunications ; Telecommunications ; Telecommunications and information theory ; Teleprocessing networks. Isdn ; Throughput ; Transmission and modulation (techniques and equipments) ; Wireless communication ; Wireless networks</subject><ispartof>IEEE transactions on wireless communications, 2011-11, Vol.10 (11), p.3583-3588</ispartof><rights>2015 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Nov 2011</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c398t-7625d4b5e891b709eb02827220be8fbb718d482556cf53e30087fb9f9017a49c3</citedby><cites>FETCH-LOGICAL-c398t-7625d4b5e891b709eb02827220be8fbb718d482556cf53e30087fb9f9017a49c3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6036020$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6036020$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=25313483$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Goo Yeon Lee</creatorcontrib><creatorcontrib>Haas, Z. J.</creatorcontrib><title>Simple, Practical, and Effective Opportunistic Routing for Short-Haul Multi-Hop Wireless Networks</title><title>IEEE transactions on wireless communications</title><addtitle>TWC</addtitle><description>In this paper, we propose a simple and practical opportunistic routing algorithm, and we analyze its performance along a multi-hop wireless network path, while considering link-level interference among the network nodes. Through our analysis, we show that our algorithm results in significant improvement in throughput, especially for short-haul paths. The proposed algorithm can be easily integrated into most routing protocols with only minor modifications. Consequently, the algorithm provides a practical and effective approach for implementation of opportunistic routing in wireless networks.</description><subject>Access methods and protocols, osi model</subject><subject>Algorithm design and analysis</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>capacity</subject><subject>Computer networks</subject><subject>Exact sciences and technology</subject><subject>hidden-terminal problem</subject><subject>Interference</subject><subject>link-level interference</subject><subject>multi-hop wireless network</subject><subject>Networks</subject><subject>Opportunistic routing</subject><subject>Protocol (computers)</subject><subject>Routing</subject><subject>Routing (telecommunications)</subject><subject>Simulation</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Teleprocessing networks. Isdn</subject><subject>Throughput</subject><subject>Transmission and modulation (techniques and equipments)</subject><subject>Wireless communication</subject><subject>Wireless networks</subject><issn>1536-1276</issn><issn>1558-2248</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNqNkUtLJTEQhRsZwecvECQIwizsax6d11IuOldwVHzgMqT7VjTat9OTdDv4782lxcWsZlUJ56tDVZ2iOCR4RgjWpw9P8xnFhMywpjIXgokkbKPYJpyrktJK_Vi_mSgJlWKr2EnpFWdGcL5d2Hu_6ls4QbfRNoNvbHuCbLdE585B_r8Duun7EIex8ynL6C6Mg--ekQsR3b9koVzYsUW_x3bw5SL06MlHaCEldA3D3xDf0l6x6WybYP-r7haPF-cP80V5dfPrcn52VTZMq6GUgvJlVXNQmtQSa6gxVVRSimtQrq4lUctKUc5F4zgDhrGSrtZO501spRu2W_ycfPsY_oyQBrPyqYG2tR2EMZl8FqxUJRX-T5RpKTN69A_6GsbY5UWMzhNQoSueITFBTQwpRXCmj35l40d2MuuMTM7IrDMyU0Zmyig3Hn-525RP76LtGp--uylnhFVqzR1MnAeAb1lgJjDF7BOljpi7</recordid><startdate>20111101</startdate><enddate>20111101</enddate><creator>Goo Yeon Lee</creator><creator>Haas, Z. J.</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>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20111101</creationdate><title>Simple, Practical, and Effective Opportunistic Routing for Short-Haul Multi-Hop Wireless Networks</title><author>Goo Yeon Lee ; Haas, Z. J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c398t-7625d4b5e891b709eb02827220be8fbb718d482556cf53e30087fb9f9017a49c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Access methods and protocols, osi model</topic><topic>Algorithm design and analysis</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>capacity</topic><topic>Computer networks</topic><topic>Exact sciences and technology</topic><topic>hidden-terminal problem</topic><topic>Interference</topic><topic>link-level interference</topic><topic>multi-hop wireless network</topic><topic>Networks</topic><topic>Opportunistic routing</topic><topic>Protocol (computers)</topic><topic>Routing</topic><topic>Routing (telecommunications)</topic><topic>Simulation</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Teleprocessing networks. Isdn</topic><topic>Throughput</topic><topic>Transmission and modulation (techniques and equipments)</topic><topic>Wireless communication</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Goo Yeon Lee</creatorcontrib><creatorcontrib>Haas, Z. J.</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>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on wireless communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Goo Yeon Lee</au><au>Haas, Z. J.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Simple, Practical, and Effective Opportunistic Routing for Short-Haul Multi-Hop Wireless Networks</atitle><jtitle>IEEE transactions on wireless communications</jtitle><stitle>TWC</stitle><date>2011-11-01</date><risdate>2011</risdate><volume>10</volume><issue>11</issue><spage>3583</spage><epage>3588</epage><pages>3583-3588</pages><issn>1536-1276</issn><eissn>1558-2248</eissn><coden>ITWCAX</coden><abstract>In this paper, we propose a simple and practical opportunistic routing algorithm, and we analyze its performance along a multi-hop wireless network path, while considering link-level interference among the network nodes. Through our analysis, we show that our algorithm results in significant improvement in throughput, especially for short-haul paths. The proposed algorithm can be easily integrated into most routing protocols with only minor modifications. Consequently, the algorithm provides a practical and effective approach for implementation of opportunistic routing in wireless networks.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TWC.2011.092711.101713</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1536-1276 |
| ispartof | IEEE transactions on wireless communications, 2011-11, Vol.10 (11), p.3583-3588 |
| issn | 1536-1276 1558-2248 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1010883977 |
| source | IEEE Electronic Library (IEL) |
| subjects | Access methods and protocols, osi model Algorithm design and analysis Algorithms Applied sciences capacity Computer networks Exact sciences and technology hidden-terminal problem Interference link-level interference multi-hop wireless network Networks Opportunistic routing Protocol (computers) Routing Routing (telecommunications) Simulation Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Teleprocessing networks. Isdn Throughput Transmission and modulation (techniques and equipments) Wireless communication Wireless networks |
| title | Simple, Practical, and Effective Opportunistic Routing for Short-Haul Multi-Hop Wireless 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-25T03%3A53%3A44IST&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=Simple,%20Practical,%20and%20Effective%20Opportunistic%20Routing%20for%20Short-Haul%20Multi-Hop%20Wireless%20Networks&rft.jtitle=IEEE%20transactions%20on%20wireless%20communications&rft.au=Goo%20Yeon%20Lee&rft.date=2011-11-01&rft.volume=10&rft.issue=11&rft.spage=3583&rft.epage=3588&rft.pages=3583-3588&rft.issn=1536-1276&rft.eissn=1558-2248&rft.coden=ITWCAX&rft_id=info:doi/10.1109/TWC.2011.092711.101713&rft_dat=%3Cproquest_RIE%3E2528620091%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=908726945&rft_id=info:pmid/&rft_ieee_id=6036020&rfr_iscdi=true |