Provided by: University of Calgary
Date Added: Mar 2012
The most fundamental problem in wireless ad-hoc networks is to determine a connected communication sub-graph that satisfies desirable topological properties by assigning appropriate transmission power to each node. Some of the properties considered by a vast majority of researchers include minimum-energy, fault tolerance, minimum interference, and bounded node degree. However preserving two or more combination of these properties at the same time is harder to achieve and often overlooked by the research community. In this paper, the authors propose a topology control algorithm that preserves connectivity and combines two other important properties, e.g., minimum interference, and fault tolerance.