research-article

Some complexity results about packet radio networks (Corresp.)

Author:

E. ArikanAuthors Info & Claims

IEEE Transactions on Information Theory, Volume 30, Issue 4

Pages 681 - 685

https://doi.org/10.1109/TIT.1984.1056928

Published: 01 September 2006 Publication History

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.

Cited By

View all

He QYuan DEphremides A(2021)A general optimality condition of link scheduling for emptying a wireless network2016 IEEE International Symposium on Information Theory (ISIT)10.1109/ISIT.2016.7541538(1446-1450)Online publication date: 11-Mar-2021
https://dl.acm.org/doi/10.1109/ISIT.2016.7541538
He QDán GKoudouridis G(2020)Semi-Persistent Scheduling for 5G Downlink Based on Short-Term Traffic PredictionGLOBECOM 2020 - 2020 IEEE Global Communications Conference10.1109/GLOBECOM42002.2020.9322125(1-6)Online publication date: 7-Dec-2020
https://dl.acm.org/doi/10.1109/GLOBECOM42002.2020.9322125
(2018)Effects of vertex insertion on local rescheduling in wireless sensor networksInternational Journal of Ad Hoc and Ubiquitous Computing10.1504/IJAHUC.2018.08982427:3(195-209)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.1504/IJAHUC.2018.089824
Show More Cited By

Some complexity results about packet radio networks (Corresp.)
1. Networks
  1. Network types

Recommendations

Unexpected hardness results for Kolmogorov complexity under uniform reductions
STOC 2020: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing

Hardness of computing the Kolmogorov complexity of a given string is closely tied to a security proof of hitting set generators, and thus understanding hardness of Kolmogorov complexity is one of the central questions in complexity theory. In this paper,...
New complexity results for the k-covers problem

The k-covers problem (kCP) asks us to compute a minimum cardinality set of strings of given length k>1 that covers a given string. It was shown in a recent paper, by reduction to 3-SAT, that the k-covers problem is NP-complete. In this paper we ...
On the complexity of connectivity in cognitive radio networks through spectrum assignment

Cognitive Radio Networks (CRNs) are considered as a promising solution to the spectrum shortage problem in wireless communication. In this paper, we initiate the first systematic study on the algorithmic complexity of the connectivity problem in CRNs ...

Comments

Information & Contributors

Information

Published In

IEEE Transactions on Information Theory Volume 30, Issue 4

July 1984

129 pages

ISSN:0018-9448

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 September 2006

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

32
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

He QYuan DEphremides A(2021)A general optimality condition of link scheduling for emptying a wireless network2016 IEEE International Symposium on Information Theory (ISIT)10.1109/ISIT.2016.7541538(1446-1450)Online publication date: 11-Mar-2021
https://dl.acm.org/doi/10.1109/ISIT.2016.7541538
He QDán GKoudouridis G(2020)Semi-Persistent Scheduling for 5G Downlink Based on Short-Term Traffic PredictionGLOBECOM 2020 - 2020 IEEE Global Communications Conference10.1109/GLOBECOM42002.2020.9322125(1-6)Online publication date: 7-Dec-2020
https://dl.acm.org/doi/10.1109/GLOBECOM42002.2020.9322125
(2018)Effects of vertex insertion on local rescheduling in wireless sensor networksInternational Journal of Ad Hoc and Ubiquitous Computing10.1504/IJAHUC.2018.08982427:3(195-209)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.1504/IJAHUC.2018.089824
Jones WWilson RBoukerche AKanhere SBellavista P(2018)Effects of Routing on the Capacity of Multi-Hop Wireless NetworksProceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems10.1145/3242102.3242111(155-162)Online publication date: 25-Oct-2018
https://dl.acm.org/doi/10.1145/3242102.3242111
Karakus CDiggavi S(2017)Enhancing Multiuser MIMO Through Opportunistic D2D CooperationIEEE Transactions on Wireless Communications10.1109/TWC.2017.271264916:9(5616-5629)Online publication date: 7-Sep-2017
https://dl.acm.org/doi/10.1109/TWC.2017.2712649
Köse AMédard M(2017)Scheduling wireless ad hoc networks in polynomial time using claw-free conflict graphs2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)10.1109/PIMRC.2017.8292404(1-7)Online publication date: 8-Oct-2017
https://dl.acm.org/doi/10.1109/PIMRC.2017.8292404
He QYuan DEphremides A(2017)On optimal link scheduling with deadlines for emptying a wireless network2017 IEEE International Symposium on Information Theory (ISIT)10.1109/ISIT.2017.8006570(461-465)Online publication date: 25-Jun-2017
https://dl.acm.org/doi/10.1109/ISIT.2017.8006570
Shafigh ALorenzo BGlisic SPérez-Romero JDaSilva LMacKenzie ARöning J(2016)A framework for dynamic network architecture and topology optimizationIEEE/ACM Transactions on Networking10.1109/TNET.2014.238343724:2(717-730)Online publication date: 1-Apr-2016
https://dl.acm.org/doi/10.1109/TNET.2014.2383437
Liu JTsai J(2016)Distributed multi-objective cross-layer optimization with joint hyperlink and transmission mode scheduling in network coding-based wireless networksAd Hoc Networks10.1016/j.adhoc.2015.09.00737:P2(460-474)Online publication date: 1-Feb-2016
https://dl.acm.org/doi/10.1016/j.adhoc.2015.09.007
Barcelo JBellalta BCano CFaridi AOliver M(2014)On the distributed construction of a collision-free schedule in multi-hop packet radio networksTelecommunications Systems10.1007/s11235-013-9836-556:2(285-298)Online publication date: 1-Jun-2014
https://dl.acm.org/doi/10.1007/s11235-013-9836-5
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Recommendations

Unexpected hardness results for Kolmogorov complexity under uniform reductions

New complexity results for the k-covers problem

On the complexity of connectivity in cognitive radio networks through spectrum assignment

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations