Abstract—In Wireless Sensor Networks (WSNs), nodes close to the sink forward traffic from all over the network. Therefore, they tend to deplete their battery and be congested more than the other sensor nodes. Addressing this issue known as the hot spot problem is critical to design an efficient network. In this paper, we formulated this question as a combination of the precedence-constrained knapsack and the single-runway aircraft landing problems. The resulting TDMA (Time Division Multiple Access)-based protocol leverages two mixed-integer linear programs to select nodes and schedule data transmissions. This scheme simultaneously considers parameters like energy level, congestion degree, link state, transmission delay, and packet priority using a single queue, unlike solutions commonly found in the literature. Simulation results showed that this protocol can improve packet delivery ratio, throughput, fairness, and network lifetime respectively by 5.06%, 35.20%, 32.49%, and 60% compared with that of IEEE 802.14.5-based counterparts.

Keywords—hot spot, queue management, packet prioritization, TDMA, wireless sensor networks


Cite: Gokou Hervé Fabrice Diédié, Armand Kodjo Atiampo, and Tchimou N’Takpé, “Sink’s One-Hop Neighborhood Energy Hole Mitigation Scheme for Dense Wireless Sensor Networks," Journal of Communications, vol. 18, no. 12, pp. 748-758, December 2023. Doi: 10.12720/jcm.18.12.748-758

Copyright © 2023 by the authors. This is an open access article distributed under the Creative Commons Attribution License (CC BY-NC-ND 4.0), which permits use, distribution and reproduction in any medium, provided that the article is properly cited, the use is non-commercial and no modifications or adaptations are made.