Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
IEEE Transactions on Parallel and Distributed Systems
Role-based multicast in highly mobile but sparsely connected ad hoc networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Depth First Search and Location Based Localized Routing and QoS Routing in Wireless Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Ant-routing-algorithm for mobile multi-hop ad-hoc networks
Network control and engineering for Qos, security and mobility II
Performance analysis of the AntNet algorithm
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient implementations of all-to-all broadcasting in mobile ad hoc networks
Pervasive and Mobile Computing
Broadcast analysis of spanning tree flooding algorithm for mobile ad hoc networks
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
Survey paper: A survey on routing algorithms for wireless Ad-Hoc and mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A novel ant colony based qos-aware routing algorithm for MANETs
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
Hi-index | 0.00 |
A mobile ad hoc network (MANET) is comprised of mobile hosts that can communicate with two other using wireless links. In this paper we present a novel routing algorithm called GPSAL (GPS/Ant-Like Routing Algorithm) which is based on GPS (Global Positioning System) and mobile software agents modeled on ants for routing in ad hoc networks. We compare our algorithm to the Location-Aided Routing (LAR) [16] algorithm for MANET which is also based on GPS. Simulation results show that our algorithm has less overhead than LAR.