Low-Complexity Statistical-CSI Wireless Energy Transfer for Indoor IoT: Power Beacon Placement and Beamsharing-Aware Charging Scheduling
This paper proposes a low-complexity framework for indoor IoT wireless energy transfer that combines K-means-based Power Beacon placement, Statistical-CSI analog beamforming, and an Intelligent Power Distribution Model for beamsharing-aware scheduling, achieving up to 50% charging-time reduction while maintaining near-optimal performance with polynomial computational complexity.
Original paper licensed under CC BY 4.0 (https://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer
In the quiet corners of modern life, from the sensors monitoring a forest's health to the tiny tags tracking goods in a warehouse, a vast network of Internet of Things devices is growing. These devices are the silent workers of the future, but they share a common vulnerability: they need power. For decades, the solution has been batteries, which require frequent replacement, human intervention, and create a growing mountain of waste. A more elegant solution has emerged in the form of wireless energy transfer, where a central source beams energy through the air to recharge devices without a single wire. However, this technology faces a practical hurdle. To send energy efficiently, the source must aim a focused beam at a specific device, much like a flashlight illuminating a single person in a dark room. Doing this requires knowing exactly where that person is and how the light bounces off the walls around them. In a real-world environment filled with furniture and people, the air is full of unpredictable reflections that make the signal wobble. Getting this precise, real-time information for hundreds of devices is slow, expensive, and often impossible.
Researchers at the National Institute of Telecommunications in Brazil and their international colleagues have proposed a new way to solve this puzzle. Instead of trying to track every tiny wobble of the signal, they suggest a strategy that relies on the general, long-term layout of the room and the predictable path of the direct signal. Their work focuses on a scenario where a set of ceiling-mounted energy beacons must charge a group of devices scattered across a floor. The team developed a system that first places these beacons in the most logical spots based on where the devices are clustered, and then creates a charging schedule that intelligently decides which device to power next. This approach, they found, dramatically cuts down the time it takes to fully charge a network of devices, even without the complex, real-time data usually thought to be necessary.
The core of their method involves two distinct steps that happen in sequence. First, the researchers use a mathematical technique called clustering to group the devices based on their physical locations. Imagine a room filled with scattered dots; the algorithm finds the center of each group of dots and places an energy beacon directly above that center point. This ensures that the beacons are physically close to the devices they are meant to serve, which naturally strengthens the energy signal. Once the beacons are installed in these fixed positions, the second phase begins: the charging schedule. Here, the system uses a rule of thumb based on distance. It assigns each beacon to the nearest uncharged device, creating a primary beam of energy aimed directly at that target.
What makes this system particularly clever is how it handles the "leftover" energy. When a beacon aims at one device, the beam is not a perfectly tight laser; it spreads slightly, and some of that energy spills over to nearby devices that are not currently the main target. The researchers call this "beamsharing." In their model, they explicitly account for this spillover. While a device is waiting its turn to be the primary target, it is quietly soaking up this secondary energy from the beams aimed at its neighbors. This means that by the time a device finally gets its turn to be the main focus, it is already partially charged, allowing the system to move on to the next device faster. The schedule updates in real-time; as soon as a device reaches its full energy capacity, it drops out of the queue, and the system recalculates the best next target based on who is left and who is closest.
The results of their simulations are striking. In a test environment with twenty devices, the proposed method reduced the total time required to charge the entire network by up to fifty percent compared to a random approach where beacons and targets are chosen without a plan. The system performed even better when compared to other advanced methods that rely on wave-based placement strategies. Perhaps most importantly, the researchers showed that their approach works almost as well as a theoretical "perfect" system that knows the exact, moment-to-moment behavior of the air and walls. In small-scale tests with just three or four devices, their method was only about nine percent slower than a computer that tried every single possible combination of beacon placements and charging orders to find the absolute best solution. This suggests that their simpler, faster method captures the vast majority of the benefits without the impossible computational cost of checking every possibility.
The study also explored how different factors influence the outcome. They found that the more antennas a beacon has, the more focused the beam can be, which generally speeds up charging, though there is a point where the beam becomes so narrow that it stops helping the neighboring devices with their "spillover" energy. They also discovered that the method remains robust even when the signal conditions change, such as when the direct line of sight between the beacon and the device is clearer or more obstructed. The system does not require the beacons to move or the devices to report their exact location constantly; it relies on the initial map of where things are and the general rules of how radio waves travel.
This work offers a practical path forward for powering the massive, distributed networks of the future. By accepting that we cannot always know the exact state of the air at every second, and instead focusing on the stable, long-term layout of the environment, the researchers have created a system that is both efficient and manageable. It proves that you do not need perfect, instantaneous knowledge to achieve excellent results; sometimes, a smart plan based on where things are and how they naturally interact is enough to keep the lights on, wirelessly and sustainably. The findings suggest that for indoor environments, such as factories or smart buildings, this low-complexity approach could be the key to making wireless power a reliable reality for the devices that will soon surround us.
Drowning in papers in your field?
Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.