The feasibility of matchings in a wireless network

Authors:
Steven A. Borbash;Anthony Ephremides
Affiliations:
National Security Agency, Fort Meade, MD;Department of Electrical and Computer Engineering, University of Maryland, College Park, MD
Venue:
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Year:
2006

Citing 2
Cited 5

Matrix analysis

Matrix analysis
An algorithm for combined cell-site selection and power control to maximize cellular spread spectrum capacity

IEEE Journal on Selected Areas in Communications

Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs

ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Fast algorithms for joint power control and scheduling in wireless networks

IEEE Transactions on Wireless Communications
Efficiency of Wireless Networks: Approximation Algorithms for the Physical Interference Model

Foundations and Trends® in Networking
On optimal SINR-based scheduling in multihop wireless networks

IEEE/ACM Transactions on Networking (TON)
On the effect of self-interference cancelation in multihop wireless networks

EURASIP Journal on Wireless Communications and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of determining what links can be simultaneously activated in a wireless network such that a signal-to-interference-and-noise (SINR) constraint is satisfied at all receivers is considered. The term "feasible matching" is introduced to describe a set of (transmitter, receiver) pairs for which there exists some set of transmit powers which can simultaneously meet the SINR equirements at the receivers. Given disjoint equally sized sets of transmitters and receivers, it is shown that when the SINR requirement at the receivers is greater than 1, no more than one feasible matching between the transmitters and the receivers exists. Sufficient conditions are provided under which certain broad classes of matchings in a network are guaranteed to be feasible; for example all matchings involving k or fewer links. The application of these results to ad hoc wireless networks and to scheduling is discussed.