Rights statement: ©2019 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Accepted author manuscript, 423 KB, PDF document
Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License
Final published version
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Research output: Contribution to Journal/Magazine › Journal article › peer-review
}
TY - JOUR
T1 - Exploiting Delay Budget Flexibility for Efficient Group Delivery in the Internet of Things
AU - Yao, Yuhui
AU - Sun, Yan
AU - Phillips, Chris
AU - Cao, Yue
AU - Li, Jichun
N1 - ©2019 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
PY - 2019/8/1
Y1 - 2019/8/1
N2 - Further accelerated by the Internet of Things (IoT) concept, various devices are being continuously introduced into diverse application scenarios. To achieve unattended updates of IoT smart object(s), there remains a challenging problemconcerning how to efficiently deliver messages to specific groups of target nodes, especially considering node mobility. In this paper, the relay selection problem is investigated on the basis of directional movement with randomness (e.g. typically associated with the searching or migrating behaviour of animals). Unlike numerous works tackling one-to-one communication, we focus on efficient group delivery (one-to-many). A two-level delay budget model is considered to reflect the flexibility of delay tolerance, which brings potential efficiency gains for group delivery compared with using a single budget boundary. Following the description of the system model, a combinatorial bi-objective optimisation problem is formulated and solutions are proposed.Simulation results show that the greedy algorithm can achieve comparable performance to an evolutionary algorithm when the delivery satisfaction outweighs efficiency. Furthermore, we show that our proposed greedy scheme can outperform the state-of-theart when the delivery efficiency becomes increasingly important.
AB - Further accelerated by the Internet of Things (IoT) concept, various devices are being continuously introduced into diverse application scenarios. To achieve unattended updates of IoT smart object(s), there remains a challenging problemconcerning how to efficiently deliver messages to specific groups of target nodes, especially considering node mobility. In this paper, the relay selection problem is investigated on the basis of directional movement with randomness (e.g. typically associated with the searching or migrating behaviour of animals). Unlike numerous works tackling one-to-one communication, we focus on efficient group delivery (one-to-many). A two-level delay budget model is considered to reflect the flexibility of delay tolerance, which brings potential efficiency gains for group delivery compared with using a single budget boundary. Following the description of the system model, a combinatorial bi-objective optimisation problem is formulated and solutions are proposed.Simulation results show that the greedy algorithm can achieve comparable performance to an evolutionary algorithm when the delivery satisfaction outweighs efficiency. Furthermore, we show that our proposed greedy scheme can outperform the state-of-theart when the delivery efficiency becomes increasingly important.
U2 - 10.1109/JIOT.2019.2908892
DO - 10.1109/JIOT.2019.2908892
M3 - Journal article
VL - 6
SP - 6593
EP - 6605
JO - IEEE Internet of Things Journal
JF - IEEE Internet of Things Journal
SN - 2327-4662
IS - 4
ER -