Abstract
After surveying through various algorithms regarding cut or disconnection in a network detection, an algorithm has been reported in this paper for on cut detection in Wireless Sensor Networks (WSN) which is energy efficient and simplistic in nature. The algorithm allows sending data to one-hop nodes only which required less amount of energy.This algorithm provides guaranteed cut detection in most optimal and efficient time which is equivalently proportional to data forwarding time. Also, it ensures that the whole data/packet is actually sent to the destination node. Here, all the packets are eventually sent to the source node which is a master processor or computer with unlimited resources and memory capability and processing potential and directly connected to the power supply. At source node the necessary processing is done to decode the packet and extract the desired information. The node arrangement is shaped as a structure of tree. A particular segment/snapshot will be demonstrated for proposed cut detection technique. Tree structure takes the help of parent sibling, uncle, leaf nodes in order to update information regarding cut detection. Keywords: Linear cut; algorithm; Sentinel nodes .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.