An Efficient Group-Based Neighbor Discovery for Wireless Sensor Networks
Sudhakar Pandey, Prashant Kumar Shukla, Anshuman Tripathi · 2021 Third International Conference on Intelligent Communication Technologies and Virtual Mobile Networks (ICICV) · 2021
Wireless sensor networks have several applications, which usually need fast communication establishment of neighbor nodes such as military applications and business applications. Discovery of neighboring nodes is treated as a demanding problem in any network of remote sensors, on account of the low-duty cycle mode, high mobility and limited energy of nodes. At present, we have two kinds of neighbor revelation techniques: group-wise and pair-wise discovery techniques. The past techniques introduce high discovery latency, and the recent ones speed up the revelation process of nodes with a surplus of energy overhead, that is not desirable. Here, we present an effective group-based neighbor revelation technique based on probabilistic separation, that results in a good balance between revelation delay and energy utilization and accelerates the discovery process. We use schedule reference technique for better recommendation of nodes and avoid direct referring of nodes in the group. A node is considered to be a neighbor of another node by estimating its probabilistic separation. We use RSSI strengths of nodes to calculate probabilistic separation between nodes. Analytical and Simulation outcomes demonstrate that our method measurably accomplishes a better compromise between energy utilization and revelation delay. Our method of neighbor discovery also shows significant drop in revelation delay with a small boost in energy utilization compared with former neighbor revelation techniques.