Project on Continuous Neighbor Discovery in Asynchronous Sensor Networks.

By, Under The Guidance Of Prof. Mr. Sujit Ahirrao.

-Chaudhari Komal. - Dhepe Surekha . -Raundal Nimila . -Salunkhe Varsha.

Abstract
In most sensor networks the nodes are static. Node connectivity is subject to changes of disruptions in wireless communication, transmission power changes, or loss of synchronization between neighboring nodes. Hence after a sensor is aware of its immediate neighbors, it must continuously maintain its view, a process we call continuous neighbor discovery. work distinguish between neighbor discovery during sensor network initialization and continuous neighbor discovery.

System Requirement
HARDWARE REQUIREMENTS:
System Hard Disk Floppy Drive Monitor Mouse : : : : : : Pentium IV 2.4 GHz. 40 GB. 1.44 Mb. 15 VGA Color. Logitech. 512 MB.

Ram

SOFTWARE REQUIREMENTS: Operating system : Windows XP Professional. Coding Language : C#.NET

Introduction
A sensor network may contain a huge number of simple sensor nodes that are deployed at some inspected site. In large areas, such a network usually has a mesh structure. The nodes are placed randomly over the area of interest and their first step is to detect their immediate neighbors . Direct wireless communication . To establish routes to the gateway. In networks -continuously heavy traffic, the sensors need not invoke any special neighbor discovery protocol during normal operation. for sensor networks with low and irregular traffic, a special neighbor discovery scheme should be used.

Modules
Client Server Detecting all hidden links Inside a segment Detecting all hidden links Outside a segment Neighbor Discovery Model

System Flow
SERVER ROUT ER 1 ROUTER 2 CLIENT IP Ad dress IP Address IP Addr ess Browse a received path

Br owse a File

Select Node

Select No de

Connecting..

Via Hidden L ink

yes yes

Flle Receive

Via Hidden Link no no

Connecting..

Connecting.. F Ile Transfer Detect Hidden L ink Inside a Segment

Detect Hidden L ink Outsid e a Segment

Service Time

End

CL IENT

SERVER

ROUTER 1

ROUTER 2

Brows e

IP Ad dress

IP Address

IP Ad dress

Sel ect a Rec eiving Path

Brows e a File

Select a Node

Se lect a Node

Conn ectin g..

Via Hidden Link

Yes Via Hidden Link Yes

FILE RECEIVE

NO

No

Connecting ..

Co nnecting..

F ILE TRANSFER

Detect Hid den Link Inside a Segment

Detect Hidden Link Ou tside a Seg ment

SERVICE TIME

Existing System
Disadvantages:
In networks with continuously heavy traffic. Long-term process. Greater expense of energy than required in our scheme.

Proposed System
Advantages:
Detect their immediate neighbors. Message does not collide with another. Every node discovers its hidden neighbors independently.

Algorithm Analysis
AN EFFICIENT CONTINUOUS NEIGHBOR DISCOVERY ALGORITHM

Algorithm 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 effort of the whole segment.

Conclusion

References
S. Vasudevan, J. Kurose, and D. Towsley, .On neighbor discovery in wireless networks with directional antennas. R. Madan and S. Lall, .An energy-optimal algorithm for neighbor discovery in wireless sensor networks. A. Keshavarzian and E. Uysal-Biyikoglu, .Energy-efficient link assessment in wireless sensor networks. S. A. Borbash, .Design considerations in wireless sensor networks.