A Distributed Algorithm for Finding a Tree Trunk and its Application for Multicast in Mobile Ad Hoc Networks

Author(s):  
Yamin Li ◽  
Shietung Peng ◽  
Wanming Chu
2005 ◽  
Vol 06 (02) ◽  
pp. 63-84
Author(s):  
PETRA BERENBRINK ◽  
THOMAS FRIEDETZKY ◽  
JÁN MAŇUCH ◽  
LADISLAV STACHO

We introduce a notion of t-quasi-spanner as an alternative to classical t-spanners. Our motivation for quasi-spanner comes from a problem of computing a sparse backbone for ad hoc wireless networks with fixed transmission ranges. We study computational complexity of the problem of computing sparsest quasi-spanner. Then we concentrate on the case t = 2 and give a distributed algorithm for computing a 2-quasi-spanner with linear number of edges. Finally, we give a modification of our algorithm which performs well on a class of random ad hoc networks.


2012 ◽  
Vol 2 (3) ◽  
pp. 77-80
Author(s):  
V. Karamchand Gandhi ◽  
◽  
D.P.Jeyabalan D.P.Jeyabalan

2012 ◽  
Vol E95-B (1) ◽  
pp. 169-177
Author(s):  
Yasushi YAMAWAKI ◽  
Takahiro MATSUDA ◽  
Tetsuya TAKINE

Sign in / Sign up

Export Citation Format

Share Document