基于调度的无线自组网邻居节点检测算法研究

Research on schedule-based neighbor node detection algorithm for WSNs

无线自组网实际应用中,查找邻居节点的效率是衡量协议性能的重要因素之一,通常采用竞争机制占用信道。但在节点密度较大的自组网络中,信道载荷加重导致传输成功率降低,造成信息包重传次数增加,从而引起节点能量严重浪费问题。针对该问题,提出一种基于调度的无线自组网邻居节点检测算法,随机等待P时隙广播消息包后,在获取并分析平均一跳邻居节点数基础上,确定最优时间帧长度初始值,根据成功接收消息包数量实时调整时间帧长度。仿真和实验结果表明,该算法可大幅减少消息包的碰撞概率,有效提高无线自组网的能量利用率和吞吐率。

In the application of WSNs,the efficiency of searching neighbor nodes is one of the important factors for measuring protocol performance,and the competition mechanism is often used to accessing channel.However,in the WSNs with large node density,the channel load increasing leads to the decreasing of the load transfer success rate,which increases the number of the information packet retransmission and causes serious node energy consumption.Aiming at this problem,we propose a schedule-based neighbor node detection algorithm for WSNs.After randomly waiting P time slot broadcast message packets,based on obtaining and analyzing the average number of the neighbor nodes in one hop,the optimal time frame length initial value is determined,according to the number of the successfully received message packets,the time frame length is adjusted in real time.The proposed algorithm was tested with simulation and experiments ; and the results show that the algorithm can greatly reduce the message packet collision probability and effectively improve the energy utilization ratio and the throughput of the whole wireless sensor network.