Recently, based on the homomorphic signatures, the authentication schemes, such as homomorphic subspace signature (HSS) and key predistribution-based tag encoding (KEPTE), have been proposed to resist against pollutio...
详细信息
Recently, based on the homomorphic signatures, the authentication schemes, such as homomorphic subspace signature (HSS) and key predistribution-based tag encoding (KEPTE), have been proposed to resist against pollution attacks in network coding. In this paper, we show that there exists an efficient multigeneration pollution attack on HSS and KEPTE. In particular, we show that using packets and their signatures of different generations, the adversary can create invalid packets and their corresponding signatures that pass the verification of HSS and KEPTE at intermediate the nodes as well as at the destination nodes. After giving a more generic attack, we analyze the cause of the proposed attack. We then propose the improved key distribution schemes for HSS and KEPTE, respectively. Next, we show that the proposed key distribution schemes can combat against the proposed multi-generation pollution attacks. Finally, we analyze the computation and communication costs of the proposed key distribution schemes for HSS and KEPTE, and by implementing experiments, we demonstrate that the proposed schemes add acceptable burden on the system.
In this paper, we propose INCP, inter-flow network coding protocol, for wireless mesh networks. INCP is designed with the concept of Layered Approach. It acts as a distinct layer above the MAC and has close cooperatio...
详细信息
In this paper, we propose INCP, inter-flow network coding protocol, for wireless mesh networks. INCP is designed with the concept of Layered Approach. It acts as a distinct layer above the MAC and has close cooperation with IP layer. INCP exploits the opportunities of network coding through multiple unicast sessions to decrease the number of transmissions, thereby increasing the aggregated throughput. Unlike most prior work that is mainly theoretical, INCP addresses the practical issues of network coding such as impact of lossy links, enabling/disabling RTS/CTS mechanism, packet size and its variation. We consider a retransmission mechanism to ensure a reliable broadcasting. We analyze the cost of this approach by providing a theoretical formulation for the amount of required bandwidth for successful broadcasting a coded packet to n neighbors. Further, we examine the coding gain for lossy networks by considering the ETX metric for routing in addition to traditionally shortest-path metric. The results, implemented in ns-3, show that not only INCP increases network throughput, but also improves the fairness of the IEEE 802.11 MAC. Moreover, the gain for real MAC is greater than the theoretical gain in most cases. The performance gain of INCP reaches up to several folds depending on the traffic model and congestion level.
Mechanisms that can cope with unreliable wireless channels in an efficient manner are required due to the increasing number of resource constrained devices. Concurrent use of multiple communications technologies can b...
详细信息
Mechanisms that can cope with unreliable wireless channels in an efficient manner are required due to the increasing number of resource constrained devices. Concurrent use of multiple communications technologies can be instrumental towards improving services to mobile devices in heterogeneous networks. In our previous work, we developed an optimization framework to generate channel-aware transmission policies for multi-homed devices under different cost criteria. Our formulation considers network coding as a key technique that simplifies load allocation across multiple channels and provides high resiliency under time-varying channel conditions. This paper seeks to explore the parameter space and identify the operating regions where dynamic coded policies offer most improvement over static ones in terms of energy consumption and channel utilization. We leverage meta-heuristics to find different local optima, while also tracking the intermediate solutions to map operating regions above 3 dB and 5 dB. Our results show a large set of relevant configurations where high resource efficiency can be obtained with the proposed transmission mechanisms. (C) 2016 Elsevier B.V. All rights reserved.
network coding can significantly enhance reliability and throughput in wireless networks. However, network coding comes with a considerable cost in terms of computing, storage, and power consumption. In this paper, we...
详细信息
ISBN:
(纸本)9781509043729
network coding can significantly enhance reliability and throughput in wireless networks. However, network coding comes with a considerable cost in terms of computing, storage, and power consumption. In this paper, we propose a constraint-aware distributed algorithm which considers the contribution of each node in generating coded packets and opportunistically makes use of multiple available paths to forward unicast traffic while providing a reliable data delivery. We demonstrate the effect of the scheme, particularly in terms of overhead, through simulation in different network topologies.
In this paper, we propose an algorithm for network coding that can be deployed in single-queue with single-memory devices in a butterfly network. In order to overcome the decoding failure rates incurred by the same so...
详细信息
ISBN:
(纸本)9781509047499
In this paper, we propose an algorithm for network coding that can be deployed in single-queue with single-memory devices in a butterfly network. In order to overcome the decoding failure rates incurred by the same source data, we jointly consider network coding strategy and a typical store and forward routing algorithm. We actually implement the proposed algorithm and show that the proposed algorithms outperform network coding only strategy in terms of decoding failure rate.
network coding is commonly used to improve the energy efficiency of network-wide broadcasting in wireless multi-hop networks. In this work, we focus on XOR-based broadcasting in mobile ad hoc networks with multiple so...
详细信息
network coding is commonly used to improve the energy efficiency of network-wide broadcasting in wireless multi-hop networks. In this work, we focus on XOR-based broadcasting in mobile ad hoc networks with multiple sources. We make the observation that the common approach, which is to benefit from the synergy of XOR network coding with a CDS-based broadcast algorithm, suffers performance breakdowns. After delving into the details of this synergy, we attribute this behavior to an important mechanism of the underlying broadcast algorithm, known as the "termination criterion". To tackle the problem, we propose a termination criterion that is fully compatible with XOR coding. In addition to that, we revisit the internals of XOR coding. We first enhance the synergy of XOR coding with the underlying broadcast algorithm by allowing each mechanism to benefit from information available by the other. In this way, we manage to improve the pruning efficiency of the CDS-based algorithm while at the same time we come up with a method for detecting coding opportunities that has minimal storage and processing requirements compared to current approaches. Then, for the first time, we use XOR coding as a mechanism not only for enhancing energy efficiency but also for reducing the end-to-end-delay. We validate the effectiveness of our proposed algorithm through extensive simulations on a diverse set of scenarios. (C) 2016 Elsevier B.V. All rights reserved.
Recent work shows that Cooperative Data Exchange (CDE) with network coding can significantly improve wireless performance, especially in data exchange scenario. Moreover, wireless networks are now capable of supportin...
详细信息
Recent work shows that Cooperative Data Exchange (CDE) with network coding can significantly improve wireless performance, especially in data exchange scenario. Moreover, wireless networks are now capable of supporting time critical applications, e.g., video streaming. Such time-critical applications usually impose a deadline on the packet reception, i.e., beyond which, the packet is useless or invalid to the users. In this paper, we propose a deadline-aware CDE scheme with network coding, so as to maximize the total number of packets that can be timely received/decoded at wireless clients/devices. We first formulate the problem into an integer programming, and prove that it is NP-hard. For the case when the deadline of the packets is the same, we theoretically analyze the performance of two specific schemes. We then design an efficient heuristic algorithm to solve the general problem, which is based on an auxiliary graph model. Finally, simulation results demonstrate the effectiveness of the proposed scheme. (C) 2016 Elsevier B.V. All rights reserved.
In IEEE 802.11 infrastructure wireless local area network (WLAN), the communication between any two nodes is relayed by an access point (AP), which becomes the bottleneck of WLAN and severely restricts the overall thr...
详细信息
In IEEE 802.11 infrastructure wireless local area network (WLAN), the communication between any two nodes is relayed by an access point (AP), which becomes the bottleneck of WLAN and severely restricts the overall throughput. It is well known that network coding technique is able to greatly improve the throughput of wireless networks. But, the available coding schemes do not make full advantage of channel capacity due to the fact that they pick at most one packet from each data flow for coding and the picked packets may have a great difference in packet size, wasting some channel capacity. To remedy the problem, in this paper, we propose the coding scheme that combines multiple buffered packets in one flow into a larger packet for coding so that the packets participating in coding have close sizes. We formulate an integer programming problem to find the optimal packet coding, which is solved by an optimal algorithm with relative high time complexity together with a heuristic algorithm with relative low time complexity. Simulation results show that the proposed coding scheme is able to greatly improve the throughput of WLAN and the throughput gain increases with the growth of the number of coding flows.
We propose a selective retransmission (SR) protocol for relay-assisted multicast systems with instantly decodable network coding (IDNC). Our protocol consists of three stages, the initial transmission stage, selective...
详细信息
We propose a selective retransmission (SR) protocol for relay-assisted multicast systems with instantly decodable network coding (IDNC). Our protocol consists of three stages, the initial transmission stage, selective retransmission stage, and relay retransmission stage. To reduce the computational complexity, weighted packet scheduling (WPS) algorithm, which is used to select coded packets in greed manner has been presented. The object of our protocol and algorithm is to maximize transmission gain so as to minimize completion time. The simulation results indicate that our new SR-WPS scheme achieves good performance in terms of block completion time.
Motivated by the popularity of the peer to peer (P2P) content sharing over internet and the development of wireless device to device (D2D) communications, this paper considers the problem of delivering K different con...
详细信息
Motivated by the popularity of the peer to peer (P2P) content sharing over internet and the development of wireless device to device (D2D) communications, this paper considers the problem of delivering K different contents to D destinations from N sources in wireless networks. Traffic in opposite directions over two wireless hops can utilize the advantage of network coding (NC) in order to decrease the number of transmissions used. We call such coded hops as "NC-links". On the other hand, the multicast (MC) links can transmit data to several nodes at the same time, also yielding the improvement of the transmissions efficiency. However, there exists a certain level of ambiguity regarding how to coordinate NC and MC to improve the file sharing performance in wireless P2P content distribution systems. Considering both NC and MC gains, we investigate the content traffic splitting using a potential game model. Subsequently, we identify the equilibrium solution to this game and develop a two-level distributed control algorithm that allows each destination to select the source and split the traffic so as to adjust the content traffic based on the potential function in a distributed way. Through theoretical analysis and simulation results, we show that the proposed scheme is stable and effective. (C) 2016 Elsevier B.V. All rights reserved.
暂无评论