scholarly journals Power efficient and sparse spanner for wireless ad hoc networks

2001 ◽  
Author(s):  
Xiang-Yang Li ◽  
Peng-Jun Wan ◽  
Yu Wang
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Power Efficient ◽  
Hoc Networks

DISTRIBUTED SPANNERS WITH BOUNDED DEGREE FOR WIRELESS AD HOC NETWORKS

2003 ◽  
Vol 14 (02) ◽  
pp. 183-200 ◽  
Author(s):  
YU WANG ◽  
XIANG-YANG LI ◽  
OPHIR FRIEDER
Keyword(s):  
Ad Hoc Networks ◽  
Unit Disk ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Unit Disk Graph ◽  
Bounded Degree ◽  
Small Power ◽  
Power Efficient ◽  
Stretch Factor ◽  
Hoc Networks

In this paper, we review some new distributed algorithms that construct sparse subgraphs with bounded degree of the unit disk graph efficiently for wireless ad hoc networks. They maintain a linear number of links while still preserving power-efficient routes for any pair of nodes. It was open whether the Yao plus reverse Yao graph and the symmetric Yao graph are spanners. We show that the Yao plus reverse Yao graph has a bounded power stretch factor 2 in civilized unit disk graph. In addition, we review a recent example by M. Grünewald et al. [6] to show that the symmetric Yao graph does not have a constant bounded stretch factor. Finally, we conduct simulations to study the practical performances of these structures. All structures have small power stretch factors for randomly generated unit disk graphs in our experiments.

Sign in / Sign up

Export Citation Format

Share Document