Journal of the Korea Institute of Information and Communication Engineering (한국정보통신학회논문지)

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지
DOI QR코드

DOI QR Code

A Tabu Search Algorithm for Minimum Cost Localization Problem in Underwater Sensor Networks

수중 센서 네트워크에서 최소 비용 위치 결정 문제를 위한 타부 서치 알고리즘

  • Jang, Kil-woong (Department of Data Information, Korea Maritime and Ocean University)
  • Received : 2016.12.06
  • Accepted : 2016.12.30
  • Published : 2017.05.31
Download PDF
⟨ Previous Next ⟩

Abstract

All sensor nodes generally determine their positions using anchor nodes that are located in underwater sensor networks. This paper proposes a Tabu search algorithm to determine the minimum number of anchor nodes for the location of all sensor nodes in underwater sensor networks. As the number of the sensor nodes increases in the network, the amount of calculation that determines the number of anchor nodes would be too much increased. In this paper, we propose a Tabu search algorithm that determines the minimum number of anchor nodes within a reasonable computation time in a high dense network, and propose an efficient neighborhood generating operation of the Tabu search algorithm for efficient search. The proposed algorithm evaluates those performances through some experiments in terms of the minimum number of anchor nodes and execution time. The proposed algorithm shows 5-10% better performance than the conventional algorithm.

일반적으로 수중 센서 네트워크에서 모든 센서 노드는 위치가 결정된 앵커 노드를 이용하여 자신의 위치를 결정한다. 본 논문에서는 수중 센서 네트워크에서 모든 센서 노드의 위치를 결정하기 위해 최소의 수를 가진 앵커 노드를 결정하기 위한 타부 서치 알고리즘을 제안한다. 네트워크에서 센서 노드의 수가 증가함에 따라 앵커 노드의 수를 결정하는 계산량은 급격히 늘어나게 된다. 본 논문에서는 밀집도가 높은 네트워크에서 적정한 시간 내에 최소의 앵커 노드수를 결정하는 타부 서치 알고리즘을 제안하며, 효율적인 검색을 위해 타부 서치 알고리즘의 효과적인 이웃해 생성 동작을 제안한다. 제안된 알고리즘은 최소 앵커 노드의 수와 실행시간 관점에서 성능을 평가하며, 평가 결과에서 제안된 알고리즘이 기존의 알고리즘에 비해 성능이 5-10% 우수함을 보인다.

Keywords

References

  1. I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "Wireless sensor networks: a survey," Computer Networks. vol. 38, no. 4, pp. 393-422, 2002. https://doi.org/10.1016/S1389-1286(01)00302-4
  2. M. Huang, I. Chen, and Y. Wang, "Minimum cost localization problem in wireless sensor networks," Ad Hoc Networks, vol. 9, no. 3, pp. 387-399, May 2011. https://doi.org/10.1016/j.adhoc.2010.08.013
  3. M. Erol-Kantarci, H. Mouftah, and S. Oktug, "A survey of architectures and localization techniques for underwater acoustic sensor networks," IEEE Communications Surveys Tutorials, vol. 13, no. 3, pp. 487-502, 2011. https://doi.org/10.1109/SURV.2011.020211.00035
  4. A. F. Assis, L. M. Veeira, M. R. Rodrigues, and G. L. Pappa, "A genetic algorithm for the minimum cost localization problem in wireless sensor networks," in Proceeding of IEEE Congress on Evolutionary Computation, pp. 797-804, 2013.
  5. D. K. Goldenberg, P. Bihler, M. Cao, J. Fang, B. D. O. Anderson, A. Stephen Morse, and Y. Richard Yang, "Localization in sparse networks using sweeps," in Proceeding of ACM MobiCom, 2006.
  6. Z. Yang, Y. Liu, and X. Y. Li, "Beyond trilateration: On the localizability of wireless ad-hoc networks," in Proceeding of IEEE INFOCOM, 2009.
  7. J. Aspnes, T. Eren, D. K. Goldenberg, A. S. Morse, W. Whiteley, Y. R. Yang, B. D. O. Anderson, and P. N. Belhumeur, "A theory of network localization," IEEE Transaction Mobile Computer, vol. 5, no. 12, pp. 1663- 1678, 2006. https://doi.org/10.1109/TMC.2006.174
  8. F. Glover, "Future paths for integer programming and links to artificial intelligence," Computers and Op. Res., vol. 5, pp. 533-549, 1986.
  9. C. H. Wu, W. Sheng, and Y. Zhang, "Mobile sensor etworks self localization based on multi-dimensional scaling," in Proceeding of IEEE International Conference on Robotics and Automation, pp. 4038-4043, April 2007.
  10. M. Azim, Z. Aung, W. Xiao, and V. Khadkikar, "Localization in wireless sensor networks by cross entropy method," in Preceeding of International Conference on Ad Hoc Networks, pp. 103-118, 2012.
  11. A. Savvides, H. Park, and M. B. Srivastava, "The bits and flops of the n-hop multilateration primitive for node localization problems," in Proceeding of ACM International Workshop on Wireless Sensor Networks & Applications, 2002.
  12. S. Kultuel-Konak, A. E. Norman, and D. W. Coit, "Efficiently solving the redundancy allocation problem using Tabu search," IIE Transactions, vol. 35, pp. 515-526, 2003. https://doi.org/10.1080/07408170304422