Reducing the Number of Forward Nodes from 1-Hop Nodes to Cover 2-Hop Nodes with Network Coding

All neighbors of a node can receive a data packet conveyed by a broadcasting node in an ad-hoc wireless network. In this way, the no. of forwarding nodes is utilized as the cost criterion for propagation. Among different estimation approaches, the researcher uses 1-Hop nodes to cover entire 2- Hop nodes utilizing 2-hop region information to decrease repetitive communicates. We dissect a few deficiencies of this approach and propose an improved algorithm along with the network coding concepts in this paper. Our algorithm utilizes 2-hop neighborhood more successfully to lessen excess communicates. The Simulation results of applying this algorithm demonstrate performance improvements. Nowadays the scientists are acquainting the idea of Network coding to neighbour topology aware protocols that beats the excess number of broadcast by victimization the using XOR of data packets. We have made an endeavor to seek out the network coding gain. We’ve shown simulation, implementation and breakdown of result in various circumstances