This paper presents a network coding Assisted Multicast Least Cost Anypath Routing (NC-MLCAR) scheme for packet transmission over a multi-hop wireless network. Our objective is to transmit packets efficiently from the...
详细信息
This paper presents a network coding Assisted Multicast Least Cost Anypath Routing (NC-MLCAR) scheme for packet transmission over a multi-hop wireless network. Our objective is to transmit packets efficiently from the source node to the destination set with the help of a selected forwarder set to reduce the expected number of transmissions for efficient network capacity usage. The forwarder set is selected using the earlier Multicast Least Cost Anypath Routing (MLCAR) algorithm. network coded packets are then transmitted by allocating traffic efficiently between the nodes of the forwarder set while ensuring that each destination receives all the packets. Simulation results are presented for the cases when the packets receptions over different links are considered to be (i) independent and (ii) correlated. The extensive simulation results presented in the paper are compared with the corresponding MLCAR approach and other network coding schemes employed for multicasting like MORE and Pacifier. It is observed that the proposed NC-MLCAR scheme significantly reduces the expected number of overall transmissions in the network, for both independent links and correlated links, when compared to the existing multicasting schemes. Complexity analysis of NC-MLCAR is also presented.
The converge-cast in wireless sensor networks (WSNs) is widely applied in many fields such as medical applications and the environmental monitoring. WSNs expect not only providing routing with high throughput but also...
详细信息
The converge-cast in wireless sensor networks (WSNs) is widely applied in many fields such as medical applications and the environmental monitoring. WSNs expect not only providing routing with high throughput but also achieving efficient energy saving. network coding is one of the most promising techniques to reduce the energy consumption. By maximizing the encoding number, the message capacity per package can be extended to the most efficient condition. Thus, many researchers have focused their work on this field. Nevertheless, the packages sent by the outer nodes need to be temporary stored and delayed in order to maximize the encoding number. To find out the balance between inserting the delay time and maximizing the encoding number, a Converge-cast Scheme based on data collection rate prediction (CSRP) is proposed in this paper. To avoid producing the outdated information, a prediction method based on Modifying Index Curve Model is presented to deal with the dynamic data collection rate of every sensor in WSNs. Furthermore, a novel coding conditions based on CDS is proposed to increase the coding opportunity and to solve the collision problems. The corresponding analysis and experimental results indicate that the feasibility and efficiency of the CSRP is better than normal conditions without the prediction.
A network coding-based scheme is proposed to improve the energy efficiency of distributed storage systems in WSNs (wireless sensor networks), which mainly focuses on two problems: firstly, consideration is given to ef...
详细信息
A network coding-based scheme is proposed to improve the energy efficiency of distributed storage systems in WSNs (wireless sensor networks), which mainly focuses on two problems: firstly, consideration is given to effective distributed storage technology in WSNs;secondly, we address how to repair the data in failed storage nodes with less resource. For the first problem, we propose a method to obtain a sparse generator matrix to construct network codes, and this sparse generator matrix is proven to be the sparsest. Benefiting from the sparse generator matrix, the energy consumption required to implement distributed storage is reduced. For the second problem, we designed a network coding-based iterative repair method, which adequately utilizes the idea of re-encoding at intermediate nodes from network coding theory. Benefiting from the re-encoding, the energy consumption required by data repair is significantly reduced. Moreover, we provide an explicit lower bound of field size required by this scheme, which implies that this scheme can work over a very small field and the required computation overhead of coding is very low. The simulation result verifies that by using our scheme, the total energy consumption required to implement distributed storage system in WSNs can be reduced on the one hand, and on the other hand, this method can also balance energy consumption of the networks.
In wireless coded cache network, data contents are cached in a number of mobile devices using an erasure correcting code, and thus users can retrieve data contents from other mobile devices using device-to-device comm...
详细信息
In wireless coded cache network, data contents are cached in a number of mobile devices using an erasure correcting code, and thus users can retrieve data contents 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 problem over the broadcast channels using an integer linear programming formulation, aiming at minimizing the number of necessary broadcast transmissions. We also study the construction of repair codes and propose a decentralized repair coding method. Simulation results show that the performance using our method outperforms that of traditional cooperative repair scheme, which is the basic repair method for wired distributed storage systems.
Multi-hop multicast routing can provide better communication performance in multi-hop wireless networks. However, existing multi-hop multicast routing hardly take into account energy efficiency of networks. This paper...
详细信息
Multi-hop multicast routing can provide better communication performance in multi-hop wireless networks. However, existing multi-hop multicast routing hardly take into account energy efficiency of networks. This paper studies the energy-efficient multicast communication aiming at multi-hop wireless networks. Firstly, we analyze energy metric and energy efficiency metric of multi-hop networks. Then the corresponding models are given. Secondly, network coding is used to improve network throughput. Different from previous methods, we here consider that network nodes are satisfied with a certain random distribution. In such a case, it is a challenge to construct the network structure that network coding requires. For the above random network topology, we propose three basic structures of network coding to overcome this problem. Thirdly, we present a flexible energy-efficient multicast routing algorithm for multi-hop wireless networks to extensively exploit the network structure proposed above to maximize network throughput and decrease network energy consumption. Finally, we perform numerical experiments by network simulation. Simulation results indicate that our approach is significantly promising. (C) 2015 Elsevier Inc. All rights reserved.
We develop a network coding technique based on flags of subspaces and a corresponding network channel model. To define error correcting codes we introduce a new distance on the flag variety, the Grassmann distance on ...
详细信息
We develop a network coding technique based on flags of subspaces and a corresponding network channel model. To define error correcting codes we introduce a new distance on the flag variety, the Grassmann distance on flags and compare it to the commonly used gallery distance for full flags.
Throughput limitation of wireless networks imposes many practical problems as a result of wireless media broadcast nature. The solutions of the problem are mainly categorized in two groups;the use of multiple orthogon...
详细信息
Throughput limitation of wireless networks imposes many practical problems as a result of wireless media broadcast nature. The solutions of the problem are mainly categorized in two groups;the use of multiple orthogonal channels and network coding (NC). The networks with multiple orthogonal channels and possibly multiple interfaces can mitigate co-channel interference among nodes. However, efficient assignment of channels to the available network interfaces is a major problem for network designers. Existing heuristic and theoretical work unanimously focused on joint design of channel assignment with the conventional transport/IP/MAC architecture. Furthermore, NC has been a prominent approach to improve the throughput of unicast traffic in wireless multi-hop networks through opportunistic NC. In this paper we seek a collaboration scheme for NC in multi-channel/interface wireless networks, i.e., the integration of NC, routing and channel assignment problem. First, we extend the NC for multiple unicast sessions to involve both COPE-type and a new proposed scheme named as Star-NC. Then, we propose an analytical framework that jointly optimizes the problem of routing, channel assignment and NC. Our theoretical formulation via a linear programming provides a method for finding source-destination routes and utilizing the best choices of different NC schemes to maximize the aggregate throughput. Through this LP, we propose a novel channel assignment algorithm that is aware of both coding opportunities and co-channel interference. Finally, we evaluate our model for various networks, traffic models, routing and coding strategies over coding-oblivious routing.
When network coding is used in wireless mesh networks (WMNs), the epidemic effect of pollution attacks can reduce network throughput dramatically. Nevertheless, little attention has been directed toward the performanc...
详细信息
When network coding is used in wireless mesh networks (WMNs), the epidemic effect of pollution attacks can reduce network throughput dramatically. Nevertheless, little attention has been directed toward the performance gain of network coding versus traditional routing in adversarial wireless mesh networks. To address this critical issue, in this paper, we formally model and analyze the impact of pollution attacks on traditional routing and network coding in both unicast and multicast scenarios. With the combination of both numerical and simulation studies, we evaluate the performance of traditional routing and network coding in adversarial wireless networks. Our data is consistent with the theoretical findings. Our results show that network coding is not absolutely better than traditional routing and its performance gain largely depends on various factors. Most importantly, given a network, the threshold of these factors can be derived from numerical solutions given by our developed closed-form formulae. Thus, we can determine whether network coding should be used in the network. Our results contribute to the foundation, providing guidelines for designing and applying network coding into hostile wireless networks. (C) 2014 Elsevier B.V. All rights reserved.
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.
暂无评论