A RSSI-Based DV-Hop Algorithm for Wireless Sensor Networks

Tian, Shujian; Zhang, Xin Ming; Liu, Pengxi; Sun, Peng; Wang, Xinguo

doi:10.1109/wicom.2007.636

Cited by 65 publications

(32 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…al. [4] proposed one of the enhancements over conventional DV Hop using RSSI to estimate the distance given reachable hops within radio range. In 2011, H. Wu and R. Gao [5] introduced an improvement to adjust the hop size selection process where instead of using the least hop count as hop size, the averaging hop size was multiplied to the hop count resulting in low location error.…”

Section: Range Free Localization Methodsmentioning

confidence: 99%

Localization: A Modified DV-Hop Localization Algorithm in Wireless Sensor Network

Gupta¹

2017

IJCA

View full text Add to dashboard Cite

Today wireless sensor network has become a primal technology for different kinds of resourceful environment. Sensor node localization specifying where a given sensor node is physically or relatively located is extremely crucial for majority of the programmes in wireless sensor networks. Localization has been key out as one of the leading subject in Wireless Sensor Network (WSN). Many localization algorithms have been proposed for wireless sensor network. In the present work we first review and estimate the shortcomings of the self-positioning existing DV-HOP algorithm i.e. its localization error and accuracy. Finally, a more precise positioning modified DV-HOP algorithm has been presented. The work has been simulated in MATLAB.

show abstract

Section: Range Free Localization Methodsmentioning

confidence: 99%

Localization: A Modified DV-Hop Localization Algorithm in Wireless Sensor Network

Gupta¹

2017

IJCA

View full text Add to dashboard Cite

show abstract

“…Given the location of an access point and a client's distance to the access point (e.g., estimated through RSS measurements), it is known that the client is positioned somewhere along the circumference of a circle centered at the access point's position with a radius equal to the client-access point distance. In 2-D space, distance measurements from at least three non collinear access points are required to obtain a unique location (i.e., the intersection of three circles) [11][12][13][14]. In three dimensions, distance measurements to at least four non-coplanar access points are required.…”

Section: Trilaterationmentioning

confidence: 99%

Location Determination of Dynamically Moving Mobile Nodes in Real Time

K¹,

B²

2016

J Telecommun Syst Manage

View full text Add to dashboard Cite

In today's world as the internet users become more mobile, hence the need for location determination is a key need to provide services based on location, but many devices do not have GPS receivers or transmitters, hence the location determination of these devices is important to provide the location based services, like Advertisements, security, so forth. Location determination of mobile devices has been there for some time but most approaches are based on client intervention, so they are not suitable for integrating in security related components like intrusion detection systems or access control systems. In this paper we propose an approach based on that works on concept of trilateration to determine client location without his/her intervention.

show abstract

“…A straightforward translation to actual distances on the nonanchor nodes in meter is then achieved by simple multiplication of the average hop lengths and their hop distance counts. RSSI-based DV-hop (RDV) improves the simple DV-hop performance by replacing the hop count to the RSSI based distance measurements [13].…”

Section: Related Workmentioning

confidence: 99%

Constrained Cross Entropy Localization Technique for Wireless Sensor Networks

Azim¹,

Aung²,

Xiao³

et al. 2015

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Challenges in wireless sensor networks (WSNs) localization are diverse. Addressing the challenges in cross entropy (CE) localization utilizing cross entropy optimization technique in turn minimizes the localization error with a reasonable processing cost and provides a balance between the algorithmic runtime and error. The drawback of such minimization commonly known as flip phenomenon introduces errors in the derived locations. Beyond CE, the whole class of localization techniques utilizing the same cost function suffers from the same phenomenon. This paper introduces constrained cross entropy (CCE), which enhances the localization accuracy by penalizing the identified sensor nodes affected by the aforementioned flip phenomenon in the neighborhood through neighbor sets. Simulation results comparing CCE with both simulated annealing-(SA-) based and original CE localization techniques demonstrate CCE's superiority in a consistent and reliable manner under various circumstances thereby justifing the proposed localization technique.

show abstract

A RSSI-Based DV-Hop Algorithm for Wireless Sensor Networks

Cited by 65 publications

References 9 publications

Localization: A Modified DV-Hop Localization Algorithm in Wireless Sensor Network

Localization: A Modified DV-Hop Localization Algorithm in Wireless Sensor Network

Location Determination of Dynamically Moving Mobile Nodes in Real Time

Constrained Cross Entropy Localization Technique for Wireless Sensor Networks

Contact Info

Product

Resources

About