Improving the performance guarantee for approximate graph coloring
Journal of the ACM (JACM)
The NP-completeness column: An ongoing guide
Journal of Algorithms
Data networks
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Forests, frames, and games: algorithms for matroid sums and applications
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Computer networks
Multiple communication in multi-hop radio networks
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Introduction to algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the Complexity of Distance-2 Coloring
ICCI '92 Proceedings of the Fourth International Conference on Computing and Information: Computing and Information
Graph Theory With Applications
Graph Theory With Applications
A channel access scheme for large dense packet radio networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
A new model for scheduling packet radio networks
Wireless Networks
Coloring unstructured radio networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Local approximation schemes for ad hoc and sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Topology control meets SINR: the scheduling complexity of arbitrary topologies
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Allocating dynamic time-spectrum blocks in cognitive radio networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Improved Algorithms for Latency Minimization in Wireless Networks
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Oblivious interference scheduling
Proceedings of the 28th ACM symposium on Principles of distributed computing
Slab routing: adapting two-dimensional geographic routing to three-dimensions
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
A new model for scheduling packet radio networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Improved algorithms for latency minimization in wireless networks
Theoretical Computer Science
A green framework for energy efficient management in TDMA-based wireless mesh networks
Proceedings of the 8th International Conference on Network and Service Management
| Hi-index | 0.00 |
New algorithms for transmission scheduling in multihop broadcast radio networks are presented. Both link scheduling and broadcast scheduling are considered. In each instance scheduling algorithms are given that improve upon existing algorithms both theoretically and experimentally. Theoretically, it is shown that tree networks can be scheduled optimally, and that arbitrary networks can be scheduled so that the schedule is bounded by a length that is proportional to a function of the network thickness times the optimum. Previous algorithms could guarantee only that the schedules were bounded by a length no worse than the maximum node degree, the algorithms presented here represent a considerable theoretical improvement. Experimentally, a realistic model of a radio network is given and the performance of the new algorithms is studied. These results show that, for both types of scheduling, the new algorithms (experimentally) perform consistently better than earlier methods.