Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Archivio istituziona...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
https://doi.org/10.1109/vtcspr...
Article . 2018 . Peer-reviewed
Data sources: Crossref
DBLP
Conference object
Data sources: DBLP
versions View all 3 versions
addClaim

A Novel Routing and Scheduling Algorithm for Multi-Hop Heterogeneous Wireless Networks

Authors: Katila, Charles Jumaa; Buratti, Chiara;

A Novel Routing and Scheduling Algorithm for Multi-Hop Heterogeneous Wireless Networks

Abstract

In this paper, we address the problem of scheduling and routing design in a multi-hop heterogeneous radio network. The scenario consists of two types of nodes: scheduled nodes, which depend upon a centralised resource scheduling scheme, and uncoordinated nodes, which employ an asynchronous Carrier Sense Multiple Access (CSMA) based medium access control protocol. Both types of nodes co-exist on the same spectrum and may interfere each other. In fact, scheduled nodes are synchronized to the Base Station (BS) and communicate to it in a multi-hop fashion, while uncoordinated users are asynchronous with respect to the BS and the other nodes. Our work focuses on the problem of routing and scheduling for the scheduled set of nodes, with the aim of avoiding interference caused by CSMA nodes. In particular, we propose a Coexistence-Aware (CA) routing scheme, based on the definition of a novel link cost metric accounting for the number of potential uncoordinated nodes interfering. The output of the CA routing scheme serves an input to a Multi-Link Proportional Fair (MLPF) scheme, where a new scheduling metric, accounting for the number of hops needed to reach the BS, is designed. The proposed algorithm is compared with a benchmark solution, where routing is based on the level of received power over the links and where the MLPF algorithm presented in the literature is applied. Results show the improvement achieved with the proposed solution.

Country
Italy
Keywords

Computer Science Applications1707 Computer Vision and Pattern Recognition; Electrical and Electronic Engineering; Applied Mathematics; Routing; Measurement; Protocols; Scheduling; Interference; Radio networks; Multiaccess communication

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    2
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
2
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!