The r-neighborhood graph: An adjustable structure for topology control in wireless ad hoc networks

Abstract

In wireless ad hoc networks, constructing and maintaining a topology with lower node degrees is usually intended to mitigate excessive traffic load on wireless nodes. However, keeping lower node degrees often prevents nodes from choosing better routes that consume less energy. Therefore, the trade-off is between the node degree and the energy efficiency. In this paper, an adjustable structure, named the r-neighborhood graph, is proposed to control the topology. This structure has the flexibility to be adjusted between the two objectives through a parameter r, 0 <= r <= 1. More explicitly, for any set of n nodes, the maximum node degree and power stretch factor can be bounded from above by some decreasing and increasing functions of r, respectively. Specifically, the bounds can be constants in some ranges of r. Even more, the r-neighborhood graph is a general structure of both RNG and GG, two well-known structures in topology control. Compared with YGk, another famous adjustable structure, our method always results in a connected planar with symmetric edges. To construct this structure, we investigate a localized algorithm, named PLA, which consumes less transmitting power during construction and executes efficiently in O(n log n) time.