检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]杭州电子科技大学信息与控制研究所,杭州310018
出 处:《传感技术学报》2009年第5期706-711,共6页Chinese Journal of Sensors and Actuators
基 金:国家自然科学基金项目资助(NSFC-60604024);浙江省科技计划重点项目资助(2008C23097);浙江省教育厅科研计划项目资助(20060246);浙江省高校青年教师资助计划项目资助(ZX060221)
摘 要:针对无线传感器网络在三维空间监测中存在的固有的不确定性与系统应具有较强的容错能力、鲁棒性之间的矛盾,提出了一种基于概率的三维无线传感器网络K-覆盖控制方法。对三维待监测区域以网格建模,用迭代的贪婪启发式方法确定传感器节点在网格中的位置,每一步迭代完成一个节点的放置,直到节点总数达到预设的上界或每个网格点以概率T达到K-覆盖为止。仿真结果表明,相对于传统的随机和均匀配置方法,本方法能使用较少的节点满足相同的覆盖度和监测精度的要求,或使用相同的节点达到更高的覆盖度。并对整个待监测区域中有优先覆盖要求(覆盖度优先和监测精度优先)的局部区域的情况进行了分析。For the contradiction between the inherent uncertainty and strong fault-tolerance ability and robustness required in the system during the three-dimensional monitoring with wireless sensor networks, a probability-based K-coverage control approach for three-dimensional wireless sensor network, PKCCA, is proposed in this paper. The three-dimensional monitoring region is divided into a grid, and a greedy heuristic is used to determine the best placement of one sensor at a time until a preset upper limit on the number of sensors is reached, or K-coverage with probability T of the grid points is achieved. Comparing with the traditional random and uniform deployment, the simulation results indicate PKCCA uses less sensors to achieve the same coverage degree and detection precision or same sensors to reach higher coverage degree. The case of preferential coverage (preferential coverage degree and preferential monitoring precision) for sub-regions is also analyzed and simulated.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.153