An Improved Group-Based Neighbor Discovery Algorithm for Mobile Sensor Networks. (15th April 2014)

• Record Type: Journal Article
• Authors: Niu, Qiang; Bao, Weiwei; Xia, Shixiong
• Other Names: Guo Zhongwen Academic Editor.
• Is Part Of: International journal of distributed sensor networks. (2014)
• Publication Date: 2014-04-15
• Subjects: Sensor networks -- Periodicals; Intelligent agents (Computer software) -- Periodicals; Multisensor data fusion -- Periodicals; 681.2
• DOI: 10.1155/2014/803870
• Languages: English
• ISSNs: 1550-1329

Abstract

Abstract : Wireless sensor networks have been widely used in a variety of commercial and military applications, which often require neighbor nodes to establish connection quickly. Due to high mobility of nodes, it is a challenging issue to reduce discovery delay. Most discovery designs are based on pairwise and fixed duty cycle, in which discovery is passively achieved when two nodes wake up at the same time. In order to further improve the efficiency of neighbor discovery in mobile sensor networks, this paper proposes an improved group-based neighbor discovery algorithm (IGND) which dynamically adjusts the nodes' active time based on spatial properties. This paper describes the network model and the algorithm implementation in detail. Simulation results show that the improved algorithm has a good effect in reducing discovery latency and promoting discovery efficiency.