A Historical-Beacon-Aided Localization Algorithm for Mobile
Sensor Networks
ABSTRACT:
Range-free localization approaches are cost-effective for mobile sensor networks(because no
additional hardware support is required). However, existing range- free localization approaches
for mobile sensor networks suffer from either sparseanch or node problem or high
communication cost. due to economic considerations, mobile sensor networks typically have
sparse anchor nodes which makes most range-free localization algorithms inaccurate. #n the
other hand, due to the power limitation of mobile sensor nodes (i.e., they are battery-operated)
and high power consumption by communication, high communication cost will significantly
reduce 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 three constraints.'" the aid of the three constraints, we introduce a lowcommunication-cost range-free localization algorithm (only one-hop beacon broadcasting is
required).according to the theoretical analysis and simulation results, our three constraints can
indeed improve the accuracy. Limulati on results also show that our algorithm outperforms even
in irregular-radio-signal environments. in addition, a hardware implementation running on sensor
nodes, actopus is, confirms theoretical analysis and simulation results.
Existing system:
range-based localization algorithm calculates locations with absolute point-to- point distances,
while a range-free localization algorithm calculates locations without these distances.
Disadvantages for existing system

It is impractical to equip each sensor node with GPS device in large-scale WNS.
Further Details Contact: A Vinay 9030333433, 08772261612
Email: info@takeoffprojects.com | www.takeoffprojects.com
PROPOSED SYSTEM:
In this paper, we introduce a range-free localization algorithm for mobile sensor node networks.
In order to address the sparse anchor node problem and high communication cost problem, our
algorithm full" utilizes the advantages of the communication ranges (of nodes), historical
beacons, and RSS (of beacons), which are free of communication cost. the best of our
knowledge, our algorithm is the first one to use the R&& of historical beacons in mobile sensor
node localization. our algorithm includes three new constrained regions.
constrained region is a region that can cover the location of the target normal node, e.g., the
communication range of a one-hop neighboring anchor node (which is widel" adopted in existing
range-free algorithms.
three types of RSS-constrained regions2
Current-current-RSS-constrained region (33-region, for short),
Current-historical-RSS constrained region (3H-region, for short), and
Historical-historical-RSS-constrained region (HH-region, for short).
Advantages:
1.our algorithm has low communication cost (only one-hop beacon broadcasting is required).
imulation results also show that our algorithm outperforms even in irregular-radio-signal
environments.
2.according to the theoretical analysis and simulation results, the threeconstrained regions can
indeed improve the localization accuracy.
Algorithm used:
1.The hitball algorithm
Further Details Contact: A Vinay 9030333433, 08772261612
Email: info@takeoffprojects.com | www.takeoffprojects.com
SYSTEM CONFIGURATION:HARDWARE CONFIGURATION:-
 Processor
-
Pentium –IV
 Speed
-
1.1 Ghz
 RAM
-
256 MB(min)
 Hard Disk
-
20 GB
 Key Board
-
Standard Windows Keyboard
 Mouse
-
Two or Three Button Mouse
 Monitor
-
SVGA
SOFTWARE CONFIGURATION:-
 Operating System
: Windows XP
 Programming Language
: JAVA/J2EE
 Java Version
: JDK 1.6 & above.
 Database
: MYSQL
Further Details Contact: A Vinay 9030333433, 08772261612
Email: info@takeoffprojects.com | www.takeoffprojects.com
Further Details Contact: A Vinay 9030333433, 08772261612
Email: info@takeoffprojects.com | www.takeoffprojects.com