Network Coding Opportunity of the Encyclopaedia Discovery Scheme in Wireless Networks

Abstract

Opportunistic orientation has emerged on the basis of smart coding network to improve the ability of wireless multi-hop network loss by reducing the amount of messages required reactions. Most business coding in network-based opportunistic routing in the literature assumes that independent links. This hypothesis has been invalidated by recent empirical studies have shown that the relationship between the links may be arbitrary. In this paper, we show that opportunistic routing performance based on the coding of the network and greatly affected the relationship between the links. We formulate the problem of productivity maximization while achieving justice under arbitrary channel conditions, and determine the structure of the optimal solution. As is the case in the literature, and the optimal solution requires a lot of instant information messages, which is unrealistic. We propose the idea of network message coding performance reactions, which shows that if the intermediate node waits to receive only one message the votes of each next hip node, we can calculate the optimum level of network redundancy coding form Distributed. Encrypted messages require reaction to a small amount of overhead as it can be integrated with packets. Our approach is also oblivious to losses and mutual relationships between links, but also improves performance without a clear knowledge of these two factors