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.
This project aims to improve the throughput, energy consumption and overhead of vehicular ad hoc network (VANET) by optimising the network coding (NC) using Genetic Algorithm (GA). VANET shows a promising technology as it could enhance the traffic efficiency and promote traffic safety on the road systems. The conventional store-and-forward transmission protocol used in the intermediate node(s) simply...
In wireless coded cache network, data contents are cached in a number of mobile devices using an erasure correcting code, and a user retrieves content from other mobile devices using device-to-device communication. In this paper, we consider the repair problem when multiple devices that cache data contents fail or leave the network. By exploiting the wireless broadcast nature, we formulate the repair...
This paper presents the joint design of network coding and backpressure algorithm for cognitive radio networks and its implementation with software-defined radios (SDRs) in a high fidelity network emulation testbed. The backpressure algorithm is known to provide throughput optimal solutions to joint routing and scheduling for dynamic packet traffic. This solution applies to cognitive radio networks...
This paper presents an energy-efficient solution to overcome packet loss in Wireless Sensor Networks (WSNs) by adding seed-based Random Linear Network Coding to MQTT for Sensor Networks (MQTT-SN). Whereas most sensors integrated in common WSN devices consume little energy, using the radio is costly. To increase battery lifetime, devices try to minimize their radio uptime, while still satisfy timeliness...
Named Data Networking represents a novel and an alternative approach to the current host based Internet architecture, in which the content becomes the core of the communication model. In this paper, we propose to improve named data networking robustness and throughput performances by introducing network coding functionalities. We also propose an optimized authentication model based on homomorphic...
The so-called Ring Road approach has been identified as interesting application area of DTN protocols. It leverages low-cost low-earth orbit satellites in order to inter-connect isolated networks with the Internet. Network coding may be used to introduce redundancy to address e.g. lossy links. In this paper, a simulator setup for network coding in Ring Road networks is presented and discussed. The...
In this paper wireless communications network is considered to transmit source information to destination. N number sources transmitting data to a destination receiver, through M relays nodes by employing random linear network coding (RLNC). Two methods of failure decoding probability on performance of wireless communication are explained and discussed in this paper. The major parameter that will...
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...
In this paper we revisit the problem of deriving the expected number of transmissions for multicasting random linear coded (RLC) packets on single-hop wireless channels. We show by deriving the closed form expression for an instance of the problem that previous analytical formulation does not accurately model the true expected number of transmissions, especially for smaller finite field size. Our...
Energy is a scarce resource in mobile ad hoc networks (MANETs). Network coding (NC) has been proposed recently as a means to reduce the number of transmissions and energy consumption. In this paper, we introduce energy consumption control into network coding to further enhance its performance. We propose a Sliding Window Network Coding for Energy Efficient in MANETs (SWNC-EE). The performance of the...
Network coding has shown the promise of significance throughput improvement. In this paper, we study the throughput of two-hop wireless network coding and explore how the maxi-mum throughput can be achieved under a random medium access scheme. In this paper, the problem of the performance of COPE type network coding under dual source coding architecture is solved. An Embedded Markov Chain Model for...
Energy efficiency and reliability are a pair of the most important factors in wireless sensor networks (WSNs). Recent research results have demonstrated that the previously suggested scheme of the joint network-coding-compressive-sensing can greatly improve the energy efficiency and the communication reliability of WSNs. In this paper, we propose a practical scheme, Non-Binary Joint Network-Coding...
The neighbourhood area network (NAN) in smart grid (SG) is responsible for data exchange from smart meters (SMs) to the control center and vice versa. Efficient and reliable communication from a control center to individual SMs is an essential part of enabling a green power supply system. Different packet loss at SMs causes information delay. Network coding (NC) is a promising technique to improve...
The decoding problem is addressed in this paper for the scenario that convolutional codes are employed at the source node of the network with linear or convolutional network coding for error correction. Since network errors may disperse or neutralize due to network coding, decoding cannot be done at sink nodes merely based on the minimum Hamming distance between the received and sent sequence. Source...
The capacity region of 1-to-K broadcast packet erasure channels with ACK/NACK is known for some scenarios, e.g., K ≤ 3, etc. However, existing achievability schemes either require knowing the target rate R in advance, and/or have a complicated description of the achievable rate region that is difficult prove whether it matches the capacity or not. This work proposes a new network coding protocol with...
The principal mission of Multi-Source Multicast (MSM) is to disseminate all messages from all sources in a network to all destinations. MSM is utilized in numerous applications. In many of them, securing the messages disseminated is critical. A common secure model is to consider a network where there is an eavesdropper which is able to observe a subset of the network links, and seek a code which keeps...
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...
We consider a delay-constrained streaming model for zero-error communications and show that under this model, network coding and index coding problems are code equivalent. That is, any streaming network coding instance can be efficiently mapped to a corresponding acyclic streaming index coding instance such that an index code for the latter can be efficiently transformed into a network code for the...
Uplink and downlink cloud radio access networks are modeled as two-hop K-user L-relay networks, whereby small base-stations act as relays and are connected to a central processor via orthogonal links of finite capacity. Simplified versions of noisy network coding and distributed decode-forward are used to establish inner bounds on the capacity region for uplink and downlink communications, respectively...
Network coding is a fundamental tool that enables higher network capacity and lower complexity in routing algorithms, by encouraging the mixing of information flows in the middle of a network. Implementing network coding in the core Internet is subject to practical concerns, since Internet routers are often overwhelmed by packet forwarding tasks, leaving little processing capacity for coding operations...
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.