Journal of Korea Spatial Information System Society (한국공간정보시스템학회 논문지)

Korea Spatial Information System Society (대한공간정보학회)
권호 표지

Weighted Centroid Localization Algorithm Based on Mobile Anchor Node for Wireless Sensor Networks

  • Ma, Jun-Ling (Computer Information Engineering, Inha University) ;
  • Lee, Jung-Hyun (Division of Computer Science and Engineering, Inha University) ;
  • Rim, Kee-Wook (Division of Computer Science and Engineering, Sunmoon University) ;
  • Han, Seung-Jin (School of Information and Media in Kyungin Women's College)
  • Published : 2009.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

Localization of nodes is a key technology for application of wireless sensor network. Having a GPS receiver on every sensor node is costly. In the past, several approaches, including range-based and range-free, have been proposed to calculate positions for randomly deployed sensor nodes. Most of them use some special nodes, called anchor nodes, which are assumed to know their own locations. Other sensors compute their locations based on the information provided by these anchor nodes. This paper uses a single mobile anchor node to move in the sensing field and broadcast its current position periodically. We provide a weighted centroid localization algorithm that uses coefficients, which are decided by the influence of mobile anchor node to unknown nodes, to prompt localization accuracy. We also suggest a criterion which is used to select mobile anchor node which involve in computing the position of nodes for improving localization accuracy. Weighted centroid localization algorithm is simple, and no communication is needed while locating. The localization accuracy of weighted centroid localization algorithm is better than maximum likelihood estimation which is used very often. It can be applied to many applications.

Keywords

References

  1. K.F. Ssu, C.H. Ou, and H. C. Jiau “Localization with mobile anchor points in wireless sensor networks.” IEEE Trans. on Vehicular Technology, Vol.54 No.3, 2005, pp. 1187-1197. https://doi.org/10.1109/TVT.2005.844642
  2. L. Hu and D. Evans “Localization for mobile sensor networks.” in Proc. of ACM MobiCom, 2004.
  3. Y. Ko and N. H. Vaidya “Location aided routing in mobile ad hoc networks.” in Proc. ACM Int. Conf. Mobile Computing and Networking (MOBICOM), Dallas, TX, 1998, pp. 66-75.
  4. N. Bulusu, J. Heidemann, and D. Estrin “GPS-less low cost outdoor localization for very small devices.” IEEE Personal Commun, vol. 7, 2000, pp. 28-34.
  5. T. He, C. Huang, B. M. Blum, J. A. Stankovic, and T. Abdelzaher “Range-free localization schemes for large scale sensor networks.” in Proc. ACM Int. Conf. Mobile Computing Networking(MOBICOM), San Diego, CA, 2003, pp. 81-95.
  6. D. Niculescu and B. Nath “DV based positioning in ad hoc networks.” Kluwer J. Telecommun. Syst, vol. 22 No. 1, 2003, pp. 267-280. https://doi.org/10.1023/A:1023403323460
  7. L. Doherty, L. E. Ghaoui and K. S. J. Pister “Convex position estimation in wireless sensor networks.” In Proceedings of the IEEE INFOCOM '01, Anchorage, AK, 2001.
  8. S. Simic and S. Sastry “Distributed localization in wireless ad hoc networks.” Memorandum No. UCB/ERL M02/26, University of Califormia, Berkeley, 2002.
  9. R. Nagpal, H. Shrobe, and J. Bachrach “Organizing a global coordinate system from local information on an ad hoc sensor network.” In IPSN'03, 2003.
  10. Niculescu D, Nath B. “DV based positioning in ad hoc networks.” Journal of Telecommunication Systems, Vol.22 No4, 2003, pp. 267-280. https://doi.org/10.1023/A:1023403323460
  11. Doherty L, Pister KSJ, Ghaoui LE. “Convex position estimation in wireless sensor networks.” In: Proc. of the IEEE INFOCOM 2001. Anchorage: IEEE Computer and Communications Societies, Vol. l No.3, 2001, pp. 1655-1663.
  12. Theodore S Rappaport, “Principles and Practice. Prentice Hall PTR” Wireless Communications, 1996.
  13. Bahl P, Padmanabhan VN. RADAR, “An inbuilding RF-based user location and tracking system.” In: Proc. of the IEEE INFOCOM 2000, Tel Aviv: IEEE Computer and Communications Societies, Vol.2, 2000, pp. 775-784.
  14. Youngchang Kim, Youngjin Kim, Jaewoo Chang, “Distributed Grid Scheme using S-GRID for Location Information Management of a Large Number of Moving Objects.” Journal of Korea Spatial Information System Society, Vol.10, No.4, 2008, pp. 143-813.
  15. Yang Koo Lee, Keun Ho Ryu, “Historical Sensor Data Management using Temporal Information,” Journal of Korea Spatial Information System Society, Vol.10, No.4, 2008.
  16. Dong Bin Shin, Dong Bin Shin, “A Study on the Application of As-Built Drawings for Updating Digital Maps," Journal of Korea Spatial Information System Society, Vol.10, No.4, 2008.
  17. M. A. Hammad, W. G. Aref, A. K. Elmagarmid, “Stream window join: Tracking moving objects in sensornetwork databases,” In SSDBM, 2003.
  18. Drago Niculescu and B. Nath, “Position and orientation in ad hoc networks.” Ad hoc Networks, Vol.2 No.2, 2002, pp. 133-151. https://doi.org/10.1016/S1570-8705(03)00051-9
  19. M. Sullivan, A. Heybey, “Tribeca: A System for Managing Large Databases of Network Traffic,” In Proc. of USENIX Annual Technical, 1998.
  20. G. R. Hjaltason, H. Samet, “Improved bulkloading algorithms for quadtrees” In Proceedings of the 7th ACM International Symposium on Advances in Geographic Information Systems, pp. 110-115.
  21. M.-L. LO, C. V. Ravishankar, “Spatial joins using seeded trees,” In Proceedings of the ACM SIGMOD Conference, pp. 209-220.