By Topic

The r-Neighborhood Graph: An Adjustable Structure for Topology Control in Wireless Ad Hoc Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jeng, A.A. ; Dept. of Comput. & Inf. Sci., Nat. Chiao Tung Univ., Hsinchu ; Rong-Hong Jan

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, 0lesrles1. 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 logn) time

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:18 ,  Issue: 4 )