Browse > Article
http://dx.doi.org/10.6109/jkiice.2017.21.5.929

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)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.21, no.5, 2017 , pp. 929-935 More about this Journal
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.
Keywords
Underwater sensor networks; Tabu search; localization; meta-heuristic;
Citations & Related Records
연도 인용수 순위
  • Reference
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.   DOI
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.   DOI
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.   DOI
4 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.   DOI
5 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.
6 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.
7 Z. Yang, Y. Liu, and X. Y. Li, "Beyond trilateration: On the localizability of wireless ad-hoc networks," in Proceeding of IEEE INFOCOM, 2009.
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.   DOI