network coding has been proposed recently as an efficient method to increase network throughput by allowing network nodes to combine packets instead of simply forwarding them. However, packet combinations in the netwo...
详细信息
ISBN:
(纸本)9781424464043
network coding has been proposed recently as an efficient method to increase network throughput by allowing network nodes to combine packets instead of simply forwarding them. However, packet combinations in the network may increase delay, complexity and even generate overly redundant information when they are not designed properly. Typically, the best performance is not achieved when all the nodes perform network coding. In this paper, we address the problem of efficiently placing network coding nodes in overlay networks, so that the rate of innovating packets is kept high, and the delay for packet delivery is kept small. We first estimate the expected number of duplicated packets in each network node. These estimations permit to select the nodes that should implement network coding, so that the innovating rate increases. Two algorithms are then proposed for the cases where a central node is aware of the full network statistics and where each node knows the local statistics from its neighbor, respectively. The simulation results show that in the centralized scenario the maximum profit from network coding comes by adding only a few network coding nodes. A similar result is obtained with the algorithm based on local statistics, which moreover performs very close to the centralized solution. These results show that the proper selection of the network coding nodes is crucial for minimizing the transmission delay in streaming overlays.
In this paper we show that mutual exchange of independent information between multiple nodes in a wireless network can be efficiently performed by using network coding. Furthering this conclusion, we propose a mechani...
详细信息
ISBN:
(纸本)9781424416448
In this paper we show that mutual exchange of independent information between multiple nodes in a wireless network can be efficiently performed by using network coding. Furthering this conclusion, we propose a mechanism for network coding based multi-node information exchange in large wireless mesh networks. We also provide a series of techniques, for applying this mechanism in practical environment, and run a group of simulations to evaluate the performance of our design. The simulation results show that our mechanism can substantially improve network throughput.
For a long time,store-and-forward had been the transport mode in network *** other words,information had been regarded as a commodity that only needs to be routed through the network,possibly with replication at the i...
详细信息
For a long time,store-and-forward had been the transport mode in network *** other words,information had been regarded as a commodity that only needs to be routed through the network,possibly with replication at the intermediate *** the late 1990’s,a new concept called network coding fundamentally changed the way a network can be *** the paradigm of network coding,information can be processed within the network for the purpose of *** was demonstrated that compared with store-and-forward,the network throughput can generally be increased by employing network *** then,network coding has made significant impact on different branches of information *** impact of network coding has gone as far as mathematics,physics,and *** expository work aims to be an introduction to this fast-growing subject with a detailed discussion of the basic theoretical results.
Multipath data transmission using network coding scheme in heterogeneous wireless environment enhances information flows with optimal radio resource utility which addresses high traffic demands by end users in next ge...
详细信息
ISBN:
(纸本)9781509044429
Multipath data transmission using network coding scheme in heterogeneous wireless environment enhances information flows with optimal radio resource utility which addresses high traffic demands by end users in next generation wireless and secured traffic flows over the channels. Opportunistic channel allocation and scheduling technique in heterogeneous environment optimizes the traffic flows and network coding before forwarding towards destination significantly enhances the security level of traffics over the networks. This introduces optimal network throughput and minimizes the probability of data theft over multipath data flow architecture. With the availability of micro base stations (MBSs) and remote radio heads (RRHs), multipath traffic flows through MBSs and RRHs over high frequency channels or unlicensed channels increase network throughputs while network coded multicast over the available channels within Heterogeneous Cloud Radio Access networks (H-CRAN) ensures data security over the network. In this paper, network coding scheme was implemented in H-CRAN environment for multipath traffic flow and data security measures were enhanced using network coded transmission resulting increased network throughput, reduced congestion at input buffer of nodes and secured transmission.
In the paradigm of network coding, the nodes in a network are allowed to encode the information received from the input links. With network coding, the full capacity of the network can be utilized. In this paper, we p...
详细信息
In the paradigm of network coding, the nodes in a network are allowed to encode the information received from the input links. With network coding, the full capacity of the network can be utilized. In this paper, we propose a model, call the wiretap network, that incorporates information security with network coding. In this model, a collection of subsets of the channels in the network is given, and a wiretapper is allowed to access any one (but not more than one) of these subsets without being able to obtain any information about the message transmitted. Our model includes secret sharing in classical cryptography as a special case. We present a construction of secure linear network codes that can be used provided a certain graph-theoretic condition is satisfied. We also prove the necessity of this condition for the special case that the wiretapper may choose to access any subset of channels of a fixed size. The optimality of our code construction is established for this special case. Finally, we extend our results to the scenario when the wiretapper is allowed to obtain a controlled amount of information about the message.
In this paper, we investigate the signal-to-noise ratio-based incremental relaying scheme for a two-way relay channel (TWRC) with symbol-based network coding. Under the assumption of error propagation from the relay t...
详细信息
In this paper, we investigate the signal-to-noise ratio-based incremental relaying scheme for a two-way relay channel (TWRC) with symbol-based network coding. Under the assumption of error propagation from the relay to the destination, we analyze the performance of the system in terms of the end-to-end symbol error rate (SER), the average spectral efficiency (ASE), the outage probability, the asymptotic behavior, and the diversity order for M-ary phase-shift keying modulation. All of these performance measures depend on a single threshold employed by the destination. By optimizing this threshold with respect to two different performance measures, we attain two different incremental relaying schemes: 1) the SER-optimal scheme that minimizes the end-to-end SER and 2) the ASE-constrained scheme that minimizes the end-to-end SER under an ASE constraint for the TWRC. In all cases, we derive closed-form expressions for the performance measures and the optimal thresholds. The asymptotic analysis of the system shows that both the SER-optimal and ASE-constrained schemes achieve the full diversity gain at both transceivers. Moreover, both of the schemes are optimal in the sense of the asymptotic ASE. We also propose a class of thresholds that are independent of the network geometry and asymptotically perform the same as the optimal thresholds.
The Internet of Things (IoT) envisions simultaneous sensing and actuation of numerous wirelessly connected devices. Emerging human-in-the-loop applications demand low-latency high-reliability communication protocols, ...
详细信息
ISBN:
(纸本)9781467398145
The Internet of Things (IoT) envisions simultaneous sensing and actuation of numerous wirelessly connected devices. Emerging human-in-the-loop applications demand low-latency high-reliability communication protocols, paralleling the requirements for high-performance industrial control. This paper introduces a wireless communication protocol based on network coding that in conjunction with cooperative communication techniques builds the necessary diversity to achieve the target reliability. The proposed protocol, XOR-CoW, is analyzed by using a communication theoretic delay-limited-capacity frame-work and compared to different realizations of previously proposed protocols without network coding. The results show that as the network size or payload increases, XOR-CoW gains advantage in minimum SNR to achieve the target latency. For a scenario inspired by an industrial printing application with 30 nodes in the control loop, total information throughput of 4.8 Mb/s, 20MHz of bandwidth and cycle time under 2 ms, the protocol can robustly achieve a system probability of error better than 10(-9) with a nominal SNR less than 2 dB with Rayleigh fading.
network coding has been considered as an effective approach to improve the wireless network throughput. However, due to the unreliability of wireless links and the loss of transmission, the decoded node sometimes cann...
详细信息
ISBN:
(纸本)9781467351652;9780769549149
network coding has been considered as an effective approach to improve the wireless network throughput. However, due to the unreliability of wireless links and the loss of transmission, the decoded node sometimes cannot receive enough native packets to succeed in decoding. So how to recovery decoding failure is a key issue, which is considered as the "coding recovery" problem and has become a hot spot. In this paper, a novel coding recovery scheme is proposed, named as CBCR (coding-Based coding Recovery), which makes use of the network coding method to encoded the lost native packets, then retransmit them to the decoded node to help it recovery such decoding failure problem. The experiment is well done on the wireless networks prototype system with several Sun SPOTs, and the results show that CBCR is a promising candidate for coding recovery, and its efficiency and performance are superior to the conventional recovery schemes.
Random packet errors and erasures are common in satellite communications. These types of packet losses could become significant in mobile satellite scenarios like satellite-based aeronautical communications where mobi...
详细信息
ISBN:
(纸本)9783319254791;9783319254784
Random packet errors and erasures are common in satellite communications. These types of packet losses could become significant in mobile satellite scenarios like satellite-based aeronautical communications where mobility at very high speeds is a routine. The current adaptive coding and modulation (ACM) schemes used in new satellite systems like the DVB-RCS2 might offer some solutions to the problems posed by random packet errors but very little or no solution to the problems of packet erasures where packets are completely lost in transmission. The use of the current ACM schemes to combat packet losses in a high random packet errors and erasures environment like the satellite-based aeronautical communications will result in very low throughput. network coding (NC) has proved to significantly improve throughput and thus saves bandwidth resources in such an environment. This paper focuses on establishing how in random linear network coding (RLNC) the satellite bandwidth utilization is affected by changing values of the generation size, rate of packet loss and number of receivers in a satellite-based aeronautical reliable IP multicast communication. From the simulation results, it shows that the bandwidth utilization generally increases with increasing generation size, rate of packet loss and number of receivers.
Our aim is to present a new construction of network coding from algebraic curves over finite fields. Moreover, the Reed-Solomon-like code construction introduced by Ralf Kotter in his paper coding for errors and erasu...
详细信息
ISBN:
(纸本)9781424462520
Our aim is to present a new construction of network coding from algebraic curves over finite fields. Moreover, the Reed-Solomon-like code construction introduced by Ralf Kotter in his paper coding for errors and erasures in random network coding is one simple case of our construction.
暂无评论