PROJECT TITLE :

A Historical-Beacon-Aided Localization Algorithm for Mobile Sensor Networks

ABSTRACT:

Range-free localization approaches are price-effective for mobile sensor networks (as a result of no extra hardware support is needed). But, existing vary-free localization approaches for mobile sensor networks suffer from either sparse anchor node problem or high communication price. Because of economic issues, mobile sensor networks usually have sparse anchor nodes which makes most range-free localization algorithms inaccurate. On the opposite hand, thanks to the ability limitation of mobile sensor nodes (i.e., they're battery-operated) and high power consumption by communication, high communication price will significantly cut back the network life time. For solving these two problems, in this paper, we use historical beacons (i.e., anchor nodes’ announcements delivered in previous time slots) and received signal strength (RSS) to derive 3 constraints. By the aid of the three constraints, we tend to introduce an occasional-communication-value vary-free localization algorithm (solely one-hop beacon broadcasting is required). In keeping with the theoretical analysis and simulation results, our 3 constraints can indeed improve the accuracy. Simulation results conjointly show that our algorithm outperforms even in irregular-radio-signal environments. In addition, a hardware implementation running on sensor nodes, Octopus Xs, confirms theoretical analysis and simulation results.