检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:单好民[1] SHAN Haomin(College of artificial intelligence of Zhejiang Technical College of Posts and Telecom,Shaoxing 312366,Zhejiang,China)
机构地区:[1]浙江邮电职业技术学院人工智能学院,浙江绍兴312366
出 处:《电子信息对抗技术》2022年第4期76-81,共6页Electronic Information Warfare Technology
基 金:浙江省教育厅科研项目资助(Y202044998)。
摘 要:为了延长有向传感网络(Directional Sensor Networks,DSNs)的网络寿命和提高目标覆盖质量,提出目标覆盖感知的簇构建算法(Target Coverage Aware-based Clustering,TCAC)。TCAC算法在选择簇头时,考虑了节点扇区信息。先寻找可行扇区,再计算可行扇区的优先级。然后,结合可行扇区优先级、节点离信宿距离以及能量信息,选择最优的节点作为簇头。非簇头节点(簇成员)依据离邻近簇头距离,择优选择簇头作为自己的簇头,进而形成簇。仿真结果表明,相比基于目标覆盖的分布式簇(Target Coverage through Distributed Clustering,TCDC)算法,TCAC算法在网络寿命、簇-目标-覆盖率和开销方面存在优势。In order to long the network lifetime and improve the effective coverage of the targets,Target Coverage Aware-based Clustering(TCAC)algorithm is proposed.Node sector information is taken into account by TCAC when selecting cluster headers.Firstly,the feasible sectors are searched,and then the priority of feasible sectors is calculated.Then,the optimal node is selected as cluster head by combining feasible sector priority,distance from the node to the destination and energy information.The cluster heads are selected by non-cluster-head nodes(cluster members)as their cluster head according to the distance from neighboring cluster heads,and then cluster are formed.The simulation outcomes depict that the proposed TCAC performs better than the TCDC algorithm in terms of cluster-coverage ratio,network lifetime,and overhead.
分 类 号:TP212.9[自动化与计算机技术—检测技术与自动化装置] TN929.5[自动化与计算机技术—控制科学与工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.144.200.28