Multi-Channel Data Aggregation Scheduling Based on the Chaotic Firework Algorithm for the Battery-Free Wireless Sensor Network

The emergence of battery-free wireless sensor networks (benefiting from the ability to collect energy from the surroundings) has broken through the energy and lifetime limitations of traditional wireless sensor network systems, but also brings challenges to the sharing of network resources. In the multi-channel wireless communication environment, in particular, how to coordinate the communication time and occupied channels of a large number of sensor nodes from the perspective of optimizing the global network has become a research problem that must be solved. To reduce the transmission delay and the usage of wireless channels, a new multi-channel data aggregation scheduling method based on the chaotic firework algorithm is proposed in this paper. With the help of the generation function of feasible solutions, one scheduling set and a firework individual can be rapidly converted to each other. By the operations of firework explosions, the Gaussian mutation, and chaotic exploration, a sub-optimal scheduling set could be found during an acceptable time period. Finally, simulation results show that the new scheduling method has advantages in aggregation delay and occupied channels when compared with existing methods.

Automated summary

A new multi-channel data aggregation scheduling method based on the chaotic firework algorithm is proposed to optimize communication time and occupied channels of sensor nodes, reducing transmission delay and wireless channel usage. Simulation results demonstrate advantages in aggregation delay and occupied channels compared to existing methods.