The Strongly Connecting Problem on Multihop Packet Radio Networks

Abstract

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. We also show that the approximation algorithm can find a solution no greater than twice of the optimal solution. Experimental results show that the approximation solution may be close to the optimal solution. © 1989 IEEE