Preview

Ant Colony Optimization for Routing in Mobile Ad Hoc Networks in Urban Environments

Powerful Essays
Open Document
Open Document
10973 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Ant Colony Optimization for Routing in Mobile Ad Hoc Networks in Urban Environments
Ant Colony Optimization for Routing in Mobile Ad Hoc Networks in Urban Environments

Gianni A. Di Caro, Frederick Ducatelle, and Luca M. Gambardella

Technical Report No. IDSIA-05-08
May 2008

IDSIA / USI-SUPSI Dalle Molle Institute for Artificial Intelligence Galleria 2, 6928 Manno, Switzerland

This report represents the draft English version of the book chapter (in French) Optimisation par colonie de fourmis pour le routage dans les rseaux mobiles ad hoc en environnement urbain, that will appear in the book: Nicolas Monmarch´, Fr´d´ric e e e Guinand, and Patrick Siarry, Eds., Fourmis artificielles, des bases algorithmiques aux concepts et ralisations avancs, Herm`s e Science Publications, 2008. IDSIA is a joint institute of both University of Lugano (USI) and University of Applied Sciences of Southern Switzerland (SUPSI), and was founded in 1988 by the “Dalle Molle” Foundation which promoted quality of life.

Contents
1 Introduction 2 Routing in mobile ad hoc networks 3 Ant Colony Optimization for routing: general principles 4 The 4.1 4.2 4.3 4.4 4.5 AntHocNet routing algorithm Pheromone tables . . . . . . . . . . . . . . . . . Reactive route setup . . . . . . . . . . . . . . . Proactive route maintenance and improvement Data forwarding . . . . . . . . . . . . . . . . . Dealing with link failures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 3 4 5 6 6 7 8 8 9 10 11 12 12 13 14 14 15 16 17 18 18 20

5 Working in an urban environment 5.1 The urban environment and node mobility . . . . . . . . . . . . . 5.2 Radio propagation . . . . . . . . . . . . . . . . . . . . . . . . . . 5.3 Data traffic . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5.4 Related work on the simulation of MANETs in urban environments 6 Experimental evaluation 6.1 Technical details about the simulation setup 6.2 General network properties . . . . . . . . . 6.3 Data send rate . . . . . . . . .



References: [1] The internet engineering task force mobile ad-hoc networking page (MANET). Available from: http://www.ietf.org/html.charters/ manet-charter.html. [2] Taipei-wlan. Available from: http://wlan.taipei-elife.net/english/ main.html. [3] Wireless philadelphia. wirelessphiladelphia.org. Available from: http://www. [4] M. Abolhasan, T. Wysocki, and E. Dutkiewicz. A review of routing protocols for mobile ad hoc networks. Ad Hoc Networks, 2:1–22, 2004. [5] AWE Communications. WinProp software suite. [6] D. Bertsekas and R. Gallager. Data Networks. Prentice–Hall, Englewood Cliffs, NJ, USA, 1992. [7] E. Bonabeau, M. Dorigo, and G. Theraulaz. Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, 1999. [8] J. Broch, D. A. Maltz, D. B. Johnson, Y.-C. Hu, and J. Jetcheva. A performance comparison of multi-hop wireless ad hoc network routing protocols. In Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), 1998. [9] T. Clausen, P. Jacquet, A. Laouiti, P. Muhlethaler, A. Qayyum, and L. Viennot. Optimized link state routing protocol. In Proceedings of IEEE INMIC, 2001. [10] S. R. Das, C. E. Perkins, and E. M. Royer. Performance comparison of two on-demand routing protocols for ad hoc networks. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM), March 2000. [11] G. Di Caro and M. Dorigo. AntNet: Distributed stigmergetic control for communications networks. Journal of Artificial Intelligence Research (JAIR), 9:317–365, 1998. [12] G. Di Caro, F. Ducatelle, and L. M. Gambardella. AntHocNet: an adaptive nature-inspired algorithm for routing in mobile ad hoc networks. European Transactions on Telecommunications (ETT), 16(5), 2005. [13] Y. Dong, D. Makrakis, and T. Sullivan. Effective admission control in multihop mobile ad hoc networks. In Proc. of the International Conference on Communication Technology (ICCT), 2003. [14] M. Dorigo, G. Di Caro, and L. M. Gambardella. Ant algorithms for distributed discrete optimization. Artificial Life, 5(2):137–172, 1999. 22 [15] M. Dorigo and T. St¨tzle. Ant Colony Optimization. MIT Press, Camu bridge, MA, 2004. [16] F. Ducatelle. Adaptive Routing in Ad Hoc Wireless Multi-hop Networks. PhD thesis, Universit` della Svizzera Italiana (USI), Istituto Dalle Molle a di Studi sull’Intelligenza Artificiale (IDSIA), 2007. [17] F. Ducatelle, G. Di Caro, and L. M. Gambardella. Using ant agents to combine reactive and proactive strategies for routing in mobile ad hoc networks. International Journal of Computational Intelligence and Applications (IJCIA), 5(2), 2005. [18] P. Gupta and P. R. Kumar. The capacity of wireless networks. IEEE Transactions on Information Theory, March 2000. [19] E. Huang, W. Hu, J. Crowcroft, and I. Wassell. Towards commercial mobile ad hoc network applications: A radio dispatch system. In Proceedings of the sixth ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), May 2005. [20] A. Jardosh, E. M. Belding-Royer, K. C. Almeroth, and S. Suri. Towards realistic mobility models for mobile ad hoc networks. In Proceedings of MobiCom, 2003. [21] W. Jiang and H. Schulzrinne. Analysis of on-off patterns in voip and their effect on voicetraffic aggregation. In Proceedings of the Ninth International Conference on Computer Communications and Networks, 2000. [22] D. B. Johnson and D. A. Maltz. Mobile Computing, chapter Dynamic Source Routing in Ad Hoc Wireless Networks. Kluwer, 1996. [23] J. Jun, P. Peddabachagari, and M.L. Sichitiu. Theoretical maximum throughput of IEEE 802.11 and its applications. In Proceedings of the 2nd IEEE International Symposium on Network Computing and Applications (NCA), April 2003. [24] J. Luo and J.-P. Hubaux. Embedded Security in Cars, chapter A Survey of Research in Inter-Vehicle Communications, pages 111–122. Springer Berlin Heidelberg, 2006. [25] S. Marinoni and H. H. Kari. Ad hoc routing protocol performance in a realistic environment. In Proceedings of IEEE ICN, April 2006. [26] Ian Marsh, Fengyi Li, and Gunnar Karlsson. Wide area measurements of voip quality. In Proceedings of the 4th International Workshop on Quality of Future Internet Services, 2003. [27] C. H. Papadimitriou and K. Steiglitz. Prentice-Hall, New Jersey, 1982. Combinatorial Optimization. 23 [28] C. Perkins and P. Bhagwat. Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In ACM SIGCOMM’94 Conference on Communications Architectures, Protocols and Applications, pages 234–244, 1994. [29] C. E. Perkins and E. M. Royer. Ad-hoc on-demand distance vector routing. In Proc. of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, 1999. [30] V. Ramasubramanian, Z. J. Haas, and E. G. Sirer. Sharp: A hybrid adaptive routing protocol for mobile ad hoc networks. In Proceedings of The Fourth ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), 2003. [31] E. M. Royer and C.-K. Toh. A review of current routing protocols for ad hoc mobile wireless networks. IEEE Personal Communications, 1999. [32] N. Sadagopan, F. Bai, B. Krishnamachari, and A. Helmy. PATHS: analysis of PATH duration statistics and their impact on reactive MANET routing protocols. In Proceedings of MobiHoc’03, pages 245–256, 2003. [33] Scalable Network Technologies, Inc. QualNet Simulator, Version 3.8, 2005. Available from: http://www.scalable-networks.com. [34] A. Schmitz and M. Wenig. The effect of the radio wave propagation model in mobile ad hoc networks. In Proceedings of ACM MSWiM, October 2006. [35] R. Schoonderwoerd, O. Holland, J. Bruten, and L. Rothkrantz. Antbased load balancing in telecommunications networks. Adaptive Behavior, 5(2):169–207, 1996. [36] P. Shirley and R. Morley Keith. Realistic Ray Tracing. A.K. Peters, 2001. [37] V. Sridhana and S. Bohacek. Realistic propagation simulation of urban mesh networks. Technical report, University of Delaware, Department of Electrical and Computer Engineering, 2006. [38] V. Sridhara, J. Kim, and S. Bohacek. Performance of urban mesh networks. In Proceedings of ACM MSWiM, October 2005. [39] R. S. Sutton and A. G. Barto. Reinforcement Learning: An Introduction. MIT Press, 1998. [40] S. Tadrus and L. Bai. A QoS network routing algorithm using multiple pheromone tables. In Proceedings of the IEEE/WIC International Conference on Web Intelligence, pages 132–138, Halifax, Canada, October 2003. 24

You May Also Find These Documents Helpful

  • Best Essays

    Basios, C. and Solidakis, M. "Current trends and challenges towards wireless Internet", Computer Systems and Applications, 2005. The 3rd ACS/IEEE International Conference on 2005 Page(s):77…

    • 1489 Words
    • 5 Pages
    Best Essays
  • Powerful Essays

    It230 Unit 3 Assignment 1

    • 5629 Words
    • 23 Pages

    Vehicular Ad hoc Network (VANET), a subclass deriving from Mobile Ad Hoc networks (MANET), is a promising approach for future intelligent transportation system…

    • 5629 Words
    • 23 Pages
    Powerful Essays
  • Good Essays

    The advent of wireless technology is due in part to the ever increasing demands for mobility and flexibility in our daily lives. A wireless LAN (WLAN) is based on cellular architecture where the system is subdivided into cells,…

    • 929 Words
    • 4 Pages
    Good Essays
  • Good Essays

    unit 8 assignement

    • 920 Words
    • 3 Pages

    Wireless technology has become an increasingly crucial part of today's world. From health care and retail to academia across the world, wireless systems are improving the rate and ease with which data is sent and received. Two specific examples of the wireless technology used today personally and professionally are local area networks (LAN) and personal area networks (PAN).…

    • 920 Words
    • 3 Pages
    Good Essays
  • Powerful Essays

    15. What are the four key issues in dynamic routing protocols?Path determination, Metric, Convergence, Load Balancing…

    • 1575 Words
    • 7 Pages
    Powerful Essays
  • Powerful Essays

    References: Aarts, E.H.L., Korst, J.H.M. and Laarhoven, P.J.M. van. (1997). Simulated annealing. Pages 91– 120 in: Local Search in Combinatorial Optimization (E.H.L. Aarts, and J.K.L. Lenstra, Eds.) John Wiley & Sons, New York. Anderson, C. and McShea, D.W. Individual versus social complexity, with particular reference to ant colonies. Biol. Rev. (Camb), in press. Appleby, S. and Steward, S. (1994). Mobile software agents for control in telecommunications networks. BT Technol. J. 12: 104–113. Bartholdi, J. J., III. (1993) Interactive program to balance assembly lines. Int. J. Prod. Res. 31: 2447–2461. Bartholdi, J.J., III and Eisenstein, D.D. (1996). A production line that balances itself. Oper. Res. 44: 21–34. Bartholdi, J. J., III, Bunimovich, L.A. and Eisenstein, D.D. (1999). Dynamics of two- and threeworker "bucket brigade" production lines. Oper. Res. 47: 488–491. Bartholdi, J. J., III, Eisenstein, D.D. and Foley, R. A. Performance of bucket brigades when work is stochastic. Oper. Res., in press. Beebe, W. (1921). Edge of the Jungle. Henry Holt and Company, New York. Bonabeau, E. (1998). Social insect colonies as complex adaptive systems. Ecosystems 1: 437– 443. Bonabeau, E., and Théraulaz, G. (2000). Swarm smarts. Sci. Am. 282: 72–79. Bonabeau, E., Dorigo, M. and Théraulaz, G., 1999. Swarm Intelligence: From Natural to Artificial Systems. Santa Fe Institute on the Sciences of Complexity. Oxford University Press, New York. Bonabeau, E., Dorigo, M. and Théraulaz, G. (2000). Inspiration for optimization from social insect behaviour. Nature 406: 39–42.…

    • 8717 Words
    • 35 Pages
    Powerful Essays
  • Good Essays

    (c) Data throughput in sensor networks is a bigger concern than that in mobile ad hoc networks.…

    • 1413 Words
    • 6 Pages
    Good Essays
  • Good Essays

    Our online world is totally incomplete without a modem or router and nowadays, technological advancements have made it possible for us to use wireless routers which in itself is a remarkable achievement of computer science.…

    • 783 Words
    • 4 Pages
    Good Essays
  • Powerful Essays

    Network Simulator

    • 1018 Words
    • 5 Pages

    4. V. Naoumov and A. Gross, “Simulation of Large Ad Hoc Networks,” In Proceedings of the 6th ACM Workshop on Modeling, Analysis, and…

    • 1018 Words
    • 5 Pages
    Powerful Essays
  • Good Essays

    Misra, S., Misra, S. C., & Woungang, I. (2010). Selected topics in communication networks and distributed systems. Singapore: World Scientific.…

    • 682 Words
    • 3 Pages
    Good Essays
  • Powerful Essays

    Wireless Security

    • 3481 Words
    • 14 Pages

    Mobile devices and wireless networks rely on a broad spectrum of technology, much of it cutting-edge. In comparison to PCs, each class of mobile device currently represents a unique hardware and software platform. Mobile phones and PDAs, for example, have varying capabilities and limitations both as computing devices and as client devices accessing corporate networks. The wireless networks that support mobile devices are similarly diverse.…

    • 3481 Words
    • 14 Pages
    Powerful Essays
  • Powerful Essays

    Review Report on A Heuristic Routing Protocol for Wireless Sensor Networks in Home Automation (WSNHA) Proposed by Xiao Hui Li, Seung Ho Hong and Kang Ling Fang This review report summarizes the proposed concept of WSNHA greedy-algorithm heuristic routing(GAHR) protocol by using the Greedy algorithm and A* heuristic path finding to find a optimal route from source to destination while simultaneously records the changes in network topology. WSNHA-GAHR protocol aims to address the challenge of when implementing WSNHA -- high energy efficiency, low storage and simple algorithm, high dependency of sensor node distribution and self adaptation to network topology changes The Greedy algorithm is a simple approach that finds the shortest and optimum route from the source to destination, based on the immediate information known by the node to its neighbours and forwards the packet to the neighbour closest to the destination. The decision make does not account to effects in future. The selection function is based on f = min (d1, d2,...,dN), where di is the distance between ith neighbour of X and the destination for i ϵ [1,N]. To resolve infinite loop issue caused by Greedy algorithm, the WSNHA-GAHR protocol uses the A*route finding algorithm, a distance-plus-cost function [h(x) = d(x) + c(x)] to find the least-cost path from a given initial node to the destination node taking account the distance already traveled. d(x) is the path cost function and c(x) is an admissible heuristic estimate of the distance to destination. The main idea of the Algorithm is that a node,S chooses the smallest heuristic value of its neighbours as its next hop (example n1), set and broadcast a new heuristic value[h(S) = dsn1 + h(n1)] to its neighbours. When packet is forwarded to n1 from S, n1 finds its neighbours in the similar way. Each node maintains three tables: Ntable (records neighbours' coordinates of the local node), Htable (records heuristic value between local node and the destination…

    • 1043 Words
    • 5 Pages
    Powerful Essays
  • Powerful Essays

    A Mobile Ad hoc Networks (MANETs) stand for a structure of wireless mobile hosts that can dynamically and liberally self organize in to temporary and uninformed network topologies, allocating devices and people to faultlessly communicate without any kinds of pre-existing design of communication structure. The appliances of these networks are extremely necessary in areas like lecture theatres, conference halls, battlefields emergency rescue services, battlefields and other places whenever it’s become very difficult to employment the network infrastructures. In a Mobile Ad Hoc Network the network may experience unpredictable and rapid topology changes because of arbitrarily node movement. Routing paths in Mobile Ad hoc Network possibly have multiple hops, and each node in Mobile Ad hoc Network has the responsibility to perform like a router [1]. So each node in the Ad hoc networking is responsible for forwarding data packets to other nodes [2]. Routing in Mobile Ad hoc Network has been a tough job ever while the wireless mobile networks came into reality because of frequently change in network. Development of dynamic routing protocols is a huge challenge in the design of Ad hoc networks which can proficiently find routes among. These protocols are classified into hybrid, pro-active and reactive routing protocols [3] and the identification of the most appropriate routing protocol to be used depends on various facts which are scalability, traffic and mobility models and quality of service.…

    • 8219 Words
    • 33 Pages
    Powerful Essays
  • Satisfactory Essays

    Panko and Panko Business Data Networks and Telecommunications, 8th Edition 1 Chapters 1–4: Introductory material Chapters 5–6: Switched networks Chapter 7: 802.11 standards and operation Chapter 8: 802.11 security, 802.11 management, other local wireless technologies, and cellular technologies Chapter 8 Chapters 9–10: Internetworking Panko and Panko Business Data Networks and Telecommunications, 8th Edition © 2011…

    • 2613 Words
    • 11 Pages
    Satisfactory Essays
  • Good Essays

    Intervehicle

    • 944 Words
    • 4 Pages

    In this context, Vehicular Ad hoc NETworks (VANETs) are emerging as a new class of wireless network, spontaneously formed between moving vehicles equipped with wireless interfaces that could have similar or different radio interface technologies, employing short-range to medium-range communication systems. A VANET is a form of mobile ad hoc network, providing communications among nearby vehicles and between vehicles and nearby fixed equipment on the roadside.…

    • 944 Words
    • 4 Pages
    Good Essays