08-08-2012, 09:46 AM
Mobile Agent Based Routing Protocol with Security for MANET
[attachment=30470]
ABSTRACT
A mobile ad hoc network (MANET) consists of a set of mobile hosts. The mobile hosts are
capable of communicating with each other without the assistance of base stations. The nodes
of a MANET intercommunicate through singlehop
and multihop
paths in a peertopeer
form. Intermediate nodes between two pairs of communication nodes act as routers. Mobile
agent is a program segment which is selfcontrolling.
They navigate from node to node not
only transmitting data but also doing computation. They are an effective paradigm for
distributed applications, and especially attractive in a dynamic network environment. A
routing algorithm with multiple constraints is proposed based on mobile agents. It uses
mobile agents to collect information of all mobile nodes. The algorithm has stronger routing
stability and lower probability of link failure because it selects links with large link expiration
time. Multipath strategy reduces the time consumption of rerouting. Also, the source node
can utilize the best path to perform the data transmission to meet two QoS requirements
(remaining battery and bandwidth) in order to extend the survival time of network. The
mobile agent based routing algorithm is more effective and robust than AODV. The mobile
agent multiple constraint based routing scheme is enhanced with security and access control
features.
Introduction
A mobile ad hoc network (MANET) consists of a set of mobile hosts. The mobile hosts are
capable of communicating with each other without the assistance of base stations. The nodes
of a MANET intercommunicate through singlehop
and multihop
paths in a peertopeer
form. Intermediate nodes between two pairs of communication nodes act as routers [9].
Quality of service (QoS) requirement, such as those for multimedia applications with
bandwidth and energy constraint, has been intensively studied recently as an issue for
MANETs. Node Mobility and wireless radio properties make it more difficult to provide QoS
in mobile ad hoc networks than in wired networks. The QoS guarantee is a new challenge for
MANETs. Traditional routing algorithms for MANETs, such as AODV and DSR, cannot
meet this requirement.
Related Work
Mobile Adhoc
Networks
A mobile ad hoc network (MANET) is a collection of mobile devices forming a temporary
network in the absence of fixed infrastructure. Each node has a wireless interface and
communicates using it. Because nodes may move in to and out of the radio range of other
nodes, routing information may change frequently. For example, in Figure 1, node A has two
paths to node E: ABDE
and ACDE,
however, these two paths would become
unavailable should node E move out of range of node D. If node E subsequently moves close
enough to node A, then node A might be able to communicate with E directly. Alternatively,
node E might enter the communication range of node C, so ACE
would become a valid path.
Such routes must be discovered quickly and with low overhead.
MANET Routing Protocols
Routing in an MANET typically consists of two phases: route discovery and route
maintenance. Route Discovery is the mechanism by which a node S intending to send a
packet to destination D obtains a route to D. Route Maintenance is the mechanism by which
node S is able to detect, while using a route to D, that one or more links along the route have
failed.
Routing Using Mobile Agents
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. When a route is requested, an agent is sent
to discover routes to the destination. These agents analyze the routing tables on the hosts they
arrive at and either return a discovered route to the sender or move on to another machine if
no route is found. Unfortunately, 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 application specific routing algorithms concurrently in use.
Bandwidth and Energy
Bandwidth Calculation
The MAC sublayer
in our model is implemented by using the CDMAoverTDMA
channel
model. The CDMA overTDMA
channel model is the same model as defined. The free slots
recorded at each node may be different. We define the set of the common free slots between
two adjacent nodes to be the link bandwidth [1]. The path bandwidth between two nodes does
not need to be adjacent. 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. We can observe that
link_BW(A,B)=free_slot(A )Ç free_slot(B). free_slot(X) 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 indication of whether there is enough bandwidth on a given
route between a sourcedestination
pair.
Conclusion
MANETbased
applications require high stability and long survival time of the networks. To
address these issues, we propose a multipath
unicast routing algorithm with multiple
constraints based on mobile agents. It uses mobile agents to collect information of all mobile
nodes, and reduces the network delay and the overhead of control messages for routing. Our
algorithm has stronger routing stability and lower probability of link failure because it selects
links with large link expiration time (LET) during route creating phase. Multipath
strategy of
our algorithm reduces the time consumption of rerouting. Also, the source node can utilize
the best path to perform the data transmission to meet QoS requirements in order to extend
the survival time of network. The system ensures security for the mobile agents based QoS
routing. The system improves the network resource utilization. Reliability is assured by the
routing protocol. Multipath route discovery mechanism handles failures in route.
[attachment=30470]
ABSTRACT
A mobile ad hoc network (MANET) consists of a set of mobile hosts. The mobile hosts are
capable of communicating with each other without the assistance of base stations. The nodes
of a MANET intercommunicate through singlehop
and multihop
paths in a peertopeer
form. Intermediate nodes between two pairs of communication nodes act as routers. Mobile
agent is a program segment which is selfcontrolling.
They navigate from node to node not
only transmitting data but also doing computation. They are an effective paradigm for
distributed applications, and especially attractive in a dynamic network environment. A
routing algorithm with multiple constraints is proposed based on mobile agents. It uses
mobile agents to collect information of all mobile nodes. The algorithm has stronger routing
stability and lower probability of link failure because it selects links with large link expiration
time. Multipath strategy reduces the time consumption of rerouting. Also, the source node
can utilize the best path to perform the data transmission to meet two QoS requirements
(remaining battery and bandwidth) in order to extend the survival time of network. The
mobile agent based routing algorithm is more effective and robust than AODV. The mobile
agent multiple constraint based routing scheme is enhanced with security and access control
features.
Introduction
A mobile ad hoc network (MANET) consists of a set of mobile hosts. The mobile hosts are
capable of communicating with each other without the assistance of base stations. The nodes
of a MANET intercommunicate through singlehop
and multihop
paths in a peertopeer
form. Intermediate nodes between two pairs of communication nodes act as routers [9].
Quality of service (QoS) requirement, such as those for multimedia applications with
bandwidth and energy constraint, has been intensively studied recently as an issue for
MANETs. Node Mobility and wireless radio properties make it more difficult to provide QoS
in mobile ad hoc networks than in wired networks. The QoS guarantee is a new challenge for
MANETs. Traditional routing algorithms for MANETs, such as AODV and DSR, cannot
meet this requirement.
Related Work
Mobile Adhoc
Networks
A mobile ad hoc network (MANET) is a collection of mobile devices forming a temporary
network in the absence of fixed infrastructure. Each node has a wireless interface and
communicates using it. Because nodes may move in to and out of the radio range of other
nodes, routing information may change frequently. For example, in Figure 1, node A has two
paths to node E: ABDE
and ACDE,
however, these two paths would become
unavailable should node E move out of range of node D. If node E subsequently moves close
enough to node A, then node A might be able to communicate with E directly. Alternatively,
node E might enter the communication range of node C, so ACE
would become a valid path.
Such routes must be discovered quickly and with low overhead.
MANET Routing Protocols
Routing in an MANET typically consists of two phases: route discovery and route
maintenance. Route Discovery is the mechanism by which a node S intending to send a
packet to destination D obtains a route to D. Route Maintenance is the mechanism by which
node S is able to detect, while using a route to D, that one or more links along the route have
failed.
Routing Using Mobile Agents
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. When a route is requested, an agent is sent
to discover routes to the destination. These agents analyze the routing tables on the hosts they
arrive at and either return a discovered route to the sender or move on to another machine if
no route is found. Unfortunately, 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 application specific routing algorithms concurrently in use.
Bandwidth and Energy
Bandwidth Calculation
The MAC sublayer
in our model is implemented by using the CDMAoverTDMA
channel
model. The CDMA overTDMA
channel model is the same model as defined. The free slots
recorded at each node may be different. We define the set of the common free slots between
two adjacent nodes to be the link bandwidth [1]. The path bandwidth between two nodes does
not need to be adjacent. 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. We can observe that
link_BW(A,B)=free_slot(A )Ç free_slot(B). free_slot(X) 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 indication of whether there is enough bandwidth on a given
route between a sourcedestination
pair.
Conclusion
MANETbased
applications require high stability and long survival time of the networks. To
address these issues, we propose a multipath
unicast routing algorithm with multiple
constraints based on mobile agents. It uses mobile agents to collect information of all mobile
nodes, and reduces the network delay and the overhead of control messages for routing. Our
algorithm has stronger routing stability and lower probability of link failure because it selects
links with large link expiration time (LET) during route creating phase. Multipath
strategy of
our algorithm reduces the time consumption of rerouting. Also, the source node can utilize
the best path to perform the data transmission to meet QoS requirements in order to extend
the survival time of network. The system ensures security for the mobile agents based QoS
routing. The system improves the network resource utilization. Reliability is assured by the
routing protocol. Multipath route discovery mechanism handles failures in route.