Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Ant-based load balancing in telecommunications networks
Adaptive Behavior
A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Location-aided routing (LAR) in mobile ad hoc networks
Wireless Networks
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
ARA - The Ant-Colony Based Routing Algorithm for MANETs
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
A location routing protocol based on smart antennas for ad hoc networks
Journal of Network and Computer Applications
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Swarm intelligent power-aware detection of unauthorized and compromised nodes in MANETs
Journal of Artificial Evolution and Applications - Regular issue
AntNet: distributed stigmergetic control for communications networks
Journal of Artificial Intelligence Research
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Performance evaluation of bandwidth allocation in ATM networks
International Journal of Business Information Systems
Ant colony algorithms in MANETs: A review
Journal of Network and Computer Applications
Hi-index | 0.24 |
The ad hoc network has been attracting increasing attention of researchers owing to its good performance and special application. The search of route that satisfies such multi-constraints as delay, jitter and bandwidth in ad hoc network can facilitate the solution to multi-media transmission. The problem of multi-constraint is generally an NP-Hard problem. This paper deals with the problem by adding an orientation heuristic factor to the conventional ant colony algorithm, which enables the ant to get rid of the blindness at the initial stage of path searching. The ant in the modified algorithm not only makes use of the previous search findings, but also reduces the misguiding effect of pheromones on the irrelevant paths, thus overcoming the problem of slow convergence. The choice and the extent of the effect of the orientation heuristic factor in the modified algorithm is our focus, and the gradual changing orientation factors is also studied. The gradual changing orientation factor not only enables the ant to take advantage of direction to assist path search, but also adjust convergence speed and exactitude. Simulation results indicate that the modified algorithm can quickly find the feasible solution to the network routing problem. The method adopted can help find better solutions in shorter time.