As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
Most of existing localization algorithms for mobile sensor networks are based on the Sequential Monte Carlo (SMC) method. SMC-based methods has either high localization error in low-anchor density environments or high computation cost. In this paper, we propose a low cost localization algorithm. Our idea comes from the observation that a sensor node which hears an another node for a sufficiently long time has trajectory similar to the heard anchor node's trajectory. Simulation shows that our algorithm has low localization error, and low computation cost.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.