A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A distributed mechanism for topology discovery in ad hoc wireless networks using mobile agents
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
ARA - The Ant-Colony Based Routing Algorithm for MANETs
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
Relation between static and dynamic optimization in computer network routing
AIKED'09 Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases
Computer network routing based on imprecise routing tables
WSEAS TRANSACTIONS on COMMUNICATIONS
Maximum entropy method and underdetermined systems applied to computer network topology and routing
AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
A heuristic algorithm for the network design problem
NN'10/EC'10/FS'10 Proceedings of the 11th WSEAS international conference on nural networks and 11th WSEAS international conference on evolutionary computing and 11th WSEAS international conference on Fuzzy systems
An algorithm for the network design problem based on the maximum entropy method
AMERICAN-MATH'10 Proceedings of the 2010 American conference on Applied mathematics
AODV based multi-path local repairing scheme for mobile ad hoc networks
WORLD-EDU'12/CIT'12 Proceedings of the 6th international conference on Communications and Information Technology, and Proceedings of the 3rd World conference on Education and Educational Technologies
| Hi-index | 0.00 |
A mobile ad hoc network is a dynamic mobile wireless network that can be formed without the need for any pre-existing wired or wireless infrastructure. One of the main challenges in an ad hoc network is the design of robust routing algorithms that adapt to the frequent and randomly changing network topology. So there is a great need for a new routing protocol that have low routing message overhead to enhance the performance of MANET. The reduction of routing message overhead will decrease the wasted portions of bandwidth that used for exchange routing messages between nodes, and increase the bandwidth available for transferring data, which in turn increases the network throughput and decreases the latency. This paper proposes a new ant agent based Local repair routing protocol (ALRP) that decreases both of the routing message overhead and the average end to end delay by on average 28%, 14% respectively less than the well known AODV routing protocol. This led to increase the throughput by 24% more than AODV routing protocol.