Home > Research > Publications & Outputs > Exploiting Delay Budget Flexibility for Efficie...

Electronic data

  • Yuhui-Conf2

    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

Links

Text available via DOI:

View graph of relations

Exploiting Delay Budget Flexibility for Efficient Group Delivery in the Internet of Things

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published
  • Yuhui Yao
  • Yan Sun
  • Chris Phillips
  • Yue Cao
  • Jichun Li
Close
<mark>Journal publication date</mark>1/08/2019
<mark>Journal</mark>IEEE Internet of Things Journal
Issue number4
Volume6
Number of pages13
Pages (from-to)6593 - 6605
Publication StatusPublished
Early online date2/04/19
<mark>Original language</mark>English

Abstract

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 problem
concerning 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.

Bibliographic note

©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.