Topology control for multihop packet radio networks

A distributed topology-control algorithm has been developed for each node in a packet radio network (PRN) to control its transmitting power and logical neighbors for a reliable high-throughput topology. The algorithm first constructs a planar triangulation from locations of all nodes as a starting topology. Then, the minimum angles of all triangles in the planar triangulation are maximized by means of edge switching to improve connectivity and throughput. The resulting triangulation at this stage, the Delaunay triangulation, can be determined locally at each node. The topology is modified by negotiating among neighbors to satisfy a design requirement on the nodal degree parameter. Simulations show that the final topology is degree-bounded, has a rather regular and uniform structure, and has throughput and reliability that are greater than that of a number of alternative topologies. >

[1]  D. T. Lee,et al.  Computational Geometry—A Survey , 1984, IEEE Transactions on Computers.

[2]  D. T. Lee,et al.  Generalized delaunay triangulation for planar graphs , 1986, Discret. Comput. Geom..

[3]  Dennis J. Baker,et al.  Distributed Control of Broadcast Radio Networks with Changing Topologies , 1983, INFOCOM.

[4]  Prodip Sen,et al.  A rule-based system for packet radio network design , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[5]  L. Kleinrock,et al.  Spatial reuse in multihop packet radio networks , 1987, Proceedings of the IEEE.

[6]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[7]  Limin Hu,et al.  A novel topology control for multihop packet radio networks , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[8]  John A. Silvester,et al.  On Multi-Hop Spread Spectrum Network Modeling , 1986, MILCOM 1986 - IEEE Military Communications Conference: Communications-Computers: Teamed for the 90's.

[9]  Ting-Chao Hou,et al.  Transmission Range Control in Multihop Packet Radio Networks , 1986, IEEE Trans. Commun..

[10]  Leonard Kleinrock,et al.  Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals , 1984, IEEE Trans. Commun..

[11]  AARON KERSHENBAUM,et al.  An Algorithm for Evaluation of Throughput in Multihop Packet Radio Networks with Complex Topologies , 1987, IEEE J. Sel. Areas Commun..

[12]  F.A. Tobagi,et al.  Modeling and performance analysis of multihop packet radio networks , 1987, Proceedings of the IEEE.

[13]  R. Boorstyn,et al.  Large-Scale Network Topological Optimization , 1977, IEEE Trans. Commun..

[14]  John A. Silvester,et al.  Optimum transmission radii for packet radio networks or why six is a magic number , 1978 .

[15]  Robert R. Boorstyn,et al.  A Comparison of the Performance of Protocols in Packet Radio Networks , 1985, MILCOM 1985 - IEEE Military Communications Conference.

[16]  John A. Silvester,et al.  On the Capacity of Multihop Slotted ALOHA Networks with Regular Structure , 1983, IEEE Trans. Commun..

[17]  Ting-Chao Hou,et al.  PERFORMANCE ANALYSIS OF ROUTING STRATEGIES IN MULTIHOP PACKET RADIO NETWORK. , 1984 .

[18]  Mario Gerla,et al.  On the Topological Design of Distributed Computer Networks , 1977, IEEE Trans. Commun..

[19]  Anthony Ephremides,et al.  The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm , 1981, IEEE Trans. Commun..

[20]  I. Frisch,et al.  Analysis and Design of Survivable Networks , 1970 .