research-article

Joint selection and transmission scheduling of point-to-point communication requests in multi-channel wireless networks

Author:

Peng-Jun WanAuthors Info & Claims

MobiHoc '16: Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing

Pages 231 - 240

https://doi.org/10.1145/2942358.2942378

Published: 05 July 2016 Publication History

Abstract

Consider a set of point-to-point communication requests in a multi-channel multihop wireless network, each of which is associated with a traffic demand of at most one unit of transmission time, and a weight representing the utility if its demand is fully met. A subset of them is said to be feasible if they can be scheduled within one unit of time. The problem Maximum-Weighted Feasible Set (MWFS) seeks a feasible subset with maximum total weight together with a transmission schedule of them whose length is at most one unit of time. This paper develops efficient and provably good approximation algorithms for the problem MWFS.

References

[1]

K. Akcoglu, J. Aspnes, B. DasGupta, and M-Y. Kao, Opportunity Cost Algorithms for Combinatorial Auctions, Applied Optimization 74: Computational Methods in Decision-Making, Economics and Finance, 455--479, 2002.

[2]

M. Alicherry, R. Bhatia, and L. E. Li. Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks. IEEE JSAC 24(11):1960--1971, 2006. Also appeared in Proc. of ACM MobiCom 2005.

Digital Library

[3]

A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor and B. Schieber, A Unified Approach to Approximating Resource Allocation And Scheduling, Journal of ACM 48(5): 1069--1090, 2001.

Digital Library

[4]

A. Bar-Noy, S. Guha, J. Naor, and B. Schieber, Approximating The Throughput of Multiple Machines In Real-Time Scheduling, SIAM Journal on Computing 31(2): 331--352, 2001.

Digital Library

[5]

R. Bar-Yehuda and D. Rawttz, On The Equivalence between The Primal-Dual Schema And The Local Ratio Technique, SIAM J. Disc. Math. 19: 762--797, 2005.

Digital Library

[6]

R. Bar-Yehuda and D. Rawttz, Using Fractional Primal-Dual to Schedule Split Intervals with Demands, Journal Discrete Optimization 3(4): 275--287, 2006.

Digital Library

[7]

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.

Digital Library

[8]

B. Han, V. S. A. Kumar, M. V. Marathe, S. Parthasarathy, and A. Srinivasan, Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks, Proc. IEEE INFOCOM 2009, pp. 1521--1529.

[9]

C. Joo, X. Lin, and N. B. Shroff, Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-hop Wireless Networks, Proc. IEEE INFOCOM 2008.

[10]

M. Kodialam and T. Nandagopal, Characterizing The Capacity Region in Multi-Radio Multi-Channel Wireless Mesh Networks, Proc. ACM MobiCom 2005.

Digital Library

[11]

P.-J. Wan, Multiflows in Multihop Wireless Networks, Proc. ACM MOBIHOC 2009, pp. 85--94.

Digital Library

[12]

P.-J. Wan, X. Jia, G. Dai, H. Du, Z. G. Wan, and O. Frieder, Scalable Algorithms for Wireless Link Schedulings in Multi-Channel Multi-Radio Wireless Networks, Proc. IEEE INFOCOM 2013.

[13]

P.-J. Wan, X. Jia, G. Dai, H. Du, and O. Frieder, Fast And Simple Approximation Algorithms for Maximum Weighted Independent Set of Links, Proc. IEEE INFOCOM 2014: 1653--1661.

[14]

P.-J. Wan, C. Ma, Z. Wang, B. Xu, M. Li, and X. Jia, Weighted Wireless Link Scheduling without Information of Positions And Interference/Communication Radii, Proc. IEEE INFOCOM 2011.

[15]

Y. Ye and A. Borodin, Elimination graphs, ACM Transactions on Algorithms 8(2):14:1--14:23, 2012.

Digital Library

Cited By

Zamir NHou IPapavassiliou SSchmid S(2024)Deep Index Policy for Multi-Resource Restless Matching Bandit and Its Application in Multi-Channel SchedulingProceedings of the Twenty-fifth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing10.1145/3641512.3686381(71-80)Online publication date: 14-Oct-2024
https://dl.acm.org/doi/10.1145/3641512.3686381
Halldorsson MTonoyan T(2019)Link Scheduling under Correlated Shadowing2019 International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT)10.23919/WiOPT47501.2019.9144134(1-8)Online publication date: Jun-2019
https://doi.org/10.23919/WiOPT47501.2019.9144134
Halldórsson MWattenhofer R(2019)Wireless Network AlgorithmicsComputing and Software Science10.1007/978-3-319-91908-9_9(141-160)Online publication date: 2019
https://doi.org/10.1007/978-3-319-91908-9_9
Show More Cited By

Index Terms

Joint selection and transmission scheduling of point-to-point communication requests in multi-channel wireless networks
1. Networks
  1. Network algorithms
2. Theory of computation
  1. Design and analysis of algorithms
    1. Online algorithms
      1. Online learning algorithms
        Scheduling algorithms

Recommendations

Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks
MobiCom '05: Proceedings of the 11th annual international conference on Mobile computing and networking

Multi-hop infrastructure wireless mesh networks offer increased reliability, coverage and reduced equipment costs over their single-hop counterpart, wireless LANs. Equipping wireless routers with multiple radios further improves the capacity by ...
Joint multi-radio multi-channel assignment, scheduling, and routing in wireless mesh networks

The IEEE 802.11 DCF and EDCA mechanisms based on CSMA/CA are the most widely used random channel access mechanisms in wireless mesh networks (WMNs), but unfortunately these cannot effectively eliminate hidden terminal and exposed terminal problems in ...
Enhancing multi-hop communication over multi-radio multi-channel wireless mesh networks: A cross-layer approach

The multi-channel multi-radio technology represents a straightforward approach to expand the capacity of wireless mesh networks (WMNs) in broadband wireless access scenarios. However, the effective leveraging of this technology in WMNs requires (i) ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

MobiHoc '16: Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing

July 2016

421 pages

ISBN:9781450341844

DOI:10.1145/2942358

General Chairs:
Falko Dressler
Paderborn University
,
Friedhelm Meyer auf der Heide
Paderborn University

Copyright © 2016 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

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 July 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

MobiHoc'16

Sponsor:

MobiHoc'16: The Seventeenth ACM International Symposium on Mobile Ad Hoc Networking and Computing

July 5 - 8, 2016

Paderborn, Germany

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
227
Total Downloads

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

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zamir NHou IPapavassiliou SSchmid S(2024)Deep Index Policy for Multi-Resource Restless Matching Bandit and Its Application in Multi-Channel SchedulingProceedings of the Twenty-fifth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing10.1145/3641512.3686381(71-80)Online publication date: 14-Oct-2024
https://dl.acm.org/doi/10.1145/3641512.3686381
Halldorsson MTonoyan T(2019)Link Scheduling under Correlated Shadowing2019 International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT)10.23919/WiOPT47501.2019.9144134(1-8)Online publication date: Jun-2019
https://doi.org/10.23919/WiOPT47501.2019.9144134
Halldórsson MWattenhofer R(2019)Wireless Network AlgorithmicsComputing and Software Science10.1007/978-3-319-91908-9_9(141-160)Online publication date: 2019
https://doi.org/10.1007/978-3-319-91908-9_9
Wan PYuan HWang JRen JZhang Y(2018)Joint Selection and Scheduling of Communication Requests in Multi-Channel Wireless Networks under SINR ModelIEEE INFOCOM 2018 - IEEE Conference on Computer Communications10.1109/INFOCOM.2018.8486389(2312-2320)Online publication date: Apr-2018
https://doi.org/10.1109/INFOCOM.2018.8486389
Halldórsson MTonoyan T(2017)Wireless Link Capacity under Shadowing and FadingProceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing10.1145/3084041.3084068(1-10)Online publication date: 10-Jul-2017
https://dl.acm.org/doi/10.1145/3084041.3084068
Wan PAl-dhelaan FYuan HJi S(2017)Fractional wireless link scheduling and polynomial approximate capacity regions of wireless networksIEEE INFOCOM 2017 - IEEE Conference on Computer Communications10.1109/INFOCOM.2017.8057156(1-9)Online publication date: May-2017
https://doi.org/10.1109/INFOCOM.2017.8057156
Wan PYuan HJia XWang JWang Z(2017)Maximum-weighted subset of communication requests schedulable without spectral splittingIEEE INFOCOM 2017 - IEEE Conference on Computer Communications10.1109/INFOCOM.2017.8056982(1-9)Online publication date: May-2017
https://doi.org/10.1109/INFOCOM.2017.8056982

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