Abstract

Multilevel short-distance clustering communication is an important scheme to reduce lost data packets over the path to the sink, particularly when nodes are deployed in a dense WSN (wireless sensor network). Our proposed protocol solves the problems of single hop paths in the TDTCGE (two-dimensional technique based on center of gravity and energy) method, which addresses only single-hop problems and does not minimize distances between nodes by using multi-hop nodes with multilevel clustering grids to avoid dropped packets and to guarantee reliable paths without failures. In multilevel clustering grids, transmitted data are aggregated from lower-level grids to upper-level grids. In this paper, the proposed protocol obtains the optimal path for data transmission between cluster heads and the sink for heterogeneous WSNs. The cluster head nodes play an important role in forwarding data originating from other normal nodes that aggregate data to upper clusterheads. This routing approach is more efficient than other routing approaches, and it provides a reliable protocol for avoidance of data loss. In addition, the proposed protocol produces sleep and wakeup signals to the nodes and cluster heads via an MD (mediation device), thereby reducing energy consumption. Simulation results demonstrate the efficiency of the proposed method in terms of fewer dropped packets and high energy efficiency. The network environment overcomes the drawbacks of failure paths and provides reliable transmission to the sink.

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.