article

Maximizing throughput in wireless networks via gossiping

Authors:

Gil ZussmanAuthors Info & Claims

ACM SIGMETRICS Performance Evaluation Review, Volume 34, Issue 1

Pages 27 - 38

https://doi.org/10.1145/1140103.1140283

Published: 26 June 2006 Publication History

Abstract

A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed algorithms for networks in which a node can converse with at most a single neighbor at a time have been presented. These algorithms guarantee 50% of the maximum possible throughput. We present the first distributed scheduling framework that guarantees maximum throughput. It is based on a combination of a distributed matching algorithm and an algorithm that compares and merges successive matching solutions. The comparison can be done by a deterministic algorithm or by randomized gossip algorithms. In the latter case, the comparison may be inaccurate. Yet, we show that if the matching and gossip algorithms satisfy simple conditions related to their performance and to the inaccuracy of the comparison (respectively), the framework attains the desired throughput.It is shown that the complexities of our algorithms, that achieve nearly 100% throughput, are comparable to those of the algorithms that achieve 50% throughput. Finally, we discuss extensions to general interference models. Even for such models, the framework provides a simple distributed throughput optimal algorithm.

References

[1]

M. Bayati, D. Shah, and M. Sharma. Maximum weight matching via maxproduct algorithm. In Proc. IEEE ISIT'05, Sep. 2005.

[2]

D. Bertsekas and J. Tsitsiklis. Parallel and distributed computation: numerical methods. MIT/LIDS Tech. Report, 2003.

[3]

R. Bhatia, A. Segall, and G. Zussman. Analysis of bandwidth allocation algorithms for wireless personal area networks. To appear in ACM/Springer Wireless Networks (WINET), 12, 2006.

Digital Library

[4]

S. Boyd, A. Ghosh, B. Prabbakar, and D. Shah. Gossip algorithms: design, analysis and applications. In Proc. IEEE INFOCOM'05, March 2005.

[5]

P. Chaporkar, K. Kar, and S. Sarkar. Throughput guarantees through maximal scheduling in wireless networks. In Proc. 43rd Allerton Conf. on Commun., Control, and Comp., September 2005.

[6]

L. Chen, S. H. Low, M. Chiang, and J. C. Doyle. Optimal cross-layer congestion control, routing and scheduling design in ad hoc wireless networks. In Proc. IEEE INFOCOM'06, April 2006.

[7]

S. Deb, D. Shah, and S. Shakkottai. Fast incremental algorithm for repetitive optimization: an application to switch scheduling. In Proc. CISS, March 2006.

[8]

A. Dembo and O. Zeitouni. Large Deviations Techniques and Applications. 2nd edition, Springer, 1998.

[9]

P. Giaccone, B. Prabhakar, and D. Shah. Randomized scheduling algorithms for high-aggregate bandwidth switches. IEEE J. Sel. Areas Commun., 21(4):546--559, May 2003.

Digital Library

[10]

B. Hajek and G. Sasaki. Link scheduling in polynomial time. IEEE Trans. Inf. Theory, 34(5):910--917, September 1988.

Digital Library

[11]

J.-H. Hoepman. Simple distributed weighted matchings. eprint cs.DC/0410047, October 2004.

[12]

A. Israeli and A. Itai. A fast randomized parallel algorithm for maximal matching. Inform. Process. Lett., 22(2):77--80, January 1986.

Digital Library

[13]

K. Jain, J. Padhye, V. N. Padmanabhan, and L. Qiu. Impact of interference on multi-hop wireless network performance. ACM/Springer Wireless Networks, 11(4):471--487, July 2005.

Digital Library

[14]

K. M. Jung and D. Shah. Fast gossip via non-reversible random walk. In Proc. IEEE ITW'06, March 2006.

[15]

R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking. Randomized rumor spreading. In Proc. IEEE FOCS'00, November 2000.

Digital Library

[16]

E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, and Winston, New York, 1976.

[17]

X. Lin and N.B. Shroff. The impact of imperfect scheduling on cross-layer rate control in wireless networks. In Proc. IEEE INFOCOM'05, March 2005.

[18]

N. McKeown, V. Anantharam, and J. Walrand. Achieving 100% throughput in an input-queued switch. In Proc. IEEE INFOCOM'96, March 1996.

Digital Library

[19]

D. Mosk-Aoyama and D. Shah. Computing separable functions via gossip. Available at www.arxiv.org:cs.NI/0504029, Feb. 2006.

[20]

M. Neely, E. Modiano, and C. Rohrs. Dynamic power allocation and routing for time-varying wireless networks. IEEE J. Sel. Areas Commun., 23(1):89--103, January 2005.

Digital Library

[21]

D. Peleg, Distributed Computing: A Locality-Sensitive Approach. SIAM, 2000.

Digital Library

[22]

L. Tassiulas. Linear complexity algorithms for maximum throughput in radio networks and input queued switches. In Proc. IEEE INFOCOM'98, April 1998.

[23]

L. Tassiulas and A. Ephremides. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Autom. Control, 37(12):1936--1948, December 1992.

[24]

L. Tassiulas and S. Sarkar. Maxmin fair scheduling in wireless ad hoc networks. IEEE J. Sel. Areas Commun., 23(1):163--173, January 2005.

Digital Library

[25]

M. Wattenhofer and R. Wattenhofer. Distributed weighted matching. In Proc. DISC'04, LNCS 3221:335--348, Springer, October 2004.

[26]

X. Wu and R. Srikant. Regulated maximal matching: a distributed scheduling algorithm for multi-hop wireless networks with node-exclusive spectrum sharing. In Proc. IEEE CDC-ECC'05, December 2005.

[27]

G. Zussman and A. Segall. Capacity assignment in bluetooth scatternets - optimal and heuristic algorithms. ACM/Kluwer Mobile Networks and Applications (MONET), 9(1):49--61, February 2004.

Digital Library

Cited By

Bistritz IBambos N(2024)Power Is Knowledge: Distributed and Throughput Optimal Power Control in Wireless NetworksIEEE/ACM Transactions on Networking10.1109/TNET.2024.344460232:6(4722-4734)Online publication date: Dec-2024
https://doi.org/10.1109/TNET.2024.3444602
Nguyen QModiano E(2024)Linear-Time Scheduling for Time-Varying Wireless Networks via Randomization2024 60th Annual Allerton Conference on Communication, Control, and Computing10.1109/Allerton63246.2024.10735302(1-8)Online publication date: 24-Sep-2024
https://doi.org/10.1109/Allerton63246.2024.10735302
Liu BLiang QModiano E(2023)Tracking MaxWeight: Optimal Control for Partially Observable and Controllable NetworksIEEE/ACM Transactions on Networking10.1109/TNET.2022.322575231:4(1809-1821)Online publication date: Aug-2023
https://doi.org/10.1109/TNET.2022.3225752
Show More Cited By

Index Terms

Maximizing throughput in wireless networks via gossiping
1. Mathematics of computing
  1. Probability and statistics
    1. Probabilistic algorithms
    2. Probabilistic reasoning algorithms
      1. Markov-chain Monte Carlo methods
      2. Sequential Monte Carlo methods
2. Networks
  1. Network types
    1. Mobile networks
    2. Wireless access networks

Recommendations

Maximizing throughput in wireless networks via gossiping
SIGMETRICS '06/Performance '06: Proceedings of the joint international conference on Measurement and modeling of computer systems

A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed algorithms for networks in which a node can converse with at most a ...
Distributed throughput maximization in wireless mesh networks via pre-partitioning

This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multi-radio Wireless Mesh Networks (WMNs). Recently, a number of distributed scheduling algorithms for wireless networks have emerged. Due to ...
Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach
MobiCom '06: Proceedings of the 12th annual international conference on Mobile computing and networking

This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number of distributed scheduling algorithms for wireless networks have emerged. Due to ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review

ACM SIGMETRICS Performance Evaluation Review Volume 34, Issue 1

Performance evaluation review

June 2006

388 pages

ISSN:0163-5999

DOI:10.1145/1140103

Issue’s Table of Contents

SIGMETRICS '06/Performance '06: Proceedings of the joint international conference on Measurement and modeling of computer systems
June 2006
404 pages
ISBN:1595933190
DOI:10.1145/1140277
General Chair:
Raymond Marie
University of Rennes 1/IRISA, France
,
Program Chairs:
Peter Key
Microsoft Research, Cambridge, U.K.
,
Evgenia Smirni
College of William and Mary, USA

Copyright © 2006 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 June 2006

Published in SIGMETRICS Volume 34, Issue 1

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

250
Total Citations
View Citations
1,199
Total Downloads

Downloads (Last 12 months)28
Downloads (Last 6 weeks)1

Reflects downloads up to 03 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Bistritz IBambos N(2024)Power Is Knowledge: Distributed and Throughput Optimal Power Control in Wireless NetworksIEEE/ACM Transactions on Networking10.1109/TNET.2024.344460232:6(4722-4734)Online publication date: Dec-2024
https://doi.org/10.1109/TNET.2024.3444602
Nguyen QModiano E(2024)Linear-Time Scheduling for Time-Varying Wireless Networks via Randomization2024 60th Annual Allerton Conference on Communication, Control, and Computing10.1109/Allerton63246.2024.10735302(1-8)Online publication date: 24-Sep-2024
https://doi.org/10.1109/Allerton63246.2024.10735302
Liu BLiang QModiano E(2023)Tracking MaxWeight: Optimal Control for Partially Observable and Controllable NetworksIEEE/ACM Transactions on Networking10.1109/TNET.2022.322575231:4(1809-1821)Online publication date: Aug-2023
https://doi.org/10.1109/TNET.2022.3225752
Tsanikidis CGhaderi JChong SJoo CLee K(2022)Online scheduling and routing with end-to-end deadline constraints in multihop wireless networksProceedings of the Twenty-Third International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing10.1145/3492866.3549729(11-20)Online publication date: 3-Oct-2022
https://dl.acm.org/doi/10.1145/3492866.3549729
Altaweel AYang CStoleru RBhunia SSagor MMaurice MBlalock R(2022)RSockAd Hoc Networks10.1016/j.adhoc.2022.102926134:COnline publication date: 1-Sep-2022
https://dl.acm.org/doi/10.1016/j.adhoc.2022.102926
Jawad SAl-Ali MJasim A(2022)Adaptive CSMA scheduling algorithm for queuing delay enhancement and energy optimizationAd Hoc Networks10.1016/j.adhoc.2022.102908134:COnline publication date: 1-Sep-2022
https://dl.acm.org/doi/10.1016/j.adhoc.2022.102908
Fu LXu JQu SXu ZWang XChen G(2021)Seeking the Truth in a Decentralized MannerIEEE/ACM Transactions on Networking10.1109/TNET.2021.308500029:5(2296-2312)Online publication date: Oct-2021
https://doi.org/10.1109/TNET.2021.3085000
Li BLiu JJi B(2021)Low-Overhead Wireless Uplink Scheduling for Large-Scale Internet-of-ThingsIEEE Transactions on Mobile Computing10.1109/TMC.2019.294929120:2(577-587)Online publication date: 1-Feb-2021
https://dl.acm.org/doi/10.1109/TMC.2019.2949291
Mohan AGopalan AKumar A(2020)Reduced-State, Optimal Scheduling for Decentralized Medium Access Control of a Class of Wireless NetworksIEEE/ACM Transactions on Networking10.1109/TNET.2020.297692328:3(1017-1032)Online publication date: Jun-2020
https://doi.org/10.1109/TNET.2020.2976923
Choi JJoo C(2019)Optimal CSMA scheduling with dual access probability for wireless networksWireless Networks10.1007/s11276-018-1800-625:4(2101-2115)Online publication date: 1-May-2019
https://dl.acm.org/doi/10.1007/s11276-018-1800-6
Show More Cited By

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.

Media

Figures

Other

Tables

View Issue’s Table of Contents