In this paper, an energy-aware routing protocol based on network coding (NCEAR) is presented for wireless sensor networks which the energy is constrained. First, considering the rate matching problem of data flows, NC...
详细信息
We consider the problem of indoor target tracking using wireless sensor networks. To facilitate ease of deployment and keeping the cost to a minimum we focus on devising a target tracking system based on received sign...
详细信息
We consider the problem of indoor target tracking using wireless sensor networks. To facilitate ease of deployment and keeping the cost to a minimum we focus on devising a target tracking system based on received signal strength indicator (RSSI) measurements. We adopt a model based approach in which the targets are assumed to evolve in time according to a certain maneuver model and the deployed sensors record RSSI measurements governed by an appropriate observation model. To devise an accurate target tracking algorithm, that would account for the radio environment, we use mixed maximum likelihood (ML)-Bayesian framework. Under this framework the radio environment is estimated using the ML approach and the target tracking is accomplished using a Bayesian filtering technique namely, particle filtering. Next to create a distributed tracking algorithm which warrants that every sensor node has access to RSSI measurements of all the other sensor nodes we introduce a dissemination mechanism for the same based on the technique of random linear network coding (RLNC). In this technique every sensor node encodes RSSI measurements that it has received from other nodes (including its own) to create a network coded packet, which in turn is transmitted using the carrier-sense multiple access based access mechanism. Our simulation results demonstrate that the root mean square tracking error (RMSE) obtained by using RLNC is strictly lower than what was achieved with a competing scheme based on localized aggregation. This can be attributed to the rapid dissemination capability of the RLNC technique. Further, the growth of RMSE in a strongly connected network with noise variance was found to be much slower than in the case of a weakly connected network. This points to the potential of RLNC in improving tracking performance, especially in strongly connected networks.
This paper considers the problem of reducing the broadcast decoding delay of wireless networks using instantly decodable network coding-based device-to-device communications. In contrast with the previous works that a...
详细信息
Ever since the introduction of network coding (NC) technique, several Medium Access Control (MAC) protocols based on NC have been developed for wireless networks of three node topology as well as 'X' topology,...
详细信息
Minimizing network coding resources of multicast networks,such as the number of coding nodes or links,has been proved to be NP-hard,and taking propagation delay into account makes the problem more complicated. To reso...
详细信息
Minimizing network coding resources of multicast networks,such as the number of coding nodes or links,has been proved to be NP-hard,and taking propagation delay into account makes the problem more complicated. To resolve this optimal problem,an integer encoding routing-based genetic algorithm( REGA) is presented to map the optimization problem into a genetic algorithm( GA)framework. Moreover,to speed up the search process of the algorithm,an efficient local search procedure which can reduce the searching space size is designed for searching the feasible *** with the binary link state encoding representation genetic algorithm( BLSGA),the chromosome length of REGA is shorter and just depends on the number of sinks. Simulation results show the advantages of the algorithm in terms of getting the optimal solution and algorithmic convergence speed.
We investigate the potential of applying cooperative relaying and network coding techniques to support vehicle-to-vehicle (V2V) communication in vehicular cloud networks (VCN). A reuse-mode MIMO content distribution s...
详细信息
ISBN:
(纸本)9783030061616;9783030061609
We investigate the potential of applying cooperative relaying and network coding techniques to support vehicle-to-vehicle (V2V) communication in vehicular cloud networks (VCN). A reuse-mode MIMO content distribution system with multiple sources, multiple relays, and multiple destinations under Nakagami-m fading is considered. We apply a class of finite field network codes in the relays to achieve high spatial diversity in an efficient manner and derive the system communication error probability that the destinations fail to recover the desired source messages. The results show that our method can improve the performance over conventional data transmission solutions.
Cloud storage systems are designed to provide reliable storage services and reduce the cost by utilizing the storage space efficiently. However, cloud storage systems suffer from loss of data whenever an unexpected fa...
详细信息
ISBN:
(纸本)9781538684931
Cloud storage systems are designed to provide reliable storage services and reduce the cost by utilizing the storage space efficiently. However, cloud storage systems suffer from loss of data whenever an unexpected failure occurs. This work focuses on providing network coding benefits in robust cloud storage system. We design a system model for multiple-cloud storage and multiple node failures. Further, the storage system provides authentication for users and minimizes the update operation. We have carried out our work considering trade-off between repair bandwidth and cloud storage capacity and comparing with RAID-6. The proposed approach provides protection (fault tolerance) against unexpected failure using erasure and regenerating codes.
The abstraction of shared memory is a powerful tool that can greatly simplify design and implementation of software systems for distributed settings. The key property of a shared memory abstraction is the consistency ...
详细信息
The abstraction of shared memory is a powerful tool that can greatly simplify design and implementation of software systems for distributed settings. The key property of a shared memory abstraction is the consistency guarantees that it provides under concurrent access. The most intuitive consistency model is atomicity since its semantics closely reassemble these of a sequential register. Emulating shared atomic memory proves to be challenging especially if this is to be done in a distributed message passing setting with unreliable components, as is often the case in networked systems. To this end standard techniques and solutions have been developed, however these have high communication and storage costs. In this project, we explore several algorithms for efficient implementations of shared memory services that use erasure-codes. We also derive provable strong consistency and liveness properties of these algorithms in the failure-prone setting. Novelty of this work is the fusion of standard replication techniques with network coding techniques. Shared memory services for distributed systems emulate a memory abstraction providing users with a consistent view of its content under concurrent access, with a best effort to ensure availability and survivability.
In recent years, network coding has emerged as an innovative method that helps wireless network approaches its maximum capacity, by combining multiple unicasts in one broadcast. However, the majority of research condu...
详细信息
network Functions Virtualization (NFV) and network coding (NC) have attracted much attention in recent years as key concepts for providing 5G networks with flexibility and differentiated reliability, respectively. In ...
详细信息
暂无评论