Physical-Layer network coding (PLNC) was first introduced as a solution to increase the throughput of a two-way relay channel communication. Unlike most wireless communication techniques which try to avoid collisions,...
详细信息
Physical-Layer network coding (PLNC) was first introduced as a solution to increase the throughput of a two-way relay channel communication. Unlike most wireless communication techniques which try to avoid collisions, PLNC allows two simultaneous transmissions to a common receiver. In basic topologies, this technique has been shown to significantly enhance the throughput performance compared to classical interference-free communications. However, quantifying the impact of PLNC in large multi-hop networks remains an open question. In this work, we introduce the first theoretical framework that, given a particular network topology and traffic matrix, can evaluate the optimal network throughput subject to a fairness constraint relative to the initial demand of each flow, when PLNC is adopted. Based on linear programming, our solution ensures to respect the particularities imposed by PLNC. We use this framework to evaluate three state-of-the-art PLNC schemes across a variety of topologies and traffic matrices. Our numerical analysis reveals that while in simple toy topologies PLNC can significantly increase the network throughput, in large topologies the verdict is mixed. For certain topologies and traffic patterns adopting PLNC can double the throughput while in others, depending on the scheme used for implementing PLNC, the gain can be as high as 60 percent or as low as 0 percent when compared to traditional interference-free transmissions.
A large volume of data is generated by traffic surveillance devices such as cameras and sensors integrated into an intelligent transportation system (ITS), a subfield of the Internet of Things (IoT). We argue that net...
详细信息
A large volume of data is generated by traffic surveillance devices such as cameras and sensors integrated into an intelligent transportation system (ITS), a subfield of the Internet of Things (IoT). We argue that network coding can be applied to leverage on an emerging fog architecture that relies on edge resources, to achieve higher throughput, saving up network bandwidth, and provide resilience to link failures, while also achieving simple obfuscation against wire-tapping attacks by linearly combining the source packets. There are two broad linear network coding paradigms in the literature - deterministic and random network coding, each with their own strengths and limitations. With the aid of software-defined network (SDN), we rethink about the possibility of applying a hybrid approach to deal with networks at different scales. Under network conditions that reflect expected network properties of an ITS, our simulation results show that the proposed hybrid approach performs better than other alternates. (C) 2019 Elsevier B.V. All rights reserved.
This letter proposes to optimize the effective data rate of random linear network coding (RLNC) over finite-buffer burst-erasure relay links. An absorbing Markov chain model is exploited to analyze the expected transm...
详细信息
This letter proposes to optimize the effective data rate of random linear network coding (RLNC) over finite-buffer burst-erasure relay links. An absorbing Markov chain model is exploited to analyze the expected transmission completion times of using different finite field sizes. Through analysis and simulations, we show that the RLNC effective data rate considering the coefficient overhead can be maximized by optimization over the field size for coding.
As an important technology in next-generation networks, mobile edge computing (MEC) can bring high-speed intelligent network services to users. However, planning MEC file transmission represents a problem to be urgent...
详细信息
As an important technology in next-generation networks, mobile edge computing (MEC) can bring high-speed intelligent network services to users. However, planning MEC file transmission represents a problem to be urgently solved. In addition, network coding has been an emerging technology in recent years, and certain forms of cooperation with wireless relays can improve the transmission efficiency of network data. In this paper, we focus on cooperation in MEC intelligent cache with network coding. First, we built a MEC intelligent cache analysis platform that includes multiple algorithms;it can predetermine which streaming media files should be stored in the limited storage space of the MEC device to provide users the most efficient intelligent network experience. The platform's decision algorithm includes an innovative composite recommendation algorithm that is more comprehensive than the traditional recommendation algorithm. The MEC file extracted from the core network is then simultaneously transmitted to the edge with the real-time normal communication file using an innovative network coding and wireless relay cooperation method;with that, the files stored in the MEC can be cached to the edge. The normal network communication process does not require additional slot costs. The simulation results show that the proposed cooperation scheme can effectively improve network data transmission, improve users' average access rate, and offer users better intelligent network services.
With the rapid growth of Internet of Things (IoT), integrating a variety of IoT can result in novel applications. However, IoT devices are often deployed in an open environment where IoT are inclined to be malfunction...
详细信息
With the rapid growth of Internet of Things (IoT), integrating a variety of IoT can result in novel applications. However, IoT devices are often deployed in an open environment where IoT are inclined to be malfunctioned. Although data reliability can be achieved by data recovery with conventional replication, the communication between IoT is susceptible to eavesdropping. Therefore, in this paper, we study the eavesdropping prevention of data repair in IoT environments based on network coding. We theoretically derive the relation between security level and storage in heterogeneous IoT systems. To further reduce the repair bandwidth, we exploit recurrent neural network for the storage failure prediction. Under the condition when failure probability and workloads of storage devices are considered, two allocation algorithms are proposed to avoid data repair. Finally, we show the relation between storage cost and reliability with different numbers of IoT devices. Experimental results manifest that the proposed allocation algorithms can outperform the baseline case by 18.4% in terms of the security level.
A Wireless Mesh network (WMN) is a multi-hop network that gains the benefits of low deployment cost, fast access speed, expanded service coverage and large network capacity. However, the multi-hop communication in WMN...
详细信息
A Wireless Mesh network (WMN) is a multi-hop network that gains the benefits of low deployment cost, fast access speed, expanded service coverage and large network capacity. However, the multi-hop communication in WMNs limits the throughput capacity due to increased number of packet transmissions. As a result, network coding is a recently emerged paradigm that can enhance the throughput capacity (i.e. network throughput) by minimizing the quantity of network workload and at the same time it ensures the data transfer among all the users. Further, with network coding the transmission effectiveness of a node can be improved by encoding (combining) several packets collectively and verifies whether the coding strategies is satisfied or not. Subsequently, if the coding strategies are satisfied then it transmits only the resultant encoded packet to the desired destination. In other words, network coding can improve the network throughput in WMNs by minimizing the transmission counts needed to transfer several packets to the destination. It should be noted that, while employing network coding in WMNs there are several challenges that should be compensated such as (i) identifying packets that can be combined (encoded) collectively and (ii) integrating the coding strategies in routing protocols. In this paper, we proposed a new mesh routing protocol that integrates network-coding called as network coding Aware Routing (Net-CART) protocol. Therefore, to enjoy the whole benefit of network coding a Net-CART protocol uses the innovative routing metric called Code-Aware and Load-Aware Routing Metric. Additionally, to identify numerous coding structures' and to support number of packet encodings' an improved set of coding strategies known as Enhanced Universal coding Strategies is also proposed. The proposed Net-CART protocol comprising an improved set of coding strategies and a new routing-metric considers both the coding-opportunities and network workload. The simulation study ca
It has been proven that network coding can provide significant benefits to P2P networks. In recent years, many schemes have been designed to provide low-cost network coding strategies for P2P content distribution syst...
详细信息
It has been proven that network coding can provide significant benefits to P2P networks. In recent years, many schemes have been designed to provide low-cost network coding strategies for P2P content distribution systems. In this paper, firstly, we propose a low-cost intra-generation network coding strategy. By designing the upper triangular encoding matrix, we can reduce the computational complexity of encoding and decoding. Secondly, a linear dependency detection method for encoded blocks is proposed. We use the postponement strategy and the loop self-checking strategy to reduce the probability of receiving linearly dependent encoded blocks. At last, we simulate the distribution system using the above strategies on the simulator and compare it to other systems. From the simulation results, the performance of our system is better than that of the other two systems. Taking the average download time as an example, the average download time of our system is 21.0% and 3.17% lower than other schemes respectively, which effectively improves the distribution efficiency.
Opportunistic routing and network coding are two promising techniques that have been proposed for wireless networks. These techniques have significantly improved the performance of multi-hop wireless networks by utili...
详细信息
Opportunistic routing and network coding are two promising techniques that have been proposed for wireless networks. These techniques have significantly improved the performance of multi-hop wireless networks by utilizing the broadcast nature of wireless media and optimizing the capacity of lossy wireless networks. Recent research has shown that the combination of opportunistic routing and network coding in a single joint protocol outperforms each of them individually. This article explains the motivation and interaction effect of the joint protocols. We provide a taxonomy of joint protocols and illustrate the benefit and cost by highlighting their fundamental components and comparing different solutions. We also present a conclusion along with the outline of future research direction.
A combinatorial framework for adversarial network coding is presented. Channels are described by specifying the possible actions that one or more (possibly coordinated) adversaries may take. Upper bounds on three noti...
详细信息
A combinatorial framework for adversarial network coding is presented. Channels are described by specifying the possible actions that one or more (possibly coordinated) adversaries may take. Upper bounds on three notions of capacity-the one-shot capacity, the zero-error capacity, and the compound zero-error capacity-are obtained for point-to-point channels, and generalized to corresponding capacity regions appropriate for multi-source networks. A key result of this paper is a general method by which bounds on these capacities in point-to-point channels may be ported to networks. This technique is illustrated in detail for Hamming-type channels with multiple adversaries operating on specific coordinates, which correspond, in the context of networks, to multiple adversaries acting on specific network edges. Capacity-achieving coding schemes are described for some of the considered adversarial models.
In today's datacenter topologies, there exist multiple equal-cost paths between each pair of communicating virtual machines. Yet, splitting flows and routing them along multiple paths may lead to packet reordering...
详细信息
In today's datacenter topologies, there exist multiple equal-cost paths between each pair of communicating virtual machines. Yet, splitting flows and routing them along multiple paths may lead to packet reordering, which may affect the performance of TCP. In this paper, we propose Promenade, a new protocol that uses random network coding to mitigate the negative effects of packet reordering, while at the same time achieving weighted proportional fairness in bandwidth allocation across different tenants. To achieve weighted proportional fairness when allocating bandwidth to tenants, the problem of rate control is formulated as a convex optimization problem, and Promenade uses its distributed solution as a theoretical foundation to design its bandwidth allocation protocol. With our real-world implementation of Promenade in the Mininet testbed, we are able to show that Promenade is able to achieve weighted proportional fairness in its rate control when individual flows are split into multiple paths.
暂无评论