Home > Research > Publications & Outputs > A Low-Latency Interference Coordinated Routing ...

Electronic data

  • FINAL VERSION.PDF

    Rights statement: ©2021 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, 1.66 MB, 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

A Low-Latency Interference Coordinated Routing for Wireless Multi-hop Networks

Research output: Contribution to journalJournal articlepeer-review

Published
Close
<mark>Journal publication date</mark>15/03/2021
<mark>Journal</mark>IEEE Sensors Journal
Issue number6
Volume21
Number of pages12
Pages (from-to)8679 - 8690
Publication StatusPublished
Early online date1/01/21
<mark>Original language</mark>English

Abstract

Recently, there has been an increasing interest in exploiting interference cancelation to support multiple adjacent concurrent transmissions instead of avoiding interference through scheduling. In line with these efforts, this paper propose an interference coordinated routing (ICR) scheme for wireless multi-hop networks to achieve more transmission concurrence, and thus lower the end-to-end delay. The proposed ICR scheme firstly constructs an initial path by the interference-aware routing algorithm, which captures the end-to-end latency and spatial resource cost as the routing metrics. Then, to analyze the feasibility of concurrent transmission for a given link set, we consider the interference coordination and formulate the concurrent transmission of multiple links as a linear programming (LP) problem. The solution to the LP problem indicates the power allocation. Finally, a distributed guard zone based selection (GBS) algorithm is further proposed to iteratively explore the maximum feasible link set for each time slot. The selected links are simultaneously active for packet transmission with the allocated power in the current time slot, and the remaining links will be put off to the next. Simulation results confirm that ICR reduces the end-to-end delay by 9.16% to 73.82%, and promotes better transmission concurrence compared with the existing schemes.

Bibliographic note

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