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.
Nowadays, artificial intelligence is limited by privacy and security problems. Compared with the ordinary machine learning, federated learning (FL) enables multiple participants to collaboratively learn a shared machi...
详细信息
ISBN:
(纸本)9783030638320;9783030638337
Nowadays, artificial intelligence is limited by privacy and security problems. Compared with the ordinary machine learning, federated learning (FL) enables multiple participants to collaboratively learn a shared machine learning model while keeping all the training data on local devices. However, most of the current secured federated learning systems (FLSs) are built up with high computational and communication costs. On the other hand, optimizing the network structure of federated learning systems can reduce communication complexity by considering the correlation of the transmission channels. In this paper, we propose network coding Federated Learning Systems (NC-FLSs). Specifically, it considers the whole communication network by connecting all the clients and the server. Applying a linear NC scheme to construct a linear combination of the original messages, which is transmitted over the network instead of the messages themselves. Based on NC-FLSs, the communication cost is halved and both data privacy and security are improved with the imperceptibly higher computational cost. Moreover, considering that the network coding structure is independent of the FL model, any FLSs can also be upgraded to its corresponding NC-FLSs. We also implement differential privacy on an NC-FLS to train an image classifier while keeping clients' local data secure and private, which achieves superior performance and efficiency.
We propose Wireless Sensor coding (WSC) an event-centric data-dissemination scheme for Wireless Sensor networks (WSN). WSC is based on a distributed network coding scheme. In this solution, nodes do not only forward p...
详细信息
ISBN:
(纸本)9781424464043
We propose Wireless Sensor coding (WSC) an event-centric data-dissemination scheme for Wireless Sensor networks (WSN). WSC is based on a distributed network coding scheme. In this solution, nodes do not only forward packets, but also perform linear random information coding in order to increase the throughput of the network, to reduce the number of transmissions and the end-to-end delay. These improvements involve a reduction of the energy consumption, which is one of the key-issues in WSN architecture design.
How to effectively distribute and share increasingly large volumes of data in large-scale network applications is a key challenge for Internet infrastructure. Although NDN, a promising new future internet architecture...
详细信息
ISBN:
(纸本)9781467375887
How to effectively distribute and share increasingly large volumes of data in large-scale network applications is a key challenge for Internet infrastructure. Although NDN, a promising new future internet architecture which takes data-oriented transfer approaches, aims to better solve such needs than IP, it still faces problems like data redundancy transmission and inefficient in-network cache utilization. This paper combines network coding techniques to NDN to improve network throughput and efficiency. The merit of our design is that it is able to avoid duplicate and unproductive data delivery while transferring disjoint data segments along multiple paths and with no excess modification to NDN fundamentals. To quantify performance benefits of applying network coding in NDN, we integrate network coding into an NDN streaming media system implemented in the ndnSIM simulator. Basing on BRITE generated network topologies in our simulation, the experimental results clearly and fairly demonstrate that considering network coding in NDN can significantly improve the performance, reliability and QoS. More importantly, our approach is capable of and well fit for delivering growing Big Data applications including high-performance and high-density video streaming services.
We consider a directed acyclic network with two source-sink pairs {s(1), t(1)} and {s(2), t(2)}. The source s(1) wishes to communicate a message X-1 to the sink t(1) and the source s(2) wishes to communicate two messa...
详细信息
ISBN:
(纸本)9781467325790
We consider a directed acyclic network with two source-sink pairs {s(1), t(1)} and {s(2), t(2)}. The source s(1) wishes to communicate a message X-1 to the sink t(1) and the source s(2) wishes to communicate two messages X-2 and X-3 to the sink t(2), where X-i, i = 1, 2, 3, are independent random variables of unit rate. We give a simple characterization for linear solvability of such networks under the condition that the minimum cut from {s(1), s(2)} to t(2) equals 3. We develop a region decomposition method for proving this result, which we believe can be an effective approach for non-multicast network coding problem.
Cooperation among mobile devices and utilizing multiple interfaces such as cellular and local area links simultaneously are promising to meet the increasing throughput demand over cellular links. In particular, when m...
详细信息
ISBN:
(纸本)9781509000739
Cooperation among mobile devices and utilizing multiple interfaces such as cellular and local area links simultaneously are promising to meet the increasing throughput demand over cellular links. In particular, when mobile devices are in the close proximity of each other and are interested in the same content, device-to-device connections such as WiFi-Direct, in addition to cellular links, can be utilized to construct a cooperative system. However, it is crucial to understand the potential of network coding for cooperating mobile devices with multiple interfaces. In this paper, we consider this problem, and (i) develop network coding schemes for cooperative mobile devices with multiple interfaces, and (ii) characterize the performance of network coding by using the number of transmissions to recover all packets as a performance metric.
In this paper, we prove the existence of fundamental relations between information theory and estimation theory for network-coded flows. When the network is represented by a directed graph G = (V, epsilon) and under t...
详细信息
ISBN:
(纸本)9781509021857
In this paper, we prove the existence of fundamental relations between information theory and estimation theory for network-coded flows. When the network is represented by a directed graph G = (V, epsilon) and under the assumption of uncorrelated noise over information flows between the directed links connecting transmitters, switches (relays), and receivers. We unveil that there yet exist closed-form relations for the gradient of the mutual information with respect to different components of the system matrix M. On the one hand, this result opens a new class of problems casting further insights into effects of the network topology, topological changes when nodes are mobile, and the impact of errors and delays in certain links into the network capacity which can be further studied in scenarios where one source multi-sinks multicasts and multi-source multicast where the invertibility and the rank of matrix M plays a significant role in the decoding process and therefore, on the network capacity. On the other hand, it opens further research questions of finding precoding solutions adapted to the network level.
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.
In this contribution we simulate network coding and evaluate its benefits for streaming video over P2P networks. network coding has emerged as a promise technique in the information theory field. This novel technique ...
详细信息
ISBN:
(纸本)9780769551401
In this contribution we simulate network coding and evaluate its benefits for streaming video over P2P networks. network coding has emerged as a promise technique in the information theory field. This novel technique has shown several benefits in the communication networks related to throughput, security and resources optimization. In this work, we implement network coding for a multi-source P2P scenario. The video is encoded in the sources, while the intermediate nodes implement network coding before forwarding the encoded packets to the end nodes. The received packets are decoded in each receiving peer in order to recovery the original video. Our scheme is implemented under the H. 264/MPEG-4 AVC compression standard and using the network simulator (NS-2). We evaluate our scheme in terms of overall throughput, packet loss and video quality. Results show that these parameters can be improved in P2P video streaming systems by using network coding.
暂无评论