Abstract
Many applications in Wireless Sensor Networks (WSNs) must know the position of sensor nodes in the network. That is, information from the sensors is useful only if node location information is also available. Additionally, some routing protocols use position to determine viable routes. Several localization algorithms have been proposed which can be categorized as: range-based and range-free algorithms. In this paper, the authors propose an Optimized DV-Hop (ODV-Hop), a localization range-free algorithm. The authors have used a new formula for computing the optimal hope size and used Householder algorithm for solving least square localization problem. Finally, simulation results show that the ODV-Hop achieves good location accuracy than normal DV-Hop.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Mobile Computing and Multimedia Communications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
