Skip to Main Content
ASME Press Select Proceedings

International Conference on Mechanical and Electrical Technology, 3rd, (ICMET-China 2011), Volumes 1–3

By
Yi Xie
Yi Xie
Search for other works by this author on:
ISBN:
9780791859810
No. of Pages:
906
Publisher:
ASME Press
Publication date:
2011

LCO (Localization with Convex Optimization technique) is a recent localization method which uses connectivity-induced constraints—who is within communications range of whom—to derive the locations of the nodes in the network. However, LCO is an inherently centralized algorithm restricted in many applications. In this paper, we propose a new LNNI (Localization with all Neighbor and Non-neighbor constraints and Iteration) algorithm that can be executed in a distributed fashion. We make extensive simulations to show that the new algorithm that incorporating non-neighbor constraints performs much better than the LCO method that only utilizing neighbor constraints.

Abstract
Key Words
1 Introduction
2. Localization with Convex Optimization Technique (LCO)
3. Localization with all Neighbor and Non-Neighbor Constraints and Iteration (LNNI)
4. Simulation Results and Analysis
5. Conclusions and Future Work
6. Acknowledgment
References
This content is only available via PDF.
Close Modal
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close Modal
Close Modal