Show simple item record

dc.contributor.authorYAO, Y
dc.contributor.authorSUN, Y
dc.contributor.authorPHILLIPS, CI
dc.contributor.authorCao, Y
dc.date.accessioned2019-03-27T15:48:32Z
dc.date.available2019-03-20
dc.date.available2019-03-27T15:48:32Z
dc.date.issued2019
dc.identifier.urihttps://qmro.qmul.ac.uk/xmlui/handle/123456789/56524
dc.description.abstractFurther 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.en_US
dc.publisherIEEEen_US
dc.relation.ispartofIEEE Internet of Things
dc.titleExploiting Delay Budget Flexibility for Efficient Group Delivery in the Internet of Thingsen_US
dc.typeArticleen_US
dc.rights.holder© 2019 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.
pubs.notesNot knownen_US
pubs.publication-statusAccepteden_US
dcterms.dateAccepted2019-03-20
rioxxterms.funderDefault funderen_US
rioxxterms.identifier.projectDefault projecten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record