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 Energy Cooperative Path Problem in Wireless Ad hoc Networks

무선 애드 혹 네트워크에서 최소 에너지 협력 경로 문제를 위한 타부 서치 알고리즘

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

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

References

  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. https://doi.org/10.1109/49.779917
  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.