Please use this identifier to cite or link to this item: http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/8387
Title: Improving the Average Number of Network Coded Transmission in AODV Routing Protocol with Network Coding Scheme
Authors: Goyal, Mayank Kumar
Ghrera, Satya Prakash
Gupta, Jai Prakash
Keywords: Ad-hoc Networks
Network Coding
Opportunistic listening
Opportunistic coding, throughput
Issue Date: 2016
Publisher: Jaypee University of Information Technology, Solan, H.P.
Abstract: This paper offers the improvement procedure about Network coding scheme in wireless scenarios and its merits and demerits when integrated with AODV protocol and introduces a modified routing scheme. Methods/Statistical Analysis: Using AODV from a known graph G, paths between each pair of nodes are determined and the count of reiteration of each of its nexthops for dissimilar destinations are recorded. For these next hops of a node, the edges connecting them with the node are retained as they were in original graph, while others are deleted. A subgraph of the original graph G’ is created to apply Network coding further. Findings: On integrating Network coding scheme with the AODV protocol, the algorithm formed is much more energy proficient as compared to the old Network coding scheme since less no. of average transmissions are required per node. The enhancement in the performance of the proposed AODV integrated Network coding scheme over the original Network coding scheme increases with increase in density. Hence a basic alteration of discovering a reduced subgraph from the first original subgraph utilizing AODV routing scheme can enhance the execution of Network Coding to an awesome degree. Application/Improvements: The reproduction results shows that proposed modified algorithm improves average number of Network coded transmission in AODV Routing Protocol with Network Coding Scheme.
URI: http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/8387
Appears in Collections:Journal Articles



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.