Greedy Successive Anchorization for Localizing Machine Type Communication Devices.

Area of Science:

• Wireless communication
• Localization algorithms
• Networked systems

Background:

• Machine Type Communication (MTC) device localization is critical for location-based services.
• Noisy networks and limited anchor availability pose challenges for accurate MTC localization.
• Virtual anchors (VAMs), derived from localized MTC devices, can improve coverage but introduce position errors.

Purpose of the Study:

• To address the challenge of error propagation from VAMs in distributed MTC localization.
• To propose a novel distributed localization algorithm that enhances accuracy in noisy networks.
• To develop a method that enables accurate localization even with insufficient fixed anchors.

Main Methods:

• A greedy successive anchorization process (GSAP) is proposed, involving iterative rounds of anchor selection and localization.
• GSAP greedily selects the three most relevant anchors (AMs and VAMs) to optimize localization accuracy in each round.
• A distributed localization algorithm is employed by each blind MTC machine (BM) using its selected anchors.

Main Results:

• The proposed GSAP method demonstrates improved Root Mean Square Error (RMSE) performance compared to existing localization techniques.
• GSAP's RMSE performance is shown to be consistently close to the theoretical Cramér-Rao Lower Bound (CRLB).
• The greedy anchor selection within GSAP effectively mitigates error propagation from VAMs.

Conclusions:

• GSAP offers a robust solution for distributed MTC localization in challenging, noisy network environments.
• The method successfully overcomes the limitations of VAM error propagation, enhancing overall localization precision.
• GSAP provides a practical and accurate approach for MTC localization, approaching theoretical performance limits.