Refined Anchor Free Localisation for Wireless Sensor Monitoring in Wireless Sensor Networks
Journal Title: Indian Journal of Computer Science and Engineering - Year 2011, Vol 2, Issue 2
Abstract
Localisation is required for many ad-hoc sensor network applications. In this paper we look at the limitations of the existing localisation technique, Anchor Free Localisation (AFL) with regards to coping with non-uniform anchor distributions and errors in ranging information. We present a refined approach called Refined Anchor Free Localisation (R-AFL) that uses a combination of mobile anchor scenarios for anchor information distribution, along with statistical techniques for performing localisation with inaccurate range data. This algorithm is a centralized incremental algorithm. In this algorithm we sue actual distance information instead of hop counts. Since hop counts does not reflect the true distances existing between them. Our algorithm stays in a base station and starts as soon as all the sensors send their local information to its base station. Simulations with our refined approach have shown significant reductions (in the order of magnitude range) to the required processing for performing statistical localisation over previous attempts, as well as improving the generated location information in situations with nontotal anchor information coverage, making possible a wider range of applications.
Authors and Affiliations
M. JAMES STEPHEN , P. V. G. D PRASAD REDDY , SURESH CHITTINENI
Keywords
Related Articles
- EP ID EP155396
- DOI -
- Views 108
- Downloads 0
PERFORMANCE EVALUATION OF PARALLEL APPLICATIONS USING MESSAGE PASSING INTERFACE IN NETWORK OF WORKSTATIONS OF DIFFERENT COMPUTING POWERS
A network created from so called commodity hardware can effectively and affordably be used for high performance computing. Major attraction from such networks is cost-effectiveness due to efficient utilization of existin...
Discovering Non-Redundant Association Rules using MinMax Approximation Rules
Frequent pattern mining is an important area of data mining used to generate the Association Rules. The extracted Frequent Patterns quality is a big concern, as it generates huge sets of rules and many of them are redund...
AN EFFICIENT APPROACH TO PERFORM PRE-PROCESSING
Nowadays, WWW (World Wide Web) becomes more popular and user friendly for transferring information. Therefore people are more interested in analyzing log files which can offer more useful insight into web site usage. Web...
AN IMPROVED DOMAIN CLASSIFICATION SCHEME BASED ON LOCAL FRACTAL DIMENSION
In fractal image compression, most of the time during encoding is spent for finding the best matching pair of range-domain blocks. Different techniques have been analyzed for decreasing the number of operations required...
Comparative study on classification power of the attributes and reducts
In rough set theory, reduct are those attributes which are important and are able to represent the whole range of attributes. They show up the important features of database. In the present study of educational data mini...