With the development of sensor techniques, low-power and inexpensive wireless sensors have been put
into application, then the wireless sensor networks have appeared. Wireless sensor networks can be applied to many
areas and have become a new research focus. Many applications of wireless sensor networks are based on sensor
self-positioning, which depend on knowing the location of sensor nodes. So the location techniques of sensor nodes are
being important.
In this article, the principles and characteristics of wireless networks are discussed and presented. The taxonomy for
wireless sensor networks localization systems is described. The principles and characteristics of some representative
range-free localization approaches are also discussed. The article focuses on the investigation of DV-Hop location
algorithm after contrast it with other range-free algorithms. DV-Hop localization uses a mechanism that is similar to
classical distance vector routing which uses the product of hops and hopsize to represent the distance. We use VC++ to
simulate this algorithm and point out matters needed attention. After got the simulation results, we analyze the result at
length, and focus at nodes density and other factors which influence location accuracy, and the reason of the effect is
discussed in detail.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.