The localization of nodes in a wireless sensor network is milestone to the correct functioning of the network. This paper aims to evaluate by means of simulations the Malguki spring localization algorithm. The algorithm is simulated for three different anchor deployment scenarios: the classical scenarios of random and uniform anchors and a novel scenario called hybrid. This paper analyzes the algorithm from the point of view of the obtained average errors, as well as from the point of view of the parameters that influence its results.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Performance analysis of wireless sensor network node localization algorithm


    Contributors:
    Rusnac, R. (author) / Gontean, A. (author)


    Publication date :

    2011-11-01


    Size :

    261648 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Node Localization in Wireless Sensor Network by Ant Lion Optimization

    Dao, Thi-Kien / Pan, Jeng-Shyang / Nguyen, Trong-The et al. | TIBKAT | 2021


    Node Localization in Wireless Sensor Network by Ant Lion Optimization

    Dao, Thi-Kien / Pan, Jeng-Shyang / Nguyen, Trong-The et al. | Springer Verlag | 2021




    Node Selection Strategy for Target Localization in Wireless Sensor Networks

    Deng, K.-b. / Liu, Z. | British Library Online Contents | 2009