FONT face, Verdana, 杨辉强, 等. 定向传感器网络中的最小化覆盖间隙和最大化网络生命时间问题的研究[J]. 电子学报, 2010,38(2A):138-142.
FONT face, Verdana, YANG Hui-qaing, et al. Minimum Coverage Breach and Maximum Network Lifetime in Directional Sensor Networks[J]. Acta Electronica Sinica, 2010, 38(2A): 138-142.
FONT face, Verdana, 杨辉强, 等. 定向传感器网络中的最小化覆盖间隙和最大化网络生命时间问题的研究[J]. 电子学报, 2010,38(2A):138-142.DOI：
FONT face, Verdana, YANG Hui-qaing, et al. Minimum Coverage Breach and Maximum Network Lifetime in Directional Sensor Networks[J]. Acta Electronica Sinica, 2010, 38(2A): 138-142.DOI：
we discuss the minimum coverage breach and maximum network lifetime problem in directional sensor 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 objectives.To make a trade-off betw<FONT face=Verdana>een 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 MCBLC-G algorithm
we use binary search technique to get a solution.Extensive simulations have been presented to demonstrate the performance of these algorithms.
京公网安备11010802024621