一种带宽约束的无线传感器网络节点调度算法  

A coverage-preserving node scheduling scheme under bandwidth constraints for wireless sensor networks

作　　者：匡林爱[1,2] 蔡自兴[1] 

机构地区：[1]中南大学信息科学与工程学院,长沙410083 [2]湘潭大学信息工程学院,湘潭411105

出　　处：《高技术通讯》2010年第3期309-313,共5页Chinese High Technology Letters

基　　金：国家自然科学基金(90820302)资助项目

摘　　要：研究了无线传感器网络在带宽受限时怎样最小化覆盖裂口,同时最大化网络生命期的问题。将带宽限制理解为活动节点的活动邻居数限制,且认为由于带宽约束,当需要的带宽大于实际能提供的带宽时,覆盖裂口就可能发生。进而提出了一种最小覆盖裂口的混合整数规划模型,并提出了一种求解此问题的启发式算法,同时也研究了带宽和节点数对网络覆盖的影响。仿真实验表明,增加节点数可延长网络的生命期,增加带宽可减少裂口的发生,这与理论分析的结果是一致的。This paper addresses the problem that how wireless sensor networks under bandwidth constraints minimize the coverage breach and maximize the lifetime. The paper regards the number of activity neighbors of an activity node as bandwidth constraints, and suggests that with the limited bandwidth, a coverage breach can occur if the number of activity neighbors is less than the actual requirement, and then presents the minimum breach problem by using a mixed integer^programming model and provides a heuristic algorithm for the problem. The effects of increasing the number of activity neighbors and increasing the number of sensors on sensor network coverage are studied through numerical simulations. The simulation results reveal that as the number of sensors increases, network lifetimes can be improved, and the coverage breach de- creases as the bandwidths increasing, which coincides with the theoretical analysis very well.

关 键 词：无线传感器网络(WSN) 算法 整数规划 问题求解 带宽 能量保护 

分 类 号：TN929.5[电子电信—通信与信息系统] TP212.9[电子电信—信息与通信工程]