Geometrical bounds on the efficiency of wireless network coding

Petteri Mannersalo, G.S. Paschos, L. Gkatzikis

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

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 languageEnglish
Title of host publication11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013
Place of Publication Piscataway, NJ, USA
PublisherInstitute of Electrical and Electronic Engineers IEEE
Pages500-507
ISBN (Print)978-1-4799-2239-0
Publication statusPublished - 2013
MoE publication typeNot Eligible
Event11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013 - Tsukuba Science City, Japan
Duration: 13 May 201317 May 2013

Conference

Conference11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013
Abbreviated titleWiOpt 2013
CountryJapan
CityTsukuba Science City
Period13/05/1317/05/13

Fingerprint

Network coding
Wireless networks
Computational complexity
Throughput

Keywords

  • encoding number
  • network coding
  • random networks
  • wireless

Cite this

Mannersalo, P., Paschos, G. S., & Gkatzikis, L. (2013). Geometrical bounds on the efficiency of wireless network coding. In 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013 (pp. 500-507). Piscataway, NJ, USA: Institute of Electrical and Electronic Engineers IEEE.
Mannersalo, Petteri ; Paschos, G.S. ; Gkatzikis, L. / Geometrical bounds on the efficiency of wireless network coding. 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013. Piscataway, NJ, USA : Institute of Electrical and Electronic Engineers IEEE, 2013. pp. 500-507
@inproceedings{3e725f14d41f41698f4314c6044af194,
title = "Geometrical bounds on the efficiency of wireless network coding",
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.",
keywords = "encoding number, network coding, random networks, wireless",
author = "Petteri Mannersalo and G.S. Paschos and L. Gkatzikis",
year = "2013",
language = "English",
isbn = "978-1-4799-2239-0",
pages = "500--507",
booktitle = "11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013",
publisher = "Institute of Electrical and Electronic Engineers IEEE",
address = "United States",

}

Mannersalo, P, Paschos, GS & Gkatzikis, L 2013, Geometrical bounds on the efficiency of wireless network coding. in 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013. Institute of Electrical and Electronic Engineers IEEE, Piscataway, NJ, USA, pp. 500-507, 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013, Tsukuba Science City, Japan, 13/05/13.

Geometrical bounds on the efficiency of wireless network coding. / Mannersalo, Petteri; Paschos, G.S.; Gkatzikis, L.

11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013. Piscataway, NJ, USA : Institute of Electrical and Electronic Engineers IEEE, 2013. p. 500-507.

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

TY - GEN

T1 - Geometrical bounds on the efficiency of wireless network coding

AU - Mannersalo, Petteri

AU - Paschos, G.S.

AU - Gkatzikis, L.

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - encoding number

KW - network coding

KW - random networks

KW - wireless

M3 - Conference article in proceedings

SN - 978-1-4799-2239-0

SP - 500

EP - 507

BT - 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013

PB - Institute of Electrical and Electronic Engineers IEEE

CY - Piscataway, NJ, USA

ER -

Mannersalo P, Paschos GS, Gkatzikis L. Geometrical bounds on the efficiency of wireless network coding. In 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013. Piscataway, NJ, USA: Institute of Electrical and Electronic Engineers IEEE. 2013. p. 500-507