A new multi-constrained QoS routing algorithm in mobile ad hoc networks

  • Authors:
  • Hu Bin;Liu Hui

  • Affiliations:
  • Information Center of Shandong Labour and Social Security Department, Jinan, Shandong, China;College of Mechanical and Electronic Engineering, Shandong University of Architecture, Jinan, Shandong, China

  • Venue:
  • PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The task of QoS routing is to find a route in the network, which has sufficient resources to satisfy the constraints on delay, delay-jitter, cost, etc. The delay-cost-constrained routing problem is NP-complete. In this paper we present a new method of multi-constrained routing based on Hopfield neural network (HNN) that solves the optimum routing problem for supporting QoS in Ad hoc networks, which is called MCADHP. The idea of MCADHP is to reduce the NP-complete problem to a simpler one, which can be solved in polynomial time in order that the neural network could be robust to the changed of the network topology. Under this assumption the general principles involved in the design of the proposed neural network and the method regarding the relationships of different coefficients in the energy function are discussed. The performance of the proposed neural model is studied by both theoretical analysis and computer simulations. Simulation results indicate that our proposed scheme is very effective and outperforms previous schemes.