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.
Due to asynchronous packet transmissions and rate mismatch among different coding flows in existing opportunistic network coding architectures, such as COPE, the amount of packets which can be coded together may be insufficient and thus the performance gain of network coding cannot be fully exploited. One feasible solution for this problem is to make coding nodepurposely delay some packet transmissions...
This paper proposes KAR (Key-for-Any-Route), a new intra-domain resilient routing system in which edge-nodes set a route ID to select any existing route as an alternative to safely forward packets to their destination. In KAR routing system, a route is defined as the remainder of the division between a route ID and a set of switch IDs along the path(s) between a pair of nodes. KAR-enabled switches...
Random Linear Network coding (RLNC) has emerged as a promising solution for reliable multimedia delivery over mobile cellular networks. In this paper, we deploy Application Layer-RLNC (AL-RLNC) on the top of the existing Hybrid Automatic Repeat Request (HARQ) in 4G Long Term Evolution (LTE) networks. A simple implementation scenario composed of a user equipment, an eNB and a remote host is considered...
How to effectively distribute and share increasingly large volumes of data in large-scale network applications is a key challenge for Internet infrastructure. Although NDN, a promising new future internet architecture which takes data oriented transfer approaches, aims to better solve such needs than IP, it still faces problems like data redundancy transmission and inefficient in-network cache utilization...
In this paper, we investigate the performance of the so-called Cross Network operating under diverse Network Coding (NC) techniques. We study the impact of Medium Access Control (MAC) layer fairness on the throughput performance of the network for the cases of pure relaying, digital NC with and without overhearing and physical layer NC with and without overhearing. We provide a comparison among these...
In this paper, we aim at protecting the privacy of the communicating parties while ensuring the authenticity of source nodes. In particular, we exploit intra-flow network coding to preserve the anonymity of communicating parties. Towards this objective, we propose an anonymity preservation scheme, namely closed group anonymity (CGA) that preserves the anonymity of the communicating parties via mixing...
Network coding encourages in-network mixing of information flows for enhanced network capacity, particularly for multicast data dissemination. This work aims to explore properties in the underlying network topology for efficient network coding solutions, including efficient code assignment algorithms and efficient encoding/decoding operations that come with small base field sizes. The following cases...
While network coding can potentially provide significant throughput benefits by combining packets prior to forwarding them, the achievable gains are directly related to the coding opportunities at a relay that performs encoding. If the relay does not have packets destined for distinct destinations, that can be encoded together, the network coding gains could be marginal. Towards increasing the opportunities...
Network coding is a promising technology that has been shown to improve throughput in wireless mesh networks. In this paper, we compare the analytical and experimental performance of COPE-style network coding in IEEE 802.11 ad-hoc networks. In the experiments, we use a lightweight scheme called CATWOMAN that can run on standard WiFi hardware. We present an analytical model to evaluate the performance...
Traditional method of solving group communications problem is by placing a super source with unlimited bandwidth to all sources. In this paper, we show that this method cannot guarantee the fairness within different sources for routing. Also in certain scenarios, the method can lead to wrong conclusion of network achieving higher throughput than it can actually deliver. Two algorithms are presented,...
In this paper a new method for the identification of sub-topologies, suitable for the implementation of network coding in a wireless mesh network is presented. When nodes are positioned in certain locations relative to each other they create an environment where network coding opportunities can be identified for instances where certain data flows occurs between nodes in that environment. If nodes...
We present a novel Address-Event Representation (AER) transmitter circuit to communicate pulses of neural activity (spikes) within a neuromorphic system. AER circuits allow an ensemble of neurons to achieve large scale time-multiplexed connectivity through a shared communication channel. Our design makes use of token-ring mutual exclusion where two circulating tokens in a 2D array of neurons provide...
This paper describes CoZi, a new packet scheduling mechanism for large scale ZigBee networks. CoZi aims at enhancing the reliability of the data delivery and the bandwidth utilization of the network. Based on simple network coding, instead of the classic packet forwarding, our algorithm takes advantage of the shared nature of the wireless medium as well as the cluster-tree topology of IEEE 802.15...
In this paper, we consider the problem of minimizing the resources used for network coding (MRUNC) while achieving the desired throughput in a multicast system. The problem of minimizing the number of network coding links is NP-hard. In this paper we propose a low-complexity Estimation of Distribution Algorithm (EDA) for MRUNC. Our EDA is applicable to the network with and without cycles. The numerical...
Previous works on network coding have mainly focused on the throughput and the cost of bandwidth, but few cares about saving resources used to code. In this paper we present a decentralized algorithm to construct network coding solutions, which reduces the number of coding nodes. We showed the dynamic topology greatly affected the network coding solutions, which may improve coding solution or reduce...
This paper proposes a new ring structure of network coding (RSNC) based on existing network coding topology, enlarging the field of application and reducing the complexity of coding. On the basis of real-time monitoring and dynamic allocation for network bandwidth, RSNC is applied to the CERNET backbone network. The route of the packet is decided by the source node when it sends data packet and it...
We consider the benefits of coding in wireless networks, specifically its role in exploiting the local broadcast property of the wireless medium. We first argue that for unicast, the throughput achieved with network coding is the same as that achieved without any coding. This argument highlights the role of a general max-flow min-cut duality and is more explicit than previous proofs. The maximum throughput...
Wireless multi-hop networks often rely on the use of IEEE 802.11 technology. Despite of the robustness of the IEEE 802.11 Distributed Coordination Function (DCF) for working in various network scenarios, it has been proven that critical inefficiencies can arise in the case of multi-hop packet forwarding. In this paper, we propose a MAC scheme, based on the visualization of the Point Coordination Function,...
We consider the problem of minimizing the number of network coding nodes in a multicast scenario, with the purpose of minimizing the overall encoding cost. We give a heuristic polynomial-time algorithm to approximate the minimum number of network coding nodes required to reach a given flow rate and show that it performs well in practice when the number of receivers is small. We also find that many...
Recently, network coding has gained much popularity and several practical routing schemes have been proposed for wireless mesh networks that exploit interflow network coding for improved throughput. However, the evaluation of these protocols either assumed simple topologies and traffic patterns such as opposite flows along a single chain, or small, dense networks which have ample overhearing of each...
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.