Scheduling algorithms for multihop radio networks

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. 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 times optimum. Since the thickness is typically several orders of magnitude less than the maximum node degree, the algorithms presented 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. >

[1]  Anthony Mansfield,et al.  Determining the thickness of graphs is NP-hard , 1983, Mathematical Proceedings of the Cambridge Philosophical Society.

[2]  David W. Matula,et al.  GRAPH COLORING ALGORITHMS , 1972 .

[3]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[4]  Anthony Ephremides,et al.  Distributed algorithm for efficient and interference-free broadcasting in radio networks , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[5]  F.A. Tobagi,et al.  Issues in packet radio network design , 1987, Proceedings of the IEEE.

[6]  Oded Goldreich,et al.  On the np-completeness of certain network testing problems , 1984, Networks.

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[9]  Subramanian Ramanathan,et al.  On the complexity of distance-2 coloring , 1992, Proceedings ICCI `92: Fourth International Conference on Computing and Information.

[10]  A. Ephremides,et al.  A design concept for reliable mobile radio networks with frequency hopping signaling , 1987, Proceedings of the IEEE.

[11]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[12]  Craig G. Prohazka.  Decoupling Link Scheduling Constraints in Multihop Packet Radio Networks , 1989, IEEE Trans. Computers.

[13]  Eugene Lawler,et al.  Combinatorial optimization , 1976 .

[14]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[15]  L FredmanMichael,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987 .

[16]  Reuven Bar-Yehuda,et al.  Multiple communication in multi-hop radio networks , 1989, PODC '89.

[17]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[18]  C. Nash-Williams.  Edge-disjoint spanning trees of finite graphs , 1961 .

[19]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[20]  Limin Hu,et al.  Reliability analysis of sparse topologies for packet radio networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[21]  梅村 恭司.  Andrew S.Tanenbaum 著, "Operating systems, Design and implementation", PRENTICE-HALL, INC., Englewood Cliffs, B5変形判, 719p., \4,120 , 1988 .

[22]  Béla Bollobás,et al.  Random Graphs , 1985 .

[23]  Noga Alon,et al.  On the complexity of radio communication , 1989, STOC '89.

[24]  Avi Wigderson,et al.  Improving the performance guarantee for approximate graph coloring , 1983, JACM.

[25]  Reuven Bar-Yehuda,et al.  Multiple Communication in Multihop Radio Networks , 1993, SIAM J. Comput..

[26]  Erdal Arikan,et al.  Some complexity results about packet radio networks , 1983, IEEE Trans. Inf. Theory.

[27]  Keshab K. Parhi,et al.  Distributed scheduling of broadcasts in a radio network , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[28]  Harold N. Gabow,et al.  Forests, frames, and games: algorithms for matroid sums and applications , 1988, STOC '88.