摘要
结合调整感应半径和采用睡眠唤醒调度机制2种重要的最大化网络生命周期方法,研究了无线传感器网络的最大覆盖子集MSC-ASR问题,提出了相应的混合整数规划模型,证明了所给MSC-ASR问题是一个NPC模型.此外,提出了所探讨问题的2种算法:集中式和分布式.最后通过实验表明了所给算法的有效性.
Based on efficient scheduling and adapting sensing ranges which are the two important methods for maximizing wireless sensor network lifetime,we study the maximum set covers problem with adjustable sensing ranges(MSC-ASR),propose a mixed integer programming model,and demonstrate that MSC-ASR is a NPC problem.For solving MSC-ASR,we present two methods: centralized algorithm and distributed algorithm.Simulations show that the algorithms are effiective.
出处
《中国科学院研究生院学报》
CAS
CSCD
北大核心
2011年第6期768-775,共8页
Journal of the Graduate School of the Chinese Academy of Sciences
基金
中国科学院研究生院院长基金(085102AN00)资助