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

A Tabu Search Algorithm for Minimum Energy Cooperative Path Problem in Wireless Ad hoc 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.20, no.8, 2016 , pp. 1444-1451 More about this Journal
Abstract
This paper proposes a Tabu search algorithm to minimize the required energy to send data between a source and a destination using the cooperative communication in wireless ad hoc networks. As the number of nodes in wireless ad hoc networks increases, the amount of calculation for establishing the path between nodes would be too much increased. To obtain the optimal cooperative path within a reasonable computation time, we propose a new Tabu search algorithm for a high-density wireless network. In order to make a search more efficient, we propose some efficient neighborhoods generating operations of the Tabu search algorithm. We evaluate those performances through some experiments in terms of the minimum energy required to send data between a source and a destination as well as the execution time of the proposed algorithm. The comparison results show that the proposed algorithm outperforms other existing algorithms.
Keywords
Wireless ad hoc networks; Tabu search; Cooperative path; Minimum energy; Meta-heuristic;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 M. Cagalj, J. Hubaux, and C. Enz, "Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues," in Proceeding of the ACM Mobicom 2003, 2003.
2 F. Li, K. Wu, and A. Lippman, "Minimum energy cooperative path routing in all-wireless networks: NP-completeness and heuristic algorithms," Journal of communications and networks, vol. 10, no. 2, June. 2008.
3 A. Khandani, J. Abounadi, E. Modiano, and L. Zheng, "Cooperative routing in wireless networks," in Proceeding of the Allerton Conference 2003, 2003.
4 A. Catovic, S. Tekinay, and T. Otsu, "Reducing transmit power and extending network lifetime via user cooperation in the next generation wireless multihop networks," Journal of Communication and Networks, vol. 4, no. 4, Dec. 2002.
5 J. Wieselthier, G. Nguyen, and A. Ephremides, "On the construction of energy-efficient broadcast and multicast trees in wireless networks," in Proceeding of the IEEE INFOCOM 2000, pp. 585-594, 2000.
6 W. Liang, "Constructing minimum-energy broadcast trees in wireless ad hoc networks," in Proceeding of the ACM Mobihoc, 2002.
7 V. Rodoplu and T. Meng, "Minimum energy mobile wireless networks," IEEE Journal of Selected Areas Communication, vol. 17, no. 8, pp. 1333-1344, Aug. 1999.   DOI
8 R.Wattenhofer, L. Li, P. Bahl, and Y.Wang, "Distributed topology control for power efficient operation in multihop wireless ad-hoc networks," in Proceeding of the IEEE INFOCOM 2001, 2001.
9 A. Srinivas and E. Modiano, "Minimum energy disjoint path routing in wireless ad-hoc networks," in Proceeding of the ACM Mobicom 2003, 2003.