The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Cooperative Localization in Wireless Networks
|
Author(s): Yunlong Wang (Tsinghua University, China), Yang Cai (Tsinghua University, China)and Yuan Shen (Tsinghua University, China)
Copyright: 2018
Pages: 42
Source title:
Positioning and Navigation in Complex Environments
Source Author(s)/Editor(s): Kegen Yu (Wuhan University, China)
DOI: 10.4018/978-1-5225-3528-7.ch006
Purchase
|
Abstract
This chapter describes cooperative localization in wireless networks, where mobile nodes with unknown positions jointly infer their positions through measuring and exchanging information with each other. The technique of cooperation localization, efficiently even in harsh propagation environment, enables amounts of location-based services that rely on high-accuracy position information of mobile nodes. After a brief introduction of cooperative localization, the Cramer-Rao lower bound is given as a standard metric for performance. Then the information in the temporal and spatial domain is illustrated with geometrical interpretations. Two classes of cooperative localization algorithms, namely, centralized and distributed algorithms, are presented to show the implementation of the cooperative localization in a wireless network. Then the performance of cooperative localization under non-line-of-sight condition is analyzed. Lastly, numerical results are given to illustrate the performance of cooperative localization algorithms.
Related Content
J. Mangaiyarkkarasi, J. Shanthalakshmi Revathy.
© 2024.
34 pages.
|
Gummadi Surya Prakash, W. Chandra, Shilpa Mehta, Rupesh Kumar.
© 2024.
22 pages.
|
Duygu Nazan Gençoğlan.
© 2024.
35 pages.
|
Smrity Dwivedi.
© 2024.
20 pages.
|
Pallavi Sapkale, Shilpa Mehta.
© 2024.
21 pages.
|
Pardhu Thottempudi, Vijay Kumar.
© 2024.
43 pages.
|
Sathish Kumar Danasegaran, Elizabeth Caroline Britto, S. Dhanasekaran, G. Rajalakshmi, S. Lalithakumari, A. Sivasangari, G. Sathish Kumar.
© 2024.
18 pages.
|
|
|