Some Complexity Results About Packet Radio Networks
Reads0
Chats0
TLDR
In this paper, it is shown that the decision problem regarding the membership of a given point in the capacity region of a packet radio network (PRN) is NP-complete.Abstract:
: It is shown that the decision problem regarding the membership of a given point in the capacity region of a packet radio network (PRN) is NP- complete. The capacity region is the set of all feasible sets of average origin- to-destination traffic rates, where the feasibility is defined as the existence of any set of rules (deterministic or non-deterministic) for moving the data through the network so that the desired rates are satisfied. The analysis includes a linear programming formulation of TDMA (time-division-multi-access) schemes for PRNs and NP-completeness results for some other related problems. Implicit in the analysis is the optimality of TDMA schemes in terms of achieving a given set of link traffic rates.read more
Citations
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
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
TL;DR: The stability of a queuing network with interdependent servers is considered, and the problem of scheduling server activation under the constraints imposed by the dependency among them is studied.
Journal ArticleDOI
Link scheduling in polynomial time
Bruce Hajek,Galen Sasaki +1 more
TL;DR: Two polynomial-time algorithms are given for scheduling conversations in a spread spectrum radio network that jointly meet a prespecified end-to-end demand and has the smallest possible length.
Journal ArticleDOI
Scheduling algorithms for multihop radio networks
TL;DR: Results show that the new algorithms for transmission scheduling in multihop broadcast radio networks perform consistently better than earlier methods, both theoretically and experimentally.
Journal ArticleDOI
Scheduling broadcasts in multihop radio networks
Anthony Ephremides,T. V. Truong +1 more
TL;DR: In this article, a comprehensive study of the problem of scheduling broadcast transmissions in a multihop, mobile packet radio network is provided that is based on throughput optimization subject to freedom from interference.