In smart grid, privacy implications to individuals and their families are an important issue because of the fine-grained usage data collection. Wireless communications are utilized by many utility companies to obtain ...
详细信息
In smart grid, privacy implications to individuals and their families are an important issue because of the fine-grained usage data collection. Wireless communications are utilized by many utility companies to obtain information. network coding is exploited in smart grids, to enhance network performance in terms of throughput, delay, robustness, and energy consumption. However, random linear network coding introduces a new challenge for privacy preserving due to the encoding of data and updating of coefficients in forwarder nodes. We propose a distributed privacy preserving scheme for random linear network coding in smart grid that considers the converged flows character of the smart grid and exploits a homomorphic encryption function to decrease the complexities in the forwarder node. It offers a data confidentiality privacy preserving feature, which can efficiently thwart traffic analysis. The data of the packet is encrypted and the tag of the packet is encrypted by a homomorphic encryption function. The forwarder node random linearly codes the encrypted data and directly processes the cryptotext tags based on the homomorphism feature. Extensive security analysis and performance evaluations demonstrate the validity and efficiency of the proposed scheme.
Underwater wireless sensor networks (UWSNs) have attracted increasing attention in recent years because of their numerous applications in ocean monitoring, resource discovery and tactical surveillance. However, the de...
详细信息
Underwater wireless sensor networks (UWSNs) have attracted increasing attention in recent years because of their numerous applications in ocean monitoring, resource discovery and tactical surveillance. However, the design of reliable and efficient transmission and routing protocols is a challenge due to the low acoustic propagation speed and complex channel environment in UWSNs. In this paper, we propose a novel cross-layer routing protocol based on network coding (NCRP) for UWSNs, which utilizes network coding and cross-layer design to greedily forward data packets to sink nodes efficiently. The proposed NCRP takes full advantages of multicast transmission and decode packets jointly with encoded packets received from multiple potential nodes in the entire network. The transmission power is optimized in our design to extend the life cycle of the network. Moreover, we design a real-time routing maintenance protocol to update the route when detecting inefficient relay nodes. Substantial simulations in underwater environment by network Simulator 3 (NS-3) show that NCRP significantly improves the network performance in terms of energy consumption, end-to-end delay and packet delivery ratio compared with other routing protocols for UWSNs.
network coding is emerging as a promising technique that can provide significant improvements in the throughput of Internet of Things (IoT). Previous network coding schemes focus on several nodes, regardless of the to...
详细信息
network coding is emerging as a promising technique that can provide significant improvements in the throughput of Internet of Things (IoT). Previous network coding schemes focus on several nodes, regardless of the topology and communication range in the whole network. Consequently, these schemes are greedy. Namely, all opportunities of combinations of packets in these nodes are exploited. We demonstrate that there is still room for whole network throughput improvement for these greedy design principles. Thus, in this paper, we propose a novel network coding scheme, ECS (Efficient coding Scheme), which is designed to achieve a higher throughput improvement with lower computational complexity and buffer occupancy compared to current greedy schemes for wireless mesh networks. ECS utilizes the knowledge of the topologies to minimize interference and obtain more throughput. We also prove that the widely used expected transmission countmetric (ETX) in opportunistic listening has an inherent error ratio that would lead to decoding failure. ECS therefore exploits a more reliable broadcast protocol to decrease the impact of this inherent error ratio in ETX. Simulation results show that ECS can greatly improve the performance of network coding and decrease buffer occupancy.
In general, Transmission Control Protocol (TCP), e.g., TCP NewReno, considers all losses to be a sign of congestion. It decreases the sending rate whenever a loss is detected. Integrating the network coding (NC) into ...
详细信息
In general, Transmission Control Protocol (TCP), e.g., TCP NewReno, considers all losses to be a sign of congestion. It decreases the sending rate whenever a loss is detected. Integrating the network coding (NC) into protocol stack and making it cooperate with TCP (TCP/NC) would provide the benefit of masking packet losses in lossy networks, e.g., wireless networks. TCP/NC complements the packet loss recovery capability without retransmission at a sink by sending the redundant combination packets which are encoded at the source. However, TCP/NC is less effective under heavy and bursty loss which often occurs in fast fading channel because the retransmission mechanism of the TCP/NC entirely relies on the TCP layer. Our solution is TCP/NC with enhanced retransmission (TCP/NCwER), for which a new retransmission mechanism is developed to retransmit more than one lost packet quickly and efficiently, to allow encoding the retransmitted packets for reducing the repeated losses, and to handle the dependent combination packets for avoiding the decoding failure. We implement and test our proposal in network Simulator 3. The results show that TCP/NCwER overcomes the deficiencies of the original TCP/NC and improves the TCP goodput under both random loss and burst loss channels.
network coding (NC) is considered a new paradigm for distributed networks. However, NC has an all-or-nothing property. In this paper, we propose a sparse recovery approach using sparse sensing matrix to solve the NC a...
详细信息
network coding (NC) is considered a new paradigm for distributed networks. However, NC has an all-or-nothing property. In this paper, we propose a sparse recovery approach using sparse sensing matrix to solve the NC all-or-nothing problem over a finite field. The effectiveness of the proposed approach is evaluated based on a sensor network.
Video streaming over mobile ad-hoc networks is becoming a highly important application for reliably delivering the content between the user and the content storage node. The key challenge is, hence, to address the imp...
详细信息
Video streaming over mobile ad-hoc networks is becoming a highly important application for reliably delivering the content between the user and the content storage node. The key challenge is, hence, to address the impact of the user mobility on the quality of the delivered video. Accordingly, the pioneering concept of network coding (NC) emerges as a promising approach for improving the video transmission quality mainly in multicast mobile environment. This work focuses on improving the Quality of Service of video streaming over mobile ad-hoc networks using random NC. We consider video coded by the widely-used H264/SVC codec that generates packets with different priorities and provides traffic differentiation using the IEEE 802.11e MAC. Intuitively, focusing on lowering the error transmission of high priority packets leads to enhance the video streaming quality. Accordingly, this work develops and proposes a new scalable transmission scheme that decreases the loss of high priority packets. Our approach, named Extended Multicast Scalable Video Transmission using Classification-Scheduling Algorithms and network coding over MANET (and denoted EMSCNC), adopts a cross layer design between the H.264/SVC codec, the network and MAC layers. Moreover, we develop an analytical framework allowing the performance evaluation in terms of throughput, delay, and packet delivery ratio. Simulation results validate our analytical model and confirm the substantial performance improvement brought by our approach. (C) 2016 Elsevier B.V. All rights reserved.
This paper proposes 2 novel network coding approaches for diffusion-based nanonet-works. In these 2 methods, messages from nanomachines are jointly decoded at the receiver, and in one of the methods multiple molecule ...
详细信息
This paper proposes 2 novel network coding approaches for diffusion-based nanonet-works. In these 2 methods, messages from nanomachines are jointly decoded at the receiver, and in one of the methods multiple molecule types are simultaneously employed to provide simultaneous communications over both nanomachine-to-relay and relay-to-nanomachine channels. As a result of the simultaneous use of the channel, each communication channel is allowed to use longer symbol intervals. This, in turn, results in a drastically reduced intersymbol interference component in all channels and enables communicating over longer ranges with higher data rates. The performance of the proposed communication system is investigated both analytically and via computer simulations.
network coding has a vast impact on the throughput of a network. It not only combines the packet to improve throughput but it makes it more robust from errors. A fundamental problem for applying network coding is to f...
详细信息
network coding has a vast impact on the throughput of a network. It not only combines the packet to improve throughput but it makes it more robust from errors. A fundamental problem for applying network coding is to find the number of nodes that can be treated as network coding nodes. It is found that application of network coding to every node within network results in more delay and increases the computational complexity which ultimately results in huge congestion and packet loss. Whereas selective network coding node selection decreases packet replication and increases innovative flow rate within network. To overcome this node selection problem for dynamic changing network, we have applied the concept of Matroid to construct network and form various spanning trees out of that matroidal network. In this process, subsequently Greedy algorithm for matroid is applied to find the most suitable spanning tree with minimum weight. Hence forth, Priority based selection scheme is used to prioritize the nodes within the network and subsequently nodes having highest priority will perform network coding. Lastly, we have applied an algorithm to select the best spanning tree with the help of Laplacian Matrix and all these schemes put together are named as Rule Based Selective Scheme. Thus, priority node selection and dynamic switching of spanning trees and selected NC nodes, in case of congestion, makes this rule based selective scheme more appropriate for real scenarios whereas centrality based scheme and random selection scheme do not follow this approach. The Comparative results have shown a clear indication that fi nding and applying network coding to selected number of nodes in accordance with our algorithm produces better throughput, reduces decoding delay and dynamic switching in case of congestion makes it more effi cient as compared to other mentioned schemes.
We mainly consider quantum multi-unicast problem over directed acyclic network, where each source wishes to transmit an independent message to its target via bottleneck channel. Taking the advantage of global entangle...
详细信息
We mainly consider quantum multi-unicast problem over directed acyclic network, where each source wishes to transmit an independent message to its target via bottleneck channel. Taking the advantage of global entanglement state 2D and 3D cluster states, these problems can be solved efficiently. At first, a universal scheme for the generation of resource states among distant communication nodes is provided. The corresponding between cluster and bigraph leads to a constant temporal resource cost. Furthermore, a new approach based on stabilizer formalism to analyze the solvability of several underlying quantum multi-unicast networks is presented. It is found that the solvability closely depends on the choice of stabilizer generators for a given cluster state. And then, with the designed measurement basis and parallel measurement on intermediate nodes, we propose optimal protocols for these multi-unicast sessions. Also, the analysis reveals that the resource consumption involving spatial resources, operational resources and temporal resources mostly reach the lower bounds.
The network coding mechanism has attracted much attention because of its advantage of enhanced network throughput which is a desirable characteristic especially in a multi-hop wireless network with limited link capaci...
详细信息
The network coding mechanism has attracted much attention because of its advantage of enhanced network throughput which is a desirable characteristic especially in a multi-hop wireless network with limited link capacity such as the device-to-device (D2D) communication network of 5G. COPE proposes to use the XOR-based network coding in the two-hop wireless network topology. For multi-hop wireless networks, the Distributed coding-Aware Routing (DCAR) mechanism was proposed, in which the coding conditions for two flows intersecting at an intermediate node are defined and the routing metric to improve the coding opportunity by preferring those routes with longer queues is designed. Because the routes with longer queues may increase the delay, DCAR is inefficient in delivering real-time multimedia traffic flows. In this paper, we propose a network coding-aware routing protocol for multi-hop wireless networks that enhances DCAR by considering traffic load distribution and link quality. From this, we can achieve higher network throughput and lower end-to-end delay at the same time for the proper delivery of time-sensitive data flow. The Qualnet-based simulation results show that our proposed scheme outperforms DCAR in terms of throughput and delay.
暂无评论