Packet scheduling in rechargeable wireless sensor networks under SINR model

Two packet scheduling algorithms for rechargeable sensor networks are proposed based on the signal to interference plus noise ratio model. They allocate different transmission slots to conflicting packets and overcome the challenges caused by the fact that the channel state changes quickly and is uncontrollable. The first algorithm proposes a priority-based framework for packet scheduling in rechargeable sensor networks. Every packet is assigned a priority related to the transmission delay and the remaining energy of rechargeable batteries, and the packets with higher priority are scheduled first. The second algorithm mainly focuses on the energy efficiency of batteries. The priorities are related to the transmission distance of packets, and the packets with short transmission distance are scheduled first. The sensors are equipped with low-capacity rechargeable batteries, and the harvest-store-use model is used. We consider imperfect batteries. That is, the battery capacity is limited, and battery energy leaks over time. The energy harvesting rate, energy retention rate and transmission power are known. Extensive simulation results indicate that the battery capacity has little effect on the packet scheduling delay. Therefore, the algorithms proposed in this paper are very suitable for wireless sensor networks with low-capacity batteries.