Performance relationship between distributed and centralised cooperative localisations

• Published in: Electronics letters Vol. 50; no. 2; pp. 127 - 128
• Main Authors: Shi, Yulong, Cui, Qimei, Cao, Siqi, Zhang, Xuefei, Tao, Xiaofeng
• Format: Journal Article
• Language: English
• Published: Stevenage The Institution of Engineering and Technology 16.01.2014; Institution of Engineering and Technology; John Wiley & Sons, Inc
• Subjects: Algorithmics. Computability. Computer arithmetics; Algorithms; Applied sciences; centralised cooperative localisation algorithm; Computer science; control theory; systems; cooperative communication; Correlation analysis; CrameÌr–Rao lower bounds; distributed algorithms; distributed cooperative localisation algorithm; estimation theory; Exact sciences and technology; infinite iterations; iterative methods; Lower bounds; mobile computing; performance relationship; Theoretical computing; Wireless communications; iterative methods; mobile computing; estimation theory; distributed cooperative localisation algorithm; centralised cooperative localisation algorithm; distributed algorithms; infinite iterations; performance relationship; CrameÌ r–Rao lower bounds; cooperative communication; Iterative method; Two dimensional model; Processor; Algorithm performance; Distributed algorithm; Cramer Rao inequality
• ISSN: 0013-5194; 1350-911X; 1350-911X
• DOI: 10.1049/el.2013.3452

Cooperative localisation can be classified into distributed and centralised algorithms. However, thorough theoretical analysis on the discrepancy and correlation of their performances has not yet been given by existing researches. Presented are different Cramér-Rao lower bounds for these two kinds of algorithms and the performance relationship is investigated through their own lower bounds. Furthermore, it is theoretically proved that after infinite iterations, distributed and centralised algorithms have the identical lower bound.