Abstract

A WSN computer network using sensors is used in important application like environmental monitoring warning dangers to human lives. WSN‟s may have several problems related to topology construction, maintenance, and connectivity. The deployed Sensor devices may have critical resource constraints in terms of energy consumption. Also the algorithms need to be memory-efficient. Algorithmic issues arise in sensor deployment and coverage, routing, and fusion. Applications which rely on timely sensor updates on environments may have unpredictable results due to sensor inefficiencies. WSN applications may be in operation for months without wired power supplies, thus requiring to meet the delay requirements at minimum energy cost. Though various algorithms and protocols have been proposed for deploying sensors This paper proposes a new Algorithm CN Algorithm for WSNs and discusses WSNs. Future work includes the extension of the algorithm to detect the coverage boundary of the network or area covered by the sensor nodes inside a network.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.