IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Network Coding for Multi-Hop Wireless Networks

Network Coding for Multi-Hop Wireless Networks
View Sample PDF
Author(s): Meng Yu (Lehigh University, USA), Jing (Tiffany) Li (Lehigh University, USA)and Haidong Wang (Thales Communications Inc., USA)
Copyright: 2010
Pages: 19
Source title: Cooperative Communications for Improved Wireless Network Transmission: Framework for Virtual Antenna Array Applications
Source Author(s)/Editor(s): Murat Uysal (University of Waterloo, Canada)
DOI: 10.4018/978-1-60566-665-5.ch006

Purchase

View Network Coding for Multi-Hop Wireless Networks on the publisher's website for pricing and purchasing information.

Abstract

We consider practical network coding, a useful generalization of routing, in multi-hop multicast wireless networks. The model of interest comprises a set of nodes transmitting data wirelessly to a set of destinations across an arbitrary, unreliable, and possibly time-varying network. This model is general and subsumes peer-to-peer, ad-hoc, sensory, and mobile networks. It is first shown that, in the singlehop case, the idea of adaptively matching code-on-graph with network-on-graph, first developed in the adaptive-network-coded-cooperation (ANCC) protocol, provides a significant improvement over the conventional strategies. To generalize the idea to the multi-hop context, we propose to transform an arbitrarily connected network to a possibly time-varying “trellis network,” such that routing design for the network becomes equivalent to path discovery in the trellis. Then, exploiting the distributed, real-time graph-matching technique in each stage of the trellis, a general network coding framework is developed. Depending on whether or not the intermediate relays choose to decode network codes, three practical network coding categories, progress network coding, concatenated network coding and hybrid network coding, are investigated. Analysis shows that the proposed framework can be as dissemination-efficient as those with random codes, but only more practical.

Related Content

J. Mangaiyarkkarasi, J. Shanthalakshmi Revathy. © 2024. 34 pages.
Gummadi Surya Prakash, W. Chandra, Shilpa Mehta, Rupesh Kumar. © 2024. 22 pages.
Duygu Nazan Gençoğlan. © 2024. 35 pages.
Smrity Dwivedi. © 2024. 20 pages.
Pallavi Sapkale, Shilpa Mehta. © 2024. 21 pages.
Pardhu Thottempudi, Vijay Kumar. © 2024. 43 pages.
Sathish Kumar Danasegaran, Elizabeth Caroline Britto, S. Dhanasekaran, G. Rajalakshmi, S. Lalithakumari, A. Sivasangari, G. Sathish Kumar. © 2024. 18 pages.
Body Bottom