research-article

Longest-queue-first scheduling under SINR interference model

Authors:

Ness B. ShroffAuthors Info & Claims

MobiHoc '10: Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing

Pages 41 - 50

https://doi.org/10.1145/1860093.1860100

Published: 20 September 2010 Publication History

Abstract

We investigate the performance of longest-queue-first (LQF) scheduling (i.e., greedy maximal scheduling) for wireless networks under the SINR interference model. This interference model takes network geometry and the cumulative interference effect into account, which, therefore, capture the wireless interference more precisely than binary interference models. By employing the ρ-local pooling technique, we show that LQF scheduling achieves zero throughput in the worst case. We then propose a novel technique to localize interference which enables us to decentralize the LQF scheduling while preventing it from having vanishing throughput in all network topologies. We characterize the maximum throughput region under interference localization and present a distributed LQF scheduling algorithm. Finally, we present numerical results to illustrate the usefulness and to validate the theory developed in the paper.

References

[1]

}}S. A. Borbash and A. Ephremides. Wireless Link Scheduling With Power Control and SINR Constraints. IEEE Trans. Inf. Theory, 52(11):5106--5111, November 2006.

Digital Library

[2]

}}A. Brzezinski, G. Zussman, and E. Modiano. Distributed Throughput Maximization in Wireless Mesh Networks via Pre-Partitioning. IEEE/ACM Trans. Netw., 16(6):1406--1419, December 2008.

Digital Library

[3]

}}P. Chaporkar, K. Kar, and S. Sarkar. Throughput Guarantees Through Maximal Scheduling in Wireless Networks. IEEE Trans. Inf. Theory, 54(2):572--594, February 2008.

Digital Library

[4]

}}R. L. Cruz and A. V. Santhanam. Optimal Routing, Link Scheduling, and Power Control in Multi-hop Wireless Networks. In IEEE INFOCOM, April 2003.

[5]

}}A. Dimakis and J. Walrand. Sufficient Conditions for Stability of Longest-Queue-First Scheduling: Second-order Properties using Fluid Limits. Advances in Applied Probability, 38(2):505--521, 2006.

[6]

}}P. Gupta and P. R. Kumar. The Capacity of Wireless Networks. IEEE Trans. Inf. Theory, 46(2):388--404, March 2000.

Digital Library

[7]

}}C. Joo, X. Lin, and N. B. Shroff. Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-hop Wireless Networks. IEEE/ACM Trans. Netw., 17(4):1132--1145, August 2009.

Digital Library

[8]

}}C. Joo and N. B. Shroff. Performance of Random Access Scheduling Schemes in Multi-hop Wireless Networks. IEEE/ACM Trans. Netw., 17(5), October 2009.

Digital Library

[9]

}}L. B. Le, E. Modiano, and N. B. Shroff. Optimal Control of Wireless Networks with Finite Buffers. In IEEE INFOCOM, March 2010.

Digital Library

[10]

}}M. Leconte, J. Ni, and R. Srikant. Improved Bounds on the Throughput Efficiency of Greedy Maximal Scheduling in Wireless Networks. In ACM MOBIHOC, pages 165--174, New York, NY, USA, 2009.

Digital Library

[11]

}}H.-W. Lee, E. Modiano, and L. B. Le. Distributed Throughput Maximization in Wireless Networks via Random Power Allocation. In WiOpt, 2009.

Digital Library

[12]

}}B. Li, C. Boyaci, and Y. Xia. A Refined Performance Characterization of Longest-queue-first Policy in Wireless Networks. In ACM MOBIHOC, pages 65--74, New York, NY, USA, 2009.

Digital Library

[13]

}}X. Lin and N. B. Shroff. The Impact of Imperfect Scheduling on Cross-Layer Congestion Control in Wireless Networks. IEEE/ACM Trans. Netw., 14(2):302--315, April 2006.

Digital Library

[14]

}}E. Modiano, D. Shah, and G. Zussman. Maximizing Throughput in Wireless Networks via Gossiping. Sigmetrics Performance Evaluation Review, 34(1):27--38, 2006.

Digital Library

[15]

}}M. J. Neely, E. Modiano, and L. Chih-Ping. Fairness and Optimal Stochastic Control for Heterogeneous Networks. IEEE/ACM Trans. Netw., 16(2), April 2008.

Digital Library

[16]

}}G. Sharma, N. B. Shroff, and R. R. Mazumdar. On the Complexity of Scheduling in Wireless Networks. In ACM MOBICOM, September 2006.

Digital Library

[17]

}}L. Tassiulas and A. Ephremides. Stability Properties of Constrained Queueing Systems and Scheduling Policies for Maximal Throughput in Multihop Radio Networks. IEEE Trans. Autom. Control, 37(12):1936--1948, December 1992.

[18]

}}P. J. Wan. Multiflows in Multihop Wirelress Networks. In ACM MOBIHOC, 2009.

Digital Library

[19]

}}G. Zussman, A. Brzezinski, and E. Modiano. Multihop Local Pooling for Distributed Throughput Maximization in Wireless Networks. In IEEE INFOCOM, April 2008.

Cited By

Kim YChoi PLim JKwak J(2023)Network-Compute Co-Optimization for Service Chaining in Cloud-Edge-Radio 5G NetworksIEEE Transactions on Vehicular Technology10.1109/TVT.2023.327169372:10(13374-13391)Online publication date: Oct-2023
https://doi.org/10.1109/TVT.2023.3271693
Zhong XJiang ZChen FZhu XTao M(2023)Throughput Analysis on Slotted Underwater Acoustic Sensor Networks With Guard TimeIEEE Sensors Journal10.1109/JSEN.2022.323278823:3(3313-3320)Online publication date: 1-Feb-2023
https://doi.org/10.1109/JSEN.2022.3232788
Kim YJeong JAhn SKwak JChong S(2022)Energy and Delay Guaranteed Joint Beam and User Scheduling Policy in 5G CoMP NetworksIEEE Transactions on Wireless Communications10.1109/TWC.2021.311516221:4(2742-2756)Online publication date: Apr-2022
https://doi.org/10.1109/TWC.2021.3115162
Show More Cited By

Index Terms

Longest-queue-first scheduling under SINR interference model

Recommendations

Stability of longest-queue-first scheduling in linear wireless networks with multihop traffic and one-hop interference

We consider the stability of the longest-queue-first (LQF) scheduling policy in wireless networks with multihop traffic under the one-hop interference model. Although it is well known that the back-pressure algorithm achieves the maximal stability, its ...
Distributed SINR based scheduling algorithm for multi-hop wireless networks
MSWIM '10: Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems

The problem of developing high-performance distributed scheduling algorithms for multi-hop wireless networks has seen enormous interest in recent years. The problem is especially challenging when studied under a physical interference model, which ...
Stability analyses of longest-queue-first link scheduling in MC-MR wireless networks
MobiHoc '12: Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing

Longest-queue-first (LQF) link scheduling is a greedy link scheduling in multihop wireless networks. Its stability performance in single-channel single-radio (SC-SR) wireless networks has been well studied recently. However, its stability performance in ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

MobiHoc '10: Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing

September 2010

272 pages

ISBN:9781450301831

DOI:10.1145/1860093

General Chair:
Nitin Vaidya
University of Illinois at Urbana-Champaign, USA
,
Program Chairs:
Christoph Lindemann
Universität Leipzig
,
Jitendra Padhye
Microsoft Research

Copyright © 2010 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]

Sponsors

SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 September 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

MobiCom/MobiHoc '10

Sponsor:

SIGMOBILE

MobiCom/MobiHoc '10: The 16th Annual International Conference on Mobile Computing and Networking and The 11th ACM International Symposium on Mobile Ad Hoc Networking and Computing

September 20 - 24, 2010

Illinois, Chicago, USA

Acceptance Rates

Overall Acceptance Rate 296 of 1,843 submissions, 16%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

53
Total Citations
View Citations
463
Total Downloads

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

Reflects downloads up to 12 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Kim YChoi PLim JKwak J(2023)Network-Compute Co-Optimization for Service Chaining in Cloud-Edge-Radio 5G NetworksIEEE Transactions on Vehicular Technology10.1109/TVT.2023.327169372:10(13374-13391)Online publication date: Oct-2023
https://doi.org/10.1109/TVT.2023.3271693
Zhong XJiang ZChen FZhu XTao M(2023)Throughput Analysis on Slotted Underwater Acoustic Sensor Networks With Guard TimeIEEE Sensors Journal10.1109/JSEN.2022.323278823:3(3313-3320)Online publication date: 1-Feb-2023
https://doi.org/10.1109/JSEN.2022.3232788
Kim YJeong JAhn SKwak JChong S(2022)Energy and Delay Guaranteed Joint Beam and User Scheduling Policy in 5G CoMP NetworksIEEE Transactions on Wireless Communications10.1109/TWC.2021.311516221:4(2742-2756)Online publication date: Apr-2022
https://doi.org/10.1109/TWC.2021.3115162
Ghosh NBanerjee I(2022)Energy-Efficient Compressive Sensing Based Data Gathering and Scheduling in Wireless Sensor NetworksWireless Personal Communications10.1007/s11277-022-10061-0128:4(2589-2618)Online publication date: 19-Oct-2022
https://doi.org/10.1007/s11277-022-10061-0
Yu KYu JCheng XYu DDong A(2021)Efficient Link Scheduling Solutions for the Internet of Things Under Rayleigh FadingIEEE/ACM Transactions on Networking10.1109/TNET.2021.309330629:6(2508-2521)Online publication date: Dec-2021
https://doi.org/10.1109/TNET.2021.3093306
Yu KYu JDong ALi G(2020)Distributed Shortest Link Scheduling Algorithms With Constant Time Complexity in IoT Under Rayleigh FadingIEEE Access10.1109/ACCESS.2020.29915158(103245-103255)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.2991515
Atar RKeslassy IMendelson G(2019)Subdiffusive Load Balancing in Time-Varying Queueing SystemsOperations Research10.1287/opre.2019.185167:6(1678-1698)Online publication date: 1-Nov-2019
https://dl.acm.org/doi/10.1287/opre.2019.1851
Liu LCheng YCao XZhou SNiu ZWang P(2019)Joint Optimization of Scheduling and Power Control in Wireless Networks: Multi-Dimensional Modeling and DecompositionIEEE Transactions on Mobile Computing10.1109/TMC.2018.286185918:7(1585-1600)Online publication date: 1-Jul-2019
https://doi.org/10.1109/TMC.2018.2861859
Banday YRather GBegh G(2019)SINR Analysis and Interference Management of Macrocell Cellular Networks in Dense Urban EnvironmentsWireless Personal Communications10.1007/s11277-019-06947-1Online publication date: 30-Nov-2019
https://doi.org/10.1007/s11277-019-06947-1
Shokri-Ghadikolaei HFischione CModiano E(2018)Interference Model Similarity Index and Its Applications to Millimeter-Wave NetworksIEEE Transactions on Wireless Communications10.1109/TWC.2017.276266717:1(71-85)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.1109/TWC.2017.2762667
Show More Cited By

View Options

Get Access

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 Table of Contents