| 有向传感器网络最大覆盖调度算法 |
| |
| 引用本文： | 程卫芳,廖湘科,沈昌祥.有向传感器网络最大覆盖调度算法[J].软件学报,2009,20(4):975-984. |
| |
| 作者姓名： | 程卫芳 廖湘科 沈昌祥 |
| |
| 作者单位： | 1. 国防科学技术大学,计算机学院,湖南,长沙,410073
2. 海军计算技术研究所,北京,100841 |
| |
| 基金项目： | Supported by the National High-Tech Research and Development Plan of China under Grant No.2006AA01Z213 (国家高技术研究发展计划(863)) |
| |
| 摘 要： | 与传统的全向传感器不同,有向传感器可以切换到不同的方向,并且每个方向覆盖有限角度的感应范围.针对有向传感器网络的区域覆盖问题,研究了“最大有向区域覆盖”MDAC(maximum directional area coverage)问题,期望通过调度传感器的工作方向,最大化覆盖区域面积.首先给出了MDAC 的问题定义,使用整数线性规划描述MDAC 问题,并且证明其是NP 完全的.然后提出一种分布式贪心算法DGreedy(distributed greedy algorithm)解决MDAC 问题.在此基础上,通过计算可能的覆盖贡献比例来反映网络拓扑信息.还提出了一种增强的算法PGreedy(distributed probability-enhanced greedy algorithm)使覆盖区域更大.证明了所提算法的收敛性,并通过详细的模拟实验验证了其有效性.
|
| 关 键 词： | 有向传感器网络 区域覆盖 分布式算法 调度 概率 |
| 收稿时间： | 2007/3/22 0:00:00 |
| 修稿时间： | 2007/12/17 0:00:00 |
Maximal Coverage Scheduling in Wireless Directional Sensor Networks |
| |
| CHENG Wei-Fang,LIAO Xiang-Ke and SHEN Chang-Xiang.Maximal Coverage Scheduling in Wireless Directional Sensor Networks[J].Journal of Software,2009,20(4):975-984. |
| |
| Authors: | CHENG Wei-Fang LIAO Xiang-Ke and SHEN Chang-Xiang |
| |
| Affiliation: | School of Computer;National University of Defense Technology;Changsha 410073;China;Institute of Naval Computer Technology;Beijing 100841;China |
| |
| Abstract: | Unlike the traditional omni-directional sensors that always have an omni-angle of sensing range, directional sensors may be able to switch to several directions and each direction has a limited angle of sensing range. This paper studies a novel "area coverage by directional sensors" problem. It proposes the Maximum Directional Area Coverage (MDAC) to maximize the covered area by scheduling the working directions of the sensors in the network. This paper proves the MDAC to be NP-complete and proposes two dis... |
| |
| Keywords: | directional sensor network area coverage distributed algorithm scheduling probability |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
