Probabilistic Cooperative Coded Forwarding for Broadcast Transmissions in Industrial Mobile Edge Communications

Mobile edge computing (MEC) has been considered as a key enabler for the industrial internet of things (IIoT) to cope with the ever-increasing communication and computing demands of nodes. In consideration of the limited power and resource of the IIoT nodes, it is necessary to design cost-effective data sharing mechanisms for MEC-enabled wireless industrial communication networks. In this article, we propose the probabilistic cooperative coded forwarding (PCCF) scheme based on network coding (NC) to minimize the required transmission number in both the data source and relay nodes. The data packets are encoded sparsely in a systematic coding framework so that the decoding process at the receivers can be more efficient. The relationship between the forwarding and coding parameters of the proposed scheme and the successful decoding probability are comprehensively analyzed and the approximations are numerically verified. Throughout the analysis, we find the optimal sparsity of network coding vectors and also the existence of minimum transmission numbers.

Multipath Wireless Network Coding: A Scheduling Constraint in Game Perspective

This paper considers wireless networks in which various paths are obtainable involving each source and destination. It is allowing each source to tear traffic among all of its existing paths, and it may conquer the lowest achievable number of transmissions per unit time to sustain a prearranged traffic matrix. Traffic bound in contradictory instructions in excess of two wireless hops can utilize the “reverse carpooling” advantage of network coding in order to decrease the number of transmissions used. These call such coded hops “hyper-links.” With the overturn carpooling procedure, longer paths might be cheaper than shorter ones. However, convenient is an irregular situation among sources. The network coding advantage is realized only if there is traffic in both directions of a shared path. This project regard as the problem of routing amid network coding by egotistic agents (the sources) as a potential game and develop a method of state-space extension in which extra agents (the hyper-links) decouple sources’ choices from each other by declaring a hyper-link capacity, allowing sources to split their traffic selfishly in a distributed fashion, and then altering the hyper-link capacity based on user actions. Furthermore, each hyper-link has a scheduling constraint in stipulations of the maximum number of transmissions authorized per unit time. Finally these project show that our two-level control scheme is established and verify our investigative insights by simulation.

Network Coding- Based Energy-Efficient Geographic Routing Protocols in Wireless Sensor Networks Using XOR

Energy awareness is an essential design issue in wireless sensor network. Therefore, attention must be given to the routing protocols since they might differ depending on the application and network architecture. It is desired to design the energy efficient routing protocols to conserve the power supply of sensor node and prolong its lifetime. In this paper Network Coding-Energy efficient geographic routing protocol (NC-EGRPM) in Wireless Sensor network is an energy efficient scheme which prolong the network life time using the mobile sinks. These algorithms focus on the efficiency of network coding, which could be adoptive, flexible, and intelligent enough to distribute the load among the sensor nodes that can enhance the network lifetime. By using NC (Network Coding), we propose an energy efficienct algorithm to handle uncertain level decision better than other models. We also use the concept of XOR encoding and decoding as a mechanism not only for enhancing energy efficiency but also for reducing the end-to-end-delay. XOR-based coding works on a hop-by-hop basis, i.e. packets encoded by a node are decoded by its neighbouring nodes. The idea is that each node v can combine packets using bitwise XOR operations in order to produce an encoded packet. We are implementing our proposed work using NS2 and measure its performance. Keywords: Network coding, XOR, NS2, WSN

Secure Physical Layer Network Coding versus Secure Network Coding

When a network has relay nodes, there is a risk that a part of the information is leaked to an untrusted relay. Secure network coding (secure NC) is known as a method to resolve this problem, which enables the secrecy of the message when the message is transmitted over a noiseless network and a part of the edges or a part of the intermediate (untrusted) nodes are eavesdropped. If the channels on the network are noisy, the error correction is applied to noisy channels before the application of secure NC on an upper layer. In contrast, secure physical layer network coding (secure PLNC) is a method to securely transmit a message by a combination of coding operation on nodes when the network is composed of set of noisy channels. Since secure NC is a protocol on an upper layer, secure PLNC can be considered as a cross-layer protocol. In this paper, we compare secure PLNC with a simple combination of secure NC and error correction over several typical network models studied in secure NC.