Preview

Qsdsqqs

Powerful Essays
Open Document
Open Document
9011 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Qsdsqqs
International Journal of Networks and Communications 2013, 3(1): 1-11 DOI: 10.5923/j.ijnc.20130301.01

Analysis of Routing Protocols in AD HOC and Sensor Wireless Networks Based on Swarm Intelligence
Zulfiqar Ali, Waseem Shahzad*
National University of Computer & Emerging Science, Islamabad, Pakistan

Abstract There are various bio inspired and evolutionary approaches including genetic programming (GP), Neural
Network, Evo lutionary programming (EP) exp loited for routing optimizat ion in MANETs and WSNs. The Swarm Intelligence based algorithmic approaches; Particle Swarm Optimization (PSO) and Ant Co lony Optimization (A CO) are more p ro mising in provid ing loop free, energy-aware, and mult i-path routing in mob ile ad hoc and wireless sensor networks. There are various constraints involved in ad hoc and sensor networks protocols due to the mobility and non infrastructure nature of the system. We study in this research work a probabilistic performance evaluation frameworks and Swarm Intelligence approaches (PSO, A CO) for routing protocols. The performance evaluation metrics employed for wireless and ad hoc routing algorith ms is , (a) routing overhead, (b) route optimality, and (c) energy consumption. Th is survey provides collection of Swarm Intelligence based algorithms for mobile ad hoc an d sensor networks and their critical analysis. The study concludes that PSO and ACO based protocols are advantageous than other approaches applied for the routing optimization in ad hoc and wireless sensor networks.

Keywords Ant Colony Optimizat ion (ACO), MANET, Honeybees, Swarm Intelligent, PSO, Wireless Sensor Network
(WSN)

1. Introduction
The MANETs are a co llect ion of wireless mob ile nodes having no well established infrastructure and dynamically changing topology in nature. Due to the frequently changes in topology and infrastructure less nature, Ad hoc networks require a h ighly adaptive routing algebraic approaches. In ad hoc net works , co mpon



References: [1] Charles E. Perkins and Elizabeth M . Royer. "Ad hoc On-Demand Distance Vector Routing." Proceedings of the 2nd IEEE Workshop on M obile Computing Systems and Applications, New Orleans, LA, pp. 90-100, February 1999. David B Johnson and David A M altz, “DSR : The Dynamic Source Routing Protocol for M ulti-Hop Wireless Ad Hoc Networks”, in Computer and Information Science, Volume: 5, pp. 1-25, 2001. T. Clausen, P.Jacquet, A Laouiti, P.M uhlethaler, A. Qayyum, and L.Viennot, “Optimized link state routing protocol for ad hoc networks,” in Proceedings of IEEE, INM IC, pp. 62 - 68, 2001. Zygmunt J. Haas and M arc R. Pearlman, “ The performance of query control schemes for the zone routing protocol”, In Proceedings of the ACM SIGCOMM '98 conference on [2] [3] [4] International Journal of Networks and Communications 2013, 3(1): 1-11 11 [18] Xun-bing Wang, Yong-zhao Zhan, Liang-min Wang and Li-ping Jiang, “Ant Colony Optimization and Ad-hoc On-demand M ultipath Distance Vector Based Routing Protocol,” IEEE Fourth International Conference on Natural Computation, pp. 589-593, 2008. [19] Roth M artin and Wicker Stephen, “Termite: ad-hoc networking with stigmergy”, in IEEE Conference, Global Telecommunications, vol.5, pp. 2937 – 2941, 2003. [20] M esut Gunes¸, Udo Sorges and Imed Bouazizi, “ARA – The Ant-Colony Based Routing Algorithm for M ANETs”, International Workshop on Ad Hoc Networking (IWAHN 2002), Vancouver, British Columbia, Canada, August 18-21, 2002. [21] Di Caro, G., Ducatelle, F. and Gambardella, L. M ., “AntHocNet: An Adaptive Nature-Inspired Algorithm for Routing in M obile Ad Hoc Networks”, European Transactions on Telecommunications (ETT), Special Issue on Self Organization in M obile Networking, Volume 16, Number 5, pp. 443-455, September-October 2005. [22] E. Baburaj and V. Vasudevan “An Intelligent On Demand M ulticast Routing Protocol for M ANETs,”, IEEE, First International Conference on Emerging Trends in Engineering and Technology, pp. 214-217, 2008. [23] O. Hussein and T. Saadawi ,“Ant Routing Algorithm for M obile Ad-hoc networks (AMMA),” , IEEE, Performance, Computing, and Communications Conference, pp.281 – 290, 2003. [24] Ping Yuan, Chunlin Ji, Yangyang Zhang and Yue Wang, “Optimal M ulticast Routing in Wireless Ad Hoc Sensor Networks” , International Conference on Networking, Sensing & Control, IEEE , 2004. [25] S. Gheitanchi, F. H. Ali, and E. Stipidis, "Trained particle swarm optimization for collaborative computing networks," in Proceedings of the Convention Communication, Interaction and Social Intelligence (AISB '08), vol. 11, pp. 7-12, Aberdeen, Scotland, 2008. [26] Okazaki, A.M and Frohlich, A.A., “Ant-based Dynamic Hop Optimization Protocol: A routing algorithm for M obile Wireless Sensor Networks”, in conference GLOBECOM Workshops (GC Wkshps), IEEE, 1139 – 1143, Dec. 2011. [27] Tiago Camilo, Carlos Carreto, Jorge SáSilva, and Fernando Boavida. “An energy-efficient ant-based routing algorithm for wireless sensor networks”, In Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence (ANTS '06), pp. 49-59, 2006. [28] Liao M ing-hua, Zhang Hua, Sun Guang, "Energy Aware Routing Algorithm for Wireless Sensor Network Based on Ant Colony Principle", JCIT: Journal of Convergence Information Technology, Vol. 7, No. 4, pp. 215 – 221, 2012. [29] Rajeshwar Singh, Dharmendra K Singh and Lalan Kumar, “Performance Evaluation of ACO Based on Demand Routing Algorithm for M obile Ad Hoc Networks”, in Internal Journal Engineering Science and Technology(IJEST), Vol.3, Issue 3, pp. 1809-1815, M arch 2011. [30] Okazaki, A.M and Frohlich, A.A., “Ant-based Dynamic Hop Optimization Protocol: A routing algorithm for M obile Wireless Sensor Networks”, in GLOBECOM Workshops (GC Wkshps), IEEE, pp. 1139 – 1143, Dec. 2011. [31] Jian-Feng Yan, Yang Gao and Lu Yang, “Ant colony optimization for wireless sensor networks routing”, International Conference on M achine Learning and Cybernetics (ICM LC), pp. 400 - 403 , July 2011. [32] Xie Hui, Zhang Zhigang and Zhou Xueguang, “A Novel Routing Protocol in Wireless Sensor Networks Based on Ant Colony Optimization”, on International Conference, Environmental Science and Information Application Technology(ESIAT), pp. 646 – 649, July 2009.

You May Also Find These Documents Helpful

  • Good Essays

    In Dynamic Routing, Routing Protocols running in Routers reliably exchange system status upgrades between one another as broadcast or multicast. With the support of routing upgrades messages sent by the Routing Protocols, routers can always redesign the routing table whenever a framework topology change happens. The routers or switches then upgrade one another about all the networks or system they know. If a change happens in a router goes down, the dynamic routing protocols naturally illuminate all switches about the change. If static routing is utilized, then the system manager or administrator has to upgrade all changes redesign all progressions into all routers and therefore no routing protocol is utilized.…

    • 1266 Words
    • 6 Pages
    Good Essays
  • Satisfactory Essays

    Nt1310 Unit 7

    • 410 Words
    • 2 Pages

    AODV has pooled properties of both DSR and DSDV. It uses route discovery process for sustaining route information through the basis of routing table. It is a reactive protocol as it doesn’t need to establish or maintain routes to nodes that are not involved in the communication. AODV handles route discovery process with Route Request (RREQ) messages to broadcast to neighbour nodes. The message floods through the network till the desired destination is reached. Sequence number guarantees the loop freedom. The destination node at once receiving a RREQ unicasts a Route Reply (RREP) back to the source node. Node transmitting a RREP message creates routing table entries for forward route. For route maintenance, nodes send HELLO messages intermittently to neighbour nodes. If any node in the network miss the mark to receive three consecutive HELLO messages from its neighbour, it presumes that link to that particular node is down. A node that perceive a broken link directs a Route Error (RERR) message to any upstream node. At once a node receives a RERR message it will signpost a new source discovery process. The AODV protocol uses sequence numbers to determine the timeliness of each packet and to…

    • 410 Words
    • 2 Pages
    Satisfactory Essays
  • Powerful Essays

    It230 Unit 3 Assignment 1

    • 5629 Words
    • 23 Pages

    General assessment of the selected routing protocol identify its functionality and how an algorithm should be developed to the specific routing protocol.…

    • 5629 Words
    • 23 Pages
    Powerful Essays
  • Good Essays

    1. Design a plan to integrate the different routing protocols into a new network design for Genome4U’s lab.…

    • 693 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
  • Satisfactory Essays

    This book is designed to provide information about Routing Protocols and Concepts of the Cisco Network Academy CCNA Exploration curriculum. Every effort has been made to make this book as complete and as accurate as possible, but no warranty or fitness is implied. The information is provided on an “as is” basis. The authors, Cisco Press, and Cisco Systems, Inc. shall have neither liability nor responsibility to any person or entity with respect to any loss or damages arising from the information contained in this book or from the use of the discs or programs that may accompany it. The opinions expressed in this book belong to…

    • 99578 Words
    • 399 Pages
    Satisfactory Essays
  • Good Essays

    Overview Of Key Routing Protocol Concepts: Architectures, Protocol Types, Algorithms and Metrics". Tcpipguide.com. Retrieved 15 January 2011.…

    • 479 Words
    • 2 Pages
    Good Essays
  • Powerful Essays

    [20] Groten, D.; Schmidt, J.R.; Bluetooth-based mobile ad hoc networks: opportunities and challenges for a telecommunications operator, Vehicular Technology Conference, (2001), (p.1134-1138)…

    • 8968 Words
    • 36 Pages
    Powerful Essays
  • Best Essays

    swarm intelligence for problems of optimization. The overview and experiments of PSO, ACS, and ABC are given. Enhanced versions of these are also…

    • 4410 Words
    • 18 Pages
    Best Essays
  • Powerful Essays

    Pso Paralellization

    • 928 Words
    • 4 Pages

    1 Introduction. PSO Kennedy & Eberhart (1995) proposed this bio-inspired PSO approach, which can be seen as a population-based optimization algorithm that performs a parallel search on a space of solutions. As an optimization algorithm, the purpose of the individuals in PSO is to find out the best position when they move through the problem space. These individuals in PSO, called particles, are initialized by a randomized velocity and position at the beginning of optimization, and then change their velocities and positions under the companions influence. In the optimization context, several solutions of a given problem constitute a population, called The Swarm. Each solution is seen as a social…

    • 928 Words
    • 4 Pages
    Powerful Essays
  • Powerful Essays

    This chapter provides a breif introduction to the area of Nature Inspired Algorithms and its classification. Among all the categories, Swarm intelligence will be the main area of focus. Various swarm intelligence techinques will be discussed in the later sections. Cuckoo Search Algorithm is also one of the latest swarm intelligence technique which is focused in this dissertation to solve the problem discussed in chapter 1.…

    • 3691 Words
    • 15 Pages
    Powerful Essays
  • Powerful Essays

    Chapter 1 INTRODUCTION 1.1 Background Vehicular ad hoc networks (VANETs) are self-configuring networks where the nodes are vehicles (equipped with onboard computers), elements of roadside infrastructure, sensors, and pedestrian personal devices. Wi-Fi (IEEE 802.11-based) technologies are used for deploying such kind of networks. At present, the IEEE group is completing the IEEE 802.11p and IEEE 1609 final drafts, which are known as “Standard Wireless Access in Vehicular Environments”(WAVE), specifically designed for VANETs. This technology presents the opportunity to develop powerful car systems capable of gathering, processing, and distributing information. For example, a driver assistance system could collect accurate and up-to-date data about the surrounding…

    • 6447 Words
    • 26 Pages
    Powerful Essays
  • Good Essays

    Travelling Salesman Problem

    • 3162 Words
    • 13 Pages

    Rina Refianti dan A.Benny Mutiara Jurusan Teknik Informatika, Universitas Gunadarma Abstraksi Ant Colony System (ACS) adalah sebuah metodologi yang dihasilkan melalui pengamatan terhadap semut. Di dalam ACS terdapat sejumlah semut buatan, dinamai ants, yang berfungsi sebagai agent yang ditugaskan untuk mencari solusi terhadap suatu masalah optimisasi. ACS telah diterapkan dalam berbagai bidang, salah satunya adalah untuk mencari solusi optimal pada Traveling Salesman Problem (TSP). Dengan memberikan sejumlah n kota, TSP dapat didefinisikan sebagai suatu permasalahan dalam menemukan jalur terpendek dengan mengunjungi setiap kota yang ada hanya sekali. ACS telah diuji dan dibandingkan dengan metodologi yang lain untuk membuktikan keoptimalannya tersebut. Dan hal inilah yang menjadi dasar bagi penulis dalam melakukan penelitian terhadap ACS, yaitu untuk membuktikan keoptimalannya tersebut. Penelitian ini dilakukan dengan mengimplementasikan ACS ke dalam bentuk kode-kode program berbahasa Java. Kemudian dilakukan percobaan untuk membandingkan antara ACS dengan metodologi lainnya yang juga meng-implementasikan agent di dalamnya. Dari hasil percobaan diketahui bahwa secara garis besar ACS terbukti merupakan metodologi yang paling optimal dalam menemukan jalur terpendek. Dan penelitian ini telah berhasil membuktikan keoptimalan dari ACS dalam menemukan solusi terhadap TSP. Keyword: Genetic Algorithm, Ant System, Software Agent, Pheromone, state transition rule 1. Pengantar Salah rekayasa satu paradigma lunak baru dalam dapat dihindari akan dibutuhkannya lebih dari satu agent, seiring dengan semakin kompleksnya tugas yang dikerjakan oleh sistem tersebut. Paradigma pengembangan sistem di mana dalam suatu komunitas terdapat beberapa agent yang saling berinteraksi, bernegosiasi, dan berkoordinasi satu sama lain dalam menjalankan pekerjaan disebut dengan Multi Agent System (MAS) [Romi]. Colony M. Dan…

    • 3162 Words
    • 13 Pages
    Good Essays
  • Powerful Essays

    M. Dorigo and C. Blum. Ant colony optimization theory: A survey. Theoretical Computer Science, 344(2–3):243–278, 2005.…

    • 3662 Words
    • 15 Pages
    Powerful Essays
  • Good Essays

    Emergence of the concept of multihop ad-hoc wireless networks, low power electronics, low power short-range wireless communication radios, and intelligent sensors are considered as the major technological enablers for the deployment of sensor networks (SNs). Our goal in this survey is to identify the key architectural and design issues related to sensor networks, critically evaluate the proposed solutions, and outline the m challenging research ost directions. The evaluation has three levels of abstraction: individual components on SN nodes (processor, communication, storage, sensors and/or actuators, and power supply), node level, and distributed networked system level. Special emphasis is placed on architecture, system software, and on challenges related to the usage of new types of components in networked systems. The evaluation process is guided by the anticipated technology trends, the current and the future applications. The main conclusion of the analysis is that the architectural and synthesis emphasis will be shifted from computation and communication components to sensors and actuators, and…

    • 9740 Words
    • 39 Pages
    Good Essays