Publication

Abstract : Now a days, Wireless Sensor Networks (WSN) are emerging as a challenging and interesting area. Wireless Sensor Network consists of a large number of heterogeneous or homogeneous sensor nodes which communicates through wireless medium and works together to sense or monitor the environment. The number of sensor nodes in a network can vary from hundreds to thousands. The node senses data from environment and sends these data to the gateway node. Mostly WSNs are used for applications such as military surveillance and disaster monitoring. WSNs are multi-hop networks, which depend on the intermediate nodes to relay the data packet to the destination. These nodes are equipped with lesser memory, limited battery power, little computation capability, small range of communication and need a secured and efficient routing path to forward the incoming packet delay by data aggregation) and multipath sensor networks to increase the resilience and reliability of the network. The localization information is crucial for the operation of WSN. There are mainly two types of Localization algorithms. The Range-based localization algorithm has requirements on hardware, thus is expensive to be implemented in practice. The Range-free localization algorithm reduces the hardware cost. In this paper we locate known nodes by placement (DV Hop) in various locations for best result. Our algorithm improves the localization accuracy compared with previous algorithms, which has been demonstrated by the simulating results.