Published on

  • Be the first to comment

  • Be the first to like this

No Downloads
Total views
On SlideShare
From Embeds
Number of Embeds
Embeds 0
No embeds

No notes for slide


  1. 1. Seminar By – Guided ByRushikesh B. ShreshthaKunal P. Raut Prof R M GoudarDevendra M. BajajAishwarya V. Agrawal Group ID - 16
  2. 2. Existing System IntroductionProposed System Disadvantgages of Existing SystemAdvantages of Proposed SystemDiscovery of Neighbours Segments with hidden nodes and linksHidden link participate Inside a segmentHidden link participate outside a segment References
  3. 3. Introduction...In most sensor networks the nodes are static. Nevertheless, nodeconnectivity is subject to changes because of disruptions in wirelesscommunication, transmission power changes, or loss of synchronizationbetween neighboring nodes. Hence, even after a sensor is aware of itsimmediate neighbors, it must continuously maintain its view, a processwe call continuous neighbor discovery. In this work we distinguishbetween neighbor discovery during sensor network initialization andcontinuous neighbor discovery. We focus on the latter and view it as ajoint task of all the nodes in every connected segment. Each sensoremploys a simple protocol in a coordinate effort to reduce powerconsumption without increasing the time required to detect hiddensensors.
  4. 4.  Networks with 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.
  6. 6. PROPOSED SYSTEMWe distinguish between neighbor discoveryduring sensor network initialization andcontinuous neighbor discovery. We focus on thelatter and view it as a joint task of all the nodesin every connected segment. Each sensoremploys a simple protocol in a coordinate effortto reduce power consumption withoutincreasing the time required to detect hiddensensors.
  7. 7. 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.
  8. 8. The nodes can learn about their hidden wirelesslink using the following simple scheme, whichuses two message types: SYNC messages for synchronization between allsegment nodes, transmitted over Known wirelesslinks. HELLO messages for detecting new neighbours.
  9. 9. In this section we present an method forassigning HELLO message frequency to thenodes of the same segment. This method isbased on detecting all hidden links inside asegment. Namely, if a hidden node is discoveredby one of its segment neighbors, it is discoveredby all its other segment neighbors after a veryshort time. Hence, the discovery of a newneighbor is viewed as a joint effort of the wholesegment.
  10. 10. Whenever a new node is discovered by one of the segment nodesit can be detect the all hidden links inside a segment. For allsegment members, the discovering node issues a special SYNCmessage asking them to periodically broadcast a group of HELLOmessages. The SYNC message is passes over the already knownwireless links of the segment. So, every segmentnode has to be guaranteed to be received.
  11. 11. In this scheme, the same segment is used to minimize thepossibility of repeating collisions between the HELLOmessages of nodes. Practically, another scheme might beused, where segment nodes coordinate their wake-up periodsfor prevents collisions. However, finding an efficient timedivision is equivalent to the well-known node colouringproblem, which is Node u wakes up randomly, every T(u)seconds.
  12. 12. 1. Reuven Cohen and Boris Kapchits,“Continuous Neighbor Discovery in Asynchronous Sensor Networks”,IEEE/ACM Transactions on Networking, Vol. 19, No.1, February 20112. International Journal of Distributed and Parallel Systems (IJDPS)Vol.3, No.4, July 2012 Self Configurable Re-link Establishment usingContinuous Neighbour Discovery in Asynchronous Wireless SensorNetworks M.Sreedevi NADILLA KHADAR VALLI Dr. R. Seshadri3. INTERNATIONAL JOURNAL OF COMPUTER APPLICATION ISSUE2,VOLUME 1 (FEBRUARY 2012) ISSN: 2250-1797An Efficient Continuous Neighbour Discovery in Asynchronous SensorNetworks Siva Ramakrishna, B. Ganga Bhavani Associate professor BVCEngineering college Department of CSE,BVCEC,
  13. 13. Thankyou...
  14. 14. Questions...