Evaluation and Analysis of Node Localization Power Cost in Ad-Hoc Wireless Sensor Networks with Mobility

One of the key concerns with location-aware Ad-hoc Wireless Sensor Networks (AWSNs) is how sensor nodes determine their position. The inherent power limitations of an AWSN along with the requirement for long network lifetimes makes achieving fast and power-efficient localization vital. This research examines the cost (in terms of power) of network irregularities on communications and localization in an AWSN. The number of data bits transmitted and received are significantly affected by varying levels of mobility, node degree, and network shape. The concurrent localization approach, used by the APS-Euclidean algorithm, has significantly more accurate position estimates with a higher percentage of nodes localized, while requiring 50% less data communications overhead, than the Map-Growing algorithm. Analytical power models capable of estimating the power required to localize are derived. The average amount of data communications required by either of these algorithms in a highly mobile network with a relatively high degree consumes less than 2.0% of the power capacity of an average 560mA-hr battery. This is less than expected and contrary to the common perception that localization algorithms consume a significant amount of a node\u27s power

Range-free selective anchor node center of the smallest communication overlap polygon localization algorithm in wireless networks

International audienceThis paper presents a range-free selective anchor node center of the smallest communication overlap polygon localization algorithm in wireless networks. The algorithm is range-free which does not require ranging devices. To estimate the location of unknown (location unaware) nodes it uses node connectivity based on selected anchor (location aware) nodes. The algorithm first selects appropriate anchor nodes. Then, the True Intersection Points (TIPs) constituting the vertices of the smallest communication overlap polygon (SCOP) of these selected anchor nodes' communication ranges are found. Finally, the location of the unknown node is estimated at the center of the SCOP which is formed from these TIPs. The algorithm performance is evaluated using MatLab simulation and compares favorably to state-of-the-art algorithms: Centroid, improved version of CPE, Mid-perpendicular and CSCOP localization algorithms. The results show the proposed algorithm outperforms other state-of-the-art algorithms in location accuracy and it has reasonable computational complexity

Novel range-free immune to radio range difference (IRRD) geo-localization algorithm in wireless networks

This paper presents a novel range-free immune to radio range difference (IRRD) geo-localization algorithm in wireless networks. The algorithm does not require the traditional assumption of anchor (location aware) nodes that have the same communication range as it works with anchor nodes having homogeneous and/or heterogeneous communication ranges. It is rang-free - it utilizes node connectivity to estimate the position of unknown (location unaware) nodes using two or more anchor nodes. The algorithm works in two steps: in the first step, the True Intersection Points (TIPs) forming the vertices of the smallest communication overlap polygon (SCOP) of the anchor nodes are found. In the second step, it estimates the position of the unknown node at the center of the SCOP which is formed from these TIPs. The problem is first geometrically and mathematically modeled, then new localization approach that does not assume anchor nodes have the same radio range is proposed