MSDP with ACO: A maximal SRLG disjoint routing algorithm based on ant colony optimization
Journal of Network and Computer Applications
| Hi-index | 0.00 |
A mobile Ad-hoc network is a set of mobile nodes that communicate with each other through the airwave. These networks have a high flexibility and have no central infrastructure or supervisor. In this type of networks, the topology is in change always, and the important problem in them is finding the path between source and destination. In this paper, we introduce a multi path hybrid routing algorithm for mobile Ad-hoc networks. This algorithm is based on swarm intelligence algorithms and Ant Colony Optimization (ACO), particularly. By mapping arithmetic and engineering problems on to biological societies, these methods attempt to solve the problems. In the presented algorithm, the number of neighbors of a node has been used to select the next hop. This algorithm is efficient and scalable and has a high adaptability. We introduce this algorithm as Node Neighbor Number Algorithm (NNNA).