首页 | 本学科首页   官方微博 | 高级检索  
     

无交集节点分组实现多重覆盖的算法
引用本文:周东清,凌超. 无交集节点分组实现多重覆盖的算法[J]. 计算机工程与设计, 2008, 29(18)
作者姓名:周东清  凌超
作者单位:大连理工大学,计算机技术研究所,辽宁,大连,116023;大连理工大学,计算机技术研究所,辽宁,大连,116023
摘    要:为了监测某些关键区域,通常采用传感器节点的冗余布置.分析了如何利用冗余节点以提升网络服务时间,以提高服务质量这一问题.研究了冗余布置条件下的实现多重覆盖这一服务要求,提出了一个基于分组覆盖的多重覆盖解决方案,设计了分组算法.实验结果表明,该分组算法比随机选择分组算法能有效的增加所得组数,它延长网络生存时间,提高服务质量.

关 键 词:无线传感器网络  服务时间  冗余布置  多重覆盖  无交集划分

Solution for multi-coverage based on disjoint-subsets division
ZHOU Dong-qing,LING Chao. Solution for multi-coverage based on disjoint-subsets division[J]. Computer Engineering and Design, 2008, 29(18)
Authors:ZHOU Dong-qing  LING Chao
Affiliation:ZHOU Dong-qing,LING Chao(Department of Computer Science,Dalian University of Techology,Dalian 116023,China)
Abstract:In order to detect some critical area,it will deploy a large number of sensors.How to make use of the redundancy to prolong the survivable time of networks.This is also a critical aspect on deal with the power-constrained wireless sensor and improves the QoS of the network.A solution is proposed to cope with these requirements,and an algorithm to obtain more disjoint-subsets than a random select method is given.Simulation results are presented to verify the new method achieves a significant time prolonging ...
Keywords:wireless sensor networks  server time  redundant deployment  multi-coverage  disjoint division  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号