Comparative Analysis of Routing Protocols in Mobile Adhoc … · 2016-08-29 · Kiranmai Nandagiri,...

A

National Conference on Recent Trends in Computer Science and Technology (NCRTCST)-2013

All copyrights Reserved by NCRTCST-2013, Departments of CSECMR College of Engineering and Technology, Kandlakoya(V), Medchal Road, Hyderabad, India.Published by IJECCE (www.ijecce.org) 150

International Journal of Electronics Communication and Computer EngineeringVolume 4, Issue (6) NCRTCST-2013, ISSN 2249–071X

Comparative Analysis of Routing Protocols in MobileAdhoc Networks

Kiranmai Nandagiri, M.Tech., CSEAssistant Professor, Bharath Institute of Technology and Science for Women

Email: [email protected]

Abstract – Adhoc networks are multi-hop networksconsisting of wireless autonomous hosts, where each host mayserve as a router to assists traffic from other nodes. Wirelessadhoc networks cover a wide range of network scenarios,including sensor, mobile adhoc, personal area, androoftop/mesh networks. Sensors provide service to monitoringstations. Mobile adhoc networks are pure infrastructure lessnetworks used in disaster relief, conference, hospital, campusand battlefield environments, with laptops, palmtops, cellularphones or other devices serving as nodes. Rooftop/meshnetworks provide high-speed wireless Internet access tohomes and offices. Therefore, routing in MANET is a criticaltask due to highly dynamic environment. In recent years,several routing protocols have been proposed for mobileadhoc networks and prominent among them are DSR, AODVand TORA. This research paper provides an overview ofthese protocols by presenting their characteristics,functionality, benefits and limitations and then makes theircomparative analysis so to analyze their performance. Theobjective is to make observations about how the performanceof these protocols can be improved.

Keywords – MANET, DSR, AODV and TORA.

I. INTRODUCTION

An ad-hoc network is temporarily formed by a group ofmobile hosts communicating over wireless channelswithout any fixed network interaction and centralizedadministration. In the infrastructure, all the mobile hostscommunicate with other mobile hosts in a wirelessmulti-hop routing style. All the mobile hosts act as routersin the network. Mobile Ad-hoc Network (MANET) is atemporary wireless network composed of mobile nodes, inwhich an infrastructure is absent. There are no dedicatedrouters, servers, access points and cables. Because of itsspeedy and convenient deployment, robustness, and lowcost, a MANET can find its applications in the followingareas:(1) Military use (e.g. a network in the battlefield)(2) Search and rescue(3) Vehicle-to-vehicle communication in intelligenttransportation.(4) Temporary networks in meeting rooms, airports, etc.(5) Personal Area Networks connecting cell phones,laptops, smart watches, and other wearable computers. Iftwo mobile nodes are within each other’s transmissionrange, they can communicate with each other directly.Otherwise, the nodes in between have to forward thepackets for them. In such a case, every mobile node has to

function as a router to forward the packets for others.Traditional routing protocols used in hardwired networks,such as distance vector protocols (e.g. RIP) and link stateprotocols (e.g., OSPF) cannot be applied in the MANETdirectly for the following reasons:(1) There may be uni-directional links between nodes.(2) There is more than one eligible path between two nodes.(3) The consumption of bandwidth and power supplyincurred by periodic routing information updates isconsiderable.(4) The routing fabrics converge slowly in contrast to rapidtopology change.

The rest of this paper is organized as follows.In section 2,Types of routing schemes are described. Classification ofAdhoc Routing Protocols is explained in section3.Comparative analysis of routing protocols is explained inSection 4 .Conclusions and References are given inSection 5 and 6.

II. TYPES OF ROUTING SCHEMES

In adhoc networks the routing scheme is an importantFactor to improve the network efficiency.There are 4 types of routing schemes such as(a) Dynamic source routing scheme(b) Clustered based routing scheme(c) Zone routing scheme(d) Minimum Connected Dominating Set (MCDS) scheme(a) Dynamic source routing scheme:

A mobile host propagates the route discovery message allover the network while a routing request is being issued.

Each node that is forwarding this route discoverymessage adds its address into the source list in which themessage reaches the destination node. The complete pathfrom source to destination is listed in the packet. The routeis replied to the source node. The routes discovered in thisway or by hearing routing message in its neighbourhood arerecorded in the cache.(b) Clustered based routing scheme:

In this approach the adhoc network is clustered as atwo-level network graph the upper level is the cluster-levelconnected graph, and the lower level is the originnode-level connected graph. At first it constructsoverlapping clusters structure in the network. Each nodeshould maintain not only intra-cluster topology informationbut also the inter cluster topology.

www.ijecce.org

mailto:[email protected]

A




(c) Zone routing scheme:The zone routing scheme is somewhat similar to the

cluster-based approach. For each mobile node it maintainsall the links within the defined radius, the so-called “zone”.

When a route request is issued, it searches within thezone. Moreover, the inter-zone searching is executed bymulticasting request message to its boundary nodes. Theboundary nodes proceed with the same route searchingstrategy. Finally the route or failure messages are replied.(d) Minimum Connected Dominating Set (MCDS):

Another approach is the characteristic of the minimumconnected dominating set (MCDS) to construct a so-calledvirtual backbone in an ad-hoc network. All the nodes not inthe virtual backbone have their dominators that are theaccess points on the virtual backbone. A mobile hostcommunicating with other mobile hosts may be routedthrough the virtual backbone by its dominator.

III. CLASSIFICATION OF ADHOC ROUTING

PROTOCOLS

A Mobile Adhoc Network (MANET) is an autonomoussystem of nodes (MSs) connected by wireless links.AMANET does not necessarily need support from anyexisting network infrastructure like an Internet gateway orother fixed stations. The network’s wireless topology maydynamically change in an unpredictable manner sincenodes are free to move. Information is transmitted in astore-and forward manner using multi hop routing. Eachnode is equipped with a wireless transmitter and a receiverwith an appropriate antenna. We assume that it is notpossible to have all nodes within each other’s radio range.When the nodes are close-by i.e., within radio range, thereare no routing issues to be addressed. At a given point intime, wireless connectivity in the form of a randommulti-hop graph exists between the nodes.

Fig.1. A Mobile Adhoc Network

Characteristics of Adhoc Networks:Dynamic topologies: Network topology may changedynamically as the nodes are free to move.Bandwidth-constrained, variable capacity links:Realized throughput of wireless communication is less thanthe radio’s maximum transmission rate. Collision occursfrequently.

Energy-constrained operation: Some nodes in the adhoc network may rely on batteries or other exhaustiblemeans for their energy.Limited physical security: More prone to physicalsecurity threats than fixed cable networks.Applications: Virtual navigation: Data from a remote database istransmitted periodically in small relevant blocks using linkspresent in the path of the automobile. This database maycontain the graphical representation of streets, buildings,maps and the latest traffic information, which may be usedby the driver to decide on a route. Tele-medicine: Conference assistance from a surgeonfor an emergency intervention. Tele-Geo processing: Queries regarding locationinformation of the users. Crisis-management: Natural disasters, where the entirecommunication infrastructure is in disarray. Education via the internetRouting in MANETS – Goals Provide the maximum possible reliability - use

alternative routes if an intermediate node fails. Choose a route with the least cost metric. Give the nodes the best possible response time and

throughput. Route computation must be distributed. Centralized

routing in a dynamic network is usually very expensive. Routing computation should not involve the

maintenance of global state. Every node must have quick access to routes on

demand. Each node must be only concerned about the routes to

its destination. Broadcasts should be avoided (highly unreliable) It is desirable to have a backup route when the primary

route has become stale.Routing ClassificationThe routing protocols can be classified as,Proactive: when a packet needs to be forwarded, the routeis already known.Reactive: Determine a route only when there is data tosend.Routing protocols may also be categorized as :(a)Table Driven protocols(b)Source Initiated (on demand) protocols

Routing protocols can be divided into two categories:table-driven and on-demand routing based on when andhow the routes are discovered. In table driven routingprotocols consistent and up-to-date routing information toall nodes is maintained at each node whereas in on-demandrouting the routes are created only when desired by thesource host.

A









PROTOCOLS













A









PROTOCOLS













www.ijecce.org

www.ijecce.org

www.ijecce.org

A




Fig.2. Classification of Adhoc Routing Protocols

(a) Table Driven protocols:In Table-driven routing protocols each node maintains

one or more tables containing routing information to everyother node in the network. All nodes update these tables soas to maintain a consistent and up-to-date view of thenetwork. When the network topology changes the nodespropagate update messages throughout the network in orderto maintain a consistent and up-to-date routing informationabout the whole network. These routing protocols differ inthe method by which the topology change information isdistributed across the network and the number of necessaryrouting-related tables.3.1 Dynamic Destination-Sequenced Distance-VectorRouting Protocol:

The Destination-Sequenced Distance-Vector (DSDV)Routing Algorithm is based on the idea of the classicalBellman-Ford Routing Algorithm with certainimprovements. Every mobile station maintains a routingtable that lists all available destinations, the number of hopsto reach the destination and the sequence number assignedby the destination node. The sequence number is used todistinguish stale routes from new ones and thus avoid theformation of loops. The stations periodically transmit theirrouting tables to their immediate neighbours. A station alsotransmits its routing table if a significant change hasoccurred in its table from the last update sent. So, the updateis both time-driven and event-driven. The routing tableupdates can be sent in two ways:- a "full dump" or anincremental update. A full dump sends the full routing tableto the neighbours and could span many packets whereas inan incremental update only those entries from the routingtable are sent that has a metric change since the last updateand it must fit in a packet. If there is space in theincremental update packet then those entries may beincluded whose sequence number has changed. When thenetwork is relatively stable, incremental updates are sent toavoid extra traffic and full dump are relatively infrequent.In a fast-changing network, incremental packets can growbig so full dumps will be more frequent. Each route updatepacket, in addition to the routing table information, alsocontains a unique sequence number assigned by the

transmitter. The route labelled with the highest (i.e. mostrecent) sequence number is used. If two routes have thesame sequence number then the route with the best metric(i.e. shortest route) is used. Based on the past history, thestations estimate the settling time of routes. The stationsdelay the transmission of a routing update by settling timeso as to eliminate those updates that would occur if a betterroute were found very soon.

Fig.3. Example of DSDV

A’s Routing Table before Change

A’s Routing Table after Change

3.2 The Wireless Routing Protocol (WRP):The Wireless Routing Protocol (WRP) is a table-based

distance-vector routing protocol. Each node in the network

A














A














www.ijecce.org

www.ijecce.org

www.ijecce.org

A




maintains a Distance table, a Routing table, a Link-Costtable and a Message Retransmission list. The Distance tableof a node x contains the distance of each destination node yvia each neighbour z of x.It also contains the downstreamneighbour of z through which this path is realized. TheRouting table of node x contains the distance of eachdestination node y from node x, the predecessor and thesuccessor of node x on this path. It also contains a tag toidentify if the entry is a simple path, a loop or invalid.Storing predecessor and successor in the table is beneficialin detecting loops and avoiding counting-to-infinityproblems. The Link-Cost table contains cost of link to eachneighbour of the node and the number of timeouts since anerror-free message was received from that neighbour. TheMessage Retransmission list (MRL) contains informationto let a node know which of its neighbour has notacknowledged its update message and to retransmit updatemessage to that neighbour. Node exchange routing tableswith their neighbours using update messages periodicallyas well as on link changes. The nodes present on theresponse list of update message (formed using MRL) arerequired to acknowledge the receipt of update message. Ifthere is no change in routing table since last update, thenode is required to send an idle Hello message to ensureconnectivity. On receiving an update message, the nodemodifies its distance table and looks for better paths usingnew information. Any new path so found is relayed back tothe original nodes so that they can update their tables. Thenode also updates its routing table if the new path is betterthan the existing path. On receiving an ACK, the modeupdates its MRL. A unique feature of this algorithm is thatit checks the consistency of all its neighbours every time itdetects a change in link of any of its neighbours.Consistency check in this manner helps eliminate loopingsituations in a better way and also has fast convergence.3.3 Cluster head Gateway Switch Routing Protocol:

Cluster head Gateway Switch Routing (CGSR)[Chiang97] uses as basis the DSDV Routing algorithmdescribed in the previous section. The mobile nodes areaggregated into clusters and a cluster-head is elected. Allnodes that are in the communication range of thecluster-head belong to its cluster. A gateway node is a nodethat is in the communication range of two or morecluster-heads. In a dynamic network cluster head schemecan cause performance degradation due to frequentcluster-head elections, so CGSR uses a Least ClusterChange(LCC) algorithm. In LCC, cluster-head changeoccurs only if a change in network causes two cluster-headsto come into one cluster or one of the nodes moves out ofthe range of all the cluster-heads. The general algorithmworks in the following manner. The source of the packettransmits the packet to its cluster-head. From thiscluster-head, the packet is sent to the gateway node thatconnects this cluster-head and the next cluster-head alongthe route to the destination. The gateway sends it to thatcluster-head and so on till the destination cluster-head isreached in this way. The destination cluster-head then

transmits the packet to the destination. Figure 4 shows anexample of CGSR routing Routing.

Fig.4. CGSR example

(b) Source Initiated On Demand Routing Protocol:These protocols take a lazy approach to routing. In

contrast to table-driven routing protocols all up-to-dateroutes are not maintained at every node, instead the routesare created as and when required. When a source wants tosend to a destination, it invokes the route discoverymechanisms to find the path to the destination. The routeremains valid till the destination is reachable or until theroute is no longer needed. This section discusses a fewon-demand routing protocols.3.4 Adhoc On-demand Distance Vector Routing(AODV)

Adhoc On-demand Distance Vector Routing (AODV)[Perkins99] is an improvement on the DSDV algorithmdiscussed in previous section. AODV minimizes thenumber of broadcasts by creating routes on-demand asopposed to DSDV that maintains the list of all the routes.To find a path to the destination, the source broadcasts aroute request packet. The neighbours in turn broadcast thepacket to their neighbours till it reaches an intermediatenode that has a recent route information about thedestination or till it reaches the destination (Figure 5a). Anode discards a route request packet that it has already seen.The route request packet uses sequence numbers to ensurethat the routes are loop free and to make sure that if theintermediate nodes reply to route requests, they reply withthe latest information only. When a node forwards a routerequest packet to its neighbours, it also records in its tablesthe node from which the first copy of the request came. Thisinformation is used to construct the reverse path for theroute reply packet. AODV uses only symmetric linksbecause the route reply packet follows the reverse path ofroute request packet. As the route reply packet traversesback to the source (Figure 5b), the nodes along the pathenter the forward route into their tables. If the source moves

www.ijecce.org

A




then it can reinitiate route discovery to the destination. Ifone of the intermediate nodes move then the moved nodesneighbour realizes the link failure and sends a link failurenotification to its upstream neighbours and so on till itreaches the source upon which the source can reinitiateroute discovery if needed.

Fig.5. (a)

Fig.5. (b)

3.5 Dynamic Source Routing Protocol:The Dynamic Source Routing Protocol [Johnson99] is a

source-routed on-demand routing protocol. A nodemaintains route caches containing the source routes that it isaware of. The node updates entries in the route cache as andwhen it learns about new routes. The two major phases ofthe protocol are: route discovery and route maintenance.When the source node wants to send a packet to adestination, it looks up its route cache to determine if italready contains a route to the destination. If it finds that anunexpired route to the destination exists, then it uses thisroute to send the packet. But if the node does not have sucha route, then it initiates the route discovery process bybroadcasting a route request packet. The route requestpacket contains the address of the source and thedestination, and a unique identification number. Eachintermediate node checks whether it knows of a route to thedestination. If it does not, it appends its address to the routerecord of the packet and forwards the packet to itsneighbours. To limit the number of route requestspropagated, a node processes the route request packet onlyif it has not already seen the packet and its address is notpresent in the route record of the packet. A route reply isgenerated when either the destination or an intermediatenode with current information about the destinationreceives the route request packet. A route request packet

reaching such a node already contains, in its route record,the sequence of hops taken from the source to this node.

Fig.6. Route Discovery

3.6 Temporally Ordered Routing Algorithm (TORA):The Temporally Ordered Routing Algorithm (TORA) is

a highly adaptive, efficient and scalable distributed routingalgorithm based on the concept of link reversal [Park97].TORA is proposed for highly dynamic mobile, multi hopwireless networks. It is a source-initiated on-demandrouting protocol .It finds multiple routes from a source nodeto a destination node. The main feature of TORA is that thecontrol messages are localized to a very small set of nodesnear the occurrence of a topological change.To achieve this,the nodes maintain routing information about adjacentnodes. The protocol has three basic functions: Routecreation, Route maintenance, and Route erasure.Each node has a quintuple associated with it -1. Logical time of a link failure2. The unique ID of the node that defined the new

reference level3. A reflection indicator bit4. A propagation ordering parameter5. The unique ID of the node

The first three elements collectively represent thereference level. A new reference level is defined each timea node loses its last downstream link due to a link failure.The last two values define a delta with respect to thereference level [Park97].Route Creation is done using QRYand UPD packets. The route creation algorithm starts withthe height(propagation ordering parameter in the quintuple)

www.ijecce.org

A




of destination set to 0 and all other node's height set toNULL (i.e. undefined). The source broadcasts a QRYpacket with the destination node's id in it. A node with anon-NULL height responds with a UPD packet that has itsheight in it. A node receiving a UPD packet sets its heightto one more than that of the node that generated the UPD. Anode with higher height is considered upstream and a nodewith lower height downstream. In this way a directedacyclic graph is constructed from source to the destination.3.7 Associativity Based Routing (ABR) protocol:

The Associativity Based Routing (ABR) protocol is anew approach for routing. ABR defines a new metric forrouting known as the degree of association stability. It isfree from loops, deadlock, and packet duplicates. In ABR, aroute is selected based on associativity states of nodes. Theroutes thus selected are liked to be long-lived. All nodegenerate periodic beacons to signify its existence. When aneighbour node receives a beacon, it updates itsassociativity tables. For every beacon received, a nodeincrement its associativity tick with respect to the nodefrom which it received the beacon. Association stabilitymeans connection stability of one node with respect toanother node over time and space. A high value ofassociativity tick with respect to a node indicates a low stateof node mobility, while a low value of associativity tickmay indicate a high state of node mobility. Associativityticks are reset when the neighbours of a node or the nodeitself move out of proximity. The fundamental objective ofABR is to find longer-lived routes for ad hoc mobilenetworks. The three phases of ABR are Route discovery,Route reconstruction (RRC) and Route deletion. The routediscovery phase is a broadcast query and await-reply(BQ-REPLY) cycle. The source node broadcasts a BQmessage in search of nodes that have a route to thedestination. A node does not forward a BQ request morethan once. On receiving a BQ message, an intermediatenode appends its address and its associativity ticks to thequery packet. The next succeeding node erases its upstreamnode neighbours ’associativity tick entries and retains onlythe entry concerned with itself and its upstream node. Eachpacket arriving at the destination will contain theassociativity ticks of the nodes along the route from sourceto the destination. The destination can now select the bestroute by examining the associativity ticks along each of thepaths. If multiple paths have the same overall degree ofassociation stability, the route with the minimum number ofhops is selected. Once a path has been chosen, thedestination sends a REPLY packet back to the source alongthis path. The nodes on the path that the REPLY packetfollows mark their routes as valid. All other routes remaininactive, thus avoiding the chance of duplicate packetsarriving at the destination.

RRC phase consists of partial route discovery, invalidroute erasure, valid route updates, and new route discovery,depending on which node(s) along the route move. Sourcenode movement results in a new BQ-REPLY processbecause the routing protocol is source-initiated. The route

notification (RN) message is used to erase the route entriesassociated with downstream nodes. When the destinationmoves, the destination's immediate upstream node erasesits route. A localized query (LQ [H]) process, where Hrefers to the hop count from the upstream node to thedestination, is initiated to determine if the node is stillreachable. If the destination receives the LQ packet, itselects the best partial route and REPLYs; otherwise, theinitiating node times out and backtracks to the nextupstream node. An RN message is sent to the next upstreamnode to erase the invalid route and inform this node that itshould invoke the LQ [H] process. If this process results inbacktracking more than halfway to the source, the LQprocess is discontinued and the source initiates a new BQprocess. When a discovered route is no longer needed, thesource node initiates a route delete (RD) broadcast. Allnodes along the route delete the route entry from theirrouting tables. The RD message is propagated by a fullbroadcast, as opposed to a directed broadcast, because thesource node may not be aware of any route node changesthat occurred during RRCs.3.8 Signal Stability Routing (SSR):

Signal Stability-Based Adaptive Routing protocol is anon-demand routing protocol that selects routes based on thesignal strength between nodes and a node's locationstability. This route selection criterion has the effect ofchoosing routes that have "stronger" connectivity. SSRcomprises of two cooperative protocols: the DynamicRouting Protocol (DRP) and the Static Routing Protocol(SRP).

The DRP maintains the Signal Stability Table (SST) andRouting Table (RT). The SST stores the signal strength ofneighbouring nodes obtained by periodic beacons from thelink layer of each neighbouring node. Signal strength iseither recorded as a strong or weak channel. Alltransmissions are received by DRP and processed. Afterupdating the appropriate table entries, the DRP passes thepacket to the SRP .The SRP passes the packet up the stackif it is the intended receiver. If not, it looks up thedestination in the RT and forwards the packet. If there is noentry for the destination in the RT, it initiates a route-searchprocess to find a route. Route-request packets areforwarded to the next hop only if they are received overstrong channels and have not been previously processed (toavoid looping). The destination chooses the first arrivingroute-search packet to send back as it is highly likely thatthe packet arrived over the shortest and/or least congestedpath. The DRP reverses the selected route and sends aroute-reply message back to the initiator of route-request.The DRP of the nodes along the path update their RTsaccordingly. Route-search packets arriving at thedestination have necessarily arrived on the path of strongestsignal stability because the packets arriving over a weakchannel are dropped at intermediate nodes. If the sourcetimes out before receiving a reply then it changes the PREFfield in the header to indicate that weak channels areacceptable, since these may be the only links over which the

www.ijecce.org

A




packet can be propagated. When a link failure is detectedwithin the network, the intermediate nodes send an errormessage to the source indicating which channel has failed.The source then sends an erase message to notify all nodesof the broken link and initiates a new route-search processto find a new path to the destination.

IV. COMPARATIVE ANALYSIS OF ROUTING

PROTOCOLS

This section evaluates all MANETs routing protocols onthe basis of their properties.Under the real-time ad-hocnetwork environment, some characteristics of the ad-hocnetwork should be considered in designing the routingschemes, such as dynamic topology, power constrainedmobile nodes, bandwidth constrained links, etc. In order toimprove the system performance, a routing scheme shouldnot be so complicated as to waste the resource of evaluatingthe volatile routes for the rapid changes in networktopology. The rapid response routes are more important forthe route requests issuing, in spite of that they may not bethe shortest routes. Another important issue in such anenvironment is that the control message should notmassively propagate all over the network. The controlmessage packets must be controlled carefully.

DSR has lower routing load than AODV. BecauseAODV has to depend on route discovery more often, DSRlimits the overhead by using route cache. TORA is higherbecause its overhead is the sum of neighbor discovery plusrouting creating and maintenance.DSR and AODV performwell than TORA, delivering over 95% packet regardless ofmobility rate.TORA is lower because the link-reversalprocess fails in the routing maintenance .TORA has a betterperformance in the less sources.

Fig.7. Comparision of On –Demand Protocols

Advantages and Disadvantages: The overhead of TORA is worst. It has a better delivery

ratio in less sources. DSR is good at all mobility rate and movement speed.

Its performance is poor in a higher load. AODV performs almost as well as DST at all mobility

rates and movement. It depends more on routediscovery which may increase overhead in

network

Fig.8: Comparision of Routing Protocols

Based on various properties routing protocols arecompared in this paper. The above two tables give theComparative Analysis of routing protocols in MobileAdhoc Networks. This Comparative Study helps inimproving the performance of these protocols.

V. CONCLUSIONS

This paper gives the Comparative analysis of routingprotocols in mobile adhoc networks. Two categories ofrouting protocols were discussed. Table-driven andon-demand routing protocols. In table-driven protocols,each node maintain up-to-date routing information to all thenodes in the network where in on-demand protocols a nodefinds the route to a destination when it desires to sendpackets to the destination. Several table-driven protocolswere discussed. DSDV is table-driven protocol which usesdestination sequence numbers to keep routes loop-free andup-to-date. CGSR is a cluster-based routing protocol wherenodes are grouped into clusters.

On-demand routing protocols were also discussed. Inon-demand protocols, a route creation is initiated by thesource when the source wants to communicate to thedestination. AODV on-demand version of DSDV routingprotocol. DSRP is a source routing mechanism where theroute is in each packet. Similarly, SSR selects routes basedon signal strength.Under the real-time ad-hoc networkenvironment, some characteristics of the ad-hoc networkshould be considered in designing the routing schemes,such as dynamic topology, power constrained mobilenodes, bandwidth constrained links, etc. In order toimprove the system performance, a routing scheme should

A






PROTOCOLS








network



V. CONCLUSIONS



A






PROTOCOLS








network



V. CONCLUSIONS



www.ijecce.org

www.ijecce.org

www.ijecce.org

A




not be so complicated as to waste the resource of evaluatingthe volatile routes for the rapid changes in networktopology. The rapid response routes are more important forthe route requests issuing, in spite of that they may not bethe shortest routes. Another important issue in such anenvironment is that the control message should notmassively propagate all over the network. The controlmessage packets must be controlled carefully.

REFERENCES

[1] Ravi Garg,Amit Kumar, Manvendra Partap, “AnalyticalPerformance Comparison of Different Routing Protocols inMobile Adhoc Wireless” in IJCSMS International Journal ofComputer Science & Management Studies.

[2] Sunil Taneja and Ashwani Kush,” A Survey of Routing Protocolsin Mobile Adhoc Networks”, in International Journal ofInnovation, Management and Technology.

[3] Parul Sharma, Arvind Kalia And Jawahar Thakur,”PerformanceAnalysis of AODV, Dsr And DSDV Routing Protocols In MobileAd-Hoc Network (MANET)”, in Journal of Information Systemsand Communication.

[4] Gaurav Kadyan, Sitender Malik,”Comparative Study of variousHybrid routing protocols for mobile Adhoc Networks”, inInternational Journal of Latest Research in Science andTechnology.

[5] Finnish Defence Forces, “Classification of Adhoc RoutingProtocols”. Padmini Mishra,”Routing protocols for ad hocwireless network.

[7] Hongbo Zhou, “A survey on routing protocols in MANETS”.Technical report.

[8] Geetha Jayakumar and Gopinath Ganapathy ,“PerformanceComparison of Mobile Ad-hoc Network Routing Protocol”,IJCSNS International Journal of Computer Science and NetworkSecurity.

www.ijecce.org

Comparative Analysis of Routing Protocols in Mobile Adhoc … · 2016-08-29 · Kiranmai Nandagiri,...

Documents

Transcript of Comparative Analysis of Routing Protocols in Mobile Adhoc … · 2016-08-29 · Kiranmai Nandagiri,...