Reduction of Forwarding Nodes to Reduce Effect of Broadcast Storm Problem using Network Coding

Abstract

The Wireless mesh networks guarantee modest internet access, simple deployment, and extended range. In their present structure, however, these networks experience the ill effects of both limited throughput and high redundancy; hence they cannot fulfill the needs of applications such as file sharing and high definition video. Spurred by these problems, we explore an alternative design that addresses these challenges. newline newlineMessage broadcasting is a basic function in wireless Ad-hoc network in which a node passes on a message to all neighbors thus causing redundant broadcast which is called as Broadcast storm Problem in which every node will be obligated to re-broadcast the data packet every time it gets the data packet thus causing redundancy. In this way, the number of forwarding nodes is utilized as the cost criterion for propagation. Instead of routers just storing and forwarding received packets, they mix (or code) packets content before forwarding. We have developed few algorithms; each discloses a diverse advantage of our network coded design. Prior work on network coding focuses on multicast traffic. This thesis aims to bridge theory with practice by addressing the common issues faced in the integration of network coding in the current network stack . newline newlineThe contributions of this dissertation are multifold. This dissertation presents an algorithm along with network coding concept that uses 1-Hop nodes to cover entire 2-Hop nodes utilizing 2-hop region information to decrease repetitive communicates. Simulation results of applying this algorithm demonstrate performance improvements. Now a day the scientists are acquainting the idea of Network coding to neighbour topology aware protocols that beats the excess number of broadcast by 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. newline newlineSecondly, another proposed algorithm uses bit addresses to where every node is distinguished by bit value 1 in an address bit vector. Distinguishing packets and processing the network coding of packets can be effectively done utilizing address bit vectors. This algorithm also acknowledges redundancy with total number of coded packets sent with respect to actual number of nodes present in the system. To carry out work in similar direction, Network Coding Algorithm also on integrating with the AODV protocol provides redundancy proficient system as compared to the old Network coding scheme since less number of average transmissions are required per node. The enhancement in the performance of the proposed AODV integrated Network coding scheme over the traditional Network coding scheme increases with increase in density. Hence a basic alteration of discovering a reduced sub-graph from the first original sub-graph utilizing AODV routing scheme can enhance the execution of Network Coding to an awesome degree . newline newlineAt the same time, to achieve lesser redundancy in terms of achieving less number of forwarding nodes for retransmission uses the concept of degree of incoming traffic and outgoing traffic of a node along with link bandwidth when integrated with probabilistic based Network coding provides result to awesome degree. SET Partition theory based algorithm when integrated with Network Coding approach distinguishes and comprises nodes based on the fact of bundles of different network coded reduces the Number of Forwarding nodes for retransmission in contrast to actual number of nodes. Simultaneously, the design maintains desirable properties such as being distributed, implementable, and little complexity with the rest of the network stack. newline newline