loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers
Bootstrapping Free-Space Optical Networks
Denver, Colorado
April 04-April 08
ISBN: 0-7695-2312-9
Fang Liu, University of Maryland, College Park
Uzi Vishkin, University of Maryland Institute for Advanced Computer Studies and Elec. and Comp. Eng. Dept., College Park, MD
Stuart Milner, University of Maryland, College Park
We introduce a challenging problem in establishing and initially configuring a Free Space Optical (FSO) network. In such networks, it is assumed that each communication node is a base station, including a router and optical transceivers, and its number of transceivers is limited. In addition, the FSO networks are characterized by narrow beam, directional links (operating at 1550 nm, for example). The problem is to initially configure the transceivers to form a connected topology-an NP-complete problem because of the transceiver limitation. It also needs to configure the transceivers in a "distributed" fashion, because a node can have direct knowledge of only its neighbors. We have developed a fully distributed approximation algorithm, which constructs a spanning tree with maximal node degree at most one larger than that in the optimal solution. Due to its distributed nature, this algorithm outperforms known serial algorithms. For a graph with 200 nodes generated in some randomized model, speedups greater than 6 have been demonstrated.
Citation:
Fang Liu, Uzi Vishkin, Stuart Milner, "Bootstrapping Free-Space Optical Networks," ipdps, vol. 1, pp.61b, 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers, 2005
Usage of this product signifies your acceptance of the Terms of Use.