Research On Routing Protocol Based On Network Coding In Wireless Sensor Networks

Because of the limited communication range of the wireless sensor networks nodes, the signal is vulnerable to shielding, interference and usually leads to link quality unstable phenomenon between nodes. In addition, the sensor nodes are usually powered by a micro battery, and it is difficult to get the energy supplement after the network nodes are deployed. Improving the service quality of wireless sensor network and node energy efficiency to extend the network life cycle, become the focus of the research scholars.Compared to unicast and broadcast, multicast has obvious advantages in electric energy constrained wireless sensor networks. Network coding mechanism completely changed the traditional routing, network relay nodes will be treated as data is encoded before forwarding, effectively solved the data transmission problem encountered bottleneck link, so as to improve the network throughput and bandwidth utilization. Opportunistic routing breaks the deterministic routing method, which fully considers the broadcast characteristic, the time variation and the interference irregularity of the wireless channel, reduces the waste of the network resources and improves the communication quality.For wireless sensor networks in the network resources consumed too fast and the bandwidth underutilization problem, this paper proposes a multicast algorithm based on network coding, between the source and the target nodes to establish two redundant paths, each target node redundancy path integration into the group shared multicast tree, in the redundant path using Dijkstra algorithm to select the coding nodes, using network coding techniques for data coding and transmission. Simulation results show that the proposed algorithm can improve the network bandwidth utilization and reduce the network resource consumption and transmission delay. At the same time, this paper discusses a kind of opportunity routing algorithm based on network coding, the algorithm in each jump data forwarding, to forward the data to the candidate nodes first, then competition to select a node is equivalent to "subprime" source node to the source node "superior" an ACK, and down a set of nodes forward data, each layer followed by analogy until the destination node. The transmission of a plurality of data blocks in the network, each sending a data block only need to return to a ACK, reduced the transmission of ACK. Simulation results show that the proposed algorithm is improved in terms of throughput, latency and transmission times.