Paper Info
Title
Distributed asynchronous localization over WSNs via non-convex consensus ADMM.
Abstract
This paper develops an asynchronous distributed localization algorithm based on consensus alternating direction method of multipliers (ADMM). The proposed algorithm is particularly suited to heterogeneous wireless networks with limited resources. Key features of the proposed algorithm include the capability to tolerate delays, node failures, and lost messages. Even though the localization problem is inherently non-convex, the proposed algorithm converges to a stationary solution. The asynchronous nature of the algorithm allows energy-starved nodes to temporarily fall-back and skip one or more steps in the algorithm. Detailed simulations reveal that the proposed algorithm also provides better performance compared to other state-of-the-art distributed localization algorithms.
Year
Venue
Field
2017
National Conference on Communications NCC
Asynchronous communication,Wireless network,Computer science,Brooks–Iyengar algorithm,Regular polygon,Schedule,Distributed algorithm,Convex function,Wireless sensor network,Distributed computing
DocType
Citations 
PageRank 
Conference
0
0.34
References 
Authors
14
2
Name
Order
Citations
PageRank
Sandeep Kumar171.51
Ketan Rajawat212425.44