liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Minimizing end-to-end delay in multi-hop wireless networks with optimized transmission scheduling
Tech Univ Milan, Italy.
Natl Innovat Inst Def Technol, Peoples R China.
Warsaw Univ Technol, Poland.
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
2019 (English)In: Ad hoc networks, ISSN 1570-8705, E-ISSN 1570-8713, Vol. 89, p. 236-248Article in journal (Refereed) Published
Abstract [en]

The problem of transmission scheduling in single hop and multi-hop wireless networks has been extensively studied. The focus has been on optimizing the efficiency of transmission parallelization, through a minimum-length schedule that meets a given set of traffic demands using the smallest possible number of time slots. Each time slot is associated with a set of transmissions that are compatible with each other according to the considered interference model. The minimum-length approach maximizes the resource reuse, but it does not ensure minimum end-to-end packet delay for multiple source-destination pairs, due to its inherent assumption of frame periodicity. In the paper we study the problem of transmission scheduling and routing aiming at minimizing the end-to-end delay under the signal-to-interference-and-noise-ratio (SINR) model for multi-hop networks. Two schemes are investigated. The first scheme departs from the conventional scheduling approach, by addressing explicitly end-to-end delay and removing the restriction of frame periodicity. The second scheme extends the first one by featuring cooperative forwarding and forward interference cancellation. We study the properties of the two schemes, and propose novel mixed-integer programming models and solution algorithms. Extensive results are provided to gain insights on how the schemes perform in end-to-end delay. (C) 2019 Elsevier B.V. All rights reserved.

Place, publisher, year, edition, pages
ELSEVIER SCIENCE BV , 2019. Vol. 89, p. 236-248
Keywords [en]
Cooperative forwarding; Forward interference cancellation; Link scheduling; Mathematical programming; SINR Model; Wireless networks
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:liu:diva-158310DOI: 10.1016/j.adhoc.2019.01.004ISI: 000468709600020OAI: oai:DiVA.org:liu-158310DiVA, id: diva2:1333946
Note

Funding Agencies|European Union [324515, 329313]; Swedish Research Council [2013-05649]; National Science Centre, Poland [2017/25/B/ST7/02313]

Available from: 2019-07-02 Created: 2019-07-02 Last updated: 2019-10-16

Open Access in DiVA

The full text will be freely available from 2021-02-08 13:25
Available from 2021-02-08 13:25

Other links

Publisher's full text

Search in DiVA

By author/editor
Yuan, Di
By organisation
Communications and Transport SystemsFaculty of Science & Engineering
In the same journal
Ad hoc networks
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 18 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf