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
PublisherIEEE Institute of Electrical and Electronic Engineers
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

Keywords

  • encoding number
  • network coding
  • random networks
  • wireless

Fingerprint Dive into the research topics of 'Geometrical bounds on the efficiency of wireless network coding'. Together they form a unique fingerprint.

Cite this