Abstract
This paper explores wireless network coding both in case of
deterministic and random point patterns. Using the Boolean connectivity model
we provide upper bounds for the maximum encoding number, i.e., the number of
packets that can be combined such that the corresponding receivers are able
to decode. For the models studied, this upper bound is of order vN, where N
denotes the (mean) number of neighbours. Our simulations show that the vN
law is applicable to small-sized networks as well. Moreover, achievable
encoding numbers are provided for grid-like networks where we obtain the
multiplicative constants analytically. Building on the above results, we
provide an analytic expression for the upper bound of the efficiency of
wireless network coding. The conveyed message is that it is favourable to
reduce computational complexity by relying only on small encoding numbers,
for example, XORing only pairs, as the resulting throughput loss is
typically small.
| Original language | English |
|---|---|
| Title of host publication | 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013 |
| Place of Publication | Piscataway |
| Publisher | IEEE Institute of Electrical and Electronic Engineers |
| Pages | 500-507 |
| ISBN (Print) | 978-1-4799-2239-0 |
| Publication status | Published - 2013 |
| MoE publication type | A4 Article in a conference publication |
| Event | 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013 - Tsukuba Science City, Japan Duration: 13 May 2013 → 17 May 2013 |
Conference
| Conference | 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013 |
|---|---|
| Abbreviated title | WiOpt 2013 |
| Country/Territory | Japan |
| City | Tsukuba Science City |
| Period | 13/05/13 → 17/05/13 |
Keywords
- encoding number
- network coding
- random networks
- wireless