Some complexity results about packet radio networks (Corresp.)

Authors:
E. Arikan
Affiliations:
-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 7

Performance evaluation of scheduling in IEEE 802.16 based wireless mesh networks

Computer Communications
MAC protocols over wireless mesh networks: problems and perspective

Journal of Parallel and Distributed Computing
Capacity bounds of deployment concepts for Wireless Mesh Networks

Performance Evaluation
Throughput-oriented channel assignment for opportunistic spectrum access networks

Mathematical and Computer Modelling: An International Journal
Minimizing multiplayer interactive delay in multihop wireless networks

International Journal of Communication Systems
A novel scheduling algorithm for physical-layer network coding under Markov model in wireless multi-hop network

Computers and Electrical Engineering
Optimization Decomposition for Scheduling and System Configuration in Wireless Networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	754.84

Visualization

Abstract

It is shown that the decision problem regarding the membership of a point in the capacity region of a packet radio network is nondeterministic polynomial time hard (NP hard). The capacity region is the set of all feasible origin-to-destination message rates where feasibility is defined as the existence of any set of rules for moving the data through the network so that the desired rates are satisfied.