Proceedings ArticleDOI
Distributed scheduling of broadcasts in a radio network
R. Ramaswami,Keshab K. Parhi +1 more
- pp 497-504
Reads0
Chats0
TLDR
A distributed algorithm is presented for obtaining an efficient and conflict-free broadcasting schedule in a multi-hop packet radio network and a distributed implementation of this algorithm is proposed, which is based on circulating a token through the nodes in the network.Abstract:
A distributed algorithm is presented for obtaining an efficient and conflict-free broadcasting schedule in a multi-hop packet radio network. The inherent broadcast nature of the radio channel enables a node's transmission to be received by all other nodes within range. Multiple transmissions can be scheduled simultaneously because of the multi-hop nature of the network. It is first shown that the construction of a broadcasting schedule of minimum length is NP-complete, and then a centralized algorithm based on a sequential graph-coloring heuristic is presented to construct minimal-length schedules. A distributed implementation of this algorithm is then proposed, which is based on circulating a token through the nodes in the network. >read more
Citations
More filters
Journal ArticleDOI
Design challenges for energy-constrained ad hoc wireless networks
TL;DR: It is shown that cross-layer design of these protocols is imperative to meet emerging application requirements, particularly when energy is a limited resource.
Proceedings ArticleDOI
Joint scheduling and power control for wireless ad-hoc networks
Tamer ElBatt,Anthony Ephremides +1 more
TL;DR: A cross-layer design framework to the multiple access problem in contention-based wireless ad hoc networks is introduced, limiting multiuser interference to increase single-hop throughput and reducing power consumption to prolong battery life.
Journal ArticleDOI
OR Scheduling Algorithms
TL;DR: A schedule is proposed which minimizes the makespan, the time when the last job is completed, and the constraints are that a job can only be scheduled after its release time, and preemption is not allowed.
Journal ArticleDOI
Joint scheduling and power control for wireless ad hoc networks
Tamer ElBatt,Anthony Ephremides +1 more
TL;DR: A cross-layer design framework to the multiple access problem in contention-based wireless ad hoc networks is introduced, limiting multiuser interference to increase single-hop throughput and reducing power consumption to prolong battery life.
BookDOI
Handbook of wireless networks and mobile computing
TL;DR: H Handbook of Internet Computing pdf eBook copy write by good Handbook of Wireless Networks and Mobile Computing Google Books.
References
More filters
Journal ArticleDOI
A design concept for reliable mobile radio networks with frequency hopping signaling
TL;DR: This paper outlines those features that distinguish the High Frequency (HF) Intra Task Force (ITF) Network from other packet radio networks, and presents a design concept for this network that encompasses organizational structure, waveform design, and channel access.
Journal ArticleDOI
Link scheduling in polynomial time
Bruce Hajek,Galen Sasaki +1 more
TL;DR: Two polynomial-time algorithms are given for scheduling conversations in a spread spectrum radio network that jointly meet a prespecified end-to-end demand and has the smallest possible length.
Journal ArticleDOI
On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
I. Chlamtac,Shay Kutten +1 more
TL;DR: A polynomial time algorithm is proposed under which a channel is assigned to nodes from global, multiple-source broadcasting considerations, and it is shown that the problem of finding an optimal protocol is NP-hard.
Journal ArticleDOI
The Design and Simulation of a Mobile Radio Network with Distributed Control
TL;DR: It is illustrated how fully distributed control methods can be combined with hierarchical control to create a network that is robust with respect to both node loss and connectivity changes.
Journal ArticleDOI
Some complexity results about packet radio networks (Corresp.)
TL;DR: In this article, it was shown that the decision problem regarding the membership of a point in the capacity region of a packet radio network is NP-hard, where the problem is defined as the existence of any set of rules for moving the data through the network so that the desired rates are satisfied.