Article

Maximum Weighted Matching with Interference Constraints

Authors:

PERCOMW '06: Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops

Page 70

https://doi.org/10.1109/PERCOMW.2006.79

Published: 13 March 2006 Publication History

Publisher Site

Abstract

In this paper, we study the problem of utility maximization in multi-hop wireless systems. To study the effect of wireless interference constraints on the utility maximization problem, we introduce a new class of weighted matching problems, namely Maximum Weighted K-Valid Matching problems (MWKVMPs). For K = 1, MWKVMP corresponds to the well studied Maximum Weighted Matching problem (MWMP) in the literature, which can be solved in polynomial time. We prove several interesting results concerning the hardness of these problems for K = 2. In particular, we show that MWKVMP does not even belong to APX; where APX denotes the class of problems to which a constant factor approximation can be obtained in polynomial time. Our results have strong implications concerning the hardness of scheduling transmissions in multi-hop wireless systems.

Cited By

View all

Ganesan A(2021)Performance analysis of a distributed algorithm for admission control in wireless networks under the 2-hop interference modelProceedings of the 22nd International Conference on Distributed Computing and Networking10.1145/3427796.3427806(96-105)Online publication date: 5-Jan-2021
https://dl.acm.org/doi/10.1145/3427796.3427806
Zhang HChe XLiu XJu X(2014)Adaptive instantiation of the protocol interference model in wireless networked sensing and controlACM Transactions on Sensor Networks10.1145/253028610:2(1-48)Online publication date: 31-Jan-2014
https://dl.acm.org/doi/10.1145/2530286
Huang CYe JFu B(2011)Two sides approximation algorithms for channel assignments in wireless networkProceedings of the 6th international conference on Wireless algorithms, systems, and applications10.5555/2033150.2033154(36-47)Online publication date: 11-Aug-2011
https://dl.acm.org/doi/10.5555/2033150.2033154
Show More Cited By

Index Terms

Maximum Weighted Matching with Interference Constraints
1. Mathematics of computing
  1. Discrete mathematics
    1. Combinatorics
      1. Combinatorial algorithms
    2. Graph theory
2. Networks
  1. Network protocols
    1. Network layer protocols
      1. Routing protocols
  2. Network types
    1. Mobile networks
    2. Wireless access networks

Recommendations

Weighted matching algorithms
The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization
Special issue: Efficient algorithms

The maximum intersection problem for a matroid and a greedoid, given by polynomial-time oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunctive normal form as such an intersection. The corresponding approximation ...
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree

Given a simple, undirected graph G =( V , E ) and a weight function w : E ⁺, we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all vertices is minimized. It has previously been shown that the ...

Comments

Information & Contributors

Information

Published In

PERCOMW '06: Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops

March 2006

ISBN:0769525202

Publisher

IEEE Computer Society

United States

Publication History

Published: 13 March 2006

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 21 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ganesan A(2021)Performance analysis of a distributed algorithm for admission control in wireless networks under the 2-hop interference modelProceedings of the 22nd International Conference on Distributed Computing and Networking10.1145/3427796.3427806(96-105)Online publication date: 5-Jan-2021
https://dl.acm.org/doi/10.1145/3427796.3427806
Zhang HChe XLiu XJu X(2014)Adaptive instantiation of the protocol interference model in wireless networked sensing and controlACM Transactions on Sensor Networks10.1145/253028610:2(1-48)Online publication date: 31-Jan-2014
https://dl.acm.org/doi/10.1145/2530286
Huang CYe JFu B(2011)Two sides approximation algorithms for channel assignments in wireless networkProceedings of the 6th international conference on Wireless algorithms, systems, and applications10.5555/2033150.2033154(36-47)Online publication date: 11-Aug-2011
https://dl.acm.org/doi/10.5555/2033150.2033154
Joo CSharma GShroff NMazumdar R(2010)On the complexity of scheduling in wireless networksEURASIP Journal on Wireless Communications and Networking10.1155/2010/4189342010(1-13)Online publication date: 1-Feb-2010
https://dl.acm.org/doi/10.1155/2010/418934
Sharma GJoo CShroff NMazumdar R(2010)Joint congestion control and distributed scheduling for throughput guarantees in wireless networksACM Transactions on Modeling and Computer Simulation10.1145/1870085.187009021:1(1-25)Online publication date: 17-Dec-2010
https://dl.acm.org/doi/10.1145/1870085.1870090
Li BBoyaci CXia YKnightly EChiasserini CLin X(2009)A refined performance characterization of longest-queue-first policy in wireless networksProceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing10.1145/1530748.1530758(65-74)Online publication date: 18-May-2009
https://dl.acm.org/doi/10.1145/1530748.1530758
Joo CShroff N(2009)Performance of random access scheduling schemes in multi-hop wireless networksIEEE/ACM Transactions on Networking10.1109/TNET.2008.201085717:5(1481-1493)Online publication date: 1-Oct-2009
https://dl.acm.org/doi/10.1109/TNET.2008.2010857
Szymanski TZomaya ACesana M(2008)Throughput and QoS optimization in nonuniform multichannel wireless mesh networksProceedings of the 4th ACM symposium on QoS and security for wireless and mobile networks10.1145/1454586.1454589(9-19)Online publication date: 27-Oct-2008
https://dl.acm.org/doi/10.1145/1454586.1454589
Sharma GShroff NMazumdar R(2007)Joint Congestion Control and Distributed Scheduling for Throughput Guarantees in Wireless NetworksProceedings of the IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications10.1109/INFCOM.2007.240(2072-2080)Online publication date: 1-May-2007
https://dl.acm.org/doi/10.1109/INFCOM.2007.240
Changhee Joo Shroff N(2007)Performance of Random Access Scheduling Schemes in Multi-Hop Wireless NetworksProceedings of the IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications10.1109/INFCOM.2007.11(19-27)Online publication date: 1-May-2007
https://dl.acm.org/doi/10.1109/INFCOM.2007.11

Abstract

Cited By

Index Terms

Recommendations

Weighted matching algorithms

The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization

Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations