西安电子科技大学学报 ›› 2022, Vol. 49 ›› Issue (2): 89-96.doi: 10.19665/j.issn1001-2400.2022.02.011

• 信息与通信工程 • 上一篇    下一篇

一种新的传感器节点分布式定位算法

徐莎莎1(),周芳2(),李杨剑1(),蒋俊正1,3()   

  1. 1.桂林电子科技大学 信息与通信学院,广西壮族自治区 桂林 541004
    2.桂林电子科技大学 生命与环境科学学院,广西壮族自治区 桂林 541004
    3.桂林电子科技大学 广西无线宽带通信与信号处理重点实验室,广西壮族自治区 桂林 541004
  • 收稿日期:2020-09-06 出版日期:2022-04-20 发布日期:2022-05-31
  • 通讯作者: 周芳
  • 作者简介:徐莎莎(1998—),女,桂林电子科技大学硕士研究生,E-mail: 19022201050@mails.guet.edu.cn;|李杨剑(1993—),男,桂林电子科技大学硕士研究生,E-mail: 907383163@qq.com;|蒋俊正(1983—),男,教授,E-mail: jzjiang@guet.edu.cn
  • 基金资助:
    国家自然科学基金(61761011);广西自然科学基金(2017GXNSFAA198173)

New distributed positioning algorithm for sensor nodes

XU Shasha1(),ZHOU Fang2(),LI Yangjian1(),JIANG Junzheng1,3()   

  1. 1. School of Information and Communication,Guilin University of Electronic Technology,Guilin 541004,China
    2. School of Life and Environmental Sciences,Guilin University of Electronic Technology,Guilin 541004,China
    3. Guangxi Key Laboratory of Wireless Wideband Communication and SignalProcessing, Guilin University of Electronic Technology,Guilin 541004,China
  • Received:2020-09-06 Online:2022-04-20 Published:2022-05-31
  • Contact: Fang ZHOU

摘要:

大规模无线传感器网络中节点定位问题可以归结为高度非线性非凸的优化问题。该问题在大规模无线传感器网络中难以直接求解,因此提出了一种新的传感器节点分布式定位算法。首先将大规模无线传感器网络构成的全局无向图分解为一系列部分重叠的子图,进而将全局的优化问题分解为一系列小规模的子图内优化问题,每个子图内的优化问题可以独立进行迭代求解。新的传感器节点分布式定位算法每步迭代包含两个步骤,首先使用Barzilai-Borwein梯度法估计出划分好的部分重叠子图中节点的位置,使用的Barzilai-Borwein梯度法具备收敛速度较快,计算复杂度较低的特点,然后再对不同部分重叠的子图内的同一个传感器节点进行融合求平均。通过理论分析和仿真结果表明,新的传感器节点分布式定位算法与已有算法相较,具有较高的扩展性,在大规模无线传感器网络中有较高的定位精度,能满足大规模的无线传感器网络节点的定位需求。

关键词: 无线传感器网络, 定位, 分布式算法, 图模型, Barzilai-Borwein梯度法

Abstract:

The node localization problem in large scale wireless sensor networks can be formulated into a highly nonlinear nonconvex optimization problem which is hard to solve directly in large scale sensor networks.This paper proposes a new distributed localization algorithm to solve this problem.First,the global undirected graph composed of the large scale wireless sensor network is decomposed into a series of partially overlapping subgraphs,and then the global optimization problem is decomposed into a series of small scale subproblems for iterative solutions.The optimization problem in each subgraph can be solved iteratively independently.The new distributed localization algorithm for sensor nodes consists of two steps in each iteration,First,the Barzilai-Borwein gradient method is used to estimate the location of the node in the divided partially overlapping subgraph.The gradient method has a low computational cost and greatly speeds up the convergence.Second,the same sensor nodes in different partially overlapping subgraphs are fused and averaged.Theoretical analysis and simulation results show that compared with the existing methods,the proposed new distributed localization algorithm has a higher scalability and localization accuracy in large scale wireless sensor networks,and can be used for localization in large scale sensor networks.

Key words: wireless sensor networks, localization, distributed algorithm, graph model, Barzilai-Borwein gradient method

中图分类号: 

  • TN911.7
Baidu
map