Topology formulation algorithms for wireless networks with reconfigurable directional links

In future airborne networks, high rate connectivity between platforms will be heterogeneous and provided over directional free space optical (FSO) or RF wireless links. It is essential for large scale high performance networks that the creation and maintenance of link adjacencies between airborne nodes proceed in an automated manner. Precisely which steerable transmit beams should form connections with available receivers within the transmitter's field of view, range, and type must be determined-quickly. To accomplish this aim we seek an algorithm to create a robust network that balances stability and performance goals given connectivity and resource constraints. Due to the unstable nature of links and data traffic patterns, the primary objective is to maximize the number of connected nodes, an NP-hard problem. In this paper, we describe an integer linear programming (ILP) formulation that discovers a degree constrained spanning tree (dST) if one exists. If no dST exists, i.e., if no degree constrained connected graph is feasible, the algorithm produces a degree constrained forest with the maximum number of edges feasible, subject to the requirement that each tree contains at least one edge. Performance and scalability results are shown for the ILP variant described, in different scenarios and for different network sizes.

[1]  Yoshitsugu Yamamoto,et al.  The Held—Karp algorithm and degree-constrained minimum 1-trees , 1978, Math. Program..

[2]  Bezalel Gavish,et al.  Topological design of centralized computer networks - formulations and algorithms , 1982, Networks.

[3]  Andreas T. Ernst,et al.  Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree , 2001, J. Heuristics.

[4]  S. Milner,et al.  Obscuration minimization in dynamic free space optical networks through topology control , 2004, IEEE MILCOM 2004. Military Communications Conference, 2004..

[5]  Subhash C. Narula,et al.  Degree-constrained minimum spanning tree , 1980, Comput. Oper. Res..

[6]  Marimuthu Palaniswami,et al.  Comparison of Heuristic Algorithms for the Degree Constrained Minimum Spanning Tree , 1996 .

[7]  A. Volgenant.  A Lagrangean approach to the degree-constrained minimum spanning tree problem , 1989 .

[8]  M. Gen,et al.  A new approach to the degree-constrained minimum spanning tree problem using genetic algorithm , 1996, 1996 IEEE International Conference on Systems, Man and Cybernetics. Information Intelligence and Systems (Cat. No.96CH35929).

[9]  M. Gen,et al.  A note on genetic algorithms for degree‐constrained spanning tree problems , 1997 .

[10]  Fred C. Holroyd,et al.  Cycles in the complement of a tree or other graph , 1985, Discret. Math..

[11]  Vaidyanathan Nagarajan.  Topological design of centralized computer networks , 1991 .

[12]  Harold N. Gabow.  A good algorithm for smallest spanning trees with a degree constraint , 1978, Networks.

[13]  Robert E. Tarjan,et al.  Enumeration of the Elementary Circuits of a Directed Graph , 1972, SIAM J. Comput..

[14]  Samir Khuller,et al.  Low-Degree Spanning Trees of Small Weight , 1996, SIAM J. Comput..

[15]  Martin W. P. Savelsbergh,et al.  Edge exchanges in the degree-constrained minimum spanning tree problem , 1985, Comput. Oper. Res..

[16]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[17]  M. Savelsbergh,et al.  Edge exchanges in the degree-constrained spanning tree problem , 1985 .

[18]  Donald B. Johnson,et al.  Finding All the Elementary Circuits of a Directed Graph , 1975, SIAM J. Comput..

[19]  Pierluigi Crescenzi,et al.  A compendium of NP optimization problems , 1994, WWW Spring 1994.

[20]  S. Milner,et al.  Autonomous reconfiguration of backbones in free space optical networks , 2004, IEEE MILCOM 2004. Military Communications Conference, 2004..