12,000

We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK

93%

93% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > Neighborhood watch
View graph of relations

« Back

Neighborhood watch: on network coding throughput and key sharing

Research output: Contribution in Book/Report/ProceedingsConference contribution

Published

  • Martin Strohmeier
  • Ivan Martinovic
  • Utz Roedig
  • Karim El Defrawy
  • Jens Schmitt
Publication date9/12/2013
Host publicationGlobal Communications Conference (GLOBECOM), 2013 IEEE
PublisherIEEE Xplore
Pages849-854
Number of pages6
Original languageEnglish

Abstract

Network coding (NC) has frequently been promoted as a means of improving throughput in wireless networks. Existing work has mostly focused on the fundamental aspects of NC, while constraints arising from real-world network deployments have not been given much attention. In particular, NC requires network nodes to overhear each other's packets, which is oftentimes in contradiction to many security standards that attempt to provide link-layer confidentiality by using, e.g., pairwise encryption keys (such as IEEE 802.11i or ZigBee). Therefore, there is an inherent trade-off in using NC and applying link-layer security: if many nodes share the secret link-layer key, NC will improve the network throughput, yet a leakage of the key will affect many nodes; on the other hand, having distinct secret keys will increase the network resilience against key compromise, but it will also minimize the coding gain. We formulate this security vs. performance trade-off as an optimization problem and evaluate the effectiveness of NC under different sizes of key-sharing groups and network topologies. Our results show that increasing the key-sharing group by a single node can result in a maximum coding gain between 1.3% and 13.7%.