Proceedings ArticleDOI
A maximum dispersion approach for rate feasibility problems in SINR model
Shashi Prabh
- pp 1-8
TLDR
This paper proposes a maximum dispersion based approach for the problem of determining the feasibility of a set of single-hop rates in SINR model and confirms that such an approach performs significantly better than the existing work.Abstract:
In this paper, we propose a maximum dispersion based approach for the problem of determining the feasibility of a set of single-hop rates in SINR model. Recent algorithmic work on capacity maximization has focused on maximizing the number of simultaneously scheduled links. We show that such an approach is not suitable for the problem. We present a polynomial time algorithm to determine the feasibility. We present several simulation results to evaluate the proposed approach. The results confirm that maximum dispersion-based approach is well suited for the problem and that such an approach performs significantly better than the existing work.read more
References
More filters
Journal ArticleDOI
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
TL;DR: The stability of a queueing network with interdependent servers is considered and a policy is obtained which is optimal in the sense that its Stability Region is a superset of the stability region of every other scheduling policy, and this stability region is characterized.
Proceedings ArticleDOI
Complexity in geometric SINR
TL;DR: The first NP-completeness proofs in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane, are presented, which proves two problems to be NP-complete: Scheduling and One-Shot Scheduling.
Proceedings ArticleDOI
Topology control meets SINR: the scheduling complexity of arbitrary topologies
TL;DR: This paper defines and study a generalized version of the SINR model and obtains theoretical upper bounds on the scheduling complexity of arbitrary topologies in wireless networks, and proves that even in worst-case networks, if the signals are transmitted with correctly assigned transmission power levels, the number of time slots required to successfully schedule all links of an arbitrary topology is proportional to the squared logarithm.
Journal ArticleDOI
Heuristic and special case algorithms for dispersion problems
TL;DR: This work shows that if the distances do not satisfy the triangle inequality, there is no polynomial-time relative approximation algorithm unless P = NP and proves that obtaining a performance guarantee of less than two is NP-hard.
Proceedings ArticleDOI
Maximizing Capacity in Arbitrary Wireless Networks in the SINR Model: Complexity and Game Theory
Matthew Andrews,Michael Dinitz +1 more
TL;DR: It is shown that maximizing the number of supported connections is NP-hard, even when there is no background noise, in contrast to the problem of determining whether or not a given set of connections is feasible since that problem can be solved via linear programming.