Continuous

Neighbour
Discovery in
Asynchronous
Seminar By
Guided By
Sensor Network.
www.Seminarstopics.com

OVERVIEW
OVERVIEW

Introduction
Introduction
System
Existing
System
Existing
of Existing System
Disadvantgages
of Existing System
Disadvantgages
System
Proposed
System
Proposed
of Proposed System
Advantages
of Proposed System
Advantages
with hidden nodes and links
Segments
with hidden nodes and links
Segments
of Neighbours
Discovery
of Neighbours
Discovery
Hidden link participate Inside a segment

Introduction...
In most sensor networks the nodes are static.
Nevertheless, node connectivity is subject to changes
because of disruptions in wireless communication,
transmission power changes, or loss of synchronization
between neighboring nodes. Hence, even after a sensor
is aware of its immediate neighbors, it must continuously
maintain its view, a process we call continuous neighbor
discovery. In this work we distinguish between neighbor
discovery during sensor network initialization and
continuous neighbor discovery. We focus on the latter and
view it as a joint task of all the nodes in every connected
segment. Each sensor employs a simple protocol in a
coordinate effort to reduce power consumption without
increasing the time required to detect hidden sensors.

EXISTING
SYSTEM
Initial neighbor discovery is usually
performed when the sensor has no
clue about the structure of its
immediate surroundings. In such a
case, the sensor cannot communicate
with the gateway and is therefore
very limited in performing its tasks.

DISADVANTAGES OF EXISTING
DISADVANTAGES OF EXISTING
SYSTEM
Networks withSYSTEM
continuously heavy traffic.
Loss of local synchronization due to
accumulated
clock drifts.
Long-term process and increase in
transmission
power of some nodes , in responce to
certain events.
Greater expense of energy than required in
our
scheme.

EXISTING SYSTEM
ARCHITECTURE

PROPOSED
SYSTEM
We distinguish between

neighbor
discovery during sensor network
initialization and continuous neighbor
discovery. We focus on the latter and
view it as a joint task of all the nodes
in every connected segment. Each
sensor employs a simple protocol in a
coordinate effort to reduce power
consumption without increasing the
time required to detect hidden
sensors.

ADVANTAGES OF PROPOSED
SYSTEM
The nodes detect their immediate
neighbors.
Message does not collide with each
other so congestion is under control.
Every node discovers its hidden
neighbors independently.

ments with hidden nodes and

Discovery of Neighbours
The nodes can learn about their hidden
wireless link using the following simple
scheme, which uses two message types:
SYNC messages for synchronization
between all segment nodes, transmitted
over Known wireless links.
HELLO messages for detecting new
neighbours.

Discovery of Neighbours
In this section we present an method
for
assigning
HELLO
message
frequency to the nodes of the same
segment. This method is based on
detecting all hidden links inside a
segment. Namely, if a hidden node is
discovered by one of its segment
neighbors, it is discovered by all its
other segment neighbors after a very
short time. Hence, the discovery of a
new neighbor is viewed as a joint

Scheme 1(Detecting all hidden links

inside a segment)
Whenever a new node is discovered by one of the
segment nodes it can be detect the all hidden links
inside a segment. For all segment members, the
discovering node issues a special SYNC message
asking them to periodically broadcast a group of
HELLO messages. The SYNC message is passes over
the already known wireless links of the segment. So,
every segment
node has to be guaranteed to be received.

Scheme 2(Detecting a hidden links

outside a segment)
In this scheme, the same segment is used to
minimize the possibility of repeating collisions
between the HELLO messages of nodes.
Practically, another scheme might be used,
where segment nodes coordinate their wake-up
periods for prevents collisions. However, finding
an efficient time division is equivalent to the wellknown node colouring problem, which is Node u
wakes up randomly, every T(u) seconds.

References...
1. Reuven Cohen and Boris Kapchits,
Continuous Neighbor Discovery in Asynchronous Sensor
Networks,
IEEE/ACM Transactions on Networking, Vol. 19,
No.1, February 2011
2. International Journal of Distributed and Parallel
Systems (IJDPS) Vol.3, No.4, July 2012
Self
Configurable Re-link Establishment using Continuous
Neighbour Discovery in Asynchronous Wireless Sensor
Networks M.Sreedevi NADILLA KHADAR VALLI Dr. R.
Seshadri
3.
INTERNATIONAL
JOURNAL
OF
COMPUTER
APPLICATION ISSUE2, VOLUME 1 (FEBRUARY 2012)
ISSN: 2250-1797
An www.Seminarstopics.com
Efficient Continuous Neighbour Discovery in
Asynchronous Sensor Networks Siva Ramakrishna,

Thankyou...

Questions...