Aiming at the anti-eavesdrop security demand and potential safety hazard in Ad hoc, a secure random linear network coding algorithm was proposed. The algorithm has secure source coding and protecting the coding vector...
详细信息
Aiming at the anti-eavesdrop security demand and potential safety hazard in Ad hoc, a secure random linear network coding algorithm was proposed. The algorithm has secure source coding and protecting the coding vectors. The information source secure coding method and optimizing the finite region is defined to guarantee that the information is properly protected. Different coding vectors protecting schemes were designed for adapting security path and without. We applied the secure random linear network coding algorithm in Ad Hoc networks to meet the demand on anti-eavesdrop. The anti-eavesdrop algorithm based on network coding is simulated and analyzed in NS2 platform, the results shown that comparing with the encryption algorithm, the anti-eavesdrop algorithm based on network coding has better performance in end-to-end delay and encryption speed.
We propose a novel distributed coding scheme for broadcast over mobile ad hoc networks. In this scheme, we combine MPR technique with network coding. Only multipoint relay (MPR) nodes perform coding using a rateless c...
详细信息
We propose a novel distributed coding scheme for broadcast over mobile ad hoc networks. In this scheme, we combine MPR technique with network coding. Only multipoint relay (MPR) nodes perform coding using a rateless code. Rather than waiting for a large number of encoded packets to be received before MPR nodes could decode and resend coded packets, we design a new degree distribution that enables the nodes to start decoding even when small number of encoded packets are received. Thus, we decrease the delay introduced at the intermediate nodes. The main advantage of using a rateless code for encoding instead of using a random linear combination of the previously received packets is to reduce significantly the encoding and decoding complexities. We provide a performance evaluation using a simulation to demonstrate the efficiency of our code even under mobility condition.
In today's practical communication networks such as the Internet, information delivery is performed by routing. A promising generalization of routing is network coding. The potential advantages of network coding o...
详细信息
In today's practical communication networks such as the Internet, information delivery is performed by routing. A promising generalization of routing is network coding. The potential advantages of network coding over routing include resource (e.g., bandwidth and power) efficiency, computational efficiency, and robustness to network dynamics. This tutorial article provides an overview of the theory, practice, and applications of network coding.
The fundamental result of linear network coding asserts the existence of an optimal code on an acyclic single-source multicast network when the symbol field is sufficiently large. The restriction to acyclic networks t...
详细信息
The fundamental result of linear network coding asserts the existence of an optimal code on an acyclic single-source multicast network when the symbol field is sufficiently large. The restriction to acyclic networks turns out to stem from the customary structure of the symbol alphabet as a field. Adopting data units belonging to a discrete valuation ring (DVR), that is, a PID with a unique maximal ideal, much of the network coding theory extends to cyclic single-source multicast networks. Convolutional network coding is the instance of DVR-based network coding when the DVR consists of rational power series over the symbol field. Meanwhile, a field can be regarded as a degenerate DVR since it is a PID with the maximal ideal 0. Thus the conventional field-based network coding theory becomes a degenerate version of the DVR-based theory. This paper also delves into the issue of constructing optimal network codes on cyclic networks. Inspired by matroid duality theory, a novel method is devised to take advantage of all existing acyclic algorithms for network code construction. It associates every cyclic network with a quadratically large acyclic network so that essentially every optimal code on the acyclic network directly induces one on the cyclic network.
In this paper we introduce a novel network coding-based Medium Access Control (MAC) protocol for Vehicular Ad Hoc networks (VANETs) that use cooperative Automatic Repeat reQuest (ARQ) techniques. Our protocol coordina...
详细信息
In this paper we introduce a novel network coding-based Medium Access Control (MAC) protocol for Vehicular Ad Hoc networks (VANETs) that use cooperative Automatic Repeat reQuest (ARQ) techniques. Our protocol coordinates the channel access among a set of relays capable of using network coding in order to minimize the number of the total transmissions, thus enhancing the performance of the network in terms of Quality of Service (QoS) metrics. The proposed solution is compared to other cooperative schemes, while analytical and simulation results are provided to evaluate our protocol. (C) 2012 Elsevier Ltd. All rights reserved.
In this article, a new multicast protocol is introduced at the session layer, which is based on network coding and is called the network coding Datagram Protocol (NCDP). The NCDP protocol is specifically designed for ...
详细信息
In this article, a new multicast protocol is introduced at the session layer, which is based on network coding and is called the network coding Datagram Protocol (NCDP). The NCDP protocol is specifically designed for content delivery systems that utilize multicast data transmission from multiple sources. The development of the NCDP packet and its operational logic takes into consideration the variability of the protocols used in conjunction with it, as well as the packet header processing algorithms for routing nodes-coders. Additionally, a virtual laboratory bench is proposed to facilitate research on the operation of the protocol. The article also includes the results of testing the NCDP protocol in networks with butterfly and diamond topologies, with a comparison between simple sequential multicast transmission and network coding transmission.
A recent approach COPE, presented by Katti etal. (Proc. ACM SIGCOMM 2006, pp. 243-254) for improving the throughput of unicast traffic in wireless multihop networks exploits the broadcast nature of the wireless medium...
详细信息
A recent approach COPE, presented by Katti etal. (Proc. ACM SIGCOMM 2006, pp. 243-254) for improving the throughput of unicast traffic in wireless multihop networks exploits the broadcast nature of the wireless medium through opportunistic network coding. In this paper, we analyze throughput improvements obtained by COPE-type network coding in wireless networks from a theoretical perspective. We make two key contributions. First, we obtain a theoretical formulation for computing the throughput of network coding on any wireless network topology and any pattern of concurrent unicast traffic sessions. Second, we advocate that routing be made aware of network coding opportunities rather than, as in COPE, being oblivious to it. More importantly, our model considers the tradeoff between routing flows close to each other for utilizing coding opportunities and away from each other for avoiding wireless interference. Our theoretical formulation provides a method for computing source destination routes and utilizing the best coding opportunities from available ones so as to maximize the throughput. We handle scheduling of broadcast transmissions subject to wireless transmit/receive diversity and link interference in our optimization framework. Using our formulations, we compare the performance of traditional unicast routing and network coding with coding-oblivious and coding-aware routing on a variety of mesh network topologies, including some derived from contemporary mesh network testbeds. Our evaluations show that a route selection strategy that is aware of network coding opportunities leads to higher end-to-end throughput when compared to coding-oblivious routing strategies.
Privacy threat is one of the critical issues in multihop wireless networks, where attacks such as traffic analysis and flow tracing can be easily launched by a malicious adversary due to the open wireless medium. Netw...
详细信息
Privacy threat is one of the critical issues in multihop wireless networks, where attacks such as traffic analysis and flow tracing can be easily launched by a malicious adversary due to the open wireless medium. network coding has the potential to thwart these attacks since the coding/mixing operation is encouraged at intermediate nodes. However, the simple deployment of network coding cannot achieve the goal once enough packets are collected by the adversaries. On the other hand, the coding/mixing nature precludes the feasibility of employing the existing privacy-preserving techniques, such as Onion Routing. In this paper, we propose a novel network coding based privacy-preserving scheme against traffic analysis in multihop wireless networks. With homomorphic encryption on Global Encoding Vectors (GEVs), the proposed scheme offers two significant privacy-preserving features, packet flow untraceability and message content confidentiality, for efficiently thwarting the traffic analysis attacks. Moreover, the proposed scheme keeps the random coding feature, and each sink can recover the source packets by inverting the GEVs with a very high probability. Theoretical analysis and simulative evaluation demonstrate the validity and efficiency of the proposed scheme.
In this paper, we investigate transmission techniques for a fundamental cooperative cognitive radio network, i.e., a cognitive radio system where a Secondary user may act as relay for messages sent by the Primary user...
详细信息
In this paper, we investigate transmission techniques for a fundamental cooperative cognitive radio network, i.e., a cognitive radio system where a Secondary user may act as relay for messages sent by the Primary user, hence offering performance improvement of Primary user transmissions, while at the same time obtaining more transmission opportunities for its own transmissions. Specifically, we examine the possibility of improving the overall system performance by employing network coding techniques. The objective is to achieve this while affecting Primary user transmissions only positively, namely: 1) avoid network coding operations at the Primary transmitter, hence avoiding increase of its storage requirements and keeping its complexity low, 2) keep the order of packets received by the Primary receiver the same as in the non cooperative case and 3) induce packet service times that are stochastically smaller than the packet service times induced in the non-cooperative case. A network coding algorithm is investigated in terms of achieved throughput region and it is shown to enlarge Secondary user throughput as compared to the case where the Secondary transmitter acts as a simple relay, while leaving the Primary user stability region unaffected. A notable feature of this algorithm is that it operates without knowledge of channel and packet arrival rate statistics. We further present a second network coding algorithm which increases the throughput region of the system under certain conditions on system parameters;however, the latter algorithm requires knowledge of channel and packet arrival rate statistics.
In this paper, we study a flow control problem considering network coding in wireless ad-hoc networks with multi-path routing. As a network coding scheme, we use XOR network coding, in which each node bitwise-XORs som...
详细信息
In this paper, we study a flow control problem considering network coding in wireless ad-hoc networks with multi-path routing. As a network coding scheme, we use XOR network coding, in which each node bitwise-XORs some packets received from different sessions, and then broadcasts this coded packet to multiple nodes in a single transmission. This process can reduce the number of required transmissions, and thus can improve network utilization, especially if it is used with appropriate network coding-aware protocols. Considering this XOR network coding, we formulate an optimization problem for flow control that aims at maximizing network utility. By solving the optimization problem in a distributed manner, we implement a distributed flow control algorithm that provides the optimal transmitting rate on each of multiple paths of each session. The simulation results show that our flow control algorithm performs well exploiting the advantages of network coding and provides significant performance improvement.
暂无评论