Tabu Search Algorithm for Node-Disjoint Path Problem in Wireless Ad-Hoc Networks 


Vol. 43,  No. 9, pp. 1406-1413, Sep.  2018
10.7840/kics.2018.43.9.1406


PDF
  Abstract

In this paper, we propose an optimization algorithm for the node-disjoint path problem between node pairs in a wireless ad-hoc network. The node-disjoint path problem is to establish multiple paths using different intermediate nodes between source and destination nodes. In a wireless ad-hoc network environment where a large number of nodes are deployed, we solve the node-disjoint path problem considering the transmission energy by using the Tabu search algorithm which is one of the metaheuristic methods. Especially, the higher the density of the network node, the greater the computation time and the time required for the problem. Therefore, the proposed algorithm determines the node-disjoint path that minimizes the transmission energy within a short execution time. The performance of the proposed algorithm was evaluated in terms of the amount of transmission energy used in the node-disjoint path and the time required to derive the result. The results show that the proposed algorithm can reduce the amount of transmitted energy by 10-20% within similar execution time compared to other algorithms.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Kim and K. Jang, "Tabu Search Algorithm for Node-Disjoint Path Problem in Wireless Ad-Hoc Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 43, no. 9, pp. 1406-1413, 2018. DOI: 10.7840/kics.2018.43.9.1406.

[ACM Style]

Jae-Hwan Kim and Kil-Woong Jang. 2018. Tabu Search Algorithm for Node-Disjoint Path Problem in Wireless Ad-Hoc Networks. The Journal of Korean Institute of Communications and Information Sciences, 43, 9, (2018), 1406-1413. DOI: 10.7840/kics.2018.43.9.1406.

[KICS Style]

Jae-Hwan Kim and Kil-Woong Jang, "Tabu Search Algorithm for Node-Disjoint Path Problem in Wireless Ad-Hoc Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 43, no. 9, pp. 1406-1413, 9. 2018. (https://doi.org/10.7840/kics.2018.43.9.1406)

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880