Asynchronous CSMA Policies in Multihop Wireless Networks With Primary Interference Constraints
We analyze asynchronous carrier sense multiple access (CSMA) policies for scheduling packet transmissions in multihop wireless networks subject to collisions under primary interference constraints. While the (asymptotic) achievable rate region of CSMA policies for single-hop networks has been well-k...
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2012
|
Online Access: | http://hdl.handle.net/1721.1/72681 https://orcid.org/0000-0002-1827-1285 |
_version_ | 1826201835547918336 |
---|---|
author | Marbach, Peter Eryilmaz, Atilla Ozdaglar, Asuman E. |
author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Marbach, Peter Eryilmaz, Atilla Ozdaglar, Asuman E. |
author_sort | Marbach, Peter |
collection | MIT |
description | We analyze asynchronous carrier sense multiple access (CSMA) policies for scheduling packet transmissions in multihop wireless networks subject to collisions under primary interference constraints. While the (asymptotic) achievable rate region of CSMA policies for single-hop networks has been well-known, their analysis for general multihop networks has been an open problem due to the complexity of complex interactions among coupled interference constraints. Our work resolves this problem for networks with primary interference constraints by introducing a novel fixed-point formulation that approximates the link service rates of CSMA policies. This formulation allows us to derive an explicit characterization of the achievable rate region of CSMA policies for a limiting regime of large networks with a small sensing period. Our analysis also reveals the rate at which CSMA achievable rate region approaches the asymptotic capacity region of such networks. Moreover, our approach enables the computation of approximate CSMA link transmission attempt probabilities to support any given arrival vector within the achievable rate region. As part of our analysis, we show that both of these approximations become (asymptotically) accurate for large networks with a small sensing period. Our numerical case studies further suggest that these approximations are accurate even for moderately sized networks. |
first_indexed | 2024-09-23T11:57:38Z |
format | Article |
id | mit-1721.1/72681 |
institution | Massachusetts Institute of Technology |
language | en_US |
last_indexed | 2024-09-23T11:57:38Z |
publishDate | 2012 |
publisher | Institute of Electrical and Electronics Engineers (IEEE) |
record_format | dspace |
spelling | mit-1721.1/726812022-09-27T23:06:06Z Asynchronous CSMA Policies in Multihop Wireless Networks With Primary Interference Constraints Marbach, Peter Eryilmaz, Atilla Ozdaglar, Asuman E. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Ozdaglar, Asuman E. Ozdaglar, Asuman E. We analyze asynchronous carrier sense multiple access (CSMA) policies for scheduling packet transmissions in multihop wireless networks subject to collisions under primary interference constraints. While the (asymptotic) achievable rate region of CSMA policies for single-hop networks has been well-known, their analysis for general multihop networks has been an open problem due to the complexity of complex interactions among coupled interference constraints. Our work resolves this problem for networks with primary interference constraints by introducing a novel fixed-point formulation that approximates the link service rates of CSMA policies. This formulation allows us to derive an explicit characterization of the achievable rate region of CSMA policies for a limiting regime of large networks with a small sensing period. Our analysis also reveals the rate at which CSMA achievable rate region approaches the asymptotic capacity region of such networks. Moreover, our approach enables the computation of approximate CSMA link transmission attempt probabilities to support any given arrival vector within the achievable rate region. As part of our analysis, we show that both of these approximations become (asymptotically) accurate for large networks with a small sensing period. Our numerical case studies further suggest that these approximations are accurate even for moderately sized networks. United States. Defense Threat Reduction Agency (Grant number HDTRA 1-08-1-0016) National Science Foundation (U.S.). (CAREER-CNS-0953515) National Science Foundation (U.S.). (CCF-0916664) 2012-09-13T14:21:26Z 2012-09-13T14:21:26Z 2011-05 2010-06 Article http://purl.org/eprint/type/JournalArticle 0018-9448 http://hdl.handle.net/1721.1/72681 Marbach, Peter, Atilla Eryilmaz, and Asu Ozdaglar. “Asynchronous CSMA Policies in Multihop Wireless Networks With Primary Interference Constraints.” IEEE Transactions on Information Theory 57.6 (2011): 3644–3676. https://orcid.org/0000-0002-1827-1285 en_US http://dx.doi.org/10.1109/tit.2011.2133130 IEEE Transactions on Information Theory Creative Commons Attribution-Noncommercial-Share Alike 3.0 http://creativecommons.org/licenses/by-nc-sa/3.0/ application/pdf Institute of Electrical and Electronics Engineers (IEEE) Other University Web Domain |
spellingShingle | Marbach, Peter Eryilmaz, Atilla Ozdaglar, Asuman E. Asynchronous CSMA Policies in Multihop Wireless Networks With Primary Interference Constraints |
title | Asynchronous CSMA Policies in Multihop Wireless Networks With Primary Interference Constraints |
title_full | Asynchronous CSMA Policies in Multihop Wireless Networks With Primary Interference Constraints |
title_fullStr | Asynchronous CSMA Policies in Multihop Wireless Networks With Primary Interference Constraints |
title_full_unstemmed | Asynchronous CSMA Policies in Multihop Wireless Networks With Primary Interference Constraints |
title_short | Asynchronous CSMA Policies in Multihop Wireless Networks With Primary Interference Constraints |
title_sort | asynchronous csma policies in multihop wireless networks with primary interference constraints |
url | http://hdl.handle.net/1721.1/72681 https://orcid.org/0000-0002-1827-1285 |
work_keys_str_mv | AT marbachpeter asynchronouscsmapoliciesinmultihopwirelessnetworkswithprimaryinterferenceconstraints AT eryilmazatilla asynchronouscsmapoliciesinmultihopwirelessnetworkswithprimaryinterferenceconstraints AT ozdaglarasumane asynchronouscsmapoliciesinmultihopwirelessnetworkswithprimaryinterferenceconstraints |