Maximizing Communication Concurrency via Link-Layer Packet Salvaging in Mobile Ad Hoc Networks
Carrier-sense medium access control (MAC) protocols such as the IEEE 802.11 distributed coordination function (DCF) avoid collisions by holding up pending packet transmission requests when a carrier signal is observed above a certain threshold. However, this often results in unnecessarily conservati...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on mobile computing 2007-04, Vol.6 (4), p.449-462 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Magazinearticle |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 462 |
|---|---|
| container_issue | 4 |
| container_start_page | 449 |
| container_title | IEEE transactions on mobile computing |
| container_volume | 6 |
| creator | Yu, C. Shin, K.G. Song, L. |
| description | Carrier-sense medium access control (MAC) protocols such as the IEEE 802.11 distributed coordination function (DCF) avoid collisions by holding up pending packet transmission requests when a carrier signal is observed above a certain threshold. However, this often results in unnecessarily conservative communication, thus making it difficult to maximize the utilization of the spatial spectral resource. This paper shows that a higher aggregate throughput can be achieved by allowing more concurrent communications and adjusting the communication distance on the fly, which needs provisions for the following two areas. On the one hand, carrier sense-based MAC protocols do not allow aggressive communication attempts when they are within the carrier senseable area. On the other hand, the communication distance is generally neither short nor adjustable because multihop routing protocols strive for providing minimum hop paths. This paper proposes a new MAC algorithm, called multiple access with salvation army (MASA), which adopts less sensitive carrier sensing to promote more concurrent communications and adjusts the communication distance adaptively via "packet salvaging" at the MAC layer. Extensive simulation based on the ns-2 has shown MASA to outperform the DCF, particularly in terms of packet delay. We also discuss the implementation of MASA based on the DCF specification |
| doi_str_mv | 10.1109/TMC.2007.56 |
| format | Magazinearticle |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_864560881</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4116707</ieee_id><sourcerecordid>889377227</sourcerecordid><originalsourceid>FETCH-LOGICAL-c442t-8cf0cf5b92aa9de11b5d087fb156d1f7f83ad33c4edbd3f92c144926fd0ca4603</originalsourceid><addsrcrecordid>eNqF0UFLHDEUB_BBKtRqTz32EgptDzLbZDLJJEdZ2irsaqH22vAmk0jcmUSTGXX99M2wotBDe0rC-73HC_-ieEfwghAsv1yul4sK42bB-F5xQBgTJeYcv5rvlJekovR18Sala4yJkLI5KH6v4cEN7tH5K7QMwzB5p2F0weeX11OMxustunOAVs5vyhVsTUQ_QG_MiH5CfwdXc6fzaB1a1xt00qHToNG5Ge9D3KSjYt9Cn8zbp_Ow-PXt6-XytFxdfD9bnqxKXdfVWAptsbaslRWA7AwhLeuwaGxLGO-Ibayg0FGqa9O1HbWy0qSuZcVthzXUHNPD4vNu7k0Mt5NJoxpc0qbvwZswJSUx5RRzIv8rhZC0aaqqyfLTPyXNqwvGZ_jhL3gdpujzf5XgNeNYCJLR8Q7pGFKKxqqb6AaIW0WwmsNTOTw1h6cYz_rj00hIGnobwWuXXloEz5CK7N7vnDPGPJdrQniT638A72ihaw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>magazinearticle</recordtype><pqid>864560881</pqid></control><display><type>magazinearticle</type><title>Maximizing Communication Concurrency via Link-Layer Packet Salvaging in Mobile Ad Hoc Networks</title><source>IEEE Electronic Library (IEL)</source><creator>Yu, C. ; Shin, K.G. ; Song, L.</creator><creatorcontrib>Yu, C. ; Shin, K.G. ; Song, L.</creatorcontrib><description>Carrier-sense medium access control (MAC) protocols such as the IEEE 802.11 distributed coordination function (DCF) avoid collisions by holding up pending packet transmission requests when a carrier signal is observed above a certain threshold. However, this often results in unnecessarily conservative communication, thus making it difficult to maximize the utilization of the spatial spectral resource. This paper shows that a higher aggregate throughput can be achieved by allowing more concurrent communications and adjusting the communication distance on the fly, which needs provisions for the following two areas. On the one hand, carrier sense-based MAC protocols do not allow aggressive communication attempts when they are within the carrier senseable area. On the other hand, the communication distance is generally neither short nor adjustable because multihop routing protocols strive for providing minimum hop paths. This paper proposes a new MAC algorithm, called multiple access with salvation army (MASA), which adopts less sensitive carrier sensing to promote more concurrent communications and adjusts the communication distance adaptively via "packet salvaging" at the MAC layer. Extensive simulation based on the ns-2 has shown MASA to outperform the DCF, particularly in terms of packet delay. We also discuss the implementation of MASA based on the DCF specification</description><identifier>ISSN: 1536-1233</identifier><identifier>EISSN: 1558-0660</identifier><identifier>DOI: 10.1109/TMC.2007.56</identifier><identifier>CODEN: ITMCCJ</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Access control ; Access methods and protocols, osi model ; Access protocols ; Adjustable ; Aggregates ; Algorithms ; Applied sciences ; capture effect ; carrier sense ; Carriers ; Communication ; Computer simulation ; Concurrent computing ; Delay ; Equipments and installations ; Exact sciences and technology ; Masa ; Media Access Protocol ; medium access control ; Mobile ad hoc networks ; Mobile communication ; Mobile radiocommunication systems ; Networks ; nondeterministic algorithm ; Packet transmission ; Radiocommunications ; Routing protocols ; Spread spectrum communication ; Studies ; Switching and signalling ; Systems, networks and services of telecommunications ; Telecommunications ; Telecommunications and information theory ; Teleprocessing networks. Isdn ; Teletraffic ; Throughput</subject><ispartof>IEEE transactions on mobile computing, 2007-04, Vol.6 (4), p.449-462</ispartof><rights>2007 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2007</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c442t-8cf0cf5b92aa9de11b5d087fb156d1f7f83ad33c4edbd3f92c144926fd0ca4603</citedby><cites>FETCH-LOGICAL-c442t-8cf0cf5b92aa9de11b5d087fb156d1f7f83ad33c4edbd3f92c144926fd0ca4603</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4116707$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>776,780,792,27904,54736</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4116707$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18600738$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Yu, C.</creatorcontrib><creatorcontrib>Shin, K.G.</creatorcontrib><creatorcontrib>Song, L.</creatorcontrib><title>Maximizing Communication Concurrency via Link-Layer Packet Salvaging in Mobile Ad Hoc Networks</title><title>IEEE transactions on mobile computing</title><addtitle>TMC</addtitle><description>Carrier-sense medium access control (MAC) protocols such as the IEEE 802.11 distributed coordination function (DCF) avoid collisions by holding up pending packet transmission requests when a carrier signal is observed above a certain threshold. However, this often results in unnecessarily conservative communication, thus making it difficult to maximize the utilization of the spatial spectral resource. This paper shows that a higher aggregate throughput can be achieved by allowing more concurrent communications and adjusting the communication distance on the fly, which needs provisions for the following two areas. On the one hand, carrier sense-based MAC protocols do not allow aggressive communication attempts when they are within the carrier senseable area. On the other hand, the communication distance is generally neither short nor adjustable because multihop routing protocols strive for providing minimum hop paths. This paper proposes a new MAC algorithm, called multiple access with salvation army (MASA), which adopts less sensitive carrier sensing to promote more concurrent communications and adjusts the communication distance adaptively via "packet salvaging" at the MAC layer. Extensive simulation based on the ns-2 has shown MASA to outperform the DCF, particularly in terms of packet delay. We also discuss the implementation of MASA based on the DCF specification</description><subject>Access control</subject><subject>Access methods and protocols, osi model</subject><subject>Access protocols</subject><subject>Adjustable</subject><subject>Aggregates</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>capture effect</subject><subject>carrier sense</subject><subject>Carriers</subject><subject>Communication</subject><subject>Computer simulation</subject><subject>Concurrent computing</subject><subject>Delay</subject><subject>Equipments and installations</subject><subject>Exact sciences and technology</subject><subject>Masa</subject><subject>Media Access Protocol</subject><subject>medium access control</subject><subject>Mobile ad hoc networks</subject><subject>Mobile communication</subject><subject>Mobile radiocommunication systems</subject><subject>Networks</subject><subject>nondeterministic algorithm</subject><subject>Packet transmission</subject><subject>Radiocommunications</subject><subject>Routing protocols</subject><subject>Spread spectrum communication</subject><subject>Studies</subject><subject>Switching and signalling</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Teleprocessing networks. Isdn</subject><subject>Teletraffic</subject><subject>Throughput</subject><issn>1536-1233</issn><issn>1558-0660</issn><fulltext>true</fulltext><rsrctype>magazinearticle</rsrctype><creationdate>2007</creationdate><recordtype>magazinearticle</recordtype><sourceid>RIE</sourceid><recordid>eNqF0UFLHDEUB_BBKtRqTz32EgptDzLbZDLJJEdZ2irsaqH22vAmk0jcmUSTGXX99M2wotBDe0rC-73HC_-ieEfwghAsv1yul4sK42bB-F5xQBgTJeYcv5rvlJekovR18Sala4yJkLI5KH6v4cEN7tH5K7QMwzB5p2F0weeX11OMxustunOAVs5vyhVsTUQ_QG_MiH5CfwdXc6fzaB1a1xt00qHToNG5Ge9D3KSjYt9Cn8zbp_Ow-PXt6-XytFxdfD9bnqxKXdfVWAptsbaslRWA7AwhLeuwaGxLGO-Ibayg0FGqa9O1HbWy0qSuZcVthzXUHNPD4vNu7k0Mt5NJoxpc0qbvwZswJSUx5RRzIv8rhZC0aaqqyfLTPyXNqwvGZ_jhL3gdpujzf5XgNeNYCJLR8Q7pGFKKxqqb6AaIW0WwmsNTOTw1h6cYz_rj00hIGnobwWuXXloEz5CK7N7vnDPGPJdrQniT638A72ihaw</recordid><startdate>20070401</startdate><enddate>20070401</enddate><creator>Yu, C.</creator><creator>Shin, K.G.</creator><creator>Song, L.</creator><general>IEEE</general><general>IEEE Computer Society</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>20070401</creationdate><title>Maximizing Communication Concurrency via Link-Layer Packet Salvaging in Mobile Ad Hoc Networks</title><author>Yu, C. ; Shin, K.G. ; Song, L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c442t-8cf0cf5b92aa9de11b5d087fb156d1f7f83ad33c4edbd3f92c144926fd0ca4603</frbrgroupid><rsrctype>magazinearticle</rsrctype><prefilter>magazinearticle</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Access control</topic><topic>Access methods and protocols, osi model</topic><topic>Access protocols</topic><topic>Adjustable</topic><topic>Aggregates</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>capture effect</topic><topic>carrier sense</topic><topic>Carriers</topic><topic>Communication</topic><topic>Computer simulation</topic><topic>Concurrent computing</topic><topic>Delay</topic><topic>Equipments and installations</topic><topic>Exact sciences and technology</topic><topic>Masa</topic><topic>Media Access Protocol</topic><topic>medium access control</topic><topic>Mobile ad hoc networks</topic><topic>Mobile communication</topic><topic>Mobile radiocommunication systems</topic><topic>Networks</topic><topic>nondeterministic algorithm</topic><topic>Packet transmission</topic><topic>Radiocommunications</topic><topic>Routing protocols</topic><topic>Spread spectrum communication</topic><topic>Studies</topic><topic>Switching and signalling</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Teleprocessing networks. Isdn</topic><topic>Teletraffic</topic><topic>Throughput</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yu, C.</creatorcontrib><creatorcontrib>Shin, K.G.</creatorcontrib><creatorcontrib>Song, L.</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 mobile computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yu, C.</au><au>Shin, K.G.</au><au>Song, L.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Maximizing Communication Concurrency via Link-Layer Packet Salvaging in Mobile Ad Hoc Networks</atitle><jtitle>IEEE transactions on mobile computing</jtitle><stitle>TMC</stitle><date>2007-04-01</date><risdate>2007</risdate><volume>6</volume><issue>4</issue><spage>449</spage><epage>462</epage><pages>449-462</pages><issn>1536-1233</issn><eissn>1558-0660</eissn><coden>ITMCCJ</coden><abstract>Carrier-sense medium access control (MAC) protocols such as the IEEE 802.11 distributed coordination function (DCF) avoid collisions by holding up pending packet transmission requests when a carrier signal is observed above a certain threshold. However, this often results in unnecessarily conservative communication, thus making it difficult to maximize the utilization of the spatial spectral resource. This paper shows that a higher aggregate throughput can be achieved by allowing more concurrent communications and adjusting the communication distance on the fly, which needs provisions for the following two areas. On the one hand, carrier sense-based MAC protocols do not allow aggressive communication attempts when they are within the carrier senseable area. On the other hand, the communication distance is generally neither short nor adjustable because multihop routing protocols strive for providing minimum hop paths. This paper proposes a new MAC algorithm, called multiple access with salvation army (MASA), which adopts less sensitive carrier sensing to promote more concurrent communications and adjusts the communication distance adaptively via "packet salvaging" at the MAC layer. Extensive simulation based on the ns-2 has shown MASA to outperform the DCF, particularly in terms of packet delay. We also discuss the implementation of MASA based on the DCF specification</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TMC.2007.56</doi><tpages>14</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1536-1233 |
| ispartof | IEEE transactions on mobile computing, 2007-04, Vol.6 (4), p.449-462 |
| issn | 1536-1233 1558-0660 |
| language | eng |
| recordid | cdi_proquest_journals_864560881 |
| source | IEEE Electronic Library (IEL) |
| subjects | Access control Access methods and protocols, osi model Access protocols Adjustable Aggregates Algorithms Applied sciences capture effect carrier sense Carriers Communication Computer simulation Concurrent computing Delay Equipments and installations Exact sciences and technology Masa Media Access Protocol medium access control Mobile ad hoc networks Mobile communication Mobile radiocommunication systems Networks nondeterministic algorithm Packet transmission Radiocommunications Routing protocols Spread spectrum communication Studies Switching and signalling Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Teleprocessing networks. Isdn Teletraffic Throughput |
| title | Maximizing Communication Concurrency via Link-Layer Packet Salvaging in Mobile 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-27T17%3A59%3A23IST&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=Maximizing%20Communication%20Concurrency%20via%20Link-Layer%20Packet%20Salvaging%20in%20Mobile%20Ad%20Hoc%20Networks&rft.jtitle=IEEE%20transactions%20on%20mobile%20computing&rft.au=Yu,%20C.&rft.date=2007-04-01&rft.volume=6&rft.issue=4&rft.spage=449&rft.epage=462&rft.pages=449-462&rft.issn=1536-1233&rft.eissn=1558-0660&rft.coden=ITMCCJ&rft_id=info:doi/10.1109/TMC.2007.56&rft_dat=%3Cproquest_RIE%3E889377227%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=864560881&rft_id=info:pmid/&rft_ieee_id=4116707&rfr_iscdi=true |