The NP-completeness column: An ongoing guide
Journal of Algorithms
Multiple communication in multi-hop radio networks
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Discrete Mathematics - Topics on domination
Scheduling algorithms for multi-hop radio networks
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
A new model for scheduling radio networks
A new model for scheduling radio networks
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Better Heuristic for Orthogonal Graph Drawings
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
PAMAS—power aware multi-access protocol with signalling for ad hoc networks
ACM SIGCOMM Computer Communication Review
The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Coloring powers of planar graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The broadcast storm problem in a mobile ad hoc network
Wireless Networks - Selected Papers from Mobicom'99
Broadcast scheduling for TDMA in wireless multihop networks
Handbook of wireless networks and mobile computing
OVSF-CDMA code assignment in wireless ad hoc networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Topological Characteristics of Random Multihop Wireless Networks
Cluster Computing
Design and evaluation of a new MAC protocol for long-distance 802.11 mesh networks
Proceedings of the 11th annual international conference on Mobile computing and networking
The scheduling and energy complexity of strong connectivity in ultra-wideband networks
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Time-efficient distributed layer-2 auto-configuration for cognitive radio networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Approximate dynamic programming for link scheduling in wireless mesh networks
Computers and Operations Research
Improved bounds for data-gathering time in sensor networks
Computer Communications
A sequential approach for optimal broadcast scheduling in packet radio networks
IEEE Transactions on Communications
First-fit scheduling for beaconing in multihop wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
A probabilistic greedy algorithm for channel assignment in cellular radio networks
IEEE Transactions on Communications
Low-Latency broadcast scheduling in ad hoc networks
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Infrastructure-establishment from scratch in wireless sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Theoretically good distributed CDMA/OVSF code assignment for wireless ad hoc networks
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Hi-index | 0.00 |
Packet radio networks are modeled as arbitrary graphs by most researchers. In this paper we show that an arbitrary graph is an inaccurate model of the radio networks. This is true because there exists a large class of graphs which will not model the radio networks. Radio networks can be modeled accurately by a restricted class of graphs called the planar point graphs. Since the radio networks can accurately be modeled only by a restricted class of graphs, the NP-completeness results for scheduling using an arbitrary graph as the model, do not correctly reflect the complexity of the problem. In this paper we study the broadcast scheduling problem using the restricted class as the model. We show that the problem remains NP-complete even in this restricted domain. We give an O(n log n) algorithm when all the transceivers are located on a line.