JOURNAL OF COMPUTING, VOLUME 3, ISSUE 3, MARCH 2011, ISSN 0320-1113

HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 74

Secure and Priority Based Routing Mechan-

ism in MANET through Mobile Agent
Puneet Kumar1,A.K.Vatsa1

1
School of Computer Engineering and Information Technology, SHOBHIT UNIVERSITY,
NH-58, MODIPURAM, MEERUT, UTTAR PRADESH, INDIA.

Abstract—The wide availability of mobile devices equipped with infrastructure-free wireless communication capabilities
together with the technical possibility to form Mobile ad-hoc networks (MANET) paved the path for building highly dynamic
communities of mobile users. Mobile agent is a program segment which is self-controlling. The mobile agents have no security
mechanism and authentication scheme is used to permit mobile agents to perform computations. Due to lacks of security
aspects when applied to MANET where nodes cannot be classified as they are malicious or not, hence for the cases where the
security of data or reliability of agent became must we need some method to insure the things. Thus, In this paper, we propose
a Admission Control Mechanism on hierarchical model architecture of MANET maintained by Mobile agent using secure and
priority based routing algorithm with effective security authentication technique. Our technique has three phases, In Initial
phase, Admission Control method - where we provide admission of mobile nodes in hierarchical model. In the next phase, we
discuss the priority based routing mechanism using BFS technique for routing. In the last phase, we provide security over
mobile agents with effective authentication methods.

Index Terms—Mobile ad hoc networks (MANETs), Hierarchal Model, BFS, Admission Control, Authentication.
.

————————————————————

1 INTRODUCTION
1.1 MANET
Mobile Ad-hoc Network (MANET) refers to a multi-hop
packet based wireless network composed of a set of mo-
bile nodes that can communicate and move at the same
time , without using any kind of fixed wired infrastruc-
ture. It is self-organizing, rapidly deployable, adaptive
and dynamic reconfigurable network of mobile devices
connected by wireless links [1]. Node acts as host and
router to assist in transmitting data to other nodes in its
range. MANETs differ from wired/wireless networks in
that there is no central control, no base station, and no
wireless switches.
As a result, any task in the network must be distri-
buted and executed by all its members. These tasks in-
clude manually creating and updating policies for the
admission as well as the access control of devices over
time.
1.2 Hierarchical Model of MANET
A hierarchy is an arrangement of Nodes in the form of
clusters in which the items are represented as being
"above", "below," or "at the same level as" one another.
The hierarchical model refers to an architecture in which
the network has been divided into small clusters or and
provide a hierarchy in the form of Lower level clusters
and moving up to upper level clusters. There are cluster
heads at each level which manage the associated nodes at
each level. This technique makes navigation in Mobile Ad
Hoc Network easy and also reduces the complexity of the
network as it is highly dynamic in nature.
1.3 Admission Control
Admission control refers to the decision process that is
performed prior to the incorporation of devices to the
Mobile Ad Hoc Network.
A node that wishes to use the network to transport
traffic in must first request a connection, which involves
informing the cluster head about the characteristics of the
traffic. The cluster head judges whether it has enough
resources available to accept the connection, and then
either accepts or rejects the connection request. In Short
we can say that the admission control mechanisms' func-
tion is to ascertain whether the network can satisfy a data
session's requirements without violating the session of
the nodes of previously admitted sessions.
1.4 Routing Mechanism in Hierarchical ModelofMA-
NET
Routing in an MANET typically consists of two phases:
route discovery and route maintenance. Route Discovery
is the mechanism by which a node S (lower level cluster
head ()) intending to send a packet to destination D
(upper level cluster head ()) obtains a route to D. Route
Maintenance is themechanism by which node S is able to
detect, while using a route to D, that one or more links
along the route have failed. When a broken link is discov-
ered, the source can use another route or can revoke
Route Discovery.
MANET routing protocols are commonly classified
into two categories – Proactive and Demand based. Proac-
tive routing continually maintains information on all
available paths using periodic updates so when a packet
needs to be sent, routes are known and can be used im-

© 2011 Journal of Computing Press, NY, USA, ISSN 0320-1113

http://sites.google.com/site/journalofcomputing/
 JOURNAL OF COMPUTING, VOLUME 3, ISSUE 3, MARCH 2011, ISSN 0320-1113
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG
mediately. The proactive method takes little time to dis-
cover routes but must maintain routing information for
unused paths. Demand based routing, rather than main-
taining paths between all nodes at all times, invokes a
route discovery procedure on demand. Demand based
schemes use less network bandwidth as they avoid send-
ing unnecessary routing information but they typically
take longer to discover routes.
1.5. Security of Mobile Agent in MANET
A Mobile agent is a self-governing software entity that
can manage its execution. It can suspend its execution;
transfer itself from one networked host to another and
resume its execution. Agents are programmed to perform
certain tasks- as it meant for. In the process of performing
the task, the agent may traverse numerous Clusters. The
Cluster head acts as a host and provides an execution
environment for the agent. The autonomous and mobile
nature of the agents introduces new complexities and
security issues. Mobile Agent carries sensitive informa-
tion which must be secure and tamper-proof, and must
not reveal information inappropriately. The Host plat-
form should provide a safe environment for the agent to
execute. A malicious agent may attack the Host and
access sensitive data or tie up inordinate amount of re-
sources causing Denial of Service to other applications or
agents.
1.6. Problem Identification
Due to lack of security aspects in Mobile agent when ap-
plied to MANET, where nodes cannot be classified as
they are malicious or not, hence for the cases where the
security of data or reliability of agent became must. We
need some method to insure the mechanism for routing
done by mobile agent and Mobile agent needs security
while providing routes for nodes and maintaining the
hierarchal model of MANET.
1.7. Paper Organization
We organize this paper in chapters. In Chapter -1 we have
discussed about the clusters in Hierarchical model. This
chapter also describes how cluster heads are managing
the attached nodes. Chapter -2 describes about the admis-
sion control mechanisms of the nodes at different hie-
rarchy levels of the model.
Routing Algorithm using Breadth First Search has
been explained in Chapter -3. Chapter -4 discusses Secu-
rity Mechanism concerning authentication. In Chapter -5
conclusions about the paper has been explained and the
paper hasbeen finally concluded with the discussion of
future scope.
2 RELATED WORK
In Paper [8], a routing scheme for MANET’s has been
proposed so that the services can be provided to the mo-
bile nodes with decreasing the amount of overhead
transmission and providing such an architecture which
properly manages the network with minimum probabili-
ty of error occurrence. There is a strong requirement to
make the updation of the topological information to a
© 2011 Journal of Computing Press, NY, USA, ISSN 0320-1113
http://sites.google.com/site/journalofcomputing/
75
defined level which 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 of the Hierarchical architecture.
The 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 [10], based on numerousity of
nodes in a cluster and depending upon hop counts [11].
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 [12] and defined how the
work is done in reactive way for path determination and
reservation.
Another model tells about Integrated Services [2],
[24], Differentiated Service [25], FQMM [26],[27],[28] and
SWAN [26],[29]. The Integrated Services (IntServ) model
was the first standardized model developed for the Inter-
net. The Differentiated Services (DiffServ) model was de-
signed 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 de-
veloped by the Comet team at Columbia University. The
model divides the traffic into real time UDP traffic and
best effort TCP traffic.
The architecture[8] proposed and the model used
solves the problem of management of topology and pro-
viding services in a better way than any other work pro-
posed in this field however the practicality and imple-
mentation are no doubt matter of moulding the proposals
and to change them the way they fit. Still the work can be
done to minimize the overhead transmission for topology
maintenance.In Paper [13], a hybrid reliable data trans-
mission technique for multicasting in MANET has been
proposed. It works in a controlled manner to provide a
lossless non real time data to the receiver. It uses an ad-
mission control scheme, depending on the output queue
size, to analyse flow is admission or rejection. Thus the
proposed scheme not only controls the reliability in a
network but also the overhead and scalability issues of
existing techniques. By simulation results, it has been
shown that the proposed hybrid technique achieves better
delivery ratio with reduced overhead when compared
with existing techniques.
In [16], a multipath unicast routing algorithm with
multiple constraints based on mobile agents has been
proposed. It uses mobile agents to collect information of
all mobile nodes, and reduces the network delay and the
overhead of control messages for routing. Early work on
routing in dynamic networks using mobile agents by
Kramer et al concentrated on route discovery using
agents to continuously track the network topology and
update routing tables at all mobile hosts reached. Unfor-
 JOURNAL OF COMPUTING, VOLUME 3, ISSUE 3, MARCH 2011, ISSN 0320-1113
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG
tunately, this method increases network load significantly
because mobile agents are constantly moving through the
network. Other limitations of Kramer et al’s work are that
it is difficult to determine the appropriate number of
agents to use and it is not possible to have multiple appli-
cation specific routing algorithms concurrently in use.
The MAC sub layer in the model is implemented by
using the CDMA over TDMA channel model [16]. The
CDMA over TDMA channel model is the same model as
defined. The free slots recorded at each node may be dif-
ferent. We define the set of the common free slots be-
tween two adjacent nodes to be the link bandwidth [14].
The path bandwidth is the set of available slots between
two nodes. If these two nodes are adjacent, the path
bandwidth is the link bandwidth. Considering the two
nodes A and B link_BW (A, B) is defined to be the time
slots that are not used by any adjacent host of X to receive
or to send packets from the point of view at node X.
Therefore, we can use the link bandwidth to compute the
path bandwidth. This information can provide us an indi-
cation of whether there is enough bandwidth on a given
route between a source-destination pair.
We adopt the energy consumption model discussed
in [30]. Supposing Eelec = 50nJ/bit, Eamp =100pJ/bit/m,
and the distance from the transmitter to receiver is d, then
we get the energy consumption of the transmitter for
transmitting each bit is Eelec + Eamp·d2. Further, we as-
sume that each transmitter runs at the same power and
the communication radius is R, thus theenergy consump-
tion of the transmitter for transmitting each bit is Eelec+
Eamp·R2. On the other hand, the energy consumption of
the receiver for receiving each bit is Eelec. Supposing the
maximum energy of a host is Emax and the consumed
energy is Econsume, then g (A), the normalized remain-
ing lifetime of a host is (EmaxEconsume)/Emax. Corres-
pondingly, the cost of host A is f (A) =1/g (A).
In [15], security mechanism for the mobile agent has
been incorporated in the wireless environment. The prob-
lem with the mobile agent (multi hop mobile agent) is the
security issue in gathering information from number of
remote hosts. Generally, a multi-hop mobile agent will
visit more than one remote host in the single departure
from the owner. The order of visiting the remote host
may be static (travel path is given by the originator) or
dynamic (travel path decided by the remote hosts). In
both these cases, information protection is the major chal-
lenge against the attackers. During the journey of the
agent, a single host (server) or a set of malicious hosts
(servers) can collude together and modify, delete or insert
malicious data (information or offers) in data set collected
from the preceding hosts. For this, Yee [9] proposed the
PRAC (Partial Result Authentication Codes) to protect the
mobile agent information. Yee classifies his algorithm into
three types:
i) Simple MAC-based PRACs
ii) MAC-based PRACs with one-way functions
iii) Publicly Verifiable PRACs
These three types of PRACs are the key associated. The
© 2011 Journal of Computing Press, NY, USA, ISSN 0320-1113
http://sites.google.com/site/journalofcomputing/
76
key of the current host will be erased by the mobile agent
prior to migrating to the next server or host. The agent
has the list of encryption keys for each server to be vi-
sited. Even though the PRAC scheme ensures date integr-
ity, agents must determine how many keys they need to
carry before leaving the owner. Also, the agent has to
carefully protect the keys and erase the used key once
they complete their actions on each server. PRAC only
provides weak forward integrity [17]. Also, this is im-
possible for multi-hop mobile agents in a real network
environment [18] [19]. Zhou et al [20] [21] analysed and
developed a protocol to overcome the weakness of the
Cheng et al model to defendtwo-colluder truncation at-
tack.
The Zhou et al [21] model is the same as the Cheng et
al [22] scheme and uses a co-signing mechanism in which
a host needs the preceding host’s signature on its encap-
sulated offer beforesending it to the next host. Even
though it is able to protect the data from the two-colluded
attack, it cannot defend against multiple-colluder (more
than two) truncation attacks. Xu et al [23] proposed a pro-
tocol to defend against the two-colluder truncation attack
with the help of the one hop backward and two-hop for-
ward chaining method. It also defends against the mul-
tiple colluder truncation attacks, fake stem attack and
then the interleaving attack. It will defend the multiple
colluder truncation attacks as long as any two of the col-
luders are not adjacent. This protocol can be extended to
overcome the adjacent attacker limitation, but the proto-
col process will be too complex to implement. After this,
3-ID algorithm [18] [19] is developed with complete secu-
rity for the information in the mobile agent environment.
3 PROPOSED WORK
Phase-1: Architecture of Secure and Priority based
Routing Mechanism
In [8], the hierarchy in the network means dividing the
network in smaller regions and managing the regions as
if they are small MANET’s. This technique is like the di-
vide and conquer approach in the algorithms which is
used 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 sev-
eral 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. 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 up-
per layer cluster.Now consider a tree where root is the
complete MANET and the leaves are the lowest and most
fundamentalclusters. 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 splittingcriteria are same except the
values which will be different in every level. The values
 JO
OURNAL OF COMPUT TING, VOLUME 3, ISS
SUE 3, MARCH 2011, ISSN 0320-1113
HT
TTPS://SITES.GOOGLE.COM/SITE/JOURN NALOFCOMPUTING/
W
WWW.JOURNALOFCO OMPUTING.ORG 77

will aalso be dynam

mically generated since therre is no limi- node authen ntication priorr to granting access to thee net-
tation
n over maximuum Value of leevels.This can
n be better work. The user/
u mobile node
n must prresent some soort of
credentials before
b being granted
g access to the network.

Hierarchicall Model of MANET

M mainntained by Mobile
Agent: A hieerarchical mod del is typically
y depicted as a tree
like structurre which consists of clusterss at various leevels.
The Mobile Agent
A navigattes within the cluster at diffferent
levels and seelects the nodee based on pro obability.

Routing Mo odel based on n structure of node: It main ntains

the routing of
o mobile unitt call as per th he information n giv-
en in the tab
ble of structuree of nodes. Thhe structure of node
contains infformation reg garding the node’s
n probabbility,
link expiration time, rem maining energ gy, bandwidth h etc.
which works as a deciding g factor for sellection of nodees.
Figure 1: Hieerarchical Mod
del of MANET
T, [8]
Authenticattion using PR RAC: Securitty mechanism m has
showwn by figure 1. The hierarch hical model iss maintained been provided to the nodees using autheentication baseed on
by in
nstances ofmo obile agent, which are traveelling in the PRAC algoriithm
network inside eaach cluster and instances are also run-
ning on every leveel in proactivee way updatin ng the infor- Phase-II: Admission Control at nodees in Hierarcchical
matioon after every certain time intervals.
i Also
o this mobile model
agentt waits for som
me time on eveery node. There are nodes We consiider the Hierrarchical mod del of MANE ET, in
whichh act as in nterfaces betw
ween clusterss acting as which clusteers are formeed. Suppose the losses for non-
rendeezvous pointss where mob bile agents coo-operate to real time daata determined d by the period  are deriveed on
carry
y the informatiion. the followin
ng parameters:
Th
he working mechanism
m can
n be interpreteed by the ar- DL = Data drop rate in eache period 
PLN = Probaability of dataa loss (DL) of lower level clluster
head ()
PUN = Probaability of dataa loss (DL) of upper level clluster
head ()
PHN = Probaability of dataa loss (DL) of highest level clus-
ter head (○)
PIN = Probaability of dataa loss (DL) of interfaces betwween
clusters ()
Mr = Num mber of multicaast receiver
The probability of dataa loss of DL att each cluster head
along with the number of o multicast receiver
r (r) caan be
chiteccture given beelow: calculated onn the basis of;

Figure 2: Arch
hitecture of Seccure and Prioriity based
Routing Mecchanism

Mobiile Node: It iss a device wh hich is capablee of connect- The above eq quation state two
t factors;
ing too the MANET T from a variiety of differeent points of i. Increase in
n data drop increases the probability
p off data
entryy. Within the scope of that definition, such
h devices are loss.
cell p
phones, laptopp computers, handheld
h deviices and oth- ii. Increase in receivers along
a with daata drop evolv ves a
er commmunicating portable devicces. higher data loss.
Thus whhen a probabillity of losses increases
i due to ei-
Adm mission Contro ol Regulated by Mobile Node:N It is a ther data losss or due to increase in recceivers and crross a
mech hanism which restricts accesss to the netwo ork based on particular thhreshold leveel (P(DL, Mr)T Th), the sourcee get
identtity or securityy posture. Thiss access decisiion is on the informed an nd tries to maintain
m the consistency
c o the
of
basis of informatio on maintainedd in the structture of node network.
like bbandwidth, prrobability, energy etc. Adm mission con-
trol iss controlled by
y Mobile Agen nt which can force
f mobile

© 2011 Jou
urnal of Computing Press, NY, USSA, ISSN 0320-1
1113
htttp://sites.google
e.com/site/journ
nalofcomputing//
 JOURNAL OF COMPUTING, VOLUME 3, ISSUE 3, MARCH 2011, ISSN 0320-1113
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG
Phase-III: Routing mechanism in hierarchical model
through BFS regulated by Mobile Agents
Assumed parameters are as follows:
•Link Expiration Time: We assume that two nodes A
(Lowest level Cluster Head ()) and B (Upper Level
Cluster Head ()) are within the same transmission range
r of each other. We let (x1, y1) be the coordinates of mobile
node A and (x2, y2) be the coordinates of mobile node B.
We let v1 and v2 be the mobility speeds and θ1 and θ2(0 ≤
θ1, θ2< 2π) be the moving directions.
• Therefore, we can obtain the link expiration time by
using the following equation:
In addition, the equation cannot be applied when v1 = v2
and θ1 = θ2.
• We define the set of the common free slots between two
adjacent nodes to be the link bandwidth (BW) [6]. The
path bandwidth is the set of available slots between two
nodes. If these two nodes are adjacent, the path band-
width is the link bandwidth.
• Route Expiration Time: The RET is the minimum link
expiration time along a routing path [4]. Therefore, the
RET is equal to the minimum of the set of LETs for a
route. The hop count (HC) is the number of wireless links
in a path. Route selection is based on the value of R,
which is the ratio of RET with HC.
The value of R is decided as follows:
R is used to evaluate the selected routes. By finding the
maximum value of R, which the value of the RET is max-
imized and the value of the HC is minimized.
•Agent Model: An agent consists of three components:
(a) The agent identifier; (b) The agent program, (c) The
agent briefcase (including state variables). The agent
briefcase includes a set of network state variables such as
survival time, counter, available bandwidth, energy con-
sumption etc. An agent is capable of sharing its briefcase
© 2011 Journal of Computing Press, NY, USA, ISSN 0320-1113
http://sites.google.com/site/journalofcomputing/
78
with other agents and nodes. The state variables may be
updated if necessary when an agent leaves a node. The
data structure of node is shown in Table 1.
• Counter: Each node in the network maintains a counter
which is initialized to 0 when the network commences.
Agents navigate form one node to another, collecting and
distributing information. When an agent has completed
its tasks and is about to leave a node, it adds 1 to the
node’s counter and stores the new value against the
node’s ID in its data structure [7].
Routing Mechanism is as follows:
The node’s information matrix can be acquired through
Mobile Agent Routing algorithm [5]. When the data
packets wanted to be send to node j, it can be transmitted
by the routing algorithm according to the probability of
data loss at cluster head at node i. The routing algorithm
is a Breadth first search algorithm. The destination node
is the root of the tree. A jump is a layer of the tree. The
maximum number of layers is the number of nodes in the
network. Suppose node i is the source node, node j is the
destination node. Communicating with node j, node i
perform as follows:
Step-1: Determine LETij of i’s matrix. If LETij is not equal
to 0, there is a connection between i and j. Calculate
link_BW (i, j). The data packets are sent to j directly if
link_BW(i,j) is equal to twice of BW_need and the proba-
bility of data loss at node i(lower level cluster head) is
more in comparison to data loss at node j(upper level
cluster head) i.e. (PLN>=PUN). End routing. Otherwise, go
to step2.
Step-2: Determine line LETj of i’s cache matrix. Select
items which are not equal to 0. These items are child node
of j. If all items in LETj are equal to 0 and (PLN>=PUN),
there is no path available between i and j. End routing.
Check the remaining energy whether satisfy energy re-
quirement. If yes, this node is the child node of node j.
Otherwise, go to step3.
Step-3: Calculate the path survival time R which include
node i. Compare the value of R. The biggest one is the
first spare routing. Record the routing, go to step4.
Step-4: Continue searching their child nodes according to
its corresponding line. If child nodes contain i, go to
step3. If all child nodes don’t contain i, continue searching
their child nodes according to corresponding line and
judge whether child-child nodes contain i. If node i is
found less than n (number of nodes) times and
(PLN>=PUN), record the routing. Otherwise, the routing is
not existed. Node i cannot communicate with node j. End
routing.
Step-5: Calculate path_BW (i, j) of the selected routing .If
the available bandwidth is twice of BW_need and
(PLN>=PUN), this routing is the best routing between
 JOURNAL OF COMPUTING, VOLUME 3, ISSUE 3, MARCH 2011, ISSN 0320-1113
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 79

nodes i and j. End routing. If the first selected path cannot Phase–IV: Security mechanism using Partial Result Au-
satisfy the requirement of the bandwidth, go to step6. thentication Codes (PRAC) Algorithm: Yee [9] intro-
duced Partial Result authentication Codes (PRACs). The
Step-6: Distribute the required bandwidth into several idea is to protect the authenticity of an intermediate agent
available paths according to path_BW (i, j), that is, the state or partial result that results from running on a serv-
required QoS bandwidth is composed of several selected er. PRACs can be generated using symmetric crypto-
paths. The routing between node i and node j is not ex- graphic algorithms. The numbers of encryption keys are
isted if all selected paths cannot satisfy the bandwidth used by agent. The agent’s state or some other result is
and probability requirement. End routing. Otherwise, processed using one of the keys, producing a MAC (mes-
add each value of the routing to get the sum. sage authentication code) on the message when the agent
migrates within the cluster. The key that has been used is
Pseudo code of phase – III is as follows: then disposed of before the agent migrates. The PRAC
Void Router (int n, int i, int j) can be verified at a later point to identify certain types of
// n: the number of the nodes; i: the source node; tampering. A similar functionality can be achieved using
// j: the destination node asymmetric cryptography by letting the cluster head pro-
{if (LETij!=0) duce a signature on the information instead.
{if (link_BW(i,j) >=2*BW_need) && (PLN>=PUN) ;
{Getting the routing ;
4 CONCLUSION
Ending the routing; }
} We have considered the introduction of MANET and
else { their hierarchical structure. Then, we have discussed all
if (an item in line j not equal to 0) pros and cons of their routing mechanism under heads of
{for (k=the number of items in line j not equal to 0; related work. Therefore, we found earlier there were no
k>0;k) consideration of admission control and priority of mobile
{if (PWR(m)>= PWR_need&& m is not the father units. Thus, decision was taken on basis of existing in-
node of node j && (PLN>=PUN) ; formation in routing table, which was not effective as well
) as maintenance of hierarchical structure of MANET was
Record node m as child node of node j; } not efficient by mobile agent. Therefore, in this paper, we
if (the nodes include node i) propose a Admission Control Mechanism on hierarchical
{Record each routing which includes node i; model architecture of MANET maintained by Mobile
Calculate RET of each routing; agent using secure and priority based routing algorithm
// the biggest is the first select; with effective security authentication technique. Our
// the second biggest is spare technique has three phases, In Initial phase, Admission
for (k=1; k<=the numbers of spare routing; k++) Control method - where we provide admission of mobile
{if (k_path_BW(i,j) >=2*BW_need) && (PLN>=PUN) ; nodes in hierarchical model. In the next phase, we discuss
The kth spare routing is the best routing, End the priority based routing mechanism using BFS tech-
routing ;} nique for routing. In the last phase, we provide security
for (k=1;k<= the numbers of spare routing; k++) over mobile agents with effective authentication methods.
{if (k_path_BW(i,j) <2* BW_need) && (PLN>=PUN) ;
{ 5 FUTURE SCOPE
Join the kth spare routing into the routing path
aggregate Q; Our proposed architecture and mechanism will provide
BW_needBW_needk_path_BW (i,j) /2 && (PLN>=PUN) ; secure and efficient routing. But it is based on hierarchical
} structure and this structure is maintained by mobile
else { routing in routing Q is the selected routing; End agent, so, mobile agent should be very effective and effi-
routing;} cient during maintenance of MANET structure as well as
} routing table. The scalability, bandwidth, congestion
if (k==0) {All spare routing cannot satisfy QoS windows size and other Quality of Service parameters
requirement, End routing;} may be reconsidered on basis of proposed architecture.
else append child node in these child nodes, repeat
searching routing; 6 REFERENCES
}
else { // all items in line j are 0 [1] M.Nagaratna, V.Kamakshi Prasad and
// no routing available between node i and j C.RaghavendraRao―Team Multicasting Routing Pro-
End routing; } tocol in MANETs, IJCSNS International Journal of
} Computer Science and Network Security, VOL.9
} No.6, June 2009
[2] Hannan Xiao, Winston K.G. Seah, Anthony L O and

© 2011 Journal of Computing Press, NY, USA, ISSN 0320-1113

http://sites.google.com/site/journalofcomputing/
 JOURNAL OF COMPUTING, VOLUME 3, ISSUE 3, MARCH 2011, ISSN 0320-1113
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG
KeeChaing Chua, A flexible Quality of service Model
For Mobile Ad-Hoc Networks, IEEE, 2000
[3] HaraldTebbe, Andreas J. Kassler, Pedro M. Ruiz.
”QoS Aware Mesh Construction to Enhance Multi-
cast Routing in Mobile Ad Hoc Networks”. 19th In-
ternational Conference on Advanced Information
Networking and Applications (AINA'05),2005:102109
[4] CHEN Wei and ZHANG Yi "A Multiconstrained
Routing Algorithm based on Mobile Agent for MA-
NET Networks" 2009 International Joint Conference
on Artificial Intelligence. IEEE.
[5] Shekhar H M P and Ramanatha.K.S. “Mobile Agents
Aided Congestion Aware Multipath Routing in Mo-
bile Ad Hoc Networks”. The 9th IEEE Int'l Confe-
rence on Telecom, Zagreb, 2007:6572
[6] Cesar A. Mantilla, Marzo.J.L “QoS Routing in Mobile
Adhoc Networks using Agent Technology”. Proceed-
ings of MedHocNet 2004 (ISBN 9759884003) Bodrum,
Turkey. June 2004:3036.
[7] Manvi.S.S and Telsang.V “An Agent based approach
to QOS Routing in Mobile ADHOC Network”. 2004
International Conference on Signal Processing &
Communications (SPCOM):8690.
[8] A.K.Vatsa and Gaurav Kumar” A Novel Architecture
for QoS Management in MANET using Mobile
Agent”. (IJCNS) International Journal of Computer
and Network Security, Vol. 2, No. 5, May 2010.
[9] Bennet Yee. A sanctuary for mobile agents In Secure
Internet Programming, volume 1603 in LNCS, pages
261–274, New York, NY, USA, 1999. Springer-Verlag
Inc.
[10] ParamaBhaumik, SomprokashBanyopadhyay, Mobile
Agent Based Message Communication in Large Ad
hoc Networks through Co-operative Routing using
Inter- Agent Negotiation at Rendezvous Points.
[11] S.A.Hosseini-Seno, B.Pahlevanzadeh, T.C.Wan, R.
Budiarto, M.M.Kadhum, A DISTRIBUTED RE-
SOURCE-MANAGEMENT APPROACH IN MA-
NETS, Journal of Engineering Science and Technolo-
gy Vol. 4, No. 2 (2009) 142 – 153,2009.
[12] K. A. H. Amin, “resource efficient and scalable
routing using,” university of north texas, 2003.
[13] M. RajanBabu, G.SasiBhushanaRao” A Hybrid Relia-
ble Data Transmission Technique for Multicasting in
Mobile Ad hoc Networks” Vol. 10 Issue 8 Ver. 1.0
September 2010.
[14] Cesar A. Mantilla, Marzo.J.L “QoS Routing in Mobile
Adhoc Networks using AgentTechnolo-
gy.”Proceedings of MedHocNet 2004 (ISBN
9759884003) Bodrum, Turkey. June 2004:3036.
[15] Ashish Kumar Srivastava, AdityaGoel ”Secure Mo-
bile Agent based Information Gathering in Wireless
Network. (IJCSE) International Journal on Computer
Science and Engineering Vol. 02, No. 05, 2010, 1685-
1689.
[16] Bindhu.R. “Mobile Agent Based Routing Protocol
with Security for MANET”. INTERNATIONAL
JOURNAL OF APPLIED ENGINEERING RE-
© 2011 Journal of Computing Press, NY, USA, ISSN 0320-1113
http://sites.google.com/site/journalofcomputing/
80
SEARCH, DINDIGUL Volume 1, No1, 2010.
[17] Wong D., Paciorek N., Walsh T., DiCelie J., Young M.
and Peet B. (1997), ‘Concordia: An infrastructure for
collaborating mobile agents’, Rothermel K. and Po-
pescu-Zeletin R. (Eds.), Proceedings of 1st Interna-
tional Workshop on Mobile Agents (MA'97), LNCS,
Berlin, Germany, Vol. 1219, pp. 86-97.
[18] Venkatesan S. and Chellappan C. (2007), ‘Protecting
Free Roaming Mobile Agent against Multiple Col-
luded Truncation Attacks’, ACM Proceedings of In-
ternational Conference on Mobile Multimedia Com-
munication(MobiMedia’07), Greece, pp. 293-297.
[19] Venkatesan S. and Chellappan C. (2009), ‘Free Roam-
ing Mobile Agent (FRoMA) Protection against Mul-
tiple Attacks’, International Journal on Communica-
tion Networks and Distributed Systems, Vol. 3, No. 4,
pp. 362-383.
[20] Zhou J., Onieva J. and Lopez J. (2004), ‘Analysis of a
Free Roaming Agent Result-Truncation Defense
Scheme’, Proceedings of 2004 IEEE Conference on
Electronic Commerce, San Diego, USA, IEEE Com-
puter Society Press, pp. 221-226.
[21] Zhou J., Onieva J. and Lopez J. (2004), ‘Protecting
Free Roaming Agents against Result-Truncation At-
tack’, Proceedings of 60th IEEE Vehicular Technology
Conference, Los Angles, USA, pp. 3271-3274.
[22] Cheng J. and Wei V. (2002), ‘Defenses against the
truncation of computation results of free-roaming
agents’, Proceedings of 4th International Conference
on Information and Communications Security, Lec-
ture Notes in Computer Science, Vol. 2513, pp. 1-12.
[23] Xu D., Harn L., Narasimhan M. and Luo J. (2006), ‘An
Improved Free- Roaming Mobile Agent Security Pro-
tocol against Colluded Truncation Attacks’, Proceed-
ings of the 30th Annual international Computer
Software and Applications Confe-
rence(COMPSAC’06), Vol. 2, pp. 309-314.
[24] R. Braden, D. Clark, and S. Shenker, “Integrated Ser-
vices in the Internet Architecture – an Overview,”
IETF RFC1663, June 1994.
[25] 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.
[26] John B. Oladosu, Akinwale O. Alao, Matthew O.
Adigun, Justice O. Emuoyibofarhe, Design and Simu-
lation of a Quality of Service (QoS) Guaranteed Mod-
el for Mobile Ad Hoc Networks.
[27] S.S.Manvi and P.Venkataram, Mobile agent based
approach for QoS routing, The Institution of Engi-
neering and Technology 2007.
[28] K. Wu and J. Harms, “QoS Support in Mobile Ad Hoc
Networks,” Crossing Boundaries – an interdiscipli-
nary journal, vol.1, no. 1, pp. 92-104.
[29] R. Sivakumar, P. Sinha, and V. Bharghavan, “CE-
DAR: A Core-Extraction Distributed Ad Hoc Routing
Algorithm,” IEEE Journal on Selected Areas in Com-
munication, vol. 17, no.8, pp. 1454-1465, August 1999.
 JOURNAL OF COMPUTING, VOLUME 3, ISSUE 3, MARCH 2011, ISSN 0320-1113
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 81

[30] Heinzelman.W.R, Chandrakasan.A, et al., “EnergyEf-

ficient Communication Protocol for Wireless Micro-
sensor Networks”, in Proc. of the 33rd Annual Ha-
waii International Conference on System Sciences,
Jan. 2005, pp. 30053014.

Author Biographies

Puneet Kumar is working as Lec-

turer in the Department of Com-
puter science and Engineering at
Sir Chhotu Ram Institute of Engi-
neering and Technology, CCS Uni-
versity Meerut (U.P.) and he is
pursuing M.Tech Computer Engi-
neering from Shobhit University
Meerut. He obtained his B-Tech
(CSE) from Uttar Pradesh Techini-
calUniversity, Lucknow (U.P.). He
has worked as SME in IT industry. He has been in teach-
ing for the past three years. He has been member of sev-
eral academic and administrative bodies. He has attended
several seminars, workshops and conferences at various
levels. His area of research includes MANET (Mobile Ad-
Hoc network) and Congestion Control.

A.K.Vatsa is working as Assis-

tant 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, Jaun-
pur (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 administra-
tive bodies. During his teaching he has coordinated sev-
eral 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 internation-
al conferences and journals. His area of research includes
MANET (Mobile Ad-Hoc network), Congestion Control
and VOIP-SIP(Voice over IP).

© 2011 Journal of Computing Press, NY, USA, ISSN 0320-1113

http://sites.google.com/site/journalofcomputing/