摘要
本文研究了定向传感器网络中最小化覆盖间隙和最大化网络生命时间的问题.本文采用的定向感知天线模型,每个传感器有多个感应方向.在无线传感器网络中,最大化网络生命时间和最小化覆盖间隙是两个冲突的目标.为了在两者之间做出权衡,文章研究了在生命时间受约束的情况下最小化覆盖间隙问题(MCBLC)和在覆盖间隙受约束的条件下最大化网络生命时间问题(MLCBC).对于MCBLC问题,我们首先将它模型化为整数规划问题,并提出两个启发式算法(MCBLC-G和MCBLC-G-1).基于MCBLC-G (MCBLC-G-1)算法,利用二分搜索技术得到MLCBC问题的算法.最后,模拟验证了算法的性能.
In this paper, we discuss the minimum coverage breach and maximum network lifetime problem in directional sen- sor network. In our directional model, each sensor may have several sensing directions, but only one direction can be activated at the same time. In wireless sensor network,maximizing the network lifetime and minimizing the coverage breach are two conflicting ob- jectives. To make a trade-off between them, we study Minimum Coverage Breach under Lifetime Constraint (MCBLC) problem and Maximum Lifetime under Coverage Breach Constraint problem (MLCBC).For MCBLC problem, we first formulate it as Integer Programming and then propose greedy algorithm (MCBLC-G) algorithm.For MLCBC problem,based on MCBI/2-G algorithm, we use binary search technique to get a solution. Extensive simulations have been presented to demonstrate the performance of these al- gorithms.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2010年第B02期138-142,共5页
Acta Electronica Sinica
基金
国家自然科学基金(No.10671208)
国家863高技术研究(No.2008AA01Z120)
中国人民大学研究生项目(No.08XNH066,No.10XNJ032)