Abstract

In this paper, we propose a SWIPT-based distributed node sleep scheduling method combining with clustering technology. The information transmission layer adopts a distributed topology structure. Active nodes are divided into cluster head nodes and cluster member nodes. The cluster head node acts as a relay of cluster member nodes, which can reduce the single-hop communication distance and greatly reduce the energy consumption of information transmission. The energy-carrying communication process is divided into three time slots: the first time slot, the sensor node collects energy, according to the residual energy of the node, the energy collected in the first time slot, and the requirements of network connectivity, the sleep scheduling optimization algorithm will divide the nodes into sleeping nodes and active nodes, and the active nodes are clustered according to the relative position of the information sending rate of the node; in the second time slot, the cluster head node receives the information sent by the cluster member node, and the sleeping node continues to collect energy; In three time slots, the cluster head node processes the collected data and sends it to the sink node, and the cluster member nodes and sleeping nodes continue to collect energy. Finally, according to the user's requirements for energy utilization and network coverage, an appropriate time slot division factor is selected. Compared with the centralized sleep scheduling method, the energy utilization and coverage of the network are improved.

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.