Title :
Distributed scheduling of broadcasts in a radio network
Author :
Ramaswami, Rajiv ; Parhi, Keshab K.
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA
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.<>
Keywords :
packet switching; radio networks; broadcasts; distributed algorithm; multi-hop packet radio; radio channel; radio network; scheduling; sequential graph-coloring heuristic; Computer science; Distributed algorithms; Intelligent networks; Interference; Packet radio networks; Processor scheduling; Radio broadcasting; Radio network; Scheduling algorithm; Spread spectrum communication;
Conference_Titel :
INFOCOM '89. Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies. Technology: Emerging or Converging, IEEE
Conference_Location :
Ottawa, Ont., Canada
Print_ISBN :
0-8186-1920-1
DOI :
10.1109/INFCOM.1989.101493
