Approaching the limits in routing in power line communication exploiting Network Coding

Research output: Contribution to book/Conference proceedings/Anthology/ReportConference contributionContributedpeer-review

Abstract

We address the single-source-destination routing problem in a mesh network with a broadcast channel, time-division multiplexing (TDM) and no spatial reuse, which is a special type of the PLC channel. First, the outer bound on the achievable data rate is evaluated. We show that the routing protocols (RPs) with static routing do not allow approaching this data rate limit. Then, we study RP with opportunistic routing (ORP). We show that its main disadvantage, extensive feedback, can be successively reduced when using Network Coding (NC). We propose the basic routing rules (BRR) based on ORP with NC. Then, we demonstrate that the data rate achievable with BRR approaches the outer bound when the coding window increases. Finally, we provide the simulation results, which prove the concept. In the considered scenarios, BRR allow the data rate up to 10% higher than RPs with static routing, which is just 5-10% away from the theoretical outer bound limit.

Details

Original languageEnglish
Title of host publication2017 IEEE International Symposium on Power Line Communications and its Applications, ISPLC 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (electronic)9781509023899
Publication statusPublished - 11 Apr 2017
Peer-reviewedYes

Conference

Title2017 IEEE International Symposium on Power Line Communications and its Applications, ISPLC 2017
Duration3 - 5 April 2017
CityMadrid
CountrySpain

External IDs

ORCID /0000-0001-8469-9573/work/161891284

Keywords

Keywords

  • Channel capacity, Network Coding, ORP, Powerline Communication, Routing