By Topic

Distributed construction of an underlay in wireless 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

1 Author(s)
Stratil, H. ; Inst. of Comput. Eng., Vienna Univ. of Technol., Austria

A wireless network consists of a large number of nodes that use wireless communication links to collectively perform certain tasks in various application domains (industry, military, etc.). Since wireless nodes are irregularly scattered over a large application area, a suitable wireless multihop routing protocol is needed to facilitate the communication between arbitrary nodes. Many geographic routing protocols use a planar graph as the underlying network topology. This paper presents an efficient algorithm for the localized computation of such an underlay, namely, the short Delaunay triangulation (SDT). The SDT contains all edges of the Delaunay triangulation that are shorter than the communication range. The great asset of the short Delaunay triangulation is its spanning property: It approximates the shortest path of the unit disk graph by a constant factor. Our distributed algorithm for constructing the SDT surpasses alternative underlay construction algorithms and requires point-to-point communication links only.

Published in:

Wireless Sensor Networks, 2005. Proceeedings of the Second European Workshop on

Date of Conference:

31 Jan.-2 Feb. 2005