On the energy benefit of compute-and-forward for multiple unicasts

Zhijie Ren, Jasper Goseling, Jos H. Weber, Michael Gastpar

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

Compute-and-forward (CF) is a technique which exploits broadcast and superposition in wireless networks. In this paper, the CF energy benefit is studied for networks with unicast sessions and modeled by connected graphs. This benefit is defined as the ratio of the minimum energy consumption by traditional routing techniques, not using broadcast and superposition features, and the corresponding CF consumption. It is shown to be upper bounded by min(d̅, K, 12√K), where d̅ and K are the average hop-count distance and the number of sessions, respectively. Also, it can be concluded that the energy benefit of network coding (NC) is also upper bounded by the same value, which is a new scaling law of the energy benefit for NC as a function of K.
Original languageEnglish
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
PublisherIEEE
Pages2334-2338
Number of pages5
ISBN (Electronic)978-1-5090-1806-2
DOIs
Publication statusPublished - 10 Aug 2016
EventIEEE International Symposium on Information Theory 2016 - Barcelona, Spain
Duration: 10 Jul 201615 Jul 2016

Conference

ConferenceIEEE International Symposium on Information Theory 2016
Abbreviated titleISIT 2016
CountrySpain
CityBarcelona
Period10/07/1615/07/16

Fingerprint Dive into the research topics of 'On the energy benefit of compute-and-forward for multiple unicasts'. Together they form a unique fingerprint.

  • Cite this

    Ren, Z., Goseling, J., Weber, J. H., & Gastpar, M. (2016). On the energy benefit of compute-and-forward for multiple unicasts. In IEEE International Symposium on Information Theory - Proceedings (pp. 2334-2338). IEEE. https://doi.org/10.1109/ISIT.2016.7541716