The strongly connecting problem on multihop packet radio networks

The problem of strongly connecting a multihop packet radio network by using a minimal total amount of transmission power is investigated. This problem is shown to be NP-complete. An approximation algorithm with the same computational complexity as that of finding a minimum spanning tree is given. It is also shown that the approximation algorithm can find a solution no greater than twice that of the optimal solution. Experimental results show that the approximation solution may be close to the optimal solution. >

[1]  Anthony Ephremides,et al.  The Design and Simulation of a Mobile Radio Network with Distributed Control , 1984, IEEE J. Sel. Areas Commun..

[2]  Robert E. Tarjan,et al.  Finding optimum branchings , 1977, Networks.

[3]  John Jubin,et al.  A Distributed Routing Design for a Broadcast Environment , 1982, MILCOM 1982 - IEEE Military Communications Conference - Progress in Spread Spectrum Communications.

[4]  Francesco Maffioli,et al.  A note on finding optimum branchings , 1979, Networks.

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

[6]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[7]  A. Hauptschein,et al.  Recognition and Self-Organization of Nodes into DTDMA Nets , 1981, IEEE Transactions on Aerospace and Electronic Systems.

[8]  Colin D. Frank,et al.  Comments on 'Packet error probabilities in frequency-hopped spread-spectrum packet radio networks-memoryless frequency-hopping patterns considered' by M. Georgiopoulos , 1989, IEEE Trans. Commun..

[9]  Robert E. Tarjan,et al.  Finding Minimum Spanning Trees , 1976, SIAM J. Comput..

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

[11]  Francis Y. L. Chin,et al.  An almost linear time and O(nlogn+e) Messages distributed algorithm for minimum-weight spanning trees , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[12]  Andrew Chi-Chih Yao,et al.  An O(|E| log log |V|) Algorithm for Finding Minimum Spanning Trees , 1975, Inf. Process. Lett..

[13]  Joseph JáJá,et al.  Approximation Algorithms for Several Graph Augmentation Problems , 1981, SIAM J. Comput..

[14]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

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