Abstract
Problem statement: Wireless Sensor Networks (WSNs) comprise of small nodes with sensing, computation and wireless communication capabilities. Nodes in a sensor network are severely constrained by energy and computing power. Continuous working of sensor nodes leads to quick depletion of battery power and reduces the overall lifetime. To prolong the lifetime of the sensor nodes, efficient routing protocol that could also optimize the energy consumption while maintaining coverage and connectivity is required. Approach: The Coverage Maintenance Protocol (CMP) uses Coverage Eligibility Rule (CER) to find the eligibility of sensor nodes to sleep. After turning off the eligible nodes found out by CER, the network coverage degree was maintained by the remaining active nodes. If these active nodes continuously work, they consumemore energy and decreasethe lifetime. The CMP protocol helps to balance the energy consumed by active nodes,scheduling the work state of active nodes into sleeping, active and listening states. Each node in the sleeping state will not consume energy and remains idle for delay time Td. Results: This maintained the network coverage and increased the lifetime of sensor nodes. Conclusion: The simulation results indicated that the proposed Coverage Maintenance Protocol (CMP) can significantly conserve energy increase the lifetime of sensor networks while maintaining the given coverage.
Highlights
Problem is to minimize the number of nodes that remain active, while still achieving acceptable quality
This study addresses the above problem and describes Coverage Eligibility Rule (CER) based Coverage Maintenance Protocol (CMP) for energy conservation in Wireless Sensor Networks (WSNs)
One of the disadvantages of this protocol is that routing mechanism for a sensor application, all routing intermediate nodes can lead to inconsistent routes if the protocols have to be classified according to a well- source sequence number is very old and the defined taxonomy.The protocols has been classified intermediate nodes have a higher but not the latest according to network structure and protocol operation (Notani, 2008) Routing in WSNs is generally divided in two ways: according to the network structure as flatbased, hierarchy-basedand location-based routingand according to the protocol operation as multipath-based, query-basedand negotiation-based, Quality Of Service (QoS)-based, or coherent-based
Summary
Problem is to minimize the number of nodes that remain active, while still achieving acceptable quality. First number of nodes that must be removed in order to Coverage Eligibility Rule (CER) is presented to find the partition the graph into more than one connected eligibility of sensor nodes to sleep. The active nodes of a sensor network eligible nodes found out by CER, the network coverage define a graph with links between nodes that can degree is maintained by the remaining active nodes. If this graph is K-connected, for any these active nodes continuously work, they consume possible K-1 active nodes which fail the sensor network more energy and decrease the lifetime. Second the will remain connected (Khelifa et al, 2009) scheduling protocol CMP is presented to balances the Connectivity affects the robustness and achievable energy consumed by neighbouring nodes thereby throughput of communication in a sensor network. Second the will remain connected (Khelifa et al, 2009) scheduling protocol CMP is presented to balances the Connectivity affects the robustness and achievable energy consumed by neighbouring nodes thereby throughput of communication in a sensor network. improves life time of network
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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 callDisclaimer: 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.
