Topology Control Based on a Steiner Tree in Ad Hoc Wireless Networks

This paper presents an algorithm to build a communication network by introducing extraneous transceiver nodes. Instead of conventional spanning tree model, the proposed algorithm used the Steiner tree to setup a communication links in the emergencies. The main contribution of this paper is the O(N logN) algorithm that computes the minimal Steiner tree on the communication graph consists of original and relay nodes in wireless networks. Wireless ad hoc networks consist of independent devices (transceiver nodes) communicating via radio. There is no common infrastructure which could be used for the organization of the network. The coordination necessary for efficient communication has to be carried out by the nodes themselves.