short-paper

Equalizing throughputs in random-access networks

Authors:

P. M. van de Ven,

A. J.E.M. Janssen,

J. S.H. van LeeuwaardenAuthors Info & Claims

ACM SIGMETRICS Performance Evaluation Review, Volume 38, Issue 2

Pages 39 - 41

https://doi.org/10.1145/1870178.1870192

Published: 15 October 2010 Publication History

Abstract

Random-access algorithms such as CSMA provide a popular mechanism for distributed medium access control in largescale wireless networks. In recent years, tractable models have been shown to yield accurate throughput estimates for CSMA networks. We consider the saturated model on a general conflict graph, and prove that for each graph, there exists a vector of activation rates (or mean back-off times) that leads to equal throughputs for all users. We describe an algorithm for computing such activation rates, and discuss a few specific conflict graphs that allow for explicit characterization of these fair activation rates.

References

[1]

R.R. Boorstyn, A. Kershenbaum (1980). Throughput analysis of multihop packet radio. In: Proc. ICC, 1361--1366.

[2]

R.R. Boorstyn, A. Kershenbaum, B. Maglaris, V. Sahin (1987). Throughput analysis in multihop CSMA packet radio networks. IEEE Trans. Commun. 35, 267--274.

[3]

M. Durvy, O. Dousse, P. Thiran (2007). Modeling the 802.11 protocol under different capture and sensing capabilities. In: Proc. Infocom 2007, Anchorage AK, May 6--12, 2356--2360.

Digital Library

[4]

M. Durvy, O. Dousse, P. Thiran (2009). On the fairness of large CSMA networks. IEEE J. Sel. Areas Commun. 27 (7), 1093--1104.

Digital Library

[5]

M. Durvy, P. Thiran (2006). A packing approach to compare slotted and non-slotted medium access control. In: Proc. Infocom 2006, Barcelona, Spain.

[6]

L. Jiang, D. Shah, J. Shin, J. Walrand (2010). Distributed random access algorithm: scheduling and congestion control. IEEE Trans. Inform. Theory, to appear.

Digital Library

[7]

L. Jiang, J. Walrand (2010). A distributed CSMA algorithm for throughput and utility maximization in wireless networks. IEEE/ACM Trans. Netw., 18(3), 960--972.

Digital Library

[8]

L. Jiang, J. Walrand (2008). A distributed algorithm for optimal throughput and fairness in wireless networks with a general interference model. Preprint.

[9]

F.P. Kelly (1979). Reversibility and Stochastic Networks. Wiley, Chichester.

[10]

F.P. Kelly (1985). Stochastic models of computer communication systems. J. Roy. Stat. Soc. B 47 (3), 379--395.

[11]

F.P. Kelly (1991). Loss networks. Ann. Appl. Prob. 1 (3), 319--378.

[12]

A. Kershenbaum, R.R. Boorstyn, M. Chen (1987). An algorithm for evaluation of throughput in multihop packet radio networks with complex topologies. IEEE J. Sel. Areas Commun. 5 (6), 1003--1012.

Digital Library

[13]

J. Liu, Y. Yi, A. Prouti'ere, M. Chiang, H.V. Poor (2008). Maximizing utility via random access without message passing. Technical report MSR-TR-2008--128, Microsoft Research.

[14]

S. Rajagopalan, D. Shah, J. Shin (2009). Network adiabatic theorem: an efficient randomized protocol for content resolution. In: Proc. ACM SIGMETRICS/Performance 2009, Seattle WA, June 15--19, 133--144.

Digital Library

[15]

Y. Suhov, U.A. Rozikov (2004). A hard-core model on a Cayley tree: An example of a loss network. Queueing Systems 46 (1--2), 197--212.

Digital Library

[16]

P.M. van de Ven, J.S.H. van Leeuwaarden, D. Denteneer, A.J.E.M. Janssen (2009). Spatial fairness in wireless multi-access networks. In: Proc. ValueTools 2009, Pisa, October 20--22.

Digital Library

[17]

P.M. van de Ven, J.S.H. van Leeuwaarden, S.C. Borst, A. Proutière (2010). Insensitivity and stability of random-access networks. To appear in: Proc. Performance 2010, Namur, November 15--19.

[18]

X. Wang, K. Kar (2005). Throughput modeling and fairness issues in CSMA/CA based ad-hoc networks. In: Proc. Infocom 2005, Miami FL, March 13--17.

[19]

S. Zachary, I. Ziedins (1999). Loss networks and Markov random fields. J. Appl. Prob. 36 (2), 403--414.

Cited By

Tanaka TPrabh S(2023)Clustered Mean-Field Hard-Core Model with Non-Homogeneous Clusters2023 21st International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)10.23919/WiOpt58741.2023.10349902(239-246)Online publication date: 24-Aug-2023
https://doi.org/10.23919/WiOpt58741.2023.10349902
Tanaka TPrabh SLiu Y(2016)Throughput equalization in mean-field hard-core models for CSMA-based wireless networks2016 14th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)10.1109/WIOPT.2016.7492939(1-8)Online publication date: May-2016
https://doi.org/10.1109/WIOPT.2016.7492939
Talpur MLiu WWang G(2014)A ZigBee-based elderly health monitoring systemInternational Journal of Autonomous and Adaptive Communications Systems10.1504/IJAACS.2014.0672437:4(393-411)Online publication date: 1-Feb-2014
https://dl.acm.org/doi/10.1504/IJAACS.2014.067243
Show More Cited By

Recommendations

Achieving target throughputs in random-access networks

Random-access algorithms such as CSMA provide a popular mechanism for distributed medium access control in large-scale wireless networks. In recent years, tractable stochastic models have been shown to yield accurate throughput estimates for CSMA ...
Cross-layer design of random access wireless networks
Spatial fairness in linear random-access networks

Random-access networks may exhibit severe unfairness in throughput, in the sense that some nodes receive consistently higher throughput than others. Recent studies show that this unfairness is due to local differences in the neighborhood structure: ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review

ACM SIGMETRICS Performance Evaluation Review Volume 38, Issue 2

September 2010

55 pages

ISSN:0163-5999

DOI:10.1145/1870178

Issue’s Table of Contents

Copyright © 2010 Authors.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 October 2010

Published in SIGMETRICS Volume 38, Issue 2

Check for updates

Qualifiers

Short-paper

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
95
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Tanaka TPrabh S(2023)Clustered Mean-Field Hard-Core Model with Non-Homogeneous Clusters2023 21st International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)10.23919/WiOpt58741.2023.10349902(239-246)Online publication date: 24-Aug-2023
https://doi.org/10.23919/WiOpt58741.2023.10349902
Tanaka TPrabh SLiu Y(2016)Throughput equalization in mean-field hard-core models for CSMA-based wireless networks2016 14th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)10.1109/WIOPT.2016.7492939(1-8)Online publication date: May-2016
https://doi.org/10.1109/WIOPT.2016.7492939
Talpur MLiu WWang G(2014)A ZigBee-based elderly health monitoring systemInternational Journal of Autonomous and Adaptive Communications Systems10.1504/IJAACS.2014.0672437:4(393-411)Online publication date: 1-Feb-2014
https://dl.acm.org/doi/10.1504/IJAACS.2014.067243
Kim YBaccelli Fde Veciana G(2014)Spatial Reuse and Fairness of Ad Hoc Networks With Channel-Aware CSMA ProtocolsIEEE Transactions on Information Theory10.1109/TIT.2014.232090960:7(4139-4157)Online publication date: Jul-2014
https://doi.org/10.1109/TIT.2014.2320909
Koseoglu MKarasan EAlanyali M(2012)Effect of network density and size on the short-term fairness performance of CSMA systemsEURASIP Journal on Wireless Communications and Networking10.1186/1687-1499-2012-3672012:1Online publication date: 23-Dec-2012
https://doi.org/10.1186/1687-1499-2012-367
Bouman NBorst Svan Leeuwaarden JProutiere AKalmanek CMedhi D(2011)Backlog-based random access in wireless networksProceedings of the 23rd International Teletraffic Congress10.5555/2043468.2043476(39-46)Online publication date: 6-Sep-2011
https://dl.acm.org/doi/10.5555/2043468.2043476
van de Ven PJanssen Avan Leeuwaarden JBorst S(2011)Achieving target throughputs in random-access networksPerformance Evaluation10.1016/j.peva.2011.07.01968:11(1103-1117)Online publication date: 1-Nov-2011
https://dl.acm.org/doi/10.1016/j.peva.2011.07.019

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents