Please use this identifier to cite or link to this item:
http://10.1.7.192:80/jspui/handle/123456789/3086
Title: | Review on variants of Network Coding in Wireless Ad-Hoc Networks |
Authors: | Bhatia, Jitendra Patel, Ankit Narmawala, Zunnun |
Keywords: | RLNC MGM Computer Faculty Paper Faculty Paper ITFCE020 IDFCE002 NUiCONE NUiCONE-2011 |
Issue Date: | 8-Dec-2011 |
Publisher: | Institute of Technology |
Citation: | 2nd International Conference on Current Trends in Technology, NUiCONE-2011, Institute of Technology, Nirma University, December 8-10, 2011 |
Series/Report no.: | ITFCE020-1 |
Abstract: | Network coding is a technique in which node is allowed to combine and encode one or more input packets into encoded packets instead of directly forwarding them. It increases throughput and delivery ratio. In this paper, we review basic linear network coding variants with their performance benefits and theoretical results. In practical setting, linear network coding requires central authority to control generation of meaningful encoding coefficients and for coordination between the nodes of network. In wireless network, due to dynamic nature of nodes and heterogeneity of network, centralized approach is not suitable. So, distributed approach should be used. We reviewed distributed linear network coding technique named as Random Linear Network Coding (RLNC). We also reviewed RLNC variants called Generation-by-Generation RLNC and RLNC with Multi Generation Mixing (MGM). We also reviewed the options to recover the lost encoded packets in networks where losses prevent efficient propagation of sender packets. MGM increases the decodable rate of encoded packets. We compared the performance of Generation-by-Generation Network Coding and Network coding with MGM. |
URI: | http://10.1.7.181:1900/jspui/123456789/3086 |
ISBN: | 9788192304908 |
Appears in Collections: | Faculty Papers, CE |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ITFCE020-1.pdf | ITFCE020-1 | 718.48 kB | Adobe PDF | ![]() View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.