Achieving Ultra Energy-efficient and Collision-free Data Collection in Wake-up Radio Enabled mIoT
Chapter
Accepted version
Permanent lenke
https://hdl.handle.net/11250/3131086Utgivelsesdato
2020Metadata
Vis full innførselSamlinger
Originalversjon
Hsu, C. -A., Li, F. Y., Chen, C. & Tseng, Y.-C. (2020). Achieving Ultra Energy-efficient and Collision-free Data Collection in Wake-up Radio Enabled mIoT. ICC 2020 - 2020 IEEE International Conference on Communications (ICC). https://doi.org/10.1109/ICC40277.2020.9149361Sammendrag
To achieve ultra-low energy consumption and decade-long battery lifetime for Internet of things (IoT) networks, wake-up radio (WuR) appears as an eminent solution. While keeping devices in deep sleep for most of the time, a WuR enabled IoT device can be woken up for data transmission at any time by a wake-up call (WuC). However, collisions happen among WuCs for transmitter-initiated data reporting and among data packets for receiver-initiated data collection. In this paper, we propose two novel hashing-based schemes in order to achieve collision-free data transmissions for receiver-initiated data collection. We consider first a simple scenario in which all devices in a region of interest are covered by a data collector and propose a scheme which facilitates a scheduled time for data uploading of each device. Then we extend our scheme to cover a more realistic scenario where IoT devices are distributed across a larger region that cannot be covered by a single data collector. In this case, we propose a partitioning algorithm for data collection across multiple partitions. Both analysis and simulations are performed to demonstrate the effectiveness of the proposed schemes.
Beskrivelse
Author's accepted manuscript. © 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.