Big-Step Algorithm for Neighbor Node Discovery in Ad-hoc Network

Wenjun Zhang · Information Security and Communications Privacy · 2011

This paper mainly describes the algorithm for the neighbor node discovery in the Ad-hoc network based on the directional antenna. To improve the random algorithm,that is,the common scanning algorithm,a Big-Step Algorithm based on TDMA is proposed. With this algorithm,the neighbor nodes can be readily discovered,this means that the time for network-building is greatly reduced,and the quality of the network is obviously improved. Finally,simulation with OPNET and Matlab proves the superiority of this new algorithm.

Read the paper · More papers on PaperTik