By Topic

Local Construction of Spanners in the 3D Space

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

4 Author(s)
Jenkins, J.P. ; Dept. of Comput. Sci., North Carolina State Univ., Raleigh, NC, USA ; Kanj, I.A. ; Ge Xia ; Fenghui Zhang

In this paper, we present local distributed algorithms for constructing spanners in wireless sensor networks modeled as unit ball graphs (shortly UBGs) and quasi-unit ball graphs (shortly quasi-UBGs), in the 3D euclidean space. Our first contribution is a local distributed algorithm that, given a UBG U and a parameter α<;π/3, constructs a sparse spanner of U with stretch factor 1/(1-2 sin(α/2)), improving the previous upper bound of 1/(1 - α ) by Althöfer et al. which is applicable only when α<;1/(1+2√2) <;π/3. The second contribution of this paper is in presenting the first local distributed algorithm for the construction of bounded-degree lightweight spanners of UBGs and quasi-UBGs. The simulation results we obtained show that, empirically, the weight and the stretch factor of the spanners, and the locality of the algorithms, are much better than the theoretical upper bounds proved in this paper.

Published in:

Mobile Computing, IEEE Transactions on  (Volume:11 ,  Issue: 7 )