ANALYSIS-BASED SPARSE RECONSTRUCTION WITH SYNTHESIS-BASED SOLVERS

© 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works

Network coding node placement for delay minimization in streaming overlays

Network coding has been proposed recently as an efficient method to increase network throughput by allowing network nodes to combine packets instead of simply forwarding them. However, packet combinations in the network may increase delay, complexity and even generate overly redundant information when they are not designed properly. Typically, the best performance is not achieved when all the nodes perform network coding. In this paper, we address the problem of efficiently placing network coding nodes in overlay networks, so that the rate of innovating packets is kept high, and the delay for packet delivery is kept small. We first estimate the expected number of duplicated packets in each network node. These estimations permit to select the nodes that should implement network coding, so that the innovating rate increases. Two algorithms are then proposed for the cases where a central node is aware of the full network statistics and where each node knows the local statistics from its neighbor, respectively. The simulation results show that in the centralized scenario the maximum profit from network coding comes by adding only a few network coding nodes. A similar result is obtained with the algorithm based on local statistics, which moreover performs very close to the centralized solution. These results show that the proper selection of the network coding nodes is crucial for minimizing the transmission delay in streaming overlays

Design of network coding based reliable sensor networks

Network coding can be very useful in achieving a balance between energy efficiency and end-to-end packet error in sensor networks, particularly if only a subset of the nodes act as encoding nodes. In this article, a mathematical model and a heuristic algorithm are proposed to plan for the best placement of encoding nodes while ensuring reliability. These approaches are also able to address scenarios where sensor networks, using different gateways, are federated. In this case a distributed storage system is required to ensure the recovery of packets when related coded packets arrive to the different gateways. The experimental results show that the adequate number and placement of encoding nodes can be effectively determined, significantly enhancing the performance of constrained sensor networks using network coding. (C) 2019 Elsevier B.V. All rights reserved.FCT (Foundation for Science and Technology) from Portugal within CEOT (Center for Electronic, Optoelectronic and Telecommunications) [UID/MULTI/00631/2019]Thamar University - Yemeninfo:eu-repo/semantics/publishedVersio