Revisiting the Hidden Terminal Problem in a CSMA/CA Wireless Network
Recently research interest in the performance analysis of wireless networks was revived. An issue of an utmost importance in this class of networks, classified as one of the severest reasons for the degradation of their performance, is the hidden terminal problem. In this paper we argue that an accu...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on mobile computing 2008-07, Vol.7 (7), p.817-831 |
|---|---|
| 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 | 831 |
|---|---|
| container_issue | 7 |
| container_start_page | 817 |
| container_title | IEEE transactions on mobile computing |
| container_volume | 7 |
| creator | Tsertou, A. Laurenson, D.I. |
| description | Recently research interest in the performance analysis of wireless networks was revived. An issue of an utmost importance in this class of networks, classified as one of the severest reasons for the degradation of their performance, is the hidden terminal problem. In this paper we argue that an accurate analysis of the effect of hidden nodes in the performance of a random access protocol is still an open issue. Firstly, we thoroughly explain the reasons behind the limitations of previous modelling methods, and show that their performance is reliable only for certain configurations. Secondly, and most importantly, we propose a novel method of modelling time that uses a fixed-length channel slot as the unit of time and does not rely on renewal theory. With these features the model is able to successfully take into account the desynchronisation of nodes in a hidden terminal environment. Our analytical model is shown to have a very close match to simulation results for an IEEE 802.11 MAC protocol and for all the system parameters considered, unlike conventional methods. |
| doi_str_mv | 10.1109/TMC.2007.70757 |
| format | Magazinearticle |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_34467044</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4359001</ieee_id><sourcerecordid>34467044</sourcerecordid><originalsourceid>FETCH-LOGICAL-c411t-f6098ff6ea0e7793f6b9aadb5a968e364a7d35fc4b6270d387fe57b861b1f6d63</originalsourceid><addsrcrecordid>eNqFkT1P3EAQhi0UJAjQ0tCsIgUqH7Oe9X6UJ_MpQYKSQ5TW2p5Nlvhs2PUR8e-xOUSRIlQz0jzvW8yTJPscZpyDOV5cF7MMQM0UqFxtJNs8z3UKUsKnaUeZ8gxxK_kc4z0A18ao7eTkBz356Aff_WLDb2IXvmmoYwsKS9_Zlt2EvmppyXzHLCt-Xs-Pizm784FaipF9o-FvH_7sJpvOtpH23uZOcnt2uigu0qvv55fF_CqtBedD6iQY7ZwkC6SUQScrY21T5dZITSiFVQ3mrhaVzBQ0qJWjXFVa8oo72UjcSY7WvQ-hf1xRHMqljzW1re2oX8XSAErUgOJDUqscDHKDI3n4XxKFkArEVPnlH_C-X4XxR2ObRDTCyAmaraE69DEGcuVD8EsbnksO5WSpHC2Vk6Xy1dIY-PrWamNtWxdsV_v4nspA8EwoPXIHa84T0ftZYG5GlfgCO6-XrA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>magazinearticle</recordtype><pqid>863394964</pqid></control><display><type>magazinearticle</type><title>Revisiting the Hidden Terminal Problem in a CSMA/CA Wireless Network</title><source>IEEE Electronic Library (IEL)</source><creator>Tsertou, A. ; Laurenson, D.I.</creator><creatorcontrib>Tsertou, A. ; Laurenson, D.I.</creatorcontrib><description>Recently research interest in the performance analysis of wireless networks was revived. An issue of an utmost importance in this class of networks, classified as one of the severest reasons for the degradation of their performance, is the hidden terminal problem. In this paper we argue that an accurate analysis of the effect of hidden nodes in the performance of a random access protocol is still an open issue. Firstly, we thoroughly explain the reasons behind the limitations of previous modelling methods, and show that their performance is reliable only for certain configurations. Secondly, and most importantly, we propose a novel method of modelling time that uses a fixed-length channel slot as the unit of time and does not rely on renewal theory. With these features the model is able to successfully take into account the desynchronisation of nodes in a hidden terminal environment. Our analytical model is shown to have a very close match to simulation results for an IEEE 802.11 MAC protocol and for all the system parameters considered, unlike conventional methods.</description><identifier>ISSN: 1536-1233</identifier><identifier>EISSN: 1558-0660</identifier><identifier>DOI: 10.1109/TMC.2007.70757</identifier><identifier>CODEN: ITMCCJ</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Access methods and protocols, osi model ; Access protocols ; Analytical models ; Applied sciences ; Channels ; Degradation ; Distribution functions ; Exact sciences and technology ; Markov processes ; Mathematical analysis ; Mathematical models ; Media Access Protocol ; Modeling techniques ; Modelling ; Multiaccess communication ; Network topology ; Networks ; Performance analysis ; Protocol verification ; Renewal theory ; Studies ; Systems, networks and services of telecommunications ; Telecommunications ; Telecommunications and information theory ; Teleprocessing networks. Isdn ; Terminals ; Transmission and modulation (techniques and equipments) ; Wireless communication ; Wireless LAN ; Wireless networks</subject><ispartof>IEEE transactions on mobile computing, 2008-07, Vol.7 (7), p.817-831</ispartof><rights>2008 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2008</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c411t-f6098ff6ea0e7793f6b9aadb5a968e364a7d35fc4b6270d387fe57b861b1f6d63</citedby><cites>FETCH-LOGICAL-c411t-f6098ff6ea0e7793f6b9aadb5a968e364a7d35fc4b6270d387fe57b861b1f6d63</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4359001$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>776,780,792,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4359001$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20412478$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Tsertou, A.</creatorcontrib><creatorcontrib>Laurenson, D.I.</creatorcontrib><title>Revisiting the Hidden Terminal Problem in a CSMA/CA Wireless Network</title><title>IEEE transactions on mobile computing</title><addtitle>TMC</addtitle><description>Recently research interest in the performance analysis of wireless networks was revived. An issue of an utmost importance in this class of networks, classified as one of the severest reasons for the degradation of their performance, is the hidden terminal problem. In this paper we argue that an accurate analysis of the effect of hidden nodes in the performance of a random access protocol is still an open issue. Firstly, we thoroughly explain the reasons behind the limitations of previous modelling methods, and show that their performance is reliable only for certain configurations. Secondly, and most importantly, we propose a novel method of modelling time that uses a fixed-length channel slot as the unit of time and does not rely on renewal theory. With these features the model is able to successfully take into account the desynchronisation of nodes in a hidden terminal environment. Our analytical model is shown to have a very close match to simulation results for an IEEE 802.11 MAC protocol and for all the system parameters considered, unlike conventional methods.</description><subject>Access methods and protocols, osi model</subject><subject>Access protocols</subject><subject>Analytical models</subject><subject>Applied sciences</subject><subject>Channels</subject><subject>Degradation</subject><subject>Distribution functions</subject><subject>Exact sciences and technology</subject><subject>Markov processes</subject><subject>Mathematical analysis</subject><subject>Mathematical models</subject><subject>Media Access Protocol</subject><subject>Modeling techniques</subject><subject>Modelling</subject><subject>Multiaccess communication</subject><subject>Network topology</subject><subject>Networks</subject><subject>Performance analysis</subject><subject>Protocol verification</subject><subject>Renewal theory</subject><subject>Studies</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Teleprocessing networks. Isdn</subject><subject>Terminals</subject><subject>Transmission and modulation (techniques and equipments)</subject><subject>Wireless communication</subject><subject>Wireless LAN</subject><subject>Wireless networks</subject><issn>1536-1233</issn><issn>1558-0660</issn><fulltext>true</fulltext><rsrctype>magazinearticle</rsrctype><creationdate>2008</creationdate><recordtype>magazinearticle</recordtype><sourceid>RIE</sourceid><recordid>eNqFkT1P3EAQhi0UJAjQ0tCsIgUqH7Oe9X6UJ_MpQYKSQ5TW2p5Nlvhs2PUR8e-xOUSRIlQz0jzvW8yTJPscZpyDOV5cF7MMQM0UqFxtJNs8z3UKUsKnaUeZ8gxxK_kc4z0A18ao7eTkBz356Aff_WLDb2IXvmmoYwsKS9_Zlt2EvmppyXzHLCt-Xs-Pizm784FaipF9o-FvH_7sJpvOtpH23uZOcnt2uigu0qvv55fF_CqtBedD6iQY7ZwkC6SUQScrY21T5dZITSiFVQ3mrhaVzBQ0qJWjXFVa8oo72UjcSY7WvQ-hf1xRHMqljzW1re2oX8XSAErUgOJDUqscDHKDI3n4XxKFkArEVPnlH_C-X4XxR2ObRDTCyAmaraE69DEGcuVD8EsbnksO5WSpHC2Vk6Xy1dIY-PrWamNtWxdsV_v4nspA8EwoPXIHa84T0ftZYG5GlfgCO6-XrA</recordid><startdate>20080701</startdate><enddate>20080701</enddate><creator>Tsertou, A.</creator><creator>Laurenson, D.I.</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>20080701</creationdate><title>Revisiting the Hidden Terminal Problem in a CSMA/CA Wireless Network</title><author>Tsertou, A. ; Laurenson, D.I.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c411t-f6098ff6ea0e7793f6b9aadb5a968e364a7d35fc4b6270d387fe57b861b1f6d63</frbrgroupid><rsrctype>magazinearticle</rsrctype><prefilter>magazinearticle</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Access methods and protocols, osi model</topic><topic>Access protocols</topic><topic>Analytical models</topic><topic>Applied sciences</topic><topic>Channels</topic><topic>Degradation</topic><topic>Distribution functions</topic><topic>Exact sciences and technology</topic><topic>Markov processes</topic><topic>Mathematical analysis</topic><topic>Mathematical models</topic><topic>Media Access Protocol</topic><topic>Modeling techniques</topic><topic>Modelling</topic><topic>Multiaccess communication</topic><topic>Network topology</topic><topic>Networks</topic><topic>Performance analysis</topic><topic>Protocol verification</topic><topic>Renewal theory</topic><topic>Studies</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Teleprocessing networks. Isdn</topic><topic>Terminals</topic><topic>Transmission and modulation (techniques and equipments)</topic><topic>Wireless communication</topic><topic>Wireless LAN</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Tsertou, A.</creatorcontrib><creatorcontrib>Laurenson, D.I.</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>Tsertou, A.</au><au>Laurenson, D.I.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Revisiting the Hidden Terminal Problem in a CSMA/CA Wireless Network</atitle><jtitle>IEEE transactions on mobile computing</jtitle><stitle>TMC</stitle><date>2008-07-01</date><risdate>2008</risdate><volume>7</volume><issue>7</issue><spage>817</spage><epage>831</epage><pages>817-831</pages><issn>1536-1233</issn><eissn>1558-0660</eissn><coden>ITMCCJ</coden><abstract>Recently research interest in the performance analysis of wireless networks was revived. An issue of an utmost importance in this class of networks, classified as one of the severest reasons for the degradation of their performance, is the hidden terminal problem. In this paper we argue that an accurate analysis of the effect of hidden nodes in the performance of a random access protocol is still an open issue. Firstly, we thoroughly explain the reasons behind the limitations of previous modelling methods, and show that their performance is reliable only for certain configurations. Secondly, and most importantly, we propose a novel method of modelling time that uses a fixed-length channel slot as the unit of time and does not rely on renewal theory. With these features the model is able to successfully take into account the desynchronisation of nodes in a hidden terminal environment. Our analytical model is shown to have a very close match to simulation results for an IEEE 802.11 MAC protocol and for all the system parameters considered, unlike conventional methods.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TMC.2007.70757</doi><tpages>15</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1536-1233 |
| ispartof | IEEE transactions on mobile computing, 2008-07, Vol.7 (7), p.817-831 |
| issn | 1536-1233 1558-0660 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_34467044 |
| source | IEEE Electronic Library (IEL) |
| subjects | Access methods and protocols, osi model Access protocols Analytical models Applied sciences Channels Degradation Distribution functions Exact sciences and technology Markov processes Mathematical analysis Mathematical models Media Access Protocol Modeling techniques Modelling Multiaccess communication Network topology Networks Performance analysis Protocol verification Renewal theory Studies Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Teleprocessing networks. Isdn Terminals Transmission and modulation (techniques and equipments) Wireless communication Wireless LAN Wireless networks |
| title | Revisiting the Hidden Terminal Problem in a CSMA/CA Wireless Network |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-12T23%3A07%3A35IST&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=Revisiting%20the%20Hidden%20Terminal%20Problem%20in%20a%20CSMA/CA%20Wireless%20Network&rft.jtitle=IEEE%20transactions%20on%20mobile%20computing&rft.au=Tsertou,%20A.&rft.date=2008-07-01&rft.volume=7&rft.issue=7&rft.spage=817&rft.epage=831&rft.pages=817-831&rft.issn=1536-1233&rft.eissn=1558-0660&rft.coden=ITMCCJ&rft_id=info:doi/10.1109/TMC.2007.70757&rft_dat=%3Cproquest_RIE%3E34467044%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=863394964&rft_id=info:pmid/&rft_ieee_id=4359001&rfr_iscdi=true |