(IJCNS) International Journal of Computer and Network Security, 113

Vol. 2, No. 5, May 2010

A Novel Architecture for QoS Management in

MANET using Mobile Agent
A.K.Vatsa1 and Gaurav Kumar2
1
Assistant Professor
School of Computer Engineering and Information Technology, SHOBHIT UNIVERSITY,
NH-58, MODIPURAM, MEERUT, UTTAR PRADESH, INDIA.
avimanyou@rediffmail.com
2
Bachelor of Technology
School of Computer Engineering and Information Technology, SHOBHIT UNIVERSITY,
NH-58, MODIPURAM, MEERUT, UTTAR PRADESH, INDIA.
kumar.22.gaurav@gmail.com

interest in this field and researches to be carried out for

Abstract: The wide availability of mobile devices equipped with
infrastructure-free wireless communication capabilities together
with the technical possibility to form ad-hoc networks paved the
path for building highly dynamic communities of mobile users.
In many performance oriented applications like co-operative
information sharing, defense applications, disaster
management, mission critical applications and commercial
production applications needs QoS, which is, no doubt, a critical
issue. In this paper, we propose a novel architecture using
hierarchical model to effectively manage the resources on and
attached with Mobile ad-hoc Network and provide robustness
with zero probability of fault. The dynamic clustering and the
criteria for cluster formation causes adaptability to various
situations and enhancement of load bearing capacity as well as
an effective co-operation between several nodes to bear the
responsibilities. The main focus is to minimize the overhead
transmission in the network for which a new approach of co-
operative routing is implemented.
Keywords: MANET, QoS, Mobile Agent, Cluster, Cluster
Head, co-operative Routing, Hierarchical model, Dynamic
Clustering, Hybrid Approach and Host.
1. Introduction
1.1 MANET
Mobile Ad hoc network [9], is infrastructure less, dynamic
multi-hop wireless network, where each node acts as a
mobile router. They are equipped with a wireless transceiver
and by a group of mobile hosts formed on a shared wireless
channel by virtue of their proximity to each other [10].
Routing protocols should adapt to such dynamics and
continue to maintain connection between the
communicating nodes. As a consequence of mobility and
disconnection of mobile hosts, the dynamics of wireless ad
hoc networks, causes a lot of problems to emerge in
designing proper routing algorithms for effective
communication [11]-[12]. Also the time of entering the node
to the network and exiting from it be unpredictable. Work
on unipath routing has been proposed in many literatures
[18]-[22]. There two main classes of routing protocols in
MANET, i.e., table-based or proactive and on demand or
reactive protocols [23]. Any suitable mix may give better
results. Their varied scope and promising features cause
betterment of the network functioning.
1.2 Mobile Agent
Mobile agents are programs that can migrate from host to
host in a network [11], at times and to places of their own
choosing where this is mandatory for the host to posses’
agent hosting capability. The agent code should not have to
be installed on every machine the agent could visit
providing them platform independency [11]. Agents are able
to decide, based on their local knowledge, if, when and
where to migrate in the network. The ability of mobile
agents to replicate themselves into many copies that travel to
different points across the network sounds promising.
During migration, the agent’s local state variables [7] are
transferred to the new host to continue computation there.
Mobile agents are chosen for many applications, due to
several reasons [8], viz. improvements in latency and
bandwidth of client-server applications and reducing
vulnerability to network disconnection.
1.3 Quality of Service
QoS support in MANET’s is a challenging task and it is
required to have a better management over parameters like
minimum bandwidth; minimum delay, jitter guarantee, dis-
connectivity and denial of services and contract based
enforced service agreements. Although, MANET’s are used
for a variety of applications, but, the commercial one’s
mainly multimedia applications require a predefined Quality
of Service [1]. This QoS is in the form of an agreed upon
service level agreement [1]. QoS means a guarantee of some
parameters and their threshold value. We know that
different applications have different requirements of
resources. QoS roughly means providing the applications
with enough network resources, so that they can function
within acceptable performance limits. Since the
requirements of resources vary, the value of QoS parameters
also varies for every application.
1.4 Problem Identification
The problem considered in this paper is to provide a routing
scheme for MANET’s so that the QoS can be provided to
the mobile nodes with decreasing the amount of overhead
transmission and providing such an architecture which
114
properly manages the network with minimum probability of
error occurrence. Though the consumption of resources is a
problem, yet a bigger problem is that even after giving so
much of network capacity, protocols still lack in providing
QoS strictly. Getting in a bit depth there is a strong
requirement to make the updation of the topological
information to a defined level. The reason being frequent
updation may consume considerable amount of network
resources as well as delayed updation may cause delay in
detection of topology changes. Hence, this calls for the
development, which finds a way solving both of these
problems.
1.5 Paper Organization
The rest of the paper is organized in such a way that the
second section describes previous works in the field of
quality of Service management, clustering and formation of
cluster heads. This section also describes the previously
proposed architectures in this field along with a short
description of co-operative routing. The third section consist
of our proposed work with thorough description of how
clustering is to be done and how hierarchical modeling can
help in solving the problems. This provides with a
comprehensive architecture for QoS management
mechanism with detailed description. The fourth section
consists of the future work that can be done in this field.
Finally, the paper is concluded in section five.
2. Related Work
2.1 Quality of Service
The QoS parameters are those properties of the network
which plays important role in the delivery of required
information over the network. The requirement of QoS is
that neither all applications require same network resources
nor from commercial point of view all users pay same for
services. So there is a need to make such distinctions. Now
as many parameters are considered in the QoS related to the
network the transmission will become more effective. There
are some parameters [1], identified to be considered
essential for the transmission viz. bandwidth, delay, jitter
and reliable delivery of data. There is also requirement to
pay attention to the way they are managed, about where and
how. Some architecture effectively managed these in the
form of matrices and calculations are done with defined
formulas, [2]. The QoS matrix which is used to store the
values of parameters of links between every two nodes is
having the node id on both rows and columns. The values
filled in the matrix are the values for every link in the
network and looks like as given below:
the equations are as follows:
bwp(s,d)= min bwe(i,j)>=bwmin …(1)
(i,j)έP(s,d)
delayP(s,d)= ∑ de(i,j) <= D …(2)
(i,j)έP(s,d)
These equations can be interpreted as follows:
(IJCNS) International Journal of Computer and Network Security,
Vol. 2, No. 5, May 2010
Equation 1. states that the path with banwidth left on them
denoted by bwe(i,j) which is greater than bwmin are selected
and the one with min. value is decided to be assigned.
Equation 2. states that for delay the summation of all the
delays on all the links is taken and the path where it is
found to be less than D is selected. Similarly other criterion
can be calculated.
2.2 Clusters and Cluster Head
Among several approaches there are techniques which have
considered the network as a whole and others have used
clustering to manage the network effectively. This clustering
is the technique which made it possible to deploy hybrid
approach of protocols in MANET’s. Since, the formation of
clusters is to be done carefully, previous works have done
clustering on three main basis viz. fixed geographical
locations [3], based on numerousity of nodes in a cluster and
depending upon hop counts [4]. The GPS system provides
the information about exact co-ordinate of the node in the
geographical location through which we can form fix size
and fixed boundary clusters with a little dynamics. However,
in the second approach we formed the clusters depending
upon the count of the nodes permissible in a cluster. The
third approach uses the proximity of neighborhood of nodes
in the network and other subjective values. Also, the
determination of cluster head should be done in a way
keeping in mind the proper division of work on the nodes so
that no node would get overloaded with work. This
determination cannot be done with exact calculation and
without error but yet we have much data to calculate that
which node is free most of the time and hence which can
serve as cluster head. Although in current scenario we have
such advance devices which have extremely high processing
capability and hence the selection of cluster head may not be
very strict but yet we try to keep cluster heads away from
relaying the data.
2.3 Previously Defined Architecture
Several architectures have been defined using hybrid of
proactive as well as reactive approach and tried to solve the
problem of MANETS’s. One of the most popular has used
the same hybrid approach [1] and defined how the work is
done in reactive way for path determination and reservation.
(a) Contract enforcer
 (IJCNS) International Journal of Computer and Network Security, 115
(b) Design of QoS management in MANET
Figure 1. The architecture of contract enforcement and path
determination/reservation.
This is sown in figure 1(a) and 1(b). This architecture
divides the work in two main portions viz. contract
enforcement and QoS management. The contract
enforcement is done using four modules viz. shaper module,
Packet Classifier module, packet scheduler module and
feedback module. The QoS management finds a path in
reactive way to the destination following the defined service
level agreement. Another architecture defines how this
traditional Ad-Hoc network can be interfaced with IP
network [5]. This architecture provides a well defined
separation of IP network and MANET. It tries to remove the
misconceptions which most people have about IP links. It
has defined the interaction well. Another model tells about
Integrated Services [13], [14], Differentiated Service [15],
FQMM [6],[13],[16] and SWAN [6],[17]. The Integrated
Services (IntServ) model was the first standardized model
developed for the Internet. The Differentiated Services
(DiffServ) model was designed to overcome the inherent
demerits of the IntServ model by IETF (RFC 1633). A
Flexible QoS Model for MANET (FQMM) has been
proposed which considers the characteristics of MANET’s
and tries to take advantage of both the per-flow service
granularity in IntServ and the service differentiation in
DiffServ. SWAN model was developed by the Comet team
at Columbia University. The model divides the traffic into
real time UDP traffic and best effort TCP traffic.
2.4 Co-operative Routing
Since the motion of mobile agents is pure overhead and if
this could be minimized then it can save a considerable
amount of bandwidth and also the mobile nodes are quiet
sufficient to bear the overhead of merging packets if they
can be an approach of co-operative routing[3] was proposed
which reduces the overhead transmission.
Figure 2. Cooperative Routing
It is shown in figure 2. The message from 22, 23 and 24
arrived 18 at three different times and are destined to 1, 2
and 3. As in figure 1 either they could be individually
Vol. 2, No. 5, May 2010
transmitted to the destination with their individual overhead
or they may be merged in a single packet destined to 15
where they may be reconstructed to form separate packets.
Hence the load on network from 18 to 15 is reduced on the
cost of processing on 18 and 15. Such places where this
merging is carried out are called Rendezvous points. Since it
cannot be assumed for packets to arrive these points at
exactly same time the packets face some waiting time at
these positions, the time for which these packets wait are
called rendezvous period and should be chosen such so that
they may not increase delay to unacceptable level. These
rendezvous points are mainly those from where traffic is
considerably high i.e. in case of MANET’s they are mainly
interfaces between clusters.
3. Proposed Work
3.1 Cluster Formation Criteria and Dynamics in
Clustering
The method of cluster formation in this work depends upon
two conditions. Depending upon previous experiences we
have data about what amount of time some node is using the
transmission medium. The sum of this value should not
exceed a threshold value within a period of time. Hence as
soon as we reach this value we start the formation of new
cluster. Though it may increase the performance but can
cause non-symmetric structure of cluster. To keep it
symmetric we pose a limit on the maximum hops from the
cluster head permissible in the cluster. Now, these are two
criteria’s and whichever is met first can cause the start of
formation of new cluster. Till the dynamics of cluster is
considered the changes in clusters may be triggered due to
two reasons. First, if the usage value exceeds the maximum
threshold value and secondly if any node moves out of
neighbourhood of cluster, causing changes in many clusters.
This is shown in figure 3.
Figure 3. Flow of Control for Cluster formation
Pseudo code for clustering:
Here usage_threshold maximum usage permitted,
hop_threshold maximum hops permitted from the cluster
head, passed as arguments to a function named
form_cluster(), pop() retrieves a node from the
neighbourhood list of head sent as argument and named
head_threshold, sum_cluster_usage is the sum of usage in
the cluster, node_usage is the individual usage of one node,
hop_to_cluster is the hops taken by anode to reach the head,
cluster_head_mamber[] is an array containing the id’s of
nodes added in the cluster, node_id is the identification of
nodes, node_cluster_head is a field with every node pointing
116
to the cluster head of itself, current_cluster_head is the head
of the cluster for which clustering is done presently and
least_usage_value is a function finding the node with least
usage among unassigned nodes kept in a list and passed as
argument called list_unassigned_node.
form_cluster(usage_threshold,hop_threshold)
(1) pop(head_neighbourhood)
(2) if(sum_cluster_usage+node_usage
usage_threshold || hop_to_cluster < hop_threshold)
(3) then: cluster_head_member[next]= node_id;
(4) :node_cluster_head= cluster_head_id;
(5) else current_cluster_head
least_usage_value(list_unassigned_node)
(6) goto step(1);
3.3 Hierarchical Model
The hierarchy in the network means dividing the network in
smaller regions and managing the regions as if they are
small MANET’s. This is like the divide and conquers
approach in the algorithms which we use to divide the
problem in smaller parts. Initially it looks like the same
clustering approach. This gives us several benefits, as this
may divide the load between several nodes to maintain the
topology of the network. This hierarchy will also cause
effective path determination as well as routing and need not
to travel on any path which may not lead to the destination.
This causes the QoS effectively managed. The hierarchy
which we use is rooted to several levels and taking an
abstract view the functioning is similar. The cluster
formation criterions which are previously described can be
used to make upper layer clusters. Now consider a tree
where root is the complete MANET and the leaves are the
lowest and most fundamental clusters. Each node on the n-
1th level is a group of these fundamental clusters. All such
clusters on every level are on equivalent positions on the
network. The formation and splitting criteria are same
except the values which will be different in every level. The
values will also be dynamically generated since there is no
limitation over maximum Value of levels. This can be better
shown by figure below. The hierarchical model is
maintained by a mobile agent instances of which are
travelling in the network inside each cluster and instances
are also running on every level in proactive way updating
the information after every certain time intervals. Also this
mobile agent waits for some time on every node. There are
nodes which act as interfaces between clusters acting as
Rendezvous points where mobile agents co-operate to carry
the information. It is illustrated in figure 4.
Figure 4. Cluster Formation and Hierarchical Model
(IJCNS) International Journal of Computer and Network Security,
Vol. 2, No. 5, May 2010
3.2 Architecture
The architecture shown in the figure is just a more detailed
and modified form a previously proposed architectures. This
architecture mainly defines the way in which path
determination is done in case of multilevel hierarchical
model and reservation is done afterwards. The architecture
can be referred in figure 5. This calls for generation of a
< mobile agent on demand hence reactive in nature. The agent
after finding the QoS path to the destination returns via
same path to the source reserving resources at each
intermediate cluster head. If the reservation fails due to
= reservation of resources by some other agent meanwhile,
then again the path determination is done. However the path
determination phase requires contract as well as the
information of network capacity left at that time which is
maintained by the cluster heads.
Figure 5. The Proposed Architecture for QoS management
3.3 Working Principle and Explanation
3.3.1 Hybrid Approach
The previously defined problem of finding a way between
high bandwidth consumption for overhead transmission and
delayed updation can be better solved by the hybrid
approach where at each level the topological information is
updated by mobile agent for every cluster after certain time
and the path determination can be done in reactive way by
another mobile agent on demand. Before coming on to the
actual description of operation of mobile agents we must
discuss that there are several instances of same mobile agent
travelling in the network and hence to distinguish between
them we need to give every instance a unique Id.
3.3.2 Topology Maintaining Mobile Agent
The mode of operation can be described in following steps:
• Every node performs the neighbouhood detection. Each
node must detect the neighbor nodes with which it has a
direct link. Neighbor Discovery Protocol (NDP) is used
to discover the neighbors and update the neighbors
table. It periodically transmits HELLO message at
regular intervals. The reception of NDP beacons
indicates "node found" or "node unreachable"
information, the node will respond as follows:
Node found NDP packet: upon receiving a beacon from a
new neighbor; the neighbor table is updated by adding this
neighbor information as a new record with a zero in the NV
field.
Unreachable NDP packet: NDP packet could be detected as
an unreachable neighbor node, so that neighbor record will
be deleted from the neighbors table.
• If any change is detected, it is communicated to mobile
agent when comes to the node. The motive of
communicating only changes is to minimize the amount
 (IJCNS) International Journal of Computer and Network Security, 117
of load on network again on the cost of extra processing
on the side of nodes.
• This mobile agent moves inside the cluster and collects
all such information as well as updates all such
information on the node. This causes the maintenance
of topology of the cluster on every node. The cluster
head calculates some figures about the paths and the
network capacity left with its cluster. This complete
information with the agent is updated when it reaches
the cluster head. It is later on communicated to the
higher level cluster head by another agent and the
process of updation goes on to maintain the complete
topological information.
This updation in upper level cluster is done in following
way:
• The information of cluster available at lower level is
calculated to generate some information for upper layer
cluster head.
• Every such lower level cluster head is travelled through
interfaces by agent and agent for this level takes
information from cluster heads only.
• This information is updated for upper level cluster head.
An important point to be noted is that the generated
information is not the info about each link but an abstract
knowledge of the bandwidth available through that cluster,
delay through that cluster and similar information about
other parameters. Also if some change in the node
membership is encountered. In this way the info is updated
at the highest cluster head.
3.3.3 Path Determining and Resource Reserving
Mobile Agent
The process of path determination and reservation is done
by another mobile agent who works in the following way:
• Whenever any node needs to transmit the data, it
generates the mobile agent and directs it to the cluster
head.
• At cluster head if the destination node is in the current
cluster then the head tells a QoS path to the agent.
• If the destination is not in the current cluster, the agent is
told the way for upper layer cluster head.
• The process is repeated till the cluster of some level tells
that the node is available in its cluster. From here the
agent takes the path from source to destination
following the lowest level clusters.
• This movement of the mobile agent till it reaches such a
cluster head which has both the source and destination
in its region causes the agent to see from the highest
level the topology of the required region.
• The agent then reaches the destination’s lowest cluster
head following the told path by the cluster head.
At this stage the path to the destination cluster is known. All
the intermediate cluster heads of lowest level are then
travelled in reverse order to reserve the path resources for
the source in the following way:
• The agent itself returns from the lowest level cluster
heads, intermediate in the path.
• At every cluster head it reaches intermediately it reserves
the required amount of resources which should strictly
follow the contract.
Vol. 2, No. 5, May 2010
• The agent reaches back to the source. In this way a
quality of service path is reserved for the source.
The last packet of transmission moves on with setting
resources free. For this we need a special field value of
which causes continuation of reservation or setting resources
free.
3.3.4 QoS Path Determination in detail
This process is done by reaching every cluster head and
collecting the information for various parameters. The
formulas in equation 1 and 2 are as it is followed in our
work and give a clear picture about how the calculations are
done to determine the paths fulfilling the criteria. However
from the side of cluster head the responsibilities are to
provide access to the data on the node about its cluster to the
mobile agent. The rest is on the agent. Whenever the
destination node is found in the cluster the head is
responsible to tell the lowest level QoS path. In case of
failure of path determination an alternative path is chosen,
which in our work, we try to prepare for, if it happens to
occur. For this we maintain several such paths and choose
alternative on the spot. However, choosing such alternative
path may constrain our future selections. If all such paths
are not found then we move forward for second execution of
path determination. Another point which should be
considered is there are some QoS parameters which
themselves depend upon other parameters such as delay or
congestion, jitter and reliability on mobility of nodes etc.
The guarantee for control of jitter is given by cashing of
packets i.e. in case a data packet is delayed due to excessive
traffic load or caused due to new path selection then the
packet already cashed in the memory is used to make up the
delivery gap. Another thing to be considered is the handoff
process. If handoff occurs frequently, it has adverse effect on
every aspect of QoS. Hence several factors which could
cause potential problems during handoff are also managed
under QoS. This management of QoS during handoff is
considered differently. During handoff process, the data
available at the cluster head is to be transmitted to the new
cluster head. This transmission of data is always inter-
cluster in cases when the handoff is due to head moving out
of the cluster, since the indication of need of handoff is
received only at the motion of head out of the cluster. Also
the handoff may occur if the load on the node is so increased
that it can no more bear the responsibility of cluster head in
that case the handoff is intra-cluster. To manage this
handoff process we divide the information available at the
cluster head to be divided into two parts:
1) Readily available
2) Calculated information
This readily available information is the one which can be
gathered inside the cluster as and when it is required. The
calculated info is very concentrated and calculated from a
long time in the past. Now since the handoff process
requires some transfer of information about the cluster if the
cluster head is leaving the cluster this transferred info would
be only the calculated info. The will be gathered by a
request.
118
4. Conclusion
The architecture proposed and the model used solves the
problem of management of topology and providing QoS in a
better way than any other work proposed in this field
however the practicality and implementation are no doubt
matter of molding the proposals and to change them the way
they fit. Higher load of processing is imposed on the nodes
having ample amount of processing capacity and the load of
transmission is reduced thereby saving bandwidth.
Reliability of the routing protocol depends on its
performance within highly dynamic networks. Scalability is
determined by the protocol's performance at crowded
networks. QoS is expressed by the protocol resistance to the
network changes. Applying divide and conquer approach
used in this design helps to effectively manage the network
in highly dynamic situations and decreases the probability of
fault on the network.
5. Future Scope
The architecture in view of its functioning provides a strict
set of rules for effective management of QoS in MANET’s
yet it deserves thorough study and simulation on some test
bed to evaluate its practical results and feasibility. Still the
work can be done to minimize the overhead transmission for
topology maintenance. If feasible to deploy in practical
environment GPS tracking can also be used to reduce load
on bandwidth. Also fixed geographical clustering has its
own advantages and hence can be modified in similar way
to reduce load. Consider agent's size, especially in scalable
networks. Minimizing agent size may benefit from the idea
of MPRs. Regulate TtM value depending on the network
state to save the unnecessary fast updating. Adjust the agent
population to maintain the optimal node-agent ratio in the
network.
References
[1] M.Sulleman Memon, Manzoor Hashmani and Niaz
A.Memon,A Framework for QoS Management and
Contract Enforced Services in MANETs for Prioritized
Traffic Environment, IJCSNS International Journal of
Computer Science and Network Security, VOL.9 No.4,
April 2009.
[2] S.S.Manvi and P.Venkataram, Mobile agent based
approach for QoS routing, The Institution of Engineering
and Technology 2007.
[3] Parama Bhaumik, Somprokash Banyopadhyay, Mobile
Agent Based Message Communication in Large Ad hoc
Networks through Co-operative Routing using Inter-
Agent Negotiation at Rendezvous Points.
[4] S.A.Hosseini-Seno, B.Pahlevanzadeh, T.C.Wan, R.
Budiarto, M.M.Kadhum, A DISTRIBUTED
RESOURCE-MANAGEMENT APPROACH IN
MANETS, Journal of Engineering Science and
Technology Vol. 4, No. 2 (2009) 142 – 153,2009.
[5] Thomas Heide Clausen, A MANET Architecture Model,
INSTITUT NATIONAL DE RECHERCHE EN
INFORMATIQUE ET EN AUTOMATIQUE, January
2007.
(IJCNS) International Journal of Computer and Network Security,
Vol. 2, No. 5, May 2010
[6] John B. Oladosu, Akinwale O. Alao, Matthew O.
Adigun, Justice O. Emuoyibofarhe, Design and
Simulation of a Quality of Service (QoS) Guaranteed
Model for Mobile Ad Hoc Networks.
[7] David Kotz and Robert S. Gray, Mobile Agents and the
Future of the Internet, ACM Operating Systems Review,
August 1999, pp. 7-13
[8] Danny B. Lange and Mitsuru Oshima. Seven good
reasons for mobile agents Communications of the ACM,
42(3):88– 89, March 1999.
[9] Corson, S., J.Macker, “Mobile ad hoc networking
(MANET): routing protocol performance issues and
evaluation considerations,” RFC 2501, Jan.1999.
[10] Hakim Badis and Khaldoun Al Agha, An Efficient
QOLSR Extension Protocol For QoS in Ad hoc
Networks.
[11] Manal Abdullah, Helen Bakhsh, Agent-based Dynamic
Routing System for MANETs, ICGST-CNIR Journal,
Volume 9, Issue 1, July 2009.
[12] K. A. H. Amin, “resource efficient and scalable routing
using,” university of north texas, 2003.
[13] Hannan Xiao, Winston K.G. Seah, Anthony L O and
Kee Chaing Chua, A flexible Quality of service Model
For Mobile Ad-Hoc Networks, IEEE, 2000
[14] R. Braden, D. Clark, and S. Shenker, “Integrated
Services in the Internet Architecture – an Overview,”
IETF RFC1663, June 1994.
[15] K. Nichols, V. Jacobson, and L. Zhang, “A Two-Bit
Differentiated Services Architecture for the Internet,”
RFC2638, ftp://ftp.rfceditororg/in-notes/rfc2638.txt, July
1999.
[16] K. Wu and J. Harms, “QoS Support in Mobile Ad Hoc
Networks,” Crossing Boundaries – an interdisciplinary
journal, vol.1, no. 1, pp. 92-104.
[17] R. Sivakumar, P. Sinha, and V. Bharghavan, “CEDAR:
A Core-Extraction Distributed Ad Hoc Routing
Algorithm,” IEEE Journal on Selected Areas in
Communication, vol. 17, no.8, pp. 1454-1465, August
1999.
[18] S. Murthy and G. L. Aceves, “An Efficient Routing
Protocol for Wireless Networks,” Mobile Networks and
Applications, 1996, Vol. 1, No. 2.
[19] C. E. Perkins and P. Bhagwat, “Highly Dynamic
Destination-Sequenced Distance-Vector Routing
(DSDV) for Mobile Computers,” Proceedings of ACM
SIGCOMM, 1994, pp. 234-244.
[20] C. E. Perkins and E. M. Royer, “Ad-hoc On-Demand
Distance Vector Routing,” Proceedings of the 2nd IEEE
Workshop on Mobile Computing Systems and
Applications, 1999.
[21] D. B. Johnson and D.A. Maltz, “Dynamic Source
Routing in Ad Hoc Wireless Networks,” Mobile
Computing, 1996, pp. 153-181.
[22] S. Mueller, R. P. Tsang and D. Ghosal, “Multipath
Routing in Mobile Ad Hoc Networks: Issues and
Challenges,” In Performance Tools and Applications to
Networked Systems, Vol. 2965 of LNCS, 2004.
 (IJCNS) International Journal of Computer and Network Security, 119
Vol. 2, No. 5, May 2010

[23] Muhammad Sulleman Memon, Manzoor Hashmani

and Niaz A. Memon, 2008, A review for uniqueness and
variations in throughput due to performance parameters
of simulators on MANETs routing protocols, presented
in 7th International Conference on EHAC’08, University
of Cambridge, UK Cambridge, 20-22 Feb, 2008, PP:
202-208.

Authors Profile

A.K.Vatsa is working as Assistant Professor

in the School of Computer Engineering and
Information Technology at Shobhit University,
Meerut (U.P.). He obtained his M-Tech(C.E.)
from Shobhit University and B-Tech(I.T.)
from V.B.S. Purvanchal University, Jaunpur
(U.P.). He has worked as software engineer in
software industry. He has been in teaching for
the past one decade. He has been member of
several academic and administrative bodies. During his teaching
he has coordinated several Technical fests and National
Conferences at Institute and University Level. He has attended
several seminars, workshops and conferences at various levels. His
several papers are published in various national and international
conferences across India. His area of research includes MANET
(Mobile Ad-Hoc network), Congestion Control and VOIP-SIP
(Voice over IP).

Gaurav Kumar is pursuing his Bachelor of

Technology in Computer Science and
Engineering from Shobhit University, Meerut
(Formally Shobhit Institute of Engineering
and Technology, Meerut) affiliated to Uttar
Pradesh Technical University and is likely to
complete in the June, 2010. He has published
several papers in National Conferences. He
has good organizing and leadership skills and has been a part of
several societies. He has organized several technical events at Inter
and Intra University and Institute level. He has keen interest in
research area related to MANET (Mobile Ad-Hoc Network) and
WSN (Wireless Sensor Network).