CAJ | 학술논문

着重设计了一种基于二跳生成树的可扩展分簇定位算法.首先对传感器网络进行分簇、并利用簇头节点构造一个二跳生成树;在此基础上,由簇头计算各簇成员节点的局部坐标;最后,从生成树根节点开始,自顶向下合并各簇,生成所有节点的全局坐标,完成节点的相对定位.理论分析与实验表明,本算法相对于现有的SDGPSN算法,能够有效提高定位覆盖率和定位精度,减少时间和通信开销,并具有更好的可扩展性.
착중설계료일충기우이도생성수적가확전분족정위산법.수선대전감기망락진행분족、병이용족두절점구조일개이도생성수;재차기출상,유족두계산각족성원절점적국부좌표;최후,종생성수근절점개시,자정향하합병각족,생성소유절점적전국좌표,완성절점적상대정위.이론분석여실험표명,본산법상대우현유적SDGPSN산법,능구유효제고정위복개솔화정위정도,감소시간화통신개소,병구유경호적가확전성.
The proposed localization algorithm first generates clusters and a spanning tree consisting of cluster heads, and then the cluster head computes local coordinates of all member nodes in the cluster. Finally, it generates a global coordinate of all nodes through the above spanning tree. Analysis and simulation show that the proposed algorithm has higher cover rate and precision of localization, lower network traffic, less time consumption, and higher scalability than the existing SDGPSN.