摘要
节点调度机制是解决无线传感器网络节点能量受限问题的重要方法.传统的位置信息无关的节点调度方案以节点的感知区域覆盖为调度目标,导致处于边界区域的节点由于没有太多机会进入休眠状态而先死亡,进而引起死亡节点向监测中心扩散现象,我们称这种现象为"不均等休眠"问题.针对该问题,从理论上对节点覆盖模型进行分析,提出容忍覆盖区域的概念,并在此基础上设计基于容忍覆盖区域的节点调度算法.仿真结果表明,基于容忍覆盖区域的节点调度算法不但能够缓解"不均等休眠"问题,且有效的延长了网络的生存时间.
Node scheduling scheme of sensor nodes is one of the most important method to solve the energy-constrained wireless sensor networks.Traditional methods of node scheduling that without location information are aim at node sensing area coverage.It leads to a node in the border of monitored region first death due to no more chance enter into sleep state,and then the death spread to the central region.We call this phenomenon as inequality sleep problems.To address this problem,from the theoretical analysis of the sensor node coverage model,we proposed the concept of tolerable coverage area,and propose a node scheduling scheme based on tolerable coverage area.Simulation results demonstrate that the proposed method not only alleviates the inequality sleep problems,but also prolonged network lifetime.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2011年第1期89-94,共6页
Acta Electronica Sinica
基金
国家自然科学基金(No.60973139
No.60773041
No.61003039
No.61003236)
江苏省科技支撑计划(工业)项目(No.BE2010197
No.BE2010198)
江苏省级现代服务业发展专项资金
江苏省高校自然科学基础研究(No.10KJB520013)
高校科研成果产业化推进工程(No.JH10-14)
国家和江苏省博士后基金(No.20100471353
No.20100471355)
江苏省高校科技创新计划(No.CX10B-196Z
No.CX10B-197Z
No.CX10B-198Z
No.CX10B-199Z
No.CX10B-200Z)
江苏省六大高峰人才项目(No.2008118)
江苏省计算机信息处理技术重点实验室基金(2010)
关键词
无线传感器网
容忍覆盖区域
节点调度算法
wireless sensor networks
tolerable coverage area
node scheduling algorithm
