Journal of Emerging Technologies in Web Intelligence Contents

86 JOURNAL OF EMERGING TECHNOLOGIES IN WEB INTELLIGENCE, VOL. 2, NO. 2, MAY 2010Bee-Inspired Routing Protocols for MobileAd HOC Network (MANET)Deepika ChaudharyChitkara Institute of Engg & Technology JhanslaTeh. Rajpura,Distt Patiala-140401,Punjabdeepika.chaudhary@chitkara.edu.inAbstract – Mobile AdHoc networks( MANETs) are receivinga significant amount of attention from researchers. Thispaper provides a high light on a new and very energyefficient algorithm for routing in Manets BeeAdHoc. Thisalgorithm is a reactive source routing algorithm andconsumes less energy as compared to other existing state ofart routing algorithms because a fewer control packets forrouting are sent as compared to other networks.I. INTRODUCTIONMobile Ad HOC networks (MANET’S) are networks inwhich all nodes are mobile and communicate with each other viawireless connections. Nodes can join or leave the network at anytime. There is no fixed infrastructure. All nodes are equal andthere is no centralized control or overview. There no designatedrouters all nodes can serve as routers for each other and datapackets are forwarded from node to node in multihop fashion.Since a few years researcher’s interest in MANETS havebeen growing and especially the design of MANET routingprotocols has received a lot of attention. One of the reasons isthat routing in MANETS is particularly challenging task due tothe fact that the topology of the network changes constantly andpaths, which were initially efficient, can quickly becomeinefficient or even infeasible. Moreover control information flowin the network is very restricted. This is because the bandwidthof the wireless medium is very limited and the medium isshared: nodes can only send or receive data if no other node issending in their radio neighborhood. It is therefore important todesign algorithm that are adaptive robust & self-healing. Natureself-organizing systems like insect societies show precisely thesedesirable properties. Making use of a number of relativelysimple biological agents like ants, a variety of differentorganized behavior are generated at the system level from thelocal interaction among the agents and with the environment.The robustness and effectiveness of such collective behaviorswith respect to variations of environment conditions are keyaspects of their biological success. This kind of systems areoften referred to with the term swarm intelligence. Swarmsystems have recently become a source of inspiration for designof distributed & adaptive algorithms.II. DESIGN ISSUES OF ROUTING ALGORITHMSThe most important challenge in designing algorithms forMANETs are mobility and limited battery capacity of nodes.Mobility of nodes results in continuously evolving newtopologies and consequently the routing algorithms have todiscover or update the routes in real time but with small controloverhead . The limited battery capacity requires that the packetsif possible be distributed on multiple paths , which would resultin the depletion of batteries of different nodes at an equal rateand hence as a result the life time of networks would increase[1].Therefore an important challenge in Manets is to design arouting algorithm that is not only energy effieicent but alsodelivers performance same or better than existing state of artrouting protocols.III. CLASSIFICATION OF ROUTING ALGORITHMS INMANETSThe routing algorithms for Manets can be broadly classifiedas proactive algorithms or reactive algorithms. Proactivealgorithms periodically launch control packets which collect thenew network state and update the routing tables accordingly. Onthe other hand, reactive algorithms find routes on demand only.Reactive algorithms looks more promising from the prespectiveof energy consumption in Manets. Each category of abovementioned algorithms can further be classified into hostintelligent or router intelligent algorithms . A few reactivealgorithms are DSR ( Dynamic Source Routing ) which is hostintelligent algorithm while AODV( AdHoc On DemandDistance Vector Routing) which is a router –intelligentalgorithm.However these algorithms are not designed for energyefficient routing. Here in this study an deep insight is providedon BeeAdHoc which delivers performance same as better thanthat of DSR,AODV but consumes less energy as compared tothem. The algorithm achieves these objectives by transmittingfewer control packets and by distributing data packets onmultiple paths.IV. EXISTING WORK ON NATURE –INSPIRED MANETROUTING PROTOCOLSThe first algorithm which presents a detailed scheme forMANET routing based on ant colony principles is ARA [3]. Thealgorithm has its roots in ABC AND AntNet Routing algorithmsfor fixed networks and are inpired by the pheromone layingbehavior of ant colonies . AntHocNet, which is hybrid algorithmhaving both reactive and proactive components have also beenproposed.This algorithm tries to keep most of features of theoriginal AntNet and shows promising results in simulationcomared to AODV Termite is another MANET routingalgorithm inspired by termite behaviour .Here no special agentsare needed for updating the routing tables rather data packets aredelegated this task.V. OVERVIEW OF BEEADHOC ARCHITECTUREBeeAdHoc is an on-demand multi path routing algorithm formobile adhoc networks inspired from the foraging principles ofhoney bees[4]. BeeAdHoc works with types of agents: packers,scouts foragers and swarms. The packers locate a forager andhand over the data packet to the discovered forager. Scoutsdiscover new routes from the launching node to the destination© 2010 ACADEMY PUBLISHERdoi:10.4304/jetwi.2.2.86-88