OPTIMIZE THE LINK QUALITY AND NETWORK LIFETIME FOR

OPTIMIZE THE LINK QUALITY AND NETWORK LIFETIME FOR

MULTIPATH ROUTING IN MOBILE ADHOC NETWORK

Swathi G[1]

M.Phil Research Scholar

Department of Computer Science

Sri Ramakrishna College of Arts and Science for Women, Coimbatore.

Email Id :[email protected]

Dr. E. Mary Shyla[2]

Assistant Professor

Department of Computer Science

Sri Ramakrishna College of Arts and Science for Women, Coimbatore.

Email Id : [email protected]

ABSTRACT--In recent years Mobile ad hoc networking has gained considerable attention.

Recent improvements in the MANET field made to focus on the research for routing in Mobile Ad

hoc, mobility of node. In MANET, there is an important need of Multipath communication. In

multipath communication, redundant and selection of alternative routes for data transmission

are implemented in a successful manner. These task is been done by using protocols. To reduce

the link failure automatically we plan to develop Routing protocol which leads to increase the

performance. This work aims to improve the QoS, the reliability enhancement, and also mobility

of node to improve the data transfer. This effort analysis, aims to improve the Packet

transmission and the routing protocols for MANET and its limitations. The main goal of this

research is to examine, propose and compare different mobile ad hoc network routing schemes

and seek performance in terms of Energy Consumption, Packet delivery, Delay, Energy

Consumption, Routing Overhead, Network Lifetime and Quality of service. Link stability and

energy aware multipath routing protocol, reliable energy aware end to end delivery routing

protocol are the major contributions of this research work.

Keywords:Qos, MANET, Multipath Routing,Link quality, Network lifetime, Energy consumption

I INRODUCTION

MANET (Mobile ad hoc networks) are the wireless networks of mobile registering

gadgets with no help of a fixed foundation. The mobile nodes in a MANET self-arrange together

in some self-assertive style. A MANET is a self-administering combination of mobile customers

that confer over by and large data move limit obliged remote associations. Since the nodes are

mobile, the network geography may change rapidly and sporadically after some period. These

frameworks can be utilitarian between individuals or between vehicles in zones which are

depleted of fixed establishment. Two nodes can truly talk with each other if they are inside the

radio range. The power open for transmission is similarly deliberately confined. The geography

of the network is significantly ground-breaking on account of the steady breakage and

establishment of remote association. Nodes incessantly move into and out of the radio range.

This offers climb to the change in routing data.

AEGAEUM JOURNAL

Volume 8, Issue 12, 2020

ISSN NO: 0776-3808

http://aegaeum.com/ Page No: 150

Other than this, with the development of web, the demand for constant and quality of

services (QoS) of network has been expanded. In this way, demand of QoS-mindful routing is

likewise expanded. The significant destinations of QoS-mindful routing are: -

i) Finding path from source to destination fulfilling clients prerequisite.

ii) Optimizing network resource utilization and

iii) Repairing or re-figuring the path rapidly if there should be an occurrence of path break or

connection disappointment or unwanted things like congestion, without degrading the

degree of QoS.

The remainder of the article is structured as follows: Section 2 explains about the limitations

of the exiting work and methods are discussed. Section 3 narrates about the proposed methods.

Section 4 illustrates the performance evaluation of the proposed techniques. Section 5

Conclusion of the research work.

II RELATED WORK

Mariappan Rajashanthi Studied and separated an inventive Quality of Service subordinate

ensured about multipath routing system for strong data correspondence close by encryption

strategy is proposed. Moreover, the Multipath routing measure AODV-BR protocol with

Optimal Fuzzy Logic is envisioned. The Adaptive plan of Gray Wolf Optimization approach

envisions the ideal path. Thusly, an ideal path is investigated the apparent routes to ensure the

data key organization methodologies; here Homomorphic Encryption is used. The viability in the

working of the foreseen technique is surveyed concerning limits, for instance, the all the way

delay, parcel conveyance extent, etc. Generation result shows that vitality capability and network

lifetime of our suggested work is made than that of existing work.

G. Soni, M. K. Jhariya, K. Chandravanshi and D. Tomar proposed DREAM Multipath

Routing (DMR) taking into account the mixture region in MANET. The DREAM protocol

improves the routing execution of various routes by keeping up the zone data of the portable

nodes. The DREAM protocol diminishes the overhead by sending parcel floods in MANET,

which in like manner diminishes network delay. The proposed DMR execution is better than

commonplace AOMDV routing. THE DREAM is to keep the zone data with the versatility speed

of the nodes. The typical possibility of node improvement is resolved and flooding of routing

packets is in like manner restricted. Pack flooding occurs at the arranged region of the objective.

The circumstance of the amount of nodes changes continually and the DREAM manages each

node. Each node stores the territory data of all nodes in the zone of the network. The proposed

crossover DMR protocol improves routing execution and offers better data transmission in an

amazing network.

III PROPOSED METHEDOLOGY

Mobile hosts and wireless networking are winning regions of exploration. Wireless

networks are arranged as framework based and foundation less networks. In MANETs, one of

AEGAEUM JOURNAL


ISSN NO: 0776-3808


the significant issues is to keep up a dependable stable route between the nodes notwithstanding

mobility of nodes. To accomplish this, a stable routing protocol is necessitated that keeps the

route solid for a standard time of transmission. Routing protocols for impromptu networks can be

arranged as proactive or responsive (on-request) in light of when routes are discovered. Proactive

protocols keep up state-of-the-art routing data paying little heed to the nearness of traffic, thus

devour significant resources, for example, transfer speed and force regardless of whether the

network is inactive. On request routing protocols have been appeared to lessen routing overhead

in high mobility conditions by just keeping up effectively utilized routes. In spite of the fact that

on-request routing protocols possibly start route revelation when a route is required, such

disclosure is regularly performed by means of network-wide flooding. Since flooding devours a

significant measure of data transfer capacity, it is basic to lessen the recurrence of route

revelations, thus network flooding.

To beat execution issues from visit route revelation endeavors, hybrid protocols join both

responsive and proactive protocol qualities. Albeit hybrid protocols don't squander resources by

flooding the network for each route demand, it is hard to adjust the cost of trading routing data

intermittently (i.e., proactivity) and network-wide flooding for route revelation (i.e., reactivity).

Different protocols diminish the recurrence of flooding by permitting a transfer node to start a

restricted route revelation in case of a route disappointment or utilize nearby mistake

recuperation instruments. Notwithstanding, protocols utilizing either restricted communicate or

neighborhood blunder recuperation have concentrated on lessening packet drops and not on

using the data transfer capacity productively during route recuperation.

Multipath routing protocols reserve numerous routes to a destination in a solitary route

revelation. Notwithstanding, within the sight of mobility, multipath protocols because extra

packet drops and deferral because of their reliance on possibly stale routes from reserves. In light

of these perceptions, we will probably structure a proficient route rediscovery with upgrading

join state routing protocol that diminishes route demand floods because of route disappointments

without acquiring any overhead from data trades. QoS metrics during path investigation, for

example, energy, postponement and transfer speed. In spite of the fact that these protocols

decline the time expected to investigate new paths utilizing the occasional investigating

instrument despite the fact that no mistake happened, high clog and mobility are an issue these

protocols may experience the ill effects of, particularly with the flooding of control packets in the

networks.

Mobile specially appointed Network is a self-sorted out, framework less wireless network

with no unified organization. The QoS mindful routing includes distinguishing proof of the ideal

path that fulfills the rigid prerequisites of transfer speed and deferral for hard constant

applications. Fundamentally two route fix methodologies to manage interface disappointments.

Routes are fixed by either restoring another route beginning from source node, or it very well

may be privately fixed by the node that recognizes the connection break along the start to finish

path. Source started route recuperation will prompt better execution however in different

circumstances nearby fix will be the more suitable decision. In either case, the route update

AEGAEUM JOURNAL


ISSN NO: 0776-3808


process endeavors to utilize flooding-search to get other path to the destination however it brings

about the diminishing of the network throughput just as long deferrals. The issue gets most

exceedingly terrible when mobility is high. Our methodology comprises of route rediscovery of

connection disappointment of next node interface utilizing signal quality discovery procedure

with scarcely any extra control messages, the ancestor node looks through a backup way to go

using a work structure and builds up a path subsequent to getting an affirmation from a substitute

node.

a. ROUTE SELECTION

Source node chooses the quickest settled path to advance packets and later changes to most

grounded signal quality path for transmission. To accomplish this reason, another solid routing

protocol is proposed that works in two stages. In first stage the routing happens dependent on the

sign quality of the node. In the event that no neighbor node is found and the route determination

process is fizzled, at that point the procedure changes to second stage where route choice is done

by our proposed MPRR_OLRP technique.

Algorithm: Route Selection Process

Step 1: Node Initially to specify the route for route selection

Step 2: Send data packet to its neighbours, and Build a neighbour node slope Neib(u).

No Found?

Yes

Stop

Route selection

If RREQ

Retry < 5

threshold

Check signal strength Request for route

Rediscover

route

No Yes

AEGAEUM JOURNAL


ISSN NO: 0776-3808


Step 3: Next Node sends information packet v to its neighbour’s list Neib(v), hence the node u

stores the information received from node Neib(v).

Step 4: The connected controlling set list Neib is built as an intermediate node that has two

unconnected neighbour nodes

b. ROUTE DISCOVERY AND MAINTENANCE

Route discovery and route maintenance incorporate finding various routes from a source

to an objective node. Multipath routing protocols can endeavor to discover the association

disjoint node disjoint, or non-disjoint routes. While interface disjoint routes have no ordinary

associations, it may share nodes for all aims and reason. Node-disjoint routes, which are

moreover suggested as altogether disjoint routes, don't have fundamental nodes or associations.

Non-disjoint routes, of course, can have the two nodes and associations that are in like way.

AOMDV's fundamental idea is in finding various routes during the strategy of route disclosure.

The arrangement of AOMDV is required to serve uncommonly ground-breaking exceptionally

selected networks that have visit occasions of association disillusionment and route breaks.

Another cycle of route disclosure is essential if all paths to the objective break. AOMDV uses

three control packets: the route demand (RREQ); the route answer (RREP); and the route blunder

(RERR). At first, when a source node is needed to communicate data packets to a particular

objective, the source node communicates a RREQ. Since the RREQs is an overflowed network-

wide, a few duplicates of exactly the same RREQ might be gotten by a node. In the AOMDV, all

copy duplicates go through an assessment to decide the expected substitute opposite path. Be that

as it may, of all the subsequent arrangement of paths to the source, just the utilization of those

duplicates, which safeguard circle opportunity and disconnection, get the chance to shape the

opposite paths. In the occasion the middle of the road nodes get a converse path through a RREQ

duplicate, it directs a check to decide the quantity of substantial forward paths (for example one

or many) to the objective. Provided that this is true, a RREP is created by the node and the

solicitation is sent back to the source utilizing the converse path. Since this route disclosure, the

RREP has a forward path that was not utilized in any earlier RREPs.

The RREQ isn't also induced by the temporary node. Something different, the node

would convey the RREQ copy again if some other copy of this RREQ has not been as of late

sent and this copy has incited the invigorating or the plan of a contrary path. Like momentary

nodes, the objective in like way structures transform paths when it gets RREQ copies. As a

response to each RREQ copy appearing through a circle free path towards the source, the

objective conveys a RREP, paying little mind to confining opposite paths that use just RREQ

copies appearing through circle free and disjoint trade paths towards the source. A RERR parcel

is used in AOMDV route upkeep. In the event an association breaks, it delivers a RERR

message, posting lost objections. The RERR is sent upstream by the node towards the source

node. By virtue of the presence of the past different hops, which were using this association, the

RERR is conveyed by the node. In case there are no past various bounces, the sales is unicast.

Subsequent to getting a RERR, the tolerant node from the start checks whether the node which

AEGAEUM JOURNAL


ISSN NO: 0776-3808


sent the RERR is its own next skip towards any of the objective that is recorded in the RERR. In

case the sending node is truly the recipient node's next hop, the getting node makes this route

table invalid, after which it multiplies the RERR back to the source. Accordingly, the RERR

continues being sent until the source gets the sales. At the point when this happens, it can begin

the route divulgence again if it notwithstanding everything requires the said route.

Algorithm 2: Multipath Routing

c. SIGNAL STRENGTH DETECTION

The route will be picked depending upon its trustworthiness, which is resolved through

an intermittent heartbeat packets along the basic and trade paths, assembling the sign nature of

each path. The route with best sign quality will be picked as the fundamental route. The protocol

is arranged with the end goal that when there is just a single powerful path, the source will begin

AEGAEUM JOURNAL


ISSN NO: 0776-3808


a route disclosure and find new revived paths, while the sender is so far sending the data through

the basic path. This revelation will happen even before the current path transforms into an invalid

path to make new elective paths. In this technique, different paths are encircled during the route

divulgence measure. All the paths are kept up by techniques for discontinuous update packets

unicast along each path. These update packets measure the sign nature of each ricochet along the

substitute paths. Whenever of time, only the path with the most grounded signal quality is used

for data transmission. On-demand route divulgence by picking longer-lived routes subject to flag

quality. The sign quality models license the protocol to isolate among strong and weak channels.

Disregarding the way that our protocol similarly uses signal quality data for routing, the way

where it is utilized isn't equivalent to the Signal Stability based Adaptive (SSA) protocol. SSA is

a scattered protocol that uses the sign quality data on a for every association premise, however,

our answer uses the sign quality data gathered over an entire path The nature of a parcel signal,

which a node gets is gained by the going with condition

This gives a proportion of the general security of the path since joins with higher sign

quality are more averse to break. As the estimation of the RS increments, so does the strength of

the path.

During the impart of RREQs from the source towards the objective, every node registers

the RS dependent on the sign quality with its quick upstream neighbour from which it got the

RREQ.

Here we propose the usage of the give quality measurement up the standard hop count

metric using Signal Strength Detection (SSD) considering the way that the ricochet count of a

route isn't sufficient to choose the quality and steadfastness of the path. A frail association,

whether or not on grant bob check route, could incite a significant number of dropped packets.

Then again, since our sign quality measurement relies upon the sign nature of each individual

association in the path, it gives data about both the quality and unfaltering nature of the path. A

single powerless association will yield an incredibly low sign quality for the entire path,

accordingly making it more negative for routing. Past work has shown that using ricochet count

AEGAEUM JOURNAL


ISSN NO: 0776-3808


to pick routes can be hazardous, and that using signal quality consistently yields more strong

routes.

d. MULTIPATH ROUTE REDISCOVERY OPTIMAL LINK STATE ROUTING

PROTOCOL (MPRR_OLRP)

In this developments, it is to be deal with the mobility, packets routing with the

insignificant time and energy consumption. Consequently, routing protocol assumes a urgent job

while sending the packet in the network. Also, it is important to diminish the quantity of bombed

transmissions, data redundancies and traffic overhead of mobile nodes, which brings about the

decrease of energy consumption significantly. Along these lines, routing protocol to be built up

here to send the packet in MANET henceforth it gives mobility of nodes which drives a unique

change in network topology. In this way, MANET routing protocols are intended to be versatile

to send data in network. In this proposed work multipath route rediscovery in acquainted with

give a superior data correspondence. MPRR_OLRP is a proactive routing protocol for mobile

specially appointed networks.

The protocol acquires the soundness of a connection state algorithm and has the upside of

having routes quickly accessible when required because of its proactive nature. MPRR_OLRP is

a streamlining over the old style connect state protocol, customized for mobile specially

appointed networks. MPRR_OLRP is intended to work in a totally dispersed way and doesn't

rely upon any focal element. The protocol doesn't REQUIRE dependable transmission of control

messages: every node sends control messages occasionally, and can along these lines support a

sensible loss of whatever messages. Such misfortunes happen every now and again in radio

networks because of crashes or other transmission issues.

The proposed protocol gives QoS mindful route revelation that keeps up the base deferral

and transmission capacity imperative all through the correspondence procedure. It will likewise

concentrate on compelling route support methodology on the off chance that there is a

connection break or disappointment. The expectation of connection disappointment is done

before the genuine disappointment happens and exchange path is looked so the data transmission

is proceeded immediately. The protocol gauges’ node postponement and data transmission

progressively to help the severe prerequisites of hard ongoing applications. Destination nodes

screen the fitness of the paths by piggybacking defer data and in this way choosing better route

before blockage. For route choice, it considers just those routes which have absolute path defer

not exactly or equivalent to that predetermined in the route demand and required transfer speed is

not exactly or equivalent to accessible transmission capacity. The path delay is determined

considering conflict delay at every mobile node along the path.

AEGAEUM JOURNAL


ISSN NO: 0776-3808


Algorithm 3: Proposed MPRR_OLRP

In this section, we portray our proposed protocol, which incorporates figuring of sending

delay at every mobile node, commencement of route disclosure and route support forms. The

downside of customary AODV is that route demand is same if there should arise an occurrence

of a new route demand starting from the source or a middle of the road route demand from a

messed up interface for fixing. The algorithm 1 is for route determination has been given

previously. Additionally, message route position and routing table structures are explained

according to the subtleties.

Each part in the table involves R_D_addr, R_Nt_addr, R_dist, and R_iface_addr. Such

entry shows that the node recognized by R_D_addr is assessed to be R_dist hops from the close

by node, that the symmetric neighbor node with interface address R_Nt_addr is the

accompanying bob node in the route to R_D_addr, and that this symmetric neighbor node is

reachable through the close by interface with the area R_iface_addr. Segments are recorded in

the routing table for each objective in the network for which a route is known.

AEGAEUM JOURNAL


ISSN NO: 0776-3808


Packet Delivery Ratio:

It implies the proportion of the data packets that were conveyed to the destination node

to the data packets that were created by

in its delivery of data packets from source to destination. The advanced the proportion, the

improved the presentation of the routing protocol. Chapter 1 shows the trial consequence of our

proposed work with different past methodologies.

Packet delivery proportion of our planned method is better than existing methodology

which is indicated chart 1. The proposed approach keeps up the routes with explicit

of deferral and transmission capacity for on

less stacked and smaller packet drops and clog likewise diminishes. It is determined through the

condition

AODV

94

93

92

90

88

85

IV EXPERIMENTAL RESULTS

Packet Delivery Ratio:


to the data packets that were created by the source. This metric shows a routing protocol's quality



work with different past methodologies.

Figure 5.1 Packet Delivery Ratio


which is indicated chart 1. The proposed approach keeps up the routes with explicit

of deferral and transmission capacity for on-going requests. This methodology makes the courses


�� . ��

��. ��

Table 5.1: Packet Delivery Ratio

FF-AODMV FQ-MP-

94 92

91 90

89 87

86 85

84 83

82 80

Here the value for the PDR is shown in T

IV EXPERIMENTAL RESULTS


the source. This metric shows a routing protocol's quality



Packet Delivery Ratio


which is indicated chart 1. The proposed approach keeps up the routes with explicit prerequisites

going requests. This methodology makes the courses


��

�� ∗ 100

5.1: Packet Delivery Ratio

-OLSR MPRR_OLRP

92 95

90 94

87 94

85 93

83 91

80 89

value for the PDR is shown in Table 5.1.

the source. This metric shows a routing protocol's quality

prerequisites

going requests. This methodology makes the courses

AEGAEUM JOURNAL


ISSN NO: 0776-3808


End-to-end delay:

End-to-End delay alludes to the normal time reserved by data packets in effectively

sending messages over the system from source to destination. This incorporates a wide range of

postponements, such as lining at interface line; proliferation and move times

delays; and protecting during the direction revelation inactivity. Chapter 2 portray about start to

finish postponement of proposed and many existing methodologies contrasts.

Chart 2 clearly shows that curre

postponement in our proposed protocol is less contrasted and the current protocol. Likewise, the

proposed protocol is more steady and requires less number of rediscovers which decreases the

postponement. Specified below is the formulation to compute the delay:

Where Si Sending time and R

AODV

0.3

0.5

0.7

0.8

0.9

1

Here the value for the end

Energy Consumption:

Energy feasting alludes to the measure of vitality that is consumed by the network nodes

inside the recreation time. This is gotten by computing every node's energy equal toward the

finish of the re-enactment, calculating in the underlying energy of everyo

End delay alludes to the normal time reserved by data packets in effectively


postponements, such as lining at interface line; proliferation and move times



Figure 5.2End-to-End Delay

Chart 2 clearly shows that current protocols have a peripheral increment in delay with speed. The




�� ∑ ��

��

�

Sending time and Ri receiving time.

Table 5.2: End-To-End Delay

FF-AODMV MPRR_OLRP

0.4 0.25

0.67 0.42

0.9 0.56

1.3 0.67

1.5 0.75

1.7 0.8

Here the value for the end-to-end delay is shown in table 5.2.

Energy Consumption:



enactment, calculating in the underlying energy of everyo

End delay alludes to the normal time reserved by data packets in effectively


postponements, such as lining at interface line; proliferation and move times; MAC re-broadcast



End Delay

nt protocols have a peripheral increment in delay with speed. The




� � !

�

End Delay

MPRR_OLRP FQ-MP-OLSR

0.5

0.8

1.2

1.6

1.8

2

end delay is shown in table 5.2.



enactment, calculating in the underlying energy of everyone. Chart 3 shows the

nt protocols have a peripheral increment in delay with speed. The

AEGAEUM JOURNAL


ISSN NO: 0776-3808


use of energy with the mobility of nodes. The energy usage of nodes has sped up in both the

protocols. Our proposed plot shows an improvement in the use of energy when contrasted and

existing protocol. This will drag out the network w

The following formula will produce the value for energy consumption:

where I- initial energy level and E total energy level.

MPRR_OLRP

2

3

8

12

14

16

Here the value for the energy consumption is shown in table 5.3.

Network Lifetime:

The lifetime of the network discusses to the essential time for shattering the battery of n

mobile nodes, the network lifetime alludes to the necessary time for debilitating the battery of n

mobile nodes. Subsequently, the lifetime of taking an interest mo

out by rationing energy at every node and the all

saw that the proposed conspire performs better regarding energy consumption, so the network

lifetime is expanded because of this ener



existing protocol. This will drag out the network with lower energy consumption.

Figure 5.3 Energy Consumption


��" #��$%�� = ∑ (I(

initial energy level and E total energy level.

Table 5.3: Energy Consumption

AODV FF-AODMV

6 2

14 8

21 9

28 20

32 22

37 22




mobile nodes. Subsequently, the lifetime of taking an interest mo

out by rationing energy at every node and the all-out energy for every association demand. We


lifetime is expanded because of this energy creation. Chart 4 shows the improvement. The



ith lower energy consumption.

Energy Consumption


∑ (I()− E())

Energy Consumption

AODMV FQ-MP-OLSR

2 6

8 12

9 19

20 24

22 29

22 34




mobile nodes. Subsequently, the lifetime of taking an interest mobile nodes ought to be drawn

out energy for every association demand. We


gy creation. Chart 4 shows the improvement. The

AEGAEUM JOURNAL


ISSN NO: 0776-3808


MPRR_OLRP has preferred execution over existing protocol in network lifetime as it monitors

improved energy in the mobile nodes and debilitates less nodes.

which is calculated using the following formula:

FF-AODMV

16

14

12

8

4

4

Here the value for the network lifetime is shown

Routing Overhead Ratio:

The routing methods is proportion system is the total out number of sending packets,

which is isolated by the general no of data packets that were conveyed. This investigation broke

down the normal number of routing

This metric proposal a thought regarding the additional transmission capacity that is devoured by

the data so as to convey data traffic. The routing overhead affects the network's robustness as f

as the transmission capacity use and battery power depletion of the nodes. The routing overhead

of our planned approach is smaller than remaining methods as it uses effectual link failure

approach to realm the QoS necessities.



Figure 5.4 Network Lifetime

using the following formula:

&��'��(��%�= ∑ ((

Table 5.4: Network Lifetime

AODMV AODV MPRR_OLRP

22 28

22 22

20 20

9 18

8 13

5 7

Here the value for the network lifetime is shown

Routing Overhead Ratio:



down the normal number of routing packets that is compulsory to convey a solitary data packet.


the data so as to convey data traffic. The routing overhead affects the network's robustness as f



approach to realm the QoS necessities.



Figure 5.4 Network Lifetime

)=0)

Table 5.4: Network Lifetime

MPRR_OLRP FQ-MP-

OLSR

27

20

15

12

9

3

Here the value for the network lifetime is shown in table 5.4.



packets that is compulsory to convey a solitary data packet.


the data so as to convey data traffic. The routing overhead affects the network's robustness as far




AEGAEUM JOURNAL


ISSN NO: 0776-3808


The following formula represents the computation of the routing overhead:

��$��"��ℎ��=�)

AODV

1.5

1.8

2.3

2.8

3

3.2

Node versatility in mobile ad hoc networks (MANETs) causes frequent route breakages

and discontinuous connection soundness. Presently a day this is an incredible research issue,

numerous researcher manages this work to fathom the packet misfortune, vitalit

so forth multipath assumes a significant part in find and keep up more than one route between a

source and destination. In the multipath method, the numerous paths investigated decline the

need to restore new paths while the sender node

send data packets.

In this research work we proposed multipath Route rediscovery with ideal connection

State routing protocol (MPRR_OLRP) for multipath routing in mobile ad hoc networks. This

methodology used to rediscover the route for the data correspondence. MPRR_OLRP is an

Figure 5.5 Routing Overh


*+ +, -+./012 34567/8

�).)9 :);<��= >?@AB<CD�) )9 E?<? >?@AB<C CB�<

Table 5.5: Routing Overhead

MPRR_OLRP FF-AODMV

0.8 1.7

1.6 2.3

1.9 2.8

2.4 3.9

2.7 4.2

3.1 4.7

V CONCLUSION



numerous researcher manages this work to fathom the packet misfortune, vitalit



need to restore new paths while the sender node select another elective path from the table to



to rediscover the route for the data correspondence. MPRR_OLRP is an

Figure 5.5 Routing Overhead


CB�<* 100

Table 5.5: Routing Overhead

AODMV FQ-MP-OLSR

1.7 1.4

2.3 1.7

2.8 2.3

3.9 2.6

4.2 2.9

4.7 3.3

V CONCLUSION



numerous researcher manages this work to fathom the packet misfortune, vitality utilization, and



select another elective path from the table to






y utilization, and



select another elective path from the table to




AEGAEUM JOURNAL


ISSN NO: 0776-3808


improvement over the old style connect state protocol, customized for mobile ad hoc networks.

MPRR_OLRP is intended to work in a totally disseminated way and doesn't rely upon any focal

element. The sender node keeps restoring path discovery to discover new paths, which makes for

long time delay, we comprehend this issues by applying signal quality component.

In future, we want to additionally fortify the security of proposed routing plan by

presenting packet encryption and key trade instrument. Besides, we may consider to test and

execute it in genuine situations.

REFERENCES

[1] Shijie L, Xu L, Qijing F, editors. An improved AODV local repair algorithm based on

delay constraint. Signal Processing (ICSP), 2012 IEEE 11th International Conference

on; 2012 21–25 Oct. 2012.

[2] Arega, Kedir Lemma, Gemeda Raga, and Roba Bareto. "Survey on Performance Analysis

of AODV, DSR and DSDV in MANET." (2020).

[3] Zhao, Shangqing, Zhuo Lu, and Cliff Wang. "How Can Randomized Routing Protocols

Hide Flow Information in Wireless Networks?." IEEE Transactions on Wireless

Communications (2020).

[4] Quy, Vu Khanh, Vi Hoai Nam, and Dao Manh Linh. "A Survey of State-of-the-Art Energy

Efficiency Routing Protocols for MANET." International Journal of Interactive Mobile

Technologies 14, no. 9 (2020).

[5] Kumar, Anil, R. S. Shukla, and R. K. Shukla. "Simulation Based Comparative Study of

Routing Protocols in MANET." Invertis Journal of Renewable Energy 10, no. 1 (2020):

42-48.

[6] Z. Chen, W. Zhou, S. Wu and L. Cheng, "An Adaptive on-Demand Multipath Routing

Protocol With QoS Support for High-Speed MANET," in IEEE Access, vol. 8, pp. 44760-

44773, 2020, doi: 10.1109/ACCESS.2020.2978582.

[7] W. A. Jabbar, W. K. Saad and M. Ismail, "MEQSA-OLSRv2: A Multicriteria-Based

Hybrid Multipath Protocol for Energy-Efficient and QoS-Aware Data Routing in

MANET-WSN Convergence Scenarios of IoT," in IEEE Access, vol. 6, pp. 76546-76572,

2018

[8] X. Wang, P. Zhang, Y. Du and M. Qi, "Trust Routing Protocol Based on Cloud-Based

Fuzzy Petri Net and Trust Entropy for Mobile Ad hoc Network," in IEEE Access, vol. 8,

pp. 47675-47693, 2020, doi: 10.1109/ACCESS.2020.2978143.

[9] T. Zhang, S. Zhao and B. Cheng, "Multipath Routing and MPTCP-Based Data Delivery

Over Manets," in IEEE Access, vol. 8, pp. 32652-32673, 2020, doi:

10.1109/ACCESS.2020.2974191.

[10] Kacem. I., B. Sait, S. Mekhilef and N. Sabeur, "A New Routing Approach for Mobile Ad

Hoc Systems Based on Fuzzy Petri Nets and Ant System," in IEEE Access, vol. 6, pp.

65705-65720, 2018, doi: 10.1109/ACCESS.2018.2878145.

[11] Y. Chen, E. H. Wu, C. Lin and G. Chen, "Bandwidth-Satisfied and Coding-Aware

Multicast Protocol in MANETs," in IEEE Transactions on Mobile Computing, vol. 17,

no. 8, pp. 1778-1790, 1 Aug. 2018, doi: 10.1109/TMC.2017.2778262.

[12] P. M. Chintalapalli and V. R. Ananthula, "M-LionWhale: multi-objective optimisation

model for secure routing in mobile ad-hoc network," in IET Communications, vol. 12, no.

12, pp. 1406-1415, 31 7 2018, doi: 10.1049/iet-com.2017.1279.

[13] Y. Chen, C. Hu, E. H. Wu, S. Chuang and G. Chen, "A Delay-Sensitive Multicast

Protocol for Network Capacity Enhancement in Multirate MANETs," in IEEE Systems

Journal, vol. 12, no. 1, pp. 926-937, March 2018, doi: 10.1109/JSYST.2017.2677952.

[14] M. Sivaram, V. Porkodi, A. S. Mohammed, V. Manikandan and N. Yuvaraj,

"Retransmission DBTMA Protocol With Fast Retransmission Strategy to Improve the

Performance of MANETs," in IEEE Access, vol. 7, pp. 85098-85109, 2019, doi:

10.1109/ACCESS.2019.2918723.

[15] Junnarkar. A. A., Y. P. Singh and V. S. Deshpande, "SQMAA: Security, QoS and Mobility

Aware ACO Based Opportunistic Routing Protocol for MANET," 2018 4th International

Conference for Convergence in Technology (I2CT), Mangalore, India, 2018, pp. 1-6,

doi: 10.1109/I2CT42659.2018.9058022.

AEGAEUM JOURNAL


ISSN NO: 0776-3808


Documents

OPTIMIZE THE LINK QUALITY AND NETWORK LIFETIME FOR