LITERATURE SURVEY Predictive preemptive based local route

repair strategy in Swarm Intelligence

1. LITERATURE SURVEY
Many algorithms have been proposed for mobile ad-hoc networks. Before introducing the pre-
emptive algorithm, a study of other different algorithms in this field would be helpful for
understanding the advantages of predictive pre-emptive algorithm over other algorithms. Here is
a brief description of different papers presented in this field.

[1] Adrian J Cahill et. All (2002) Link Cache extensions for predictive routing
and repair in ad-hoc wireless networks - 4th International workshop on Mobile
and Wireless Communications Network.
In this paper the authors present that in ad hoc networks that employ source-based on-
demand routing protocols, network nodes can use information contained in packet headers to
populate a link cache. Given sufficient route requests and network traffic, a link cache can
provide a good view of the past spatial network topology. This view can be successfully applied
to making future routing decisions, provided that links are allowed to expire through a timeout
mechanism, so that the cache stays fresh. They make an assumption that each node has the
ability to determine its location, velocity, and bearing. They propose a link timeout mechanism
that is based on mobility prediction, and introduce link cache extensions that incorporate
temporal information regarding the future state of the network topology. By utilizing spatial and
temporal information, better and more efficient routing decisions can be made. Furthermore,
local repairs can be initiated preemptively in anticipation of a link break.

[2] Crisostomo, S et. All (2004) Improving AODV with preemptive local
route repair – International workshop on Wireless Ad-hoc networks.
This paper proposes an extension to the AODV protocol, denoted preemptive local route
repair (PLRR), that aims to avoid route failures by preemptively local repairing routes when a
link break is about to occur. This protocol extension resorts to AODV layer 3 connectivity
information with new mobility extensions. The authors propose to enhance node's information
concerning link stability to its neighbors resorting to HELLO messages. These messages are
appended with a mobility extension containing the node's position, motion vector and an
associated timestamp. This mobility information will be used to predict the instant a link
between two neighbors will break. Their proposal does not need to take into account the sender
and destination location information, as other location-aided routing protocols. In this proposal,
location and mobility information needs to be propagated only between neighbors. This proposal
aims at improving the AODV quality of service capabilities by minimizing route failures.

Dept. of CSE, R.V.C.E Sept-Dec-2010

 LITERATURE SURVEY Predictive preemptive based local route
repair strategy in Swarm Intelligence

[3] Roth, M et. All (2003) Termite: ad-hoc networking with stigmergy –
Global Telecommunications Conference, GLOBECOM ’03, IEEE
A biologically inspired algorithm is presented to route messages in mobile wireless ad-
hoc networks. The principles of swarm intelligence are used to define a probabilistic algorithm
for which routing through paths of maximum throughput is an emergent property. This adaptive
algorithm, dubbed termite, uses stigmergy to reduce the amount of control traffic needed to
maintain a high data goodput. Stigmergy is a process by which information is indirectly
communicated between individuals through their environment The termite environment is the
contents of all routing tables. The movement of packets is influenced at each node, and
communicating nodes observe this influence to update their own tables. Strong routing
robustness is achieved through the use of multiple paths; each packet is routed randomly and
independently.

[4] Soflane Boukli Hacene et. All (2006) Predictive preemptive Ad hoc on-
demand distance vector routing – Malaysian Journal of Computer Science,
Vol. 19(2) pp. 189-195
The authors present that routing protocols for ad hoc networks typically include
mechanisms for route discovery and route maintenance. The performance of these protocols
depends on the route maintenance mechanism they use. The movement of network nodes can
cause routes to become unusable. A node on a route from a source to a destination may become
unreachable from its predecessor node because of node movement. They propose a predictive
preemptive approach to route maintenance. Route maintenance is initiated when a link break is
expected rather than waiting for the break to happen. To evaluate the approach, they have added
it to the AODV routing protocol, and evaluated its impact on performance using detailed
simulations. It is proved that it can reduce communication overhead, decrease the number of
breaks in active links, reduce end-to-end packet delays, and improve packet delivery ratio.

[5] Sharvani,G.S et. All (2009) Different Types of Swarm Intelligence

Algorithm for routing – International Conference on Advances in Recent
Technologies in Communication and Computing, 2009. ARTCom ‘09
Swarm intelligence (SI) is emerged with collective intelligence of groups of simple
agents. SI offers an alternative way of designing intelligent system, in which autonomy,
emergence and distributed functioning replaces control, preprogramming and centralization
systems. This approach emphasizes on distributed, flexibility, robustness and direct or indirect
communication among relatively simple agents. A new class of algorithms, inspired by swarm
intelligence, is currently being developed that can solve numerous problems of modern
communications networks. These algorithms rely on the interaction of a multitude of
simultaneously interacting agents. They are Ant Based Control algorithm, Antnet algorithm, Ant

Dept. of CSE, R.V.C.E Sept-Dec-2010

 LITERATURE SURVEY Predictive preemptive based local route
repair strategy in Swarm Intelligence

Colony Based Routing Algorithm, Mobile Ant Based Routing, Termite. They differ based on the
applications used. A survey of such algorithms is presented here.

[6] Chandran, K et. All (2002) A feedback based scheme for improving
TCP performance in ad-hoc wireless networks
Ad-hoc networks are completely wireless networks of mobile hosts, in which the
topology rapidly changes due to the movement of mobile hosts. This frequent topology may lead
to sudden packet losses and delays. Transport protocols like TCP have been built mainly for
reliable, fixed networks. Hence, when used in ad-hoc networks, TCPmisinterprets this loss as
congestion and invokes congestion control. This leads to unnecessary retransmissions and loss of
throughput. To overcome this problem, a feedback scheme is proposed, so that the source can
distinguish between route failure and network congestion. When a route is disrupted, the source
is sent a route failure notification (RFN) packet, allowing it to freeze its timers and stop sending
packets. When the route is re-established, the source is informed through a route re-
establishment notification (RRN) packet, upon which it resumes by unfreezing timers and
continuing packet transmissions. The simulated performance of TCP on ad-hoc networks with
and without feedback is compared and reported. It is observed that in the event of route failures,
as the route re-establishment time increases, the use of feedback provides significant gains in
throughput as well as savings in unnecessary packet transmissions. Several further enhancements
and directions for future work are also sketched.

Dept. of CSE, R.V.C.E Sept-Dec-2010