Dynamic Slot Allocation Without Explicit Request Messages for Wireless Sensor Networks With Limited Resources

This paper presents a novel dynamic slot allocation algorithm for wireless sensor networks designed to overcome resource constraints. Our algorithm operates without explicit request messages and adapts the transmission period and data transmission amount according to changes in the monitored environment. As such, it addresses the challenge of allocating wireless resources efficiently and fairly while considering packet drop rate, transmission delay, channel status, and transmission opportunities. However, networks with limited resources can only collect and process some of the necessary information for optimal allocation. Therefore, our proposed scheme uses accumulative information on allocated resources instead of additional overhead information. Our algorithm outperforms the reservation-based resource allocation scheme in conditions where packet arrival rates change dynamically, which achieves over 15% improvement in terms of network throughput, indicating its suitability for networks operating under constrained resources.