The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
With the envisioned era of Internet of Vehicles (IoVs), all aspects of Intelligent Transportation Systems (ITS) will be connected to improve transport safety, relieve traffic congestion, reduce air pollution, enhance the comfort of transportation and significantly reduce road accidents. In IoVs, regular exchange of current position, direction, velocity, etc., enables mobile vehicles to predict an...
Although, it was shown that NC is a promising technique to improve the throughput; especially for multicast environment; it also bears negative side-effects (e.g., high decoding delay). Since streaming video are usually subject to strict delay constraints, high decoding delay must be resolved to enhance the performance of the NC schemes. To overcome this issue, this paper presents a new scheme named...
As a specific example of network coding, the butterfly network often represents the networks with bottlenecks. In this paper, we propose a typical butterfly quantum network coding scheme based on remote state preparation of arbitrary two-qubit states with the assistance of GHZ channels. Firstly, in a butterfly network, each source node simultaneously performs two appropriate projective measurements...
The individual applications of network coded opportunistic routing and successive interference cancellation have been proven with significant improvement on throughput performance of wireless multi-hop networks, but there lacks practical optimization on their combination application. Based on a TDMA system, this paper models the throughput maximization as network utility function maximization problem...
The individual applications of network coded opportunistic routing and successive interference cancellation have been proven with significant improvement on throughput performance of wireless multi-hop networks, but there lacks practical optimization on their combination application. Based on a TDMA system, this paper models the throughput maximization as network utility function maximization problem...
The goal of this paper is two-fold. First, to expand an opportunistic network coding protocol for wireless networks, called PlayNCool, in order to incorporate new mechanisms to improve performance in the presence of packet losses. In particular, exploiting additional helper nodes to improve the quality of each link and even across neighbouring links and using simulations to show that an additional...
In this paper, we study the cache-aided cloud radio access network (C-RAN) with wireless fronthaul, where multiple cache-enabled users are served by multiple cache-enabled transmitters that are connected to a cloud processor through a wireless fronthaul link. We put forth a caching-and-delivery scheme that combines network-coded fronthaul transmission with cache-aided interference management. By broadcasting...
We study the problem of reducing the communication overhead from a wire-tap channel or storage system where data is encoded as a matrix, when more columns (or their linear combinations) are available. We present its applications to universal secure linear network coding and secure distributed storage with crisscross erasures. Our main contribution is a method to transform coding schemes based on linear...
In the network coding, we discuss the effect by sequential error injection to information leakage. We show that there is no improvement when the network is composed of linear operations. However, when the network contains non-linear operations, we find a counterexample to improve Eve's obtained information. Further, we discuss the asymptotic rate in the linear network under the secrecy and robustness...
We study the broadcast transmission of a single file to an arbitrary number of receivers in a wireless one-hop setting, using random linear network coding (RLNC). In contrast to similar studies, we apply RLNC within segments of the file. In a previous study, we showed that this method can achieve near optimal file transfer completion time while tackling the main drawbacks of RLNC; increased decoding...
Network-coded (NCed) automatic repeat request (ARQ) techniques have been shown to provide significant throughput improvements over basic ARQ systems in two-way wireless systems. Most results derived so far, however, used the assumption of no extra overhead. In practical systems, NCed-ARQ requires more information exchange between base-station and end-nodes, and therefore it is crucial to study the...
MPTCP is a TCP extension that enables transparent multipath for multihomed hosts. However, MPTCP is subject to head-of-line blocking, a problem that degrades delay and throughput. This problem is especially critical when used in wireless environments. On wireless, unreliable links, for example, traffic can get stalled on one path, slowing down the entire flow. A related problem is rescheduling the...
Since the first applications of network coding, there has been an increasing interest in this technology due to the promising benefits regarding efficiency. Moreover, network coding already provides a certain level of inherent security called algebraic security. Since this inherent security is not sufficient against a stronger attacker, a number of confidential network coding schemes has been developed...
Multi-path TCP has recently shown great potential to take advantage of the rich path diversity in data center networks (DCN) to increase transmission throughput. However, the small flows, which take a large fraction of data center traffic, will easily get a timeout when split onto multiple paths. Moreover, the dynamic congestions and node failures in DCN will exacerbate the reorder problem of parallel...
In this paper queue stability in a single-hop wireless multicast networks over erasure channels is analyzed. First, a queuing model consisting of several sub-queues is introduced. Under the queueing stability constraint, we adopt Lyapunov optimization model and define decision variables to derive a network coding based packet scheduling algorithm, which has significantly less complexity and shorter...
Multimedia streaming applications have high throughput requirement and stringent Quality-of-Service (QoS) guarantee. In this paper, we aim at designing a novel transmission and retransmission scheme, which integrates both the Network Coding and the Superposition Coding for wireless video broadcast networks by packet-erasure channel. Specifically, the Scalable Video Coding (SVC) technology is introduced...
Random linear network coding (RLNC) has been shown to efficiently improve the network performance in terms of reducing transmission delays and increasing the throughput in broadcast and multicast communications. However, it can result in increased storage and computational complexity at the receivers end. In our previous work we considered the broadcast transmission of large file to N receivers. We...
The recent research studies showed that inter-layered network coding is a promising approach to provide the unequal error protection for scalable video multicast under the channel heterogeneity. The selection of the optimal transmission distribution performed at eNB increases the system performance with the cost of time and computational complexities. In this paper, we propose an optimal transmission...
The rapid penetration of cloud and distributed computing technology is accelerating the need for one-to-many file transfers for sharing and duplicating data and applications among distributed data centers in an efficient manner. The purpose of our work is to develop a scheme to transfer a largesized file from a single sender to multiple receivers over an OpenFlow-based network as quickly as possible...
This paper presents a smooth way to include Network Coding in the Constrained Application Protocol (CoAP) for large resource transmissions. Devices in the Internet of Things usually communicate using short messages with little data. In some cases, for example, requesting firmware updates, bigger resources need to be transferred. CoAP's recently finalized blockwise transfer scheme can handle large...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.