In this paper, we consider network coding aided gossip algorithms for information dissemination in arbitrary networks. We closely follow the method used in [6] to obtain the upper bounds on the time required to dissem...
详细信息
ISBN:
(纸本)9781849194709
In this paper, we consider network coding aided gossip algorithms for information dissemination in arbitrary networks. We closely follow the method used in [6] to obtain the upper bounds on the time required to disseminate k messages in an arbitrary connected network, which directly extend the original work beyond the completely connected networks.
In this paper, we apply nonbinary network coding to a multiple access cooperative vehicular ad hoc network (VANET), where the vehicles have independent information to transmit to a common destination. We consider that...
详细信息
ISBN:
(纸本)9781467361873
In this paper, we apply nonbinary network coding to a multiple access cooperative vehicular ad hoc network (VANET), where the vehicles have independent information to transmit to a common destination. We consider that all the users in the network are provided with multiple antennas (MIMO), so that the benefits of both space-time codes and cooperative communication are used to increase the network diversity order and consequently provide more reliable communication. A Nakagami-m fading model is considered, aiming to evaluate the reliability of the proposed scheme mainly in scenarios where the channel condition is critical (sub-Rayleigh scenario with m < 1). The network outage probability is obtained analytically, and confirmed by numerical results. Index
In this paper, we propose an energy-efficient solution for implementing network coding (NC) in wireless networks based on the IEEE 802.11 Standard. The proposed mechanism, called GreenCode, allows nodes to duty cycle ...
详细信息
ISBN:
(纸本)9781479959525
In this paper, we propose an energy-efficient solution for implementing network coding (NC) in wireless networks based on the IEEE 802.11 Standard. The proposed mechanism, called GreenCode, allows nodes to duty cycle by switching to a low-power (sleep) state when they overhear coded packet transmissions that will not provide any new information for them. To facilitate the sleep operation, bidirectional transmissions involving both coded and non-coded packets between pairs of sender-receiver nodes are integrated into the operation of GreenCode. Both analytical and simulation results presented in this paper show the high energy efficiency of GreenCode with gains of up to 360% when compared to the existing mechanisms based on the IEEE 802.11 Standard.*
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.
暂无评论