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 language | English |
---|---|
Title of host publication | Proceedings ISIT 2016 |
Subtitle of host publication | 2016 IEEE International Symposium on Information Theory |
Place of Publication | Piscataway, NJ |
Publisher | IEEE |
Pages | 2334-2338 |
Number of pages | 5 |
ISBN (Electronic) | 978-1-5090-1806-2 |
DOIs | |
Publication status | Published - 2016 |
Event | 2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain Duration: 10 Jul 2016 → 15 Jul 2016 |
Conference
Conference | 2016 IEEE International Symposium on Information Theory, ISIT 2016 |
---|---|
Abbreviated title | ISIT 2016 |
Country/Territory | Spain |
City | Barcelona |
Period | 10/07/16 → 15/07/16 |
Keywords
- Upper bound
- Energy consumption
- Routing
- Decoding
- Wireless communication
- Unicast
- Network coding