Distributed spectral conjugate gradient algorithm for node localization in wireless sensor networks

Node localization is a key problem in wireless sensor networks (WSNs). Most existing centralized algorithms require processing data from the entire graph at each operation, leading to high computational load and making scalability difficult as the graph size increases. In this paper, a novel distrib...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Digital signal processing Ročník 162; s. 105165
Hlavní autoři: Jiang, Junzheng, Liu, Xinyi, Zhou, Fang
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.07.2025
Témata:
Distributed spectral conjugate gradient
Node localization
Non-convex optimization
Scalability
Wireless sensor networks
Wireless sensor networks
Non-convex optimization
Scalability
Node localization
Distributed spectral conjugate gradient
ISSN:1051-2004
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Node localization is a key problem in wireless sensor networks (WSNs). Most existing centralized algorithms require processing data from the entire graph at each operation, leading to high computational load and making scalability difficult as the graph size increases. In this paper, a novel distributed spectral conjugate gradient (DSCG) algorithm is proposed to solve the original optimization problem directly, in which the gradient vector and step-size are approximately calculated via a distributed manner in each iteration. The approximation calculation is based on decomposition of graph capturing the WSNs structure. The proposed algorithm can improve scalability while maintaining good localization accuracy. Experimental results verify the effectiveness of the proposed algorithm.
ISSN:1051-2004
DOI:10.1016/j.dsp.2025.105165