|
|||||
|
|
| 一种基于二分编码的无线传感器与执行器网络移动覆盖算法 | |
| 引用本文： | 杜景林,郑若钦,谢立,李娟.一种基于二分编码的无线传感器与执行器网络移动覆盖算法[J].计算机科学,2015,42(1):101-105. |
| 作者姓名： | 杜景林 郑若钦 谢立 李娟 |
| 作者单位： | 1. 南京信息工程大学电子与信息工程学院 南京210044;南京大学计算机软件新技术国家重点实验室 南京210023;南京大学计算机科学与技术系 南京210023 2. 南京信息工程大学电子与信息工程学院 南京210044 3. 南京大学计算机软件新技术国家重点实验室 南京210023;南京大学计算机科学与技术系 南京210023 |
| 基金项目： | 本文受国家自然科学基金面上项目(60873026,2,61372128),江苏省科技支撑计划(工业)项目(BE2011195,BE2010178),江苏省高校科研成果产业化推进工程项目(JH10-3),国家“九七三”重点基础研究发展规划(2006CB303000,2009CB320705)资助 |
| 摘 要： | 在无线传感器与执行器网络中,可以通过调整剩余节点的位置来提高目标区域覆盖率,以更好地为sensor节点服务.提出了一种基于二分编码的网络移动覆盖算法(SMR算法).在每次搜索中,试探性地调整失效节点区域的临近执行器节点位置来寻找最佳位置,重复此搜索过程直到覆盖数不再增加,以实现近似的局部最优覆盖.本算法提高了剩余节点的覆盖率,减少了执行器节点移动的消耗,与已有算法相比也表现出了较好的性能. |
| 关 键 词： | 无线传感器与执行器网络 搜索式移动 网络覆盖度 节点失效 |
Mobile Coverage Algorithm Based on Dichotomy Coding for WSANs |
|
| DU Jing-lin,ZHENG Ruo-qin,XIE Li and LI Juan.Mobile Coverage Algorithm Based on Dichotomy Coding for WSANs[J].Computer Science,2015,42(1):101-105. | |
| Authors: | DU Jing-lin ZHENG Ruo-qin XIE Li and LI Juan |
| Affiliation: | College of Electronics and Information Engineering,Nanjing University of Information Science and Technology,Nanjing 210044,China;State Key Laboratory for Novel Software Technology,Nanjing University,Nanjing 210023,China;Department of Computer Science & Technology,Nanjing University,Nanjing 210023,China,College of Electronics and Information Engineering,Nanjing University of Information Science and Technology,Nanjing 210044,China,State Key Laboratory for Novel Software Technology,Nanjing University,Nanjing 210023,China;Department of Computer Science & Technology,Nanjing University,Nanjing 210023,China and College of Electronics and Information Engineering,Nanjing University of Information Science and Technology,Nanjing 210044,China |
| Abstract: | In WSANs,the coverage of the target region can be enhanced by adjusting the location of remaining nodes to serve sensors better.A mobile coverage algorithm based on dichotomy coding was proposed.In each searching process,location of actor nodes near to the area of failure nodes can be adjusted in virtual to find the optimum position.This searching process is repeated until the coverage cannot be increased in order to reach the local optimum approximately.This algorithm improves the coverage rate of the remaining nodes and decreases the consumption of actors during mo-ving.Compared to other existing algorithms,this algorithm has better performance. |
| Keywords: | WSANs Searching move Network coverage Failure node |
| 本文献已被 万方数据 等数据库收录！ | |
| 点击此处可从《计算机科学》下载全文 | |
