Localization using Centroid in Wireless Sensor Networks

무선 센서 네트워크에서 위치 측정을 위한 중점 기 법

  • 김숙연 (한경대학교 컴퓨터공학과) ;
  • 권오흠 (부경대학교 전자컴퓨터정보통신공학부)
  • Published : 2005.10.01

Abstract

Localization in wireless sensor networks is essential to important network functions such as event detection, geographic routing, and information tracking. Localization is to determine the locations of nodes when node connectivities are given. In this paper, centroid approach known as a distributed algorithm is extended to a centralized algorithm. The centralized algorithm has the advantage of simplicity. but does not have the disadvantage that each unknown node should be in transmission ranges of three fixed nodes at least. The algorithm shows that localization can be formulated to a linear system of equations. We mathematically show that the linear system have a unique solution. The unique solution indicates the locations of unknown nodes are capable of being uniquely determined.

무선 센서 네트워크에서 노드들의 위치를 측정하는 문제는 사건탐지, 라우팅, 정보추적 등의 중요한 네트워크 기능을 수행하기 위해 필수적으로 해결해야 한다. 위치측정 문제는 노드들 간의 연결성이 알려져 있을 때 네트워크의 모든 노드의 위치를 결정하는 문제이다. 본 논문에서는 분산 알고리즘인 중점기법을 중앙 집중적인 알고리즘으로 확장한다. 확장된 알고리즘은 단순하다는 중점 기법의 장점을 지니면서도 각 미지 노드가 세 개 이상의 고정 노드들의 중첩된 전송 범위에 속해야 한다는 단점을 갖지 않는다. 본 논문의 알고리즘은 위치 측정 문제가 일차원 행렬 방정식으로 정형화 될 수 있음을 보여준다. 이러한 일차원 행렬 방정식이 유일한 해를 가짐을 수학적으로 증명함으로써 모든 미지 노드들의 위치를 유일하게 결정할 수 있음을 보인다.

Keywords

References

  1. G. H. Forman and J. Zahorjan. The challenges of mobile computing. IEEE Computer, 27(4):38-47, Apr. 1994 https://doi.org/10.1109/2.274999
  2. M. Weiser. Some computer science problems in ubiquitous computing. Communications of ACM, July 1993 https://doi.org/10.1145/159544.159617
  3. B. Karp and H. T. Kung. GPSR: Greedy perimeter stateless routing for wireless networks. The International Conference on Mobile Computing and Networking (MOBICOM) 2000
  4. S. Meguerdichian, F. Koushanfar, G. Qu, and M. Potkonjak. Exposure in wireless ad-hoc sensor networks. The International Conference on Mobile Computing and Networking (MOBICOM) 2001 https://doi.org/10.1145/381677.381691
  5. B. Hofmann-Wellenhof, H. Lichtenegger, and J. Collins. Global positioning system. Theory and Practice, Fourth Edition. Springer-Verlag, 1997
  6. N. Bulusu, J. Heidemann and D. Estrin. GPS-less low cost outdoor localization for very small devices. IEEE Personal Communications Magazine, 7(5):28-34, October 2000 https://doi.org/10.1109/98.878533
  7. L. Doherty, K. Pister, and L. El Ghaoui. Convex position estimation in wireless sensor networks. In Proc. of IEEE Infocom 2001 https://doi.org/10.1109/INFCOM.2001.916662
  8. N. Sundaram and P. Ramanathan. Connectivity-based location estimation scheme for wireless ad hoc networks. In IEEE Globecom 2002 https://doi.org/10.1109/GLOCOM.2002.1188058
  9. Y. Shang, W. Ruml, Y. Zhang, and M. Fromherz. Localization from mere connectivity. In Proc. of Intl. Symp, on Mobile Ad Hoc Networking and Computing (MOBIHOC), 2003 https://doi.org/10.1145/778415.778439
  10. H. Breu and D. G. Kirkpatrick. Unit disk graph recognition is NP-hard. Computational Geometry Theory and Applications, 9(1-2):3-24, 1998 https://doi.org/10.1016/S0925-7721(97)00014-X
  11. F. Kuhn, T. Moscibroda, and R. Wattenhofer. Unit disk graph approximation. In Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M), 2004 https://doi.org/10.1145/1022630.1022634
  12. T. He, C. Huang, B. Blum, J. Stankovic, and T. Abdelzaher. Range-free localization schemes in large scale sensor networks. The International Conference on Mobile Computing and Networking (MOBICOM), 2003 https://doi.org/10.1145/938985.938995
  13. R. Nagpal, H. Shrobe, and J. Bachrach. Organizing a global coordinate system from local information on an ad hoc sensor network. In Proc. of Information Processing in Sensor Networks(IPSN), 2003
  14. D. Niculescu and B. Nath. DV-based positioning in ad hoc networks. Telecommunication Systems, 22(1-4):267-280, July 2003 https://doi.org/10.1023/A:1023403323460
  15. 김재호, 김영섭, 박옥선, 김성희, 유비쿼터스 위치기반 서비스 및 위치인식시스템 연구 동향, ETRI 주간기술동향, 2003, 12, 24
  16. S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory, SIAM, 1994
  17. Y. Nesterov and A. Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming, SIAM, 1994
  18. 설동렬, 자동조절자 내부점 방법을 위한 선형방정식 해법. 경영과학 21(2): 43-60, Nov. 2004
  19. R. L. Burden, and J. D. Fairs, Numerical Analysis, 3d edition, PWS Publishers, pp. 322 and 336, 1985
  20. S. J. Leon, Linear Algebra with Applications, 6th ed. Prentice Hall, chapter 6, 2001
  21. T. Moscibroda, R. O'Dell, M. Wattenhofer, and R. Wattenhofer. Virtual coordinates for ad hoc and sensor networks. In Proceedings of 2nd Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), 2004 https://doi.org/10.1145/1022630.1022633