9

CHAPTER 2

LITERATURE REVIEW

2.1EXISTING SYSTEM

By R. Oliveira, he use the periodic messages (Hello messages) to detect

neighbor nodes. After receiving the first Hello message from one of its neighbors, a node
starts the link sensing task by setting up a sensing timer. Each time a new Hello message is
received from the same neighbor, the sensing timer is restarted and the link duration is
prolonged. If the sensing timer expires, it indicates a long time interval without receiving an
Hello message and, consequently, the link is considered broken.  Consider a MANET under
the Random Waypoint mobility model. We investigate the relationship between the
transmission frequency of the Hello messages and the sensing timer expiration value with the
network node's mobility. We formally deduce the probability of link existence after β periods
of transmission of the Hello message.

C. Gomez ,  perform tests in real MANET environments using the ad-hoc on-
demand distance vector (AODV) routing protocol. He study the influence of the protocol, the
implementation and a set of AODV link maintenance mechanisms parameter values on
network performance, suggesting that usage of different settings from those proposed by
default increase reactivity after topology changes with small impact on bandwidth and power
consumption in a set of scenarios.

Ian D. Chakeres , proposes an method for HELLO messaging is implemented to

save energy and increase throughput. Such a way that, instead of constantly sending the hello
packets to the all the nodes for a specific period of time. Otherwise to send the hello packets
 10

only to the nodes which are in active state. He use OSPF protocol to find shortest path
between the nodes. This method conserves the energy, eliminating the hello packets to the
broken links.

C.-M. Chao, presents new MAC protocols for power saving in a single hop
MANET. The essence of these protocols is a quorum-based sleep/wake-up mechanism, which
conserves energy by allowing the host to sleep for more than one beacon interval, if few
transmissions are involved.

2.2 PROPOSED SYSTEM

We consider MANET operating within random network topology and

random nodes. Node mobility follows a model, there is several mobility models used in the
evaluation of MANET protocols. The random waypoint model is one the most commonly
used mobility models for simulations of MANETs. In this model, each node selects a random
destination, uniformly distributed within the two-dimensional space . In conventional hello
messaging scheme before a packet is sent, status of neighbor nodes should be recognized first
so as to recognize if there is a link failure with one of its neighboring nodes. If the node moves
to an area where no active nodes are in its neighborhood, then nodes keeps broadcasting hello
messages and due to this unnecessarily energy consumption takes place. For this problem
hello messages should be suppressed first on the basis of determining value of hello interval.
The maximum interval of time between the transmissions of hello messages is
HELLO_INTERVAL.Now in the dynamic hello messaging scheme the time for link failure
detection (TFDD) is given as:

Tfdd=(ALLOWED_HELLO_LOSS-.5)*(HELLO_INTERVAL)
|
 11

Main objective of our research is reduction of energy consumption and

network overhead. We can do this only when hello interval is made proportional to the event
interval of a node. If the hello interval is set without considering the event interval of a node,
then the risk of sending packet through an unavailable link increases (Pfdd). Let us consider a
sender and its neighboring node. An eventon the neighboring node occurs when the sender
forwards a packet to the neighboring node. If the neighboring node moves out of the senders
transmission range, there are two possible courses of action: (1) the sender is requested to
forward; or (2) the sender is not requested to forward.Here, only case (1) can incur a link
error. In case (2), the link availability does not need to be updated. To prevent a link error in
the former case, the sender must know the availabilityof its link to the next hop node prior to
forwarding a packet. In other words, the link connectivity information from the nexthop node
obtained by the last received Hello packet shouldbe valid or refreshed before a packet is
forwarded. Setting the HELLO INTERVAL without considering the event interval of a node
can increase the risk of sending a packet through an unavailable link.The goal of this paper is
to find the expiration period corresponding to a given event interval so that unnecessary Hello
messages are suppressed.Advantages of our proposed system over existing system are
Reduced Network Overhead and increased throughput.