One of the most appropriate techniques to increase the reliability of wireless sensor networks used in industrial environments are the network coding techniques. This paper proposes an effective, yet simple and scalab...
详细信息
ISBN:
(纸本)9781467311182
One of the most appropriate techniques to increase the reliability of wireless sensor networks used in industrial environments are the network coding techniques. This paper proposes an effective, yet simple and scalable approach based on a relay-assisted cooperative scheme that uses Reed Solomon codes as network codes for such wireless sensor networks with cluster-tree topologies. The global Block Error Rate performances of this approach are analyzed in three different scenarios, characterized by different Block Error Rate distributions of the component paths. The results obtained show that this solution significantly improves the performances even for great coding rates. The paper also proposes an optimization of the network code functionality, based on a genetic algorithm, and concludes that it is effective in improving the performances for high coding rates.
network coding is promising to improve the throughput and robustness of video transmission over wireless networks. To address the security issue of network coding based Priority encoding transmission(PET), a special c...
详细信息
network coding is promising to improve the throughput and robustness of video transmission over wireless networks. To address the security issue of network coding based Priority encoding transmission(PET), a special coding design against wiretapping is proposed with hierarchical security. The basic idea is first to randomize partial blocks of each layer and then to encode each layer with inter-layer overlapping coding. The method is characterized by quantifiable security for incremental decoding,and realizes scalability in confidentiality and video transmission, while incurring relatively low computational complexity and bandwidth overhead. A sufficient condition is also presented to design a stronger secure network coded PET system against the known-plaintext attacks. Analysis and evaluation show that the method can be efficient as a new paradigm to secure network coded PET system in realistic applications.
In this paper first the problem of secure minimum-cost multicast with network coding is studied, while the maximum end-to-end parameters, such as security, delay, and rate are assumed to be bounded in one multicast se...
详细信息
ISBN:
(纸本)9783642388651
In this paper first the problem of secure minimum-cost multicast with network coding is studied, while the maximum end-to-end parameters, such as security, delay, and rate are assumed to be bounded in one multicast session. We present a decentralized algorithm that computes minimum-cost QoS flow subgraphs in network coded multicast networks. In next stage we generalize this idea to interference-limited dynamic networks where capacities are functions of the signal-to-noise-interference ratio (SINR). Since dynamic link capacities can be controlled by varying transmission powers, minimum-cost multicast must be achived by jointly optimizing network coding subgraphs with power control schemes. Simulation results shows this approach provides an efficient way for solving the optimization problem. The optimization numerical results show that using power control algorithm, higher success ratio is obtained, in comparison with previous algorithms.
In this paper, we present a set of simple extensions to the IEEE 802.11 MAC that allow the efficient realization of wireless network coding. The main characteristic of the proposed protocol is that it improves the eff...
详细信息
ISBN:
(纸本)9781424423248
In this paper, we present a set of simple extensions to the IEEE 802.11 MAC that allow the efficient realization of wireless network coding. The main characteristic of the proposed protocol is that it improves the efficiency of packet coding decisions and allows verifying the decodability of packets before they are transmitted over the network. The previous goals are achieved by adopting two techniques. First, we introduce the concept of opportunistic acknowledgments (OACKs), and second, we adopt the use of virtual buffers that are used for selectively storing overheard packets by a particular node. We performed extensive simulations for several ad hoc network topologies that test the proposed protocol. Our results indicate that significant throughput enhancements can be achieved when compared with network coding schemes that are realized with the legacy 802.11 MAC.
Basic safety message(BSM) or heartbeat message is periodically broadcast by each vehicle on the road, conveying vehicle's instantaneous position and driving state. The vehicular communication network enables the f...
详细信息
ISBN:
(纸本)9781509017010
Basic safety message(BSM) or heartbeat message is periodically broadcast by each vehicle on the road, conveying vehicle's instantaneous position and driving state. The vehicular communication network enables the fast exchange of BSMs with neighboring vehicles which assists drivers in acquiring the local driving environment and maneuvering promptly in case of any potential hazard. Such message is exceptionally crucial for vehicles at road intersection to avoid collisions. In this paper, we propose a novel BSM broadcast scheme using random linear network coding (NCB-RI) to address the message dissemination at road intersection. Considering each BSM packet broadcast occupies one broadcast slot, our objective is to reduce the required number of broadcast slots and lower the total transmission time for exchanging all BSMs among the studied vehicles. The coding overhead caused by the random linear network coding is further deducted by using coefficient seeds. The upper bounds regarding the broadcast slots for both NCB-RI and traditional broadcast scheme without network coding are discussed. Our proposed NCB-RI outperforms the traditional solution which is verified by analysis and simulations.
In heterogeneous networks consisting of relay nodes and multiple antennas, beam-forming optimization is an enabling technology yielding high throughputs. network coding not only transforms interferences into effective...
详细信息
ISBN:
(纸本)9781479946402
In heterogeneous networks consisting of relay nodes and multiple antennas, beam-forming optimization is an enabling technology yielding high throughputs. network coding not only transforms interferences into effective signals, but also provides more freedom of macro-relay coordination. This paper presents a network coding interference coordination scheme over lattice-forward multiple-input multiple-output channels. At first, we will derive the achievable rate with nested lattice codes, and then maximize the sum-rate of cooperating regions through iterative algorithm and Lagrange multiplier method. For comparisons, capacity of several conventional schemes are also provided. Numerical results validate the proposed scheme.
network coding is an effective way to achieve the maximum flow of multicast networks. In this letter, we focus on the statistical properties of the maximum flow or the capacity of network coding for ad-hoc networks ba...
详细信息
network coding is an effective way to achieve the maximum flow of multicast networks. In this letter, we focus on the statistical properties of the maximum flow or the capacity of network coding for ad-hoc networks based on random graph models. Theoretical analysis shows that the maximum flow can be modelled as extreme order statistics of Gaussian distribution for both wired and wireless ad-hoc networks as the node number is relatively large under a certain condition. We also investigate the effects of the nodes' covering capabilities on the capacity of network coding.
The drive toward the implementation and massive deployment of wireless sensor networks calls for ultralow-cost and low-power nodes. While the digital subsystems of the nodes are still following Moore's Law, there ...
详细信息
The drive toward the implementation and massive deployment of wireless sensor networks calls for ultralow-cost and low-power nodes. While the digital subsystems of the nodes are still following Moore's Law, there is no such trend regarding the performance of analog components. This work proposes a fully integrated architecture of both digital and analog components (including local oscillator) that offers significant reduction in cost, size, and overall power consumption of the node. Even though such a radical architecture cannot offer the reliable tuning of standard designs, it is shown that by using random network coding, a dense network of such nodes can achieve throughput linear in the number of channels available for communication. Moreover, the ratio of the achievable throughput of the untuned network to the throughput of a tuned network with perfect coordination is shown to be close to 1/e. This work uses network coding to leverage the fact that throughput equal to the max-flow in a graph is achievable even if the topology is not know a priori. However, the challenge here is finding the max-flow of the random graph corresponding to the network.
network coding is a relatively new forwarding paradigm where intermediate nodes perform a store, code, and forward operation on incoming packets. Traditional forwarding approaches, which employed a store and forward o...
详细信息
ISBN:
(纸本)9781467324809
network coding is a relatively new forwarding paradigm where intermediate nodes perform a store, code, and forward operation on incoming packets. Traditional forwarding approaches, which employed a store and forward operation, suffered from the limitations of the max-flow min-cut theorem wherein sources transmitting information over bottleneck links had to compete for access to these links. With network coding, multiple sources are now able to transmit packets over bottleneck links simultaneously, increasing network capacity. While the majority of the contemporary literature has focused on the performance of network coding from a capacity perspective, the aim of this research has taken a new direction focusing on two Quality of Service metrics, Packet Delivery Ratio (PDR) and latency, in conjunction with network coding protocols in Mobile Ad-Hoc networks (MANETs). Initial simulations will be performed on static environments to determine a Quality of Service baseline comparison between network coding protocols and traditional ad-hoc routing protocols. Additional simulations will then be performed for mobile scenarios to determine how the network coding protocols will compare to that of the standard ad-hoc routing protocols in the presence of mobility.
In this paper, we propose two novel schemes to solve the problem of finding a quasi-optimal number of coded packets to multicast to a set of independent wireless receivers suffering different channel conditions. In pa...
详细信息
ISBN:
(纸本)9781509050192
In this paper, we propose two novel schemes to solve the problem of finding a quasi-optimal number of coded packets to multicast to a set of independent wireless receivers suffering different channel conditions. In particular, we propose two network channel virtualization schemes that allow for representing the set of intended receivers in a multicast group to be virtualized as one receiver. Such approach allows for a transmission scheme not only adapted to per-receiver channel variation over time, but to the network-virtualized channel representing all receivers in the multicast group. The first scheme capitalizes on a maximum erasure criterion introduced via the creation of a virtual worst per receiver per slot reference channel of the network. The second scheme capitalizes on a maximum completion time criterion by the use of the worst performing receiver channel as a virtual reference to the network. We apply such schemes to a GEO satellite scenario. We demonstrate the benefits of the proposed schemes comparing them to a per-receiver point-to-point adaptive strategy.
暂无评论