On the complexity of bandwidth allocation in radio networks
Theoretical Computer Science
Throughput and QoS optimization in nonuniform multichannel wireless mesh networks
Proceedings of the 4th ACM symposium on QoS and security for wireless and mobile networks
A refined performance characterization of longest-queue-first policy in wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Performance of random access scheduling schemes in multi-hop wireless networks
IEEE/ACM Transactions on Networking (TON)
Practical scheduling schemes with throughput guarantees for multi-hop wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Joint congestion control and distributed scheduling for throughput guarantees in wireless networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Randomized algorithms for cross-layer network control
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
On the complexity of scheduling in wireless networks
EURASIP Journal on Wireless Communications and Networking - Special issue on adaptive cross-layer strategies for fourth generation wireless communications
Two sides approximation algorithms for channel assignments in wireless network
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
A refined performance characterization of longest-queue-first policy in wireless networks
IEEE/ACM Transactions on Networking (TON)
Adaptive instantiation of the protocol interference model in wireless networked sensing and control
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.00 |
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.