全覆盖需求的水下传感器网络覆盖保持算法  

Full-Coverage Required Coverage-Preserving Algorithm for Underwater Sensor Networks

作　　者：蒋鹏[1] 阮斌锋[1] 谭劼[2] 

机构地区：[1]杭州电子科技大学信息与控制研究所,杭州310018 [2]杭州和利时自动化有限公司东南工程部,杭州310018

出　　处：《传感技术学报》2012年第11期1591-1598,共8页Chinese Journal of Sensors and Actuators

基　　金：国家重点基础研究发展计划项目(2012CB821200);国家自然科学基金项目(61273072);浙江省自然科学基金项目(Y1100054);杭州市科技局科技计划项目(20110533B44;20120433B40)

摘　　要：水下传感器网络常常需要传感器网络能满足对监测区域全覆盖的需求,这直接反映了网络的服务质量(QoS)。为尽量延长网络全覆盖时间,本文提出了一种全覆盖需求的水下传感器网络覆盖保持算法(Full-coverage Required Coverage-preserving Algorithm,FCCP)。首先,通过构建覆盖集的方法选举根节点,覆盖集的每个元素根据覆盖需求部分或完全覆盖该节点的感知区域;然后,使网络中的冗余节点休眠,节点选择其覆盖冗余度最高的父节点作为下一跳节点,形成树形路由;最后,节点通过多跳方式将采集的数据发送至Sink节点。与以全覆盖为目标的能量感知覆盖保持分层式路由协议(Energy-aware Coverage-preservingHierarchical Routing Protocol,ECHR)相比,FCCP算法减少了网络能耗,延长了实现全覆盖的网络生存期。In Underwater Sensor Networks, it usually requires meeting the demand for full coverage over the targeted region,which directly reflects the network quality of service （Qos）. In order to extend network lifetime of full coverage, we propose a full-coverage required coverage-preserving algorithm for Underwater Sensor Networks （FCCP）. At first, the algorithm elects the root node by constructing a cover set, each element of the cover set could cover the sensing region of the node partially or completely. Then, make the redundant nodes of the network sleep, each node chooses the node with the highest coverage redundancy（CR） in the parent nodes as the next hop node, and form a tree routing. Finally, each node sends the sensed data to the Sink node using multi-hop routing. Compared to the energy-aware coverage-preserving hierarchical routing protocol （ ECHR ） for the purpose of full coverage,FCCP effectively reduces network energy consumption and extends the network lifetime of full coverage.

关 键 词：水下传感器网络 全覆盖 覆盖保持 冗余节点 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]