首页 | 官方网站   微博 | 高级检索  
     

EasiFCCT:一种保证连通性的传感器网络局部覆盖算法
引用本文:刘巍,崔莉,黄长城.EasiFCCT:一种保证连通性的传感器网络局部覆盖算法[J].计算机研究与发展,2008,45(1):196-204.
作者姓名:刘巍  崔莉  黄长城
作者单位:1. 中国科学院计算技术研究所,北京,100080;中国科学院研究生院,北京,100049
2. 中国科学院计算技术研究所,北京,100080
基金项目:国家自然科学基金 , 国家自然科学基金 , 国家重点基础研究发展计划(973计划)
摘    要:调度节点轮流工作可以有效延长网络寿命,然而现有的调度协议大部分需要地理位置信息,引入了额外的负担;一些不需要地理位置信息的节点密度控制算法又无法保证有效的网络覆盖度.此外,已有的分析证明了随机算法可以以较大概率保证一定的网络覆盖度,但是因其没有考虑到节点的非连通性会导致网络出现不连通的情况,所以具有一定局限性.提出的局部覆盖算法在随机调度的基础上同时考虑节点的连通性,可以保证网络在具有一定的有效覆盖度的同时能够连通工作.仿真结果表明,算法在网络有效覆盖度方面要优于已有的工作,同时由于新算法建立在随机调度的基础上,因此其复杂度低,较易实现.

关 键 词:局部覆盖  节点休眠  分组调度  连通性  同步
修稿时间:2007年5月3日

EasiFCCT:A Fractional Coverage Algorithm for Wireless Sensor Networks
Liu Wei,Cui Li,Huang Changcheng.EasiFCCT:A Fractional Coverage Algorithm for Wireless Sensor Networks[J].Journal of Computer Research and Development,2008,45(1):196-204.
Authors:Liu Wei  Cui Li  Huang Changcheng
Abstract:Scheduling nodes to work alternately can prolong network lifetime effectively.Existing solutions usually depend on geographic information which may introduce extra costs and compromise the overall effectiveness.Other node density control algorithms without geographic information do not guarantee a certain effected coverage degree.Analysis on pure stochastic-sleep scheduling mechanism reveals that a certain coverage degree can be met when numbers of nodes are at a certain level.However,the mechanism does not consider network connectivity and therefore its applicability is limited.A new definition of effected coverage is proposed to describe the network coverage maintaining network connectivity at the same time.And based on the definition of effected coverage,a new fractional coverage algorithm is proposed.The algorithm proposed in this paper takes network connectivity into account while maintaining a certain degree of effective coverage.Simulation shows that the proposed algorithm is superior to some existing algorithms in effectiveness,especially in effected coverage.EasiFCCT is designed on the basis of stochastic-sleep scheduling mechanism;so the random property of the proposed algorithm enables an easy implementation.This work is on the assumption that the network system is synchronized,which can be met by using some other algorithm.And the application of this algorithm in asynchronized system remains to be studied in the future.
Keywords:fractional coverage  node sleeping  grouped node scheduling  connectivity  synchronization
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号