An Enhanced Protocol for the evaluation of QOS

International Journal of Applied Environmental Sciences (IJAES) ISSN 0973-6077 Vol. 10 No.1 (2015) © Research India Publications; http://www.ripublication.com/ijaer.htm

An Enhanced Protocol for the evaluation of QOS using collective-path routing protocol in hybrid wireless Networks V. Sarala Devi1, N.Rajkumar2, C. Subramanian 3, S. Karthikeyan4,

1,2,4

Asst. Professor, Department of Computer Applications, Dr. MGR Educational and Research Institute University, Maduravoyal, Chennai 3 Assoc.Professor, Department of Computer Applications, Dr. MGR Educational and Research Institute University, Maduravoyal, Chennai

entertainment. WiFi capable machines like

Abstract

laptop, mobile devices and hand held devices

In Mobile ad hoc networks (MANET), the quality of service (QoS) depends on the available resources in the network and node mobility, as mobility may result in frequent route failures. Some existing hybrid approach of collective-path routing technique rarely considers QoS metrics for path selection. In this paper, we propose a QoS enhanced hybrid collective-path routing protocol for MANET. In this protocol, topology discovery is performed proactively and route discovery is performed in the reactive manner. In proactive topology discovery phase, each node collects the battery power, queue length and residual bandwidth of every other nodes and stores in the topology information table (TIT). By exchanging the TIT among the nodes, th e topology is discovered. When the source node wants to forward the data packet to the destination, it utilizes the reactive route discovery technique where the multiple paths are established using collective- path Dijkstra algorithm. When any intermediate node does not recognize the next 2-hop information from TIT towards destination, the new collective-path route discovery is performed. By simulation results, it is shown that the proposed approach reduces the overhead.

(e.g: smartphone and tablet PC) has been increasing rapidly. For example, the wireless Internet users has tripled world-wide in the last three years, and the smartphone users counting in US has increased from 92.8 million in 2011 to 121.4 million in 2012, and will reach around 207 million by 2017. Nowadays, people wish to watch videos, play games,

watch

TV,

and

make

long

distance conferencing via wireless mobile devices“on streaming

the

go.”

applications

Flixwagon,and

Therefore, such

FaceTime

video

as

Qik,

on

the

infrastructure wireless networks have received increasing

attention

recently.

These

applications use an infrastructure to directly

Key words : MANET, Quality of service (QoS), Topology Information Table (TIT), Ad

connect mobile users for video watching or

Hoc On-Demand Distance Vector (AODV)

interaction in real time. As the usage of wireless

devices

increases,

services are in high demand where wireless

The wireless applications are used in

multimedia services (e.g., mobile gaming,

wide areas such as commerce, emergency military,

mobile

demand for mobile multimedia streaming

Introduction

services,

and

education

online TV, and online conferences) are

and

widely deployed. The usage of real time and

92


multimedia applications have stimulated

performance in hybrid network in terms of

the need of high Quality of Service(QoS)

Overhead,

support

Resilience and scalability.

in

wireless

and

mobile

Transmission

Delay,

Mobility

networking

Related Works:

environments.End-to-end transmission delay and enhances throughput are achieved

Luo Liu et al. have proposed architecture

with help of the QoS support thereby

for assuring QoS based on Node-Disjoint

providing enough communication between

collective-path routing protocol(NDMR) in

mobile

mobile

devices

and

wireless

ad-hoc

networks.

The

problem

infrastructures. At the same time, hybrid

related to provisioning of QoS is extremely

wireless networks (i.e., multihop cellular

difficult task in MANETs. But the multiple

networks) have been proven to be a better

node-disjoint paths help in assigning the

network structure for the next generation

packets to paths in a best possible method

wireless networks and can help to tackle

to handle some limitations. The proposed

the stringent end-to-end QoS requirements

methodology offered limitations and also

of different applications.

compared

Combining

the

hybrid

networks

each

other.

like

updates route packets for permitting QoS computations over node-disjoint paths.

self-organizing

Chunxue Wu et al. have proposed Q-

networks thereby extending the coverage

AOMDV protocol for ad-hoc

of the infrastructure networks.

probability calculates the delay, bandwidth, hop count

Promising the QOS in hybrid wireless is

achieve

this

the

networks.

The proposed protocol with path preference

Project Objective:

network

variation

with the help of queue length field and

Particularly,

infrastructure networks, while MANETs establish

in

determined ways of establishing NDMR

scalability of MANETs is progressed by automatically

functioning

circumstance of NDMR. This method also

infrastructure networks and MANETs to support

the

crucial

QOS

purpose.

enhanced

for choosing the path for

forwarding the packet. The provision of

TO

multiple paths is more efficient in ad-hoc

hybrid

networks since the source can just utilize

collective-path routing protocol has been

the existing routes in case of any route

proposed and guarantees the high QOS

93


failure instead

of

carrying out route

(RSQR) protocol

recovery process. source

routing

constraints. In order to

protocol

easy model for measuring the link stability

path routing, they expand DSR’s routing maintenance

and route stability depending on received

technique.

To attain a better cooperation

signal strengths. Some additional fields in

among

route request/reply packets is taken into

load balancing and network overhead, an

consideration so that the route stability

ultimate count of collective-path route is

information can be used to choose a route

examined. Also, per packet granularity is utilized to allocate the packets

with increased stability when compared to

from

all possible routes among existing source

multiple links between the paths in MSR.

destination pair.

Sanguankotchakorn et al.have proposed

Kun-Ming Yu et al. have proposed a new

NQoS AODVby altering the conventional

protocol(ARMBR)

AODV. NQoS AODV upholds a routing the

average

enhance

the

This is performed by building multiple

delay.This

backup routes. During the modulation in

approach increases the packet delivery

network topology, the protocol can transfer

ratio since it upholds the QoS information

the data packets actively via backup routes.

and observes for the path fulfilling QoS

In

necessities of the applications.Further it

addition, they

analytical

forwards a smaller number of control

model

have to

developed an determine

the

reconnection probability of the proposed

packets to maintain route discovery and

algorithm.

route failure which causes reduced control overhead.

Samuel Pierre et al. have proposed a new approach based

Nityananda Sarma et al have proposed a Route Stability

to

prevailing on demand routing protocols.

table which frequently offers routes thus minimizing

the

duration in MANET, they have proposed

for MANET.In order to get the collectiveand

guarantee

suitable data path for adequate longer

with bandwidth and reliability constraints

discovery

Ad Hoc

Networks (MANETs) which is an extension of QoS routing with throughput and delay

Fujian Qin et al. have proposed a new collective-path

in Mobile

based

QoS

backbone for

Routing

94

on

a

supporting

mobile routing Quality

of


service

(QoS)

in

proposed protocol inside

MANETs.This

allocates

network can’t be fixed and frequent failure

the traffic

communication links between two nodes. If a

the network as per the existing

network

traffic

level

and

Existing communication links between

nodes

two nodes failed then the new links can be established with the reference of routing table.

processing loads. The QoS support is recognized

with

communicating

the

packets

help

of

The main disadvantages are:

possessing

particular necessities to nodes that are

1. Maintain Huge amount of data that causes

loaded

network overhead.

with

more

resources

and

connected through stable links.

2. Slow reaction on failures.

A Network is a sharing of data or file within

the group.

Examples of proactive algorithms are

The data can be

transferred from and to. The process of

Optimized Link State Routing Protocol

transferring the data from one computer to

(OLSR)

another is a Routing. Routing protocol is

Destination

a standard that decide the feasible routes

Sequence

Distance

Vector

(DSDV)

from the optimized routes in a network. This can be categorized into three types.

Reactive Routing:

They are 1. Proactive 2. Reactive and 3.

It is also known as On demand protocol.

Hybrid.

Routing table cant be maintained for the network.

Proactive routing:

this

type,

If

a

Existing

communication links between two nodes

It is also known as Table driven protocol.

failed then the new links can be established

In this type, each and every node in this

when on demand basis.

network will maintain a separate routing

The main disadvantage:

table. Routing table consists of routing information about the networks. A hybrid

High latency time in route finding.

network is a mixture of self organizing network

In

2. Excessive flooding can lead to network

and Wireless network. In

clogging.

this type of network, the topology of the

95


Examples of on-demand algorithms are: 

Of Service (QOS). Disadvantages:

Ad hoc On-demand Distance

Vector (AODV)  Dynamic Source Routing

Achieving the QOS in hybrid network is

Hybrid routing :

characteristics of MANET. By adopting

This

type

of

protocol

very difficult to achieve due to their unique QOs solutions of infrastructure

combines

can’t be applied directly to infrastructureless

the advantages of proactive and

network.

reactive routing.

Present work

Examples of hybrid algorithms are:

In this protocol, topology discovery is

 ZRP (Zone Routing Protocol)

performed proactive in manner while route discovery is performed in the reactive

Existing system: A

hybrid

wireless

network

network,

manner. In proactive topology discovery

a

phase, each node collects the battery power,

next generation network is a

queue length and residual bandwidth of

combination of wireless network i.e.

every other nodes and stores in the topology

(Infrastructure network) and Adhoc

information table (TIT). By exchanging the

network (Infrastructure less network). Adhoc network is

TIT among the nodes, the topology is

a

discovered. When the source node wants to

network having the tendency of self

forward the data packet to the destination, it

organizing nature. In a hybrid network, a

utilizes

source node wants to send a message to its

the

reactive

route

discovery

technique where the multiple paths are

destination. If a source node will be a

established using collective-path Dijkstra

transmission range of base station then the

algorithm. When any intermediate node does

data can be delivered successfully. Since, it

not recognize the next 2-hop information

is unlikely that base station covers entire

from TIT towards destination, the new

area. Then the data will transfer to the

collective-path route discovery is performed.

intermediate adhoc nodes. For an example, people want to upload or download

Mythologies to be adopted

data from the server need a good Quality

96


Single Path Routing

Quality of Service (QoS)

In case of single path routing, a single

The network offering a group of service

path is utilized to transmit the packets

necessities to some traffic for fulfilling the

from the source

users needs related to that traffic is termed

to destination. The

process of including the route information

as Quality of service (QoS). The

in the packet header corresponds to the

considered as source dependent single

main idea of QoS is to assure certain predefined service performance limitations of the user with respect to end-to-end delay, available bandwidth, packet loss probability etc. QoS in MANETs

path routing algorithm. Whereas for ad

Quality of service in MANET relies on

dynamic source routing (DSR) protocol which is

hoc on- demand distance vector routing

both existing resources in the network and

(AODV) protocol, the destination nodes

mobility

information is included in the packet

the fixed networks. Hence excess metrics

Owing to the inconsistency of the wireless

need to be considered to

infrastructure and nodes mobility, single

confine

with

quality of the links among nodes. This

path routing protocols causes performance

quality ought to be a function of resource

degradation in mobile networks.

availability existing in wireless and mobile

Collective-path Routing discovering

resources.These

only limited resources when compared to

forwarding mechanism is utilized. [3]

of

such

may cause route failure and MANET holds

packets in single path, hop-by-hop packet

process

of

metrics are considered since the mobility

header and in order to transfer the data

The

rate

environment. multiple

Also

metric for MANETs

QoS-based must

routing include

routes among the distinct source and

minimum available bandwidth and end-to-

single destination at the time of single

end latency together

route discovery corresponds to collective-

around a link.

path routing. In MANET, the prevailing

Description of working principle

with

congestion

issues such as scalability, security, network lifetime, etc can be handled by the

System Architecture:

collective-path

When a source node S wants to upload files

protocol This

routing

enhances

the

protocols. end-to-end

to an server through base station, it can

throughput and offers load balancing in

choose to send packets to the APs directly if

MANETs.

97


it is in the transmission range of source

scheduling

node or else it require its neighbor nodes

routing. In this algorithm, an intermediate

to support the packet broadcast. We

node assigns the highest priority to the

assume

packet

that queuing occurs only at the output ports of the mobile nodes. In order to enhance

forwards the packet with the highest priority

the QoS support capability of hybrid

Distributed packet scheduling algorithm.

networks,

After qualified neighbors are known, this

in

this

paper,

mechanism

with

the

to

ensure

closest

QoS

deadline

and

first.

QoS-Hybrid

collective-path Routing protocol has been

algorithm

proposed .

assigns

schedules earlier

packet

generated

routing.

It

packets

to

forwarders with higher queuing delays, while assigns a lot of recently generated packets to forwarders with lower queuing delays to decrease total transmission delay. In order to further reduce the stream transmission

time,

a

distributed

packet

scheduling algorithm is proposed for packet routing. Traffic redundant elimination algorithm. An intermediate node forwards the packet with the first smallest amount time allowed to Algorithms QOD constitutes

following

five algorithms. QoS

guaranteed

neighbor

attend

before

determined

succeed

forwarding.

Recall

being

forwarded

fairness that

in

in the

to

packet EDF

algorithm, an intermediate node forwards

selection

the packets in the order from the packets

algorithm.

with the closest deadlines to the packets

In this algorithm qualified neighbors can

with

be

intermediate node has no problem to meet

selected and adopt deadline-driven

98

the

farthest

deadlines.

If

an


all packets’ deadlines in forwarding, that

Wi .Ta . That is, reducing packet size can

is, the packets are scheduling feasible, the

increase the scheduling feasibility of an

EDF

intermediate

algorithm

works

satisfactorily.

node

and

reduces

packet

However, when an intermediate node has

dropping probability. However, we cannot

too many packets to forward out and the

make the size of the packet too small

deadlines of some packets must be missed,

because it generates more packets to be

EDF forwards

transmitted,

out the packets with the closest deadlines but may delay the packets with the

overhead.

farthest

deadlines.

Therefore,

EDF

producing

higher

packet

Due to the broadcasting feature of the wireless networks, the access point and

is

mobile nodes will cache packets. This

suitable for hard-deadline

algorithmic rule eliminates the redundant

Mobility based segment

data to boost the QoS of the packet

resizing algorithm.

transmission. The mobile nodes set their NAV values based on the overhearing

The source node resizes every packet in

message’s transmission duration time. A

its packet stream for every neighbor node

large NAV leads to a small available

in line with the neighbor’s quality so as to

bandwidth and a small scheduling feasibility

extend the programming feasibility of the

of the mobile nodes based on (2). Therefore,

packets from the source node. In a

by reducing the NAV value, we can increase

highly dynamic mobile wireless network,

the scheduling feasibility of the intermediate

the transmission link between two nodes

nodes and sequentially increase the QoS of

is frequently broken down. The delay

the

generated in the packet retransmission

broadcasting

degrades the QoS of the transmission of

meet

different

Due

to

feature

the

wireless

of

the

mobile nodes can overhead and cache

in a highly dynamic network has higher to

transmission.

networks, in a hybrid network, the APs and

a packet flow. On the other hand, a node probability

packet

packets,

mobile

we

use

an

end-to-end

traffic

redundancy elimination (TRE) algorithm to

nodes and APs, which is beneficial to

eliminate the redundancy data to

resource scheduling. As (2) shows, the

improve

the QoS of the packet transmission in QOD.

space utility of an intermediate node that

TRE uses a chunking scheme to determine

is used for forwarding a packet p is Sp /

99


the boundary of the chunks in a data

in the collective-path routing table.

stream. The source node caches the data

End if

it has sent out and the receiver also

collective-path Dijkstra Algorithm

caches its received data. In QOD with

Let ST represent the source tree.

TRE, the AP and mobile nodes overhear

Let wr represent the opposite edge of arc w.

and cache packets.

Let h (w) offers the vertex edge to w points. F (ST, D) is the function that obtains the

Collective-path Routing

shortest path to D from ST.

The main goal of this collective-path

Fp is used to increase the costs of w that

algorithm is to construct a group of N

belong to the previous path (Pi )

routes devoid of loops, connecting source (S)

Fw is used to increase the costs of w that lead

and destination (D).In the source node, the

to vertices of Pi .

collective-path optimized link state routing

The algorithm is applied to a graph G =

protocol holds a updated flag Zi for

{y ,t ,s }to compute N routes in G from S to

every possible node in the network for

D.

recognizing the validity of the routes

Where y = set of vertices t

related to the node. Primarily,

=y *y = set of arcs

Zi

is

assigned to be false which reveals that

s :y ®K+= strictly positive cost function. s1

either there is no route related to the

=s

destination or renewal process is required.

G1 = G

The condition to obtain the multiple paths

For i ¬1to N

for anynode ni is as follows.

do

If Zi = false,

STi ¬ Dijkstra(G1, S) Pi

Then

¬ F(STi ,D)

The

node

executes

For all arcs w in t

collective-path

Dijkstra algorithm to obtain the multiple

If w is in Pi or Reverse (w) is in Pi

paths to ni , store it in the collective-path

Then

routing table, and performs the renewal of

s i+1(w)¬ Fp (s i (w)) Else

corresponding Zi to be true.

if the h (w) is in Pi Then

Else

s i+1(w)¬ Fw(s i (w))

The node will discover a valid route to ni

Else

100


s i+1(w) ¬s i (w)

successfully received by the receiver.

End if End for

Energy Consumption: It is the total

Gi+1 ¬ (y ,t ,s i+1}

amount of energy consumed by the nodes

End for

during the data transmission.

Return(P1, P2 , P3,...,PN ) Results

Network Overhead: Packet delivery ratio:

Performance Metrics: The ratio of the number of delivered data

We evaluate performance of the new

packet to the destination. This illustrates the

protocol mainly according to the

level of delivered data to the destination.

following parameters. We compare the MPOLSR [5] routing protocol with our

PDR = ∑ Number of packet receive / ∑

proposed QEHMR protocol.

Number of packet send End-to-end Delay : the average time taken

Average Packet Delivery Ratio: It is the

by a data packet to arrive in the destination.

ratio of the number of packets received

It also includes the delay caused by route

successfully and the total number of

discovery process and the queue in data

packets transmitted.

packet transmission. Only the data packets that successfully delivered to destinations

Average end-to-end delay: The end-to-

that counted.

end-delay is averaged over all surviving data packets from the sources to the

∑ ( arrive time – send time ) / ∑ Number of

destinations.

connections Packet Lost : the total number of packets

Control overhead: The control overhead

dropped during the simulation.

is defined as the total number of routing control packets normalized by the total

Packet lost = Number of packet send –

number of received data packets.

Number of packet received . Results & Analysis

Throughput: It is the number of packets

101


A. Effect of varying Number of Nodes Initially we vary the number of nodes as 30, 50, 70, 90 and 110. nodes vs delivery ration OB-MR MPOLSR

102

a

0.7

0.5

b

0.7

0.5

c

0.7

0.45

d

0.6

0.45

e

0.6

0.45


Table 1. Nodes Vs Delivery Ratio

Figure 3. Nodes Vs Overhead nodes vs Throughput

Figure 1. Nodes Vs Delivery Ratio

OB-MR MPOLSR

a

15000

15000

nodes vs delay

OB-MR

MPOLSR

b

11000

10000

a

6

7

c

10000

9000

b

6

9.8

d

10000

8000

c

6

8

e

10000

7000

d

5

6.5

e

5.2

5.5

Table 4. Nodes Vs Throughput

Table 2. Nodes Vs Delay

Figure 4. Nodes Vs Throughput Figure 2. Nodes Vs Delay OB-MR MPOLSR

When the number of nodes is increased

a

15000

15500

from 30 to 110, the throughput and packet

b

14000

15000

delivery ratio begin to reduce, as there is

c

11000

14800

d

15000

15200

chances of more collisions.

e

14500

15000

nodes vs Overhead

Table 3. Nodes Vs Overhead

Figure 1 and 4 show the results of average packet

103

delivery

ratio

and

throughput,


respectively for

the increased the nodes

QEHMR uses the hybrid approach for route

scenario. Clearly our QEHMR protocol

discovery.

achieves 23% better packet delivery ratio

Conclusion and feature enhancement

and 17% throughput than the POLSR since

In this paper, we have proposed a QoS

the proactive routing is done based on the QoS

parameters

bandwidth and

enhanced hybrid

queue

topology

Figure 2 shows the results of average endto-end delay for the increasing number of The figure

depicts that

delay

proactively

and

performed

in the

topology

discovery

is

route

performed discovery

is

reactive manner. In phase,

each

node

residual bandwidth of every other nodes and

from 30 to 70, and then it reduces beyond

stores in the topology information table

70 nodes. This is due to fact that the

(TIT). By exchanging the TIT among the

proactive routing couldn’t’ discover more

nodes, the topology is discovered. When

shortest paths, since the nodes are sparse.

source wants to forward a data packet to

From the results, we can see that QEHMR

destination, it verifies TIT and computes

protocol has of 21% lower delay than the

the link metric (LM) using the data in its

MPOLSR protocol.

TIT. The source chooses the nodes with

Figure3 shows the results

minimum LM and initiates the packet

of routing

transfer through the chosen node within 2-

overhead versus number of nodes. The

hop. The collective-path Dijkstra algorithm

routing overhead decreases up to 70 nodes

is employed to transmit the data through

and increases beyond that since after 70

multiple paths

nodes, reactive routing is applied , rather

minimum

than proactive.

with

link

the nodes holding metric.

When any

intermediate node does not recognize

13%

less

the

next 2-hop information from TIT towards

From the results, we can see that QEHMR produces

discovery

learns the battery power, queue length and

increases when the nodes are increased

protocol

routing

protocol for MANET. In this technique,

length.

nodes.

collective-path

destination,

routing

the

routing protocol

overhead than the MPOLSR protocol, since

route

104

discovery.

reactive

collective-path

is performed By

for


simulation results, it is shown that the

[5] Yi, J., Adnane, A., David, S. and

proposed approach reduces the overhead.

Parrein,

optimized link state routing for

REFERENCES [1]

Premalatha.J Subramanie.P,

and

mobile ad hoc networks”, Ad Hoc

Bala

Networks 9, pp-28-47, 2011.

the

“Enhancing

quality of service in MANETs by

[6] Satyanarayana, D. and Rao, S.V.,

effective routing”, ICWCSC, 2010.

“Link Routing

[2] Moon Jeong Kim, Dong Hoon Lee, collective-path

International

conference

Computational applications

science

its

- Volume Part

III

Ad-Hoc

Networks”, DNAC, 2002. [9] Chunxue Wu, Fengna Zhang and

Chengyong Liu, Kezhong Liu,

Hongming Yang, “A Novel QoS

Layuan Li, “Research of QoS –

collective-path

aware Routing Protocol with Load

International

WiCom’

Conference

Routing

in

MANETs”, International Journal of

Adhoc 08,

ICC

Service Models for Mobile Ad-Hoc

Routing Algorithm for MANET”.

Networks”,

IEEE

Bonnet, “A Glance at Quality of

“Node Independent collective-path

Mobile

Networks”,

[8] Navid Nikaein and Christian

M. Harmonosky and Sanjay Joshi,

for

Novel

Workshop, 2008.

[3] Melike Oz Pasaogullari, Catherine

Balancing

Communication

QoS in Node-Disjoint Routing for

(ICCSA), 2007.

[4]

and

for MANET”,

[7] Luo Liu, Cuthbert, L.,”A

on

and

Protocol

QoS

2007.

Proceedings:

Networks”,

Prediction

Technology in Electrical Sciences,

Source

Routing Protocol for Wireless AdHoc

Failure

Information

and Young Ik Eom, “Enhanced Nondisjoint

collective-path

B.,”

Digital Content Technology and its

4th

Applications, 2010.

on

Wireless communication, 2008.

105


[10] Lajos Hanzo II.

And Rahim

Networks”, Wireless Personal

Tafazolli, “Admission Control schemes

Communication, Vol-54, pp-203-224,

for 802.11-Based Multi-hop

2010.

Mobile Adhoc Networks: A Survey”, IEEE Communications and Surveys,

[15] Kun-Ming Yu, Chang Wu Yu and

2009.

She-Feng Yan, “An Adhoc Routing Protocol with Multiple

[11]

S.Venkatasubramanian

and

Backup Routes”, Springer, Wireless

Dr.N.P.Gopalan, “A QoS Based Robust

Personal Communications, Volume-

collective-path Routing Protocol for

57, 2011.

Mobile Ad-hoc Networks”, International Journal of Engineering

[16] Gabriel loan Ivascu, Samuel Pierre

and Technology, 2009.

and

Alejandro

Quintero,”QoS

Routing with Traffic Distribution in [12] Fujian Qin and Youyuan Liu,

Mobile Adhoc Networks”, Computer

“collective-path Based QoS Routing in

Communications, Vol-32, pp-306-

MANET”, Journal Of Networks,

316, 2009.

2009. [17] Xuemei Gao, Xinming Zhang, [13]

Amina

Akthar

and

Sanguankotchakorn,”

Teerapat

Dong Shi, Fengfu Zou, Wenbo Zhu,

Modified

“

Contention

and

Queue-aware

AODV for Multi-Constrained QoS

Routing Protocol for Mobile Ad hoc

Routing

Networks”, International Conference

and

Performance

Optimization in MANET”, IEEE

on

Wireless

Communications,

ECTI-CON, 2010.

Networking and Mobile Computing (WiCom), pp 1628 – 1631, 2007.

[14] Nityananda Sarma and Sukumar Nandi, “Route Stability Based QoS

[18] Vinay Rishiwal, S. Verma and S.

Routing in Mobile Adhoc

K. Bajpai, “ QoS Based Power Aware

Routing

in

MANETs”,

International Journal of Computer

106


Theory and Engineering, Vol. 1, No. 1, April 2009. [19]

Network

Simulator,

http://www.isi.edu/nsnam/ns

107

An Enhanced Protocol for the evaluation of QOS

An Enhanced Protocol for the evaluation of QOS

Suggest Documents

Simulation & Performance Evaluation of QoS Routing Protocol for Ad

Evaluation of an enhanced cleaning and disinfection protocol ... - PLOS

An enhanced AODV routing protocol for MANETs

Simulation of an advanced QoS protocol for mass content

An Energy-Efficient MAC Protocol for QoS ... - Semantic Scholar

An Energy-Aware QoS Routing Protocol for ... - Semantic Scholar

An Evaluation Protocol for Picture Archiving and

An enhanced QoS Architecture based Framework for Ranking ... - IJETT

An enhanced QoS Architecture based Framework for Ranking ... - IJETT

Laryngoscopy evaluation protocol for the

An Enhanced Routing Protocol Based on Collection Tree Protocol

An Enhanced Mobile Agent Security Protocol

Tunnel Agents for Enhanced Internet QoS - CiteSeerX

Evaluation of the identification protocol for

Evaluation of an optimized protocol using human

An Enhanced RFID Multiple Access Protocol for Fast Inventory

An Enhanced AODV Routing Protocol for Wireless ... - Semantic Scholar

Enhanced AODV Routing Protocol for An architecture ...

EVALUATION OF QOS PARAMETERS FOR IPTV

An enhanced real-time routing protocol with load distribution for ...

An Enhanced Security for TCP/IP Protocol Suite - International Journal ...

An Enhanced Reservation-Based MAC Protocol for IEEE ... - MDPI

An Enhanced Routing Protocol for ZigBee/IEEE 802.15.4 Wireless ...

An Enhanced Stable Election Protocol (SEP) for ...