loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth IEEE International Conference on Computer and Information Technology (CIT'06)
Distributed Neighbor Discovery in Ad Hoc Networks Using Directional Antennas
Seoul, Korea
September 20-September 22
ISBN: 0-7695-2687-X
Rully Adrian Santosa, Nanyang Technological University, Singapore
Bu-Sung Lee, Nanyang Technological University, Singapore
Chai Kiat Yeo, Nanyang Technological University, Singapore
Teck Meng Lim, Nanyang Technological University, Singapore
In this paper, we propose a distributed neighbor discovery algorithm in ad hoc networks using directional antennas. A newly joining node obtains the information about its neighbors in both its omnidirectional and directional range by querying a subset of its omnidirectional neighbors. The main contribution of the proposed algorithm is that it does not require all neighbor nodes to be involved in the discovery process. Simulation results show that the algorithm performance closely tracks the theoretical analysis and only requires a fraction of the neighbors to be involved in the discovery process.
Citation:
Rully Adrian Santosa, Bu-Sung Lee, Chai Kiat Yeo, Teck Meng Lim, "Distributed Neighbor Discovery in Ad Hoc Networks Using Directional Antennas," cit, pp.97, Sixth IEEE International Conference on Computer and Information Technology (CIT'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.