DocumentCode
939056
Title
Some complexity results about packet radio networks (Corresp.)
Author
Arikan, Erdal
Volume
30
Issue
4
fYear
1984
fDate
7/1/1984 12:00:00 AM
Firstpage
681
Lastpage
685
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.
Keywords
Packet radio; Radio communication; TDMA (time-division multiple-access); Time-division multiple-access; Filtering; Kalman filters; Microcomputers; Nonlinear equations; Packet radio networks; Passive filters; Random processes; Statistics; Stochastic processes; Target tracking;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1984.1056928
Filename
1056928
Link To Document