Abstract
In this paper, we propose a routing optimization algorithm to efficiently determine an optimal path from a source to a destination in mobile ad-hoc networks. To determine an optimal path for the nodes is important for transmitting data between nodes in densely deployed networks. In order to efficiently transmit data to its destination, the appropriate routing algorithms must be implemented in mobile ad-hoc networks. The proposed algorithm is designed by using a tabu search mechanism that is a representative meta-heuristic algorithm. The proposed tabu search algorithm carries out two neighborhood generating operations in order to determine an optimal path and minimize algorithm execution time. We compare the proposed tabu search algorithm with other meta-heuristic algorithms, which are the genetic algorithm and the simulated annealing, in terms of the routing cost and algorithm execution time. The comparison results show that the proposed tabu search algorithm outperforms the other algorithms and that it is suitable for adapting the routing optimization problem.
Article PDF
Similar content being viewed by others
References
Ali, M. K., & Kamoun, F. (1993). Neural networks for shortest path computation and routing in computer networks. IEEE Transaction Neural Networks, 4, 941–954.
Jain, S., Fall, K., & Patra, R. (2004). Routing in a delay tolerant network. In Proceedings of ACM SIGCOM (pp. 187–198).
Zhao, W., Ammar, M., & Zegura, E. (2004). A message ferrying approach for data delivery in sparse mobile ad hoc networks. In Proceedings of ACM/IEEE MOBIHOC.
Vasilakos, A., Saltouros, M., Atlasis, A., & Pedrycz, W. (2003). Optimizing QoS routing in hierarchical ATM networks using computational intelligence techniques. IEEE-Transactions on Systems, Man and Cybernetics, Part C, 33(3), 297–312.
Akkaya, K., & Younis, M. (2005). A survey on routing protocols for wireless sensor networks. Ad hoc networks, 3, 325–349.
Royer, E. M., & Toh, C. K. (1999). A review of current routing protocols for ad-hoc mobile wireless networks. IEEE Personal Communications, 6, 46–55.
Perkins, C. E., & Bhagwat, P. (1994). Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computer. In Proceedings of the ACM SIGCOMM (pp. 234–244).
Raju, J., & Garcia-Luna-Aceves, J. J. (2000). A comparison of on-demand and table driven routing for ad-hoc wireless networks. In Proceedings of ICC.
Maltz, D. (2001). On-demand routing in multi-hop wireless ad hoc networks. PhD thesis, Carnegie Mellon University, Pittsburgh, PA.
Perkins, C. E., & Royer, E. M. (1999). Ad-hoc on-demand distance vector routing. In Proceedings of the 2nd IEEE workshop on mobile computing systems and applications (pp. 90–100).
Toh, C. K. (1999). A novel distributed routing protocol to support ad hoc mobile computing. In Proceedings of IEE 15th annual international conference on computers and communications (pp. 460–486).
Nasipuri, A., & Das, S. R. (1999). On-demand multipath routing for mobile ad hoc networks. In Proceedings of the 8th ICCCN.
Valera, A., Seah, W. K., & Rao, S. V. (2003). Cooperative packet caching and shortest multipath routing in mobile ad hoc networks. In Proceedings of IEEE INFOCOM.
Spyropoulos, T., Rais, R. N. B., Turletti, T., Obraczka, K., & Vasilakos, A. (2010). Routing for disruption tolerant networks: taxonomy and design. In Wireless networks (pp. 1–22).
Pedrycz, W., & Vasilakos, A. (2001). Computational intelligence in telecommunications networks. USA: CRC Press
Glover, F. (1989). Tabu search, Part I. ORsimulated Annealing Journal on Computing, 1, 190–206.
Glover, F. (1990). Tabu search, Part II. ORsimulated Annealing Journal on Computing, 2, 4–32.
Holland, J. (1975). Adaptation in natural and artificial systems. Ann Arbor: Univ. of Michigan Press.
Goldberg, D. E. (1989). Genetic algorithms in search, optimization & machine learning. Reading: Addison–Wesley.
Pedrycz, W., & Vasilakos, A. V. (1999). Linguistic models and linguistic modeling. IEEE Transaction on Systems, Man, and Cybernetics-Part B: Cybernetics, 29(6), 745–757.
Acampora, G., Gaeta, M., Loia, V., & Vasilakos, A. V. (2010). Interoperable and adaptive fuzzy services for ambient intelligence applications. ACM Transactions on Autonomous and Adaptive Systems, 5(2).
Vasiliakos, A., Ricudis, C., Anagnostakis, K., Pedrycz, W., & Pitsillides, A. (1998). Evolutionary-fuzzy prediction for strategic QoS routing in broadband networks. In Proceedings of IEEE-FUZZ (pp. 1488–1493).
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220, 671–680.
Rutenbar, R. (1989). Simulated annealing algorithms: an overview. IEEE Circuits and Devices Magazine, 5, 19–26.
Kulturel-Konak, S., Norman, A. E., & Coit, D. W. (2003). Efficiently solving the redundancy allocation problem using tabu search. IIE Transactions, 35, 515–526.
Antonisse, J. (1989). A new interpretation of schema notation that overturns the binary encoding constraint. In Proceedings of the 3rd international conference on genetic algorithms (pp. 86–91).
Ahn, C. W., Ramakrishna, R. S., Kang, C. G., & Choi, I. C. (2001). Shortest path routing algorithm using Hopfield neural network. Electronics Letter, 37(19), 1176–1178.
Munemoto, M., Takai, Y., & Sato, Y. (1998). A migration scheme for the genetic adaptive routing algorithm. In Proceedings IEEE international conference systems (pp. 2774–2779).
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., et al. (1953). Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21, 10–16.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Jang, KW. A tabu search algorithm for routing optimization in mobile ad-hoc networks. Telecommun Syst 51, 177–191 (2012). https://doi.org/10.1007/s11235-011-9428-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11235-011-9428-1