Abstract
A mobile ad hoc network (MANET) is comprised of mobile hosts that can communicate with each 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) [20] algorithm for MANET which is also based on GPS. Simulation results show that our algorithm has less overhead than LAR.
Similar content being viewed by others
References
S. Appleby and S. Steward, Mobile software agents for control in telecommunications network, British Telecom Technology Journal 12 (1994) 104-113.
S. Basagni et al., A distance routing effect algorithm for mobility (DREAM), in: Fourth Annual ACM/IEEE Internat. Conf. on Mobile Computing and Networking, 25–30 October 1998, Dallas, Texas, USA, pp. 76-84.
P. Belanger and W. Diepstraten, MAC entity: MAC basic access mechanism privacy and access control, Technical Report, IEEE 802.11 (March 1996).
E. Bonabeau et al., Routing in telecommunications networks with “smart” ant-like agents, in: Proc. of the 2nd Internat. Workshop on Intelligent Agents for Telecommunication Applications, Lecture Notes in Artificial Intelligence (Springer, Berlin, 1998).
M.S. Corson and A. Ephremides, A distributed routing algorithm for mobile wireless networks, Wireless Networks 1(1) (1995) 61-81.
S. Corson, S. Batsell and J. Macker, Architectural considerations for mobile mesh networking, Internet draft RPC, version 2 (May 1996).
S. Corson and J. Macker, Mobile ad hoc networking (MANET): Routing protocol performance issues and evaluation considerations, Request for comments 2501 (January 1999).
B. Das, E. Sivakumar and V. Bhargavan, Routing in ad-hoc networks using a spine, in: IEEE Internat. Conf. on Computer Communications and Networks, 1997.
G. Di Caro and M. Dorigo, Antnet: Distributed stigmergetic control for communications networks, Journal of Artifcial Intelligence Research 9 (December 1998) 371-365.
M. Dorigo and L.M. Gambardella, Ant colony system: A cooperative learning approach to the traveling salesman problem, IEEE Transactions on Evolutionary Computation 1(1) (1997) 53-66.
M. Dorigo, V. Maniezzo and A. Colorni, Positive feedback as a search strategy, Technical Report 91-016, Dipartamento Elettronica, Politecnico di Milano (1991).
M. Dorigo, V. Maniezzo and A. Colorni, Positive feedback as a search strategy, IEEE Transactions on Systems, Man and Cybernetics B 26(1) (1996) 29-42.
R. Dube, D.D. Rais, K. Wang and S.K. Tripathi, Signal stability based adaptive routing (SSA) for ad hoc mobile networks, IEEE Personal Communications (February 1997).
G. Ennis, 802.11 architecture, Technical Report, IEEE 802.11 (March 1996).
L.M. Gambardella and M. Dorigo, Has-sop: Hybrid ant system for the sequential ordering problem, Technical Report IDSIA 11-97, IDSIA (1997).
Z.J. Haas and M.R. Pearlman, The zone routing protocol (ZRP) for ad hoc networks, Internet draft (August 1998).
Iowa State University GPS page, http://www.cnde.iastate.edu/gps.html.
M. Jiang, J. Li and Y.-C. Tay, Cluster based routing protocol (CBRP) functional specification, Internet draft (August 1998).
D. Johnson, D.A. Maltz and J. Broch, The dynamic source routing protocol for mobile ad hoc networks, Internet draft (March 1998).
Y.-B. Ko and N.H. Vaidya, Location-aided routing (LAR) in mobile ad hoc networks, in: Fourth Annual ACM/IEEE Internat. Conf. on Mobile Computing and Networking, 25–30 October 1998, Dallas, Texas, USA, pp. 66-75.
P. Krishna, M. Chatterjee, N.H. Vaidya and D.K. Pradhan, A cluster-based approach for routing in ad hoc networks, in: USENIX Symposium on Location Independent and Mobile Computing, April 1995.
X. Lin and I. Stojmenovic, Geographic distance routing in ad hoc wireless networks, Technical Report, Computer Science, SITE, University of Ottawa (December 1998).
V. Maniezzo, Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem, Technical Report CSR 98-1, Scienze dell'Informazione, Universit a di Bologna, Sede di Cesena (1998).
R. Michel and M. Middendorf, An island-based ant system with look-ahead for the shortest common supersequence problem, in: Proc. of the 5th Internat. Conf. on Parallel Problem Solving from Nature, Vol. 1498 (Springer, Berlin, 1997) pp. 692-708.
NAVSTAR GPS operations, http://tycho.usno.navy.mil/gpsinfo.html.
V.D. Park and M.S. Corson, Temporally-ordered routing algorithm (TORA) version 1 functional specification, Internet draft (August 1998).
C.E. Perkins and P. Bhagwat, Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers, in: ACM SIGCOMM Symposium on Communication Architectures and Protocols, 1994.
C.E. Perkins and E.M. Royer, Ad hoc on demand distance vector (AODV) routing, Internet draft (August 1998).
R. Schoonderwoerd, O. Holland, J. Bruten and L. Rothkrantz, Ant-based load balancing in telecommunications networks, Adaptive Behavior 5 (1997) 169-207.
T. Sttzle and M. Dorigo, Aco algorithms for the traveling salesman problem, Technical Report IRIDIA/99-3, IRIDIA, Université Libre de Bruxelles (1999).
C.-K. Toh, A novel distributed routing protocol to support ad-hoc mobile computing, Wireless Personal Communication (January 1997).