IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v9y2013i11p215494.html
   My bibliography  Save this article

Asymmetric Event-Driven Localization Algorithm in Constrained Space

Author

Listed:
  • Ning Wang
  • Xiaolin Qin
  • Xingye Xu

Abstract

Existing technologies are inapplicable to localization in constrained space, especially when considering environmental factors. These methods with low localization accuracy cannot meet the location requirements in constrained space, for they usually call for lots of computation time and process resources. Moreover, they are easily interfered by environmental factors and attacks from other users. Consequently, in order to improve location accuracy in constrained space, an asymmetric event-driven localization algorithm (AELA) is proposed in this paper, which is based on the combination of event distribution and anchor node achieving a distributed location estimation strategy, so that it can satisfy the localization requirement of constrained space and achieve the high-accuracy localization with a small amount of events and anchor nodes. Meanwhile, to improve the accuracy of the algorithm, a set of candidate events are adopted to prune the event which does not meet location accuracy requirements. We finally perform experiments in indoor corridors, and the results show that the proposed algorithm has higher performances not only on localization accuracy and energy consumption but also on anti-interference ability than RSSI and MSP.

Suggested Citation

  • Ning Wang & Xiaolin Qin & Xingye Xu, 2013. "Asymmetric Event-Driven Localization Algorithm in Constrained Space," International Journal of Distributed Sensor Networks, , vol. 9(11), pages 215494-2154, November.
  • Handle: RePEc:sae:intdis:v:9:y:2013:i:11:p:215494
    DOI: 10.1155/2013/215494
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/215494
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/215494?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:9:y:2013:i:11:p:215494. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.