By Topic

Localized low-weight graph and its applications 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

5 Author(s)
Xiang-Yang Li ; Dept. of Comput. Sci., Illinois Inst. of Technol., Chicago, IL, USA ; Yu Weng ; Peng-Jun Wan ; Wen-Zhan Song
more authors

We propose a new localized structure, namely, Incident MST and RNG Graph (IMRG), for topology control and broadcasting in wireless ad hoc networks. In the construction algorithm, each node first builds a modified relative neighborhood graph (RNG'), and then informs its one-hop neighbors its incident edges in RNG'. Each node then collects all its one-hop neighbors and the two-hop neighbors who have RNG edges to some of its one-hop neighbors, and builds an Euclidean minimum spanning tree of these nodes. Each node u keeps an edge uv only if uv is in the constructed minimum spanning tree. We analytically prove that the node degree of the IMRG is at most 6, it is connected and planar, and more importantly, the total edge length of the IMRG is within a constant factor of that of the minimum spanning tree. To the best of our knowledge, this is the first algorithm that can construct a structure with all these properties using small communication messages (at most 13n total messages, each with O(logn) bits) and small computation cost, where n is the number of wireless nodes. Test results are corroborated in the simulation study.

Published in:

INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies  (Volume:1 )

Date of Conference:

7-11 March 2004