Loading…
The Effect of Node Connectivity Control on the Throughput of Distributed MAC Networks
We investigate the impact on the overall throughput of ad-hoc networks using two node connectivity control schemes. We propose a varying power constant connectivity (VPCC) scheme, where each node in a network regulates its transmission power until the number of its neighbors (node connectivity) is m...
Saved in:
Main Authors: | , , |
---|---|
Format: | Conference Proceeding |
Language: | English |
Subjects: | |
Online Access: | Request full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | 1660 |
container_issue | |
container_start_page | 1656 |
container_title | |
container_volume | |
creator | Banu, Jaseema Huat, Chew Yong Chin, Francois P. S. |
description | We investigate the impact on the overall throughput of ad-hoc networks using two node connectivity control schemes. We propose a varying power constant connectivity (VPCC) scheme, where each node in a network regulates its transmission power until the number of its neighbors (node connectivity) is maintained at some desired number, whose optimal value is a design parameter to be determined. The achievable throughput is compared with the commonly adopted constant power varying connectivity (CPVC) scheme, where each node transmits at a constant power and hence has fixed transmission coverage but the connectivity changes from node to node. We derive the theoretical probability mass function of the number of neighbors of a given node for the CPVC scheme, and the probability density function of the coverage radius for the VPCC scheme. Simulation results are made to study the achievable throughput of the two schemes under the Poisson packet arrival assumption and when carrier- sense multiple access with collision avoidance and exponential back-off timer are used. The results from the simulation show that even if VPCC may result in a higher average number of hops per transmission under the same traffic condition, it can still achieve a much higher throughput than CPVC scheme. To have a better insight, we postulate and verify via simulations that the overall system throughput depends only on a parameter, which is equal to the frequency reuse factor divided by the average number of hops regardless of the schemes and the nodal density. This relationship provides a useful guide to designers, in which the parameter can be computed to predict the throughput before the most suitable scheme is selected. |
doi_str_mv | 10.1109/WCNC.2008.296 |
format | conference_proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4489327</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4489327</ieee_id><sourcerecordid>4489327</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-4b6fb3626462c9adce32fe92d55274cd965c31861039fd0bf43bf225004a9f743</originalsourceid><addsrcrecordid>eNotjMtOwzAUBS0eEm1hyYqNfyDBvr524mUVykMqYZOKZZXENjGUukocUP-eFlgdjc5oCLnmLOWc6dvXoixSYCxPQasTMuFS5gkoDqdkyhEQudYZnB0PkImQnF-Q6TC8MwZMIk7IquosXThn20iDo2UwlhZhuz2w__Jxf4TYhw0NWxoPatX1YXzrduOvfueH2PtmjNbQ53lBSxu_Q_8xXJJzV28Ge_W_M7K6X1TFY7J8eXgq5svE80zGBBvlGqFAoYJW16a1ApzVYKSEDFujlWwFzxVnQjvDGoeicQCSMay1y1DMyM1f11tr17vef9b9fo2YawGZ-AEtFFCN</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>The Effect of Node Connectivity Control on the Throughput of Distributed MAC Networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Banu, Jaseema ; Huat, Chew Yong ; Chin, Francois P. S.</creator><creatorcontrib>Banu, Jaseema ; Huat, Chew Yong ; Chin, Francois P. S.</creatorcontrib><description>We investigate the impact on the overall throughput of ad-hoc networks using two node connectivity control schemes. We propose a varying power constant connectivity (VPCC) scheme, where each node in a network regulates its transmission power until the number of its neighbors (node connectivity) is maintained at some desired number, whose optimal value is a design parameter to be determined. The achievable throughput is compared with the commonly adopted constant power varying connectivity (CPVC) scheme, where each node transmits at a constant power and hence has fixed transmission coverage but the connectivity changes from node to node. We derive the theoretical probability mass function of the number of neighbors of a given node for the CPVC scheme, and the probability density function of the coverage radius for the VPCC scheme. Simulation results are made to study the achievable throughput of the two schemes under the Poisson packet arrival assumption and when carrier- sense multiple access with collision avoidance and exponential back-off timer are used. The results from the simulation show that even if VPCC may result in a higher average number of hops per transmission under the same traffic condition, it can still achieve a much higher throughput than CPVC scheme. To have a better insight, we postulate and verify via simulations that the overall system throughput depends only on a parameter, which is equal to the frequency reuse factor divided by the average number of hops regardless of the schemes and the nodal density. This relationship provides a useful guide to designers, in which the parameter can be computed to predict the throughput before the most suitable scheme is selected.</description><identifier>ISSN: 1525-3511</identifier><identifier>ISBN: 1424419972</identifier><identifier>ISBN: 9781424419975</identifier><identifier>EISSN: 1558-2612</identifier><identifier>DOI: 10.1109/WCNC.2008.296</identifier><language>eng</language><publisher>IEEE</publisher><subject>Ad hoc networks ; Broadcasting ; Communication system control ; Communications Society ; Frequency ; Peer to peer computing ; Protocols ; Routing ; Throughput ; Wireless LAN</subject><ispartof>2008 IEEE Wireless Communications and Networking Conference, 2008, p.1656-1660</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4489327$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54555,54920,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4489327$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Banu, Jaseema</creatorcontrib><creatorcontrib>Huat, Chew Yong</creatorcontrib><creatorcontrib>Chin, Francois P. S.</creatorcontrib><title>The Effect of Node Connectivity Control on the Throughput of Distributed MAC Networks</title><title>2008 IEEE Wireless Communications and Networking Conference</title><addtitle>WCNC</addtitle><description>We investigate the impact on the overall throughput of ad-hoc networks using two node connectivity control schemes. We propose a varying power constant connectivity (VPCC) scheme, where each node in a network regulates its transmission power until the number of its neighbors (node connectivity) is maintained at some desired number, whose optimal value is a design parameter to be determined. The achievable throughput is compared with the commonly adopted constant power varying connectivity (CPVC) scheme, where each node transmits at a constant power and hence has fixed transmission coverage but the connectivity changes from node to node. We derive the theoretical probability mass function of the number of neighbors of a given node for the CPVC scheme, and the probability density function of the coverage radius for the VPCC scheme. Simulation results are made to study the achievable throughput of the two schemes under the Poisson packet arrival assumption and when carrier- sense multiple access with collision avoidance and exponential back-off timer are used. The results from the simulation show that even if VPCC may result in a higher average number of hops per transmission under the same traffic condition, it can still achieve a much higher throughput than CPVC scheme. To have a better insight, we postulate and verify via simulations that the overall system throughput depends only on a parameter, which is equal to the frequency reuse factor divided by the average number of hops regardless of the schemes and the nodal density. This relationship provides a useful guide to designers, in which the parameter can be computed to predict the throughput before the most suitable scheme is selected.</description><subject>Ad hoc networks</subject><subject>Broadcasting</subject><subject>Communication system control</subject><subject>Communications Society</subject><subject>Frequency</subject><subject>Peer to peer computing</subject><subject>Protocols</subject><subject>Routing</subject><subject>Throughput</subject><subject>Wireless LAN</subject><issn>1525-3511</issn><issn>1558-2612</issn><isbn>1424419972</isbn><isbn>9781424419975</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotjMtOwzAUBS0eEm1hyYqNfyDBvr524mUVykMqYZOKZZXENjGUukocUP-eFlgdjc5oCLnmLOWc6dvXoixSYCxPQasTMuFS5gkoDqdkyhEQudYZnB0PkImQnF-Q6TC8MwZMIk7IquosXThn20iDo2UwlhZhuz2w__Jxf4TYhw0NWxoPatX1YXzrduOvfueH2PtmjNbQ53lBSxu_Q_8xXJJzV28Ge_W_M7K6X1TFY7J8eXgq5svE80zGBBvlGqFAoYJW16a1ApzVYKSEDFujlWwFzxVnQjvDGoeicQCSMay1y1DMyM1f11tr17vef9b9fo2YawGZ-AEtFFCN</recordid><startdate>200803</startdate><enddate>200803</enddate><creator>Banu, Jaseema</creator><creator>Huat, Chew Yong</creator><creator>Chin, Francois P. S.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200803</creationdate><title>The Effect of Node Connectivity Control on the Throughput of Distributed MAC Networks</title><author>Banu, Jaseema ; Huat, Chew Yong ; Chin, Francois P. S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-4b6fb3626462c9adce32fe92d55274cd965c31861039fd0bf43bf225004a9f743</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Ad hoc networks</topic><topic>Broadcasting</topic><topic>Communication system control</topic><topic>Communications Society</topic><topic>Frequency</topic><topic>Peer to peer computing</topic><topic>Protocols</topic><topic>Routing</topic><topic>Throughput</topic><topic>Wireless LAN</topic><toplevel>online_resources</toplevel><creatorcontrib>Banu, Jaseema</creatorcontrib><creatorcontrib>Huat, Chew Yong</creatorcontrib><creatorcontrib>Chin, Francois P. S.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Banu, Jaseema</au><au>Huat, Chew Yong</au><au>Chin, Francois P. S.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>The Effect of Node Connectivity Control on the Throughput of Distributed MAC Networks</atitle><btitle>2008 IEEE Wireless Communications and Networking Conference</btitle><stitle>WCNC</stitle><date>2008-03</date><risdate>2008</risdate><spage>1656</spage><epage>1660</epage><pages>1656-1660</pages><issn>1525-3511</issn><eissn>1558-2612</eissn><isbn>1424419972</isbn><isbn>9781424419975</isbn><abstract>We investigate the impact on the overall throughput of ad-hoc networks using two node connectivity control schemes. We propose a varying power constant connectivity (VPCC) scheme, where each node in a network regulates its transmission power until the number of its neighbors (node connectivity) is maintained at some desired number, whose optimal value is a design parameter to be determined. The achievable throughput is compared with the commonly adopted constant power varying connectivity (CPVC) scheme, where each node transmits at a constant power and hence has fixed transmission coverage but the connectivity changes from node to node. We derive the theoretical probability mass function of the number of neighbors of a given node for the CPVC scheme, and the probability density function of the coverage radius for the VPCC scheme. Simulation results are made to study the achievable throughput of the two schemes under the Poisson packet arrival assumption and when carrier- sense multiple access with collision avoidance and exponential back-off timer are used. The results from the simulation show that even if VPCC may result in a higher average number of hops per transmission under the same traffic condition, it can still achieve a much higher throughput than CPVC scheme. To have a better insight, we postulate and verify via simulations that the overall system throughput depends only on a parameter, which is equal to the frequency reuse factor divided by the average number of hops regardless of the schemes and the nodal density. This relationship provides a useful guide to designers, in which the parameter can be computed to predict the throughput before the most suitable scheme is selected.</abstract><pub>IEEE</pub><doi>10.1109/WCNC.2008.296</doi><tpages>5</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1525-3511 |
ispartof | 2008 IEEE Wireless Communications and Networking Conference, 2008, p.1656-1660 |
issn | 1525-3511 1558-2612 |
language | eng |
recordid | cdi_ieee_primary_4489327 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Ad hoc networks Broadcasting Communication system control Communications Society Frequency Peer to peer computing Protocols Routing Throughput Wireless LAN |
title | The Effect of Node Connectivity Control on the Throughput of Distributed MAC Networks |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T14%3A00%3A18IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=The%20Effect%20of%20Node%20Connectivity%20Control%20on%20the%20Throughput%20of%20Distributed%20MAC%20Networks&rft.btitle=2008%20IEEE%20Wireless%20Communications%20and%20Networking%20Conference&rft.au=Banu,%20Jaseema&rft.date=2008-03&rft.spage=1656&rft.epage=1660&rft.pages=1656-1660&rft.issn=1525-3511&rft.eissn=1558-2612&rft.isbn=1424419972&rft.isbn_list=9781424419975&rft_id=info:doi/10.1109/WCNC.2008.296&rft_dat=%3Cieee_6IE%3E4489327%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-4b6fb3626462c9adce32fe92d55274cd965c31861039fd0bf43bf225004a9f743%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4489327&rfr_iscdi=true |