The Experts below are selected from a list of 4506 Experts worldwide ranked by ideXlab platform
Christina Fragouli - One of the best experts on this subject based on the ideXlab platform.
-
on secure network coding for multiple Unicast Traffic
IEEE Transactions on Information Theory, 2020Co-Authors: Gaurav Kumar Agarwal, Martina Cardone, Christina FragouliAbstract:This paper investigates the problem of secure communication in a wireline noiseless scenario where a source wishes to communicate to a number of destinations in the presence of a passive external adversary. Different from the multicast scenario, where all destinations are interested in receiving the same message, in this setting different destinations are interested in different messages. The main focus of this paper is on characterizing the secure capacity region, when the adversary has unbounded computational capabilities, but limited network presence. Towards this end, an outer bound on the secure capacity region is derived, and secure transmission schemes are designed and analyzed in terms of achieved rate performance. It is first shown that, for the case of two destinations, the designed scheme matches the outer bound, hence characterizing the secure capacity region. Then, a particular class of networks referred to as two-layer networks is considered, where the source communicates with the destinations by hopping information through one layer of relays. It is shown that the designed scheme is indeed capacity achieving for any two-layer network for which one of the following three conditions is satisfied: (i) the number of destinations is three, (ii) the number of edges eavesdropped by the adversary is one, (iii) the min-cut capacities assume specific values. It is also shown that two-layer networks can be used to model and study a more general class of networks, referred to as separable . The key feature of separable networks is that they can be partitioned into edge disjoint networks that satisfy specific min-cut properties. In particular, it is proved that the secure capacity region of any separable network can be characterized from the secure capacity region of the corresponding two-layer network. Finally, for an arbitrary network topology, a two-phase scheme is designed and its rate performance is compared with the capacity-achieving scheme for networks with two destinations.
-
On Secure Capacity of Multiple Unicast Traffic over Two-Layer Networks.
2019Co-Authors: Gaurav Kumar Agarwal, Martina Cardone, Christina FragouliAbstract:This paper studies the problem of secure communication over two-layer networks, where a source is connected to a set of relays via direct edges. These relays are then connected to $m$ destinations, such that each destination has direct connections to a subset of relays. In multiple Unicast Traffic, the source wishes to transmit independent information to each of the $m$ destinations. This work studies the secure capacity region for this Traffic over the defined two-layer networks, under the assumption of perfect information theoretic security criterion from an adversary who can access any $K$ edges of the network. In particular, the secure capacity region is characterized when either $K=1$ or $m=3$. Moreover, conditions sufficient to characterize the secure capacity region are provided for arbitrary values of $K$ and $m$.
-
On Secure Capacity of Multiple Unicast Traffic over Separable Networks
arXiv: Information Theory, 2019Co-Authors: Gaurav Kumar Agarwal, Martina Cardone, Christina FragouliAbstract:This paper studies the problem of information theoretic secure communication when a source has private messages to transmit to $m$ destinations, in the presence of a passive adversary who eavesdrops an unknown set of $k$ edges. The information theoretic secure capacity is derived over unit-edge capacity separable networks, for the cases when $k=1$ and $m$ is arbitrary, or $m=3$ and $k$ is arbitrary. This is achieved by first showing that there exists a secure polynomial-time code construction that matches an outer bound over two-layer networks, followed by a deterministic mapping between two-layer and arbitrary separable networks.
-
on secure network coding for multiple Unicast Traffic
arXiv: Information Theory, 2019Co-Authors: Gaurav Kumar Agarwal, Martina Cardone, Christina FragouliAbstract:This paper investigates the problem of secure communication in a wireline noiseless scenario where a source wishes to communicate to a number of destinations in the presence of a passive external adversary. Different from the multicast scenario, where all destinations are interested in receiving the same message, in this setting different destinations are interested in different messages. The main focus of this paper is on characterizing the secure capacity region, when the adversary has unbounded computational capabilities, but limited network presence. First, an outer bound on the secure capacity region is derived for arbitrary network topologies and general number of destinations. Then, secure transmission schemes are designed and analyzed in terms of achieved rate performance. In particular, for the case of two destinations, it is shown that the designed scheme matches the outer bound, hence characterizing the secure capacity region. It is also numerically verified that the designed scheme matches the outer bound for a special class of networks with general number of destinations, referred to as combination network. Finally, for an arbitrary network topology with general number of destinations, a two-phase polynomial time in the network size scheme is designed and its rate performance {is} compared with the capacity-achieving scheme for networks with two destinations.
-
ITW - On Secure Capacity of Multiple Unicast Traffic over Separable Networks
2019 IEEE Information Theory Workshop (ITW), 2019Co-Authors: Gaurav Kumar Agarwal, Martina Cardone, Christina FragouliAbstract:This paper studies the problem of information theoretic secure communication when a source has private messages to transmit to m destinations, in the presence of a passive adversary who eavesdrops an unknown set of k edges. The information theoretic secure capacity is derived over unit-edge capacity separable networks, for the cases when k = 1 and m is arbitrary, or m = 3 and k is arbitrary. This is achieved by first showing that there exists a secure polynomial-time code construction that matches an outer bound over two-layer networks, followed by a deterministic mapping between two-layer and arbitrary separable networks.
Gaurav Kumar Agarwal - One of the best experts on this subject based on the ideXlab platform.
-
on secure network coding for multiple Unicast Traffic
IEEE Transactions on Information Theory, 2020Co-Authors: Gaurav Kumar Agarwal, Martina Cardone, Christina FragouliAbstract:This paper investigates the problem of secure communication in a wireline noiseless scenario where a source wishes to communicate to a number of destinations in the presence of a passive external adversary. Different from the multicast scenario, where all destinations are interested in receiving the same message, in this setting different destinations are interested in different messages. The main focus of this paper is on characterizing the secure capacity region, when the adversary has unbounded computational capabilities, but limited network presence. Towards this end, an outer bound on the secure capacity region is derived, and secure transmission schemes are designed and analyzed in terms of achieved rate performance. It is first shown that, for the case of two destinations, the designed scheme matches the outer bound, hence characterizing the secure capacity region. Then, a particular class of networks referred to as two-layer networks is considered, where the source communicates with the destinations by hopping information through one layer of relays. It is shown that the designed scheme is indeed capacity achieving for any two-layer network for which one of the following three conditions is satisfied: (i) the number of destinations is three, (ii) the number of edges eavesdropped by the adversary is one, (iii) the min-cut capacities assume specific values. It is also shown that two-layer networks can be used to model and study a more general class of networks, referred to as separable . The key feature of separable networks is that they can be partitioned into edge disjoint networks that satisfy specific min-cut properties. In particular, it is proved that the secure capacity region of any separable network can be characterized from the secure capacity region of the corresponding two-layer network. Finally, for an arbitrary network topology, a two-phase scheme is designed and its rate performance is compared with the capacity-achieving scheme for networks with two destinations.
-
On Secure Capacity of Multiple Unicast Traffic over Two-Layer Networks.
2019Co-Authors: Gaurav Kumar Agarwal, Martina Cardone, Christina FragouliAbstract:This paper studies the problem of secure communication over two-layer networks, where a source is connected to a set of relays via direct edges. These relays are then connected to $m$ destinations, such that each destination has direct connections to a subset of relays. In multiple Unicast Traffic, the source wishes to transmit independent information to each of the $m$ destinations. This work studies the secure capacity region for this Traffic over the defined two-layer networks, under the assumption of perfect information theoretic security criterion from an adversary who can access any $K$ edges of the network. In particular, the secure capacity region is characterized when either $K=1$ or $m=3$. Moreover, conditions sufficient to characterize the secure capacity region are provided for arbitrary values of $K$ and $m$.
-
On Secure Capacity of Multiple Unicast Traffic over Separable Networks
arXiv: Information Theory, 2019Co-Authors: Gaurav Kumar Agarwal, Martina Cardone, Christina FragouliAbstract:This paper studies the problem of information theoretic secure communication when a source has private messages to transmit to $m$ destinations, in the presence of a passive adversary who eavesdrops an unknown set of $k$ edges. The information theoretic secure capacity is derived over unit-edge capacity separable networks, for the cases when $k=1$ and $m$ is arbitrary, or $m=3$ and $k$ is arbitrary. This is achieved by first showing that there exists a secure polynomial-time code construction that matches an outer bound over two-layer networks, followed by a deterministic mapping between two-layer and arbitrary separable networks.
-
on secure network coding for multiple Unicast Traffic
arXiv: Information Theory, 2019Co-Authors: Gaurav Kumar Agarwal, Martina Cardone, Christina FragouliAbstract:This paper investigates the problem of secure communication in a wireline noiseless scenario where a source wishes to communicate to a number of destinations in the presence of a passive external adversary. Different from the multicast scenario, where all destinations are interested in receiving the same message, in this setting different destinations are interested in different messages. The main focus of this paper is on characterizing the secure capacity region, when the adversary has unbounded computational capabilities, but limited network presence. First, an outer bound on the secure capacity region is derived for arbitrary network topologies and general number of destinations. Then, secure transmission schemes are designed and analyzed in terms of achieved rate performance. In particular, for the case of two destinations, it is shown that the designed scheme matches the outer bound, hence characterizing the secure capacity region. It is also numerically verified that the designed scheme matches the outer bound for a special class of networks with general number of destinations, referred to as combination network. Finally, for an arbitrary network topology with general number of destinations, a two-phase polynomial time in the network size scheme is designed and its rate performance {is} compared with the capacity-achieving scheme for networks with two destinations.
-
ITW - On Secure Capacity of Multiple Unicast Traffic over Separable Networks
2019 IEEE Information Theory Workshop (ITW), 2019Co-Authors: Gaurav Kumar Agarwal, Martina Cardone, Christina FragouliAbstract:This paper studies the problem of information theoretic secure communication when a source has private messages to transmit to m destinations, in the presence of a passive adversary who eavesdrops an unknown set of k edges. The information theoretic secure capacity is derived over unit-edge capacity separable networks, for the cases when k = 1 and m is arbitrary, or m = 3 and k is arbitrary. This is achieved by first showing that there exists a secure polynomial-time code construction that matches an outer bound over two-layer networks, followed by a deterministic mapping between two-layer and arbitrary separable networks.
Martina Cardone - One of the best experts on this subject based on the ideXlab platform.
-
on secure network coding for multiple Unicast Traffic
IEEE Transactions on Information Theory, 2020Co-Authors: Gaurav Kumar Agarwal, Martina Cardone, Christina FragouliAbstract:This paper investigates the problem of secure communication in a wireline noiseless scenario where a source wishes to communicate to a number of destinations in the presence of a passive external adversary. Different from the multicast scenario, where all destinations are interested in receiving the same message, in this setting different destinations are interested in different messages. The main focus of this paper is on characterizing the secure capacity region, when the adversary has unbounded computational capabilities, but limited network presence. Towards this end, an outer bound on the secure capacity region is derived, and secure transmission schemes are designed and analyzed in terms of achieved rate performance. It is first shown that, for the case of two destinations, the designed scheme matches the outer bound, hence characterizing the secure capacity region. Then, a particular class of networks referred to as two-layer networks is considered, where the source communicates with the destinations by hopping information through one layer of relays. It is shown that the designed scheme is indeed capacity achieving for any two-layer network for which one of the following three conditions is satisfied: (i) the number of destinations is three, (ii) the number of edges eavesdropped by the adversary is one, (iii) the min-cut capacities assume specific values. It is also shown that two-layer networks can be used to model and study a more general class of networks, referred to as separable . The key feature of separable networks is that they can be partitioned into edge disjoint networks that satisfy specific min-cut properties. In particular, it is proved that the secure capacity region of any separable network can be characterized from the secure capacity region of the corresponding two-layer network. Finally, for an arbitrary network topology, a two-phase scheme is designed and its rate performance is compared with the capacity-achieving scheme for networks with two destinations.
-
On Secure Capacity of Multiple Unicast Traffic over Two-Layer Networks.
2019Co-Authors: Gaurav Kumar Agarwal, Martina Cardone, Christina FragouliAbstract:This paper studies the problem of secure communication over two-layer networks, where a source is connected to a set of relays via direct edges. These relays are then connected to $m$ destinations, such that each destination has direct connections to a subset of relays. In multiple Unicast Traffic, the source wishes to transmit independent information to each of the $m$ destinations. This work studies the secure capacity region for this Traffic over the defined two-layer networks, under the assumption of perfect information theoretic security criterion from an adversary who can access any $K$ edges of the network. In particular, the secure capacity region is characterized when either $K=1$ or $m=3$. Moreover, conditions sufficient to characterize the secure capacity region are provided for arbitrary values of $K$ and $m$.
-
On Secure Capacity of Multiple Unicast Traffic over Separable Networks
arXiv: Information Theory, 2019Co-Authors: Gaurav Kumar Agarwal, Martina Cardone, Christina FragouliAbstract:This paper studies the problem of information theoretic secure communication when a source has private messages to transmit to $m$ destinations, in the presence of a passive adversary who eavesdrops an unknown set of $k$ edges. The information theoretic secure capacity is derived over unit-edge capacity separable networks, for the cases when $k=1$ and $m$ is arbitrary, or $m=3$ and $k$ is arbitrary. This is achieved by first showing that there exists a secure polynomial-time code construction that matches an outer bound over two-layer networks, followed by a deterministic mapping between two-layer and arbitrary separable networks.
-
on secure network coding for multiple Unicast Traffic
arXiv: Information Theory, 2019Co-Authors: Gaurav Kumar Agarwal, Martina Cardone, Christina FragouliAbstract:This paper investigates the problem of secure communication in a wireline noiseless scenario where a source wishes to communicate to a number of destinations in the presence of a passive external adversary. Different from the multicast scenario, where all destinations are interested in receiving the same message, in this setting different destinations are interested in different messages. The main focus of this paper is on characterizing the secure capacity region, when the adversary has unbounded computational capabilities, but limited network presence. First, an outer bound on the secure capacity region is derived for arbitrary network topologies and general number of destinations. Then, secure transmission schemes are designed and analyzed in terms of achieved rate performance. In particular, for the case of two destinations, it is shown that the designed scheme matches the outer bound, hence characterizing the secure capacity region. It is also numerically verified that the designed scheme matches the outer bound for a special class of networks with general number of destinations, referred to as combination network. Finally, for an arbitrary network topology with general number of destinations, a two-phase polynomial time in the network size scheme is designed and its rate performance {is} compared with the capacity-achieving scheme for networks with two destinations.
-
ITW - On Secure Capacity of Multiple Unicast Traffic over Separable Networks
2019 IEEE Information Theory Workshop (ITW), 2019Co-Authors: Gaurav Kumar Agarwal, Martina Cardone, Christina FragouliAbstract:This paper studies the problem of information theoretic secure communication when a source has private messages to transmit to m destinations, in the presence of a passive adversary who eavesdrops an unknown set of k edges. The information theoretic secure capacity is derived over unit-edge capacity separable networks, for the cases when k = 1 and m is arbitrary, or m = 3 and k is arbitrary. This is achieved by first showing that there exists a secure polynomial-time code construction that matches an outer bound over two-layer networks, followed by a deterministic mapping between two-layer and arbitrary separable networks.
Eric Torng - One of the best experts on this subject based on the ideXlab platform.
-
ICNP - Optimization based rate allocation and scheduling in TDMA based wireless mesh networks
2008 IEEE International Conference on Network Protocols, 2008Co-Authors: Bo Wang, Matt W. Mutka, Eric TorngAbstract:Wireless mesh networking is a promising technology for building broadband wireless access networks. However, wireless mesh networks based on CSMA/CA MAC protocols suffer from unfairness and poor QoS support. Using TCP as a rate control mechanism in such networks further exacerbates the problem. Efficient rate allocation and scheduling algorithms that handle both multicast and Unicast Traffic in wireless mesh networks are needed with the increasing popularity of multicast and multimedia applications. In this paper, we propose a framework that performs both rate allocation and scheduling for Unicast and multicast Traffic in TDMA-based wireless mesh networks. The rate allocation algorithm is based on network utility maximization. The graph coloring-based scheduling algorithm achieves the allocated rates. Simulation results show that our framework provides guaranteed throughput and low delay for both multicast and Unicast Traffic. Furthermore, our framework significantly outperforms a previously published framework that has a similar objective.
Suman Banerjee - One of the best experts on this subject based on the ideXlab platform.
-
Network coding-aware routing in wireless networks
IEEE ACM Transactions on Networking, 2010Co-Authors: Sudipta Sengupta, Shravan Rayanchu, Suman BanerjeeAbstract:A recent approach--COPE, presented by Katti et al. (Proc. ACM SIGCOMM 2006, pp. 243-254)--for improving the throughput of Unicast Traffic in wireless multihop networks exploits the broadcast nature of the wireless medium through opportunistic network coding. In this paper, we analyze throughput improvements obtained by COPE-type network coding in wireless networks from a theoretical perspective. We make two key contributions. First, we obtain a theoretical formulation for computing the throughput of network coding on any wireless network topology and any pattern of concurrent Unicast Traffic sessions. Second, we advocate that routing be made aware of network coding opportunities rather than, as in COPE, being oblivious to it. More importantly, our model considers the tradeoff between routing flows close to each other for utilizing coding opportunities and away from each other for avoiding wireless interference. Our theoretical formulation provides a method for computing source-destination routes and utilizing the best coding opportunities from available ones so as to maximize the throughput. We handle scheduling of broadcast transmissions subject to wireless transmit/receive diversity and link interference in our optimization framework. Using our formulations, we compare the performance of traditional Unicast routing and network coding with coding-oblivious and coding-aware routing on a variety of mesh network topologies, including some derived from contemporary mesh network testbeds. Our evaluations show that a route selection strategy that is aware of network coding opportunities leads to higher end-to-end throughput when compared to coding-oblivious routing strategies.
-
an analysis of wireless network coding for Unicast sessions the case for coding aware routing
IEEE International Conference Computer and Communications, 2007Co-Authors: Sudipta Sengupta, Shravan Rayanchu, Suman BanerjeeAbstract:A recent approach, COPE, for improving the throughput of Unicast Traffic in wireless multi-hop networks exploits the broadcast nature of the wireless medium through opportunistic network coding. In this paper, we analyze throughput improvements obtained by COPE-type network coding in wireless networks from a theoretical perspective. We make two key contributions. First, we obtain a theoretical formulation for computing the throughput of network coding on any wireless network topology and any pattern of concurrent Unicast Traffic sessions. Second, we advocate that routing be made aware of network coding opportunities rather than, as in COPE, being oblivious to it. More importantly, our work studies the tradeoff between routing flows "close to each other" for utilizing coding opportunities and "away from each other" for avoiding wireless interference. Our theoretical formulation provides a method for computing source-destination routes and utilizing the best coding opportunities from available ones so as to maximize the throughput. We handle scheduling of broadcast transmissions subject to wireless transmit/receive diversity and link interference in our optimization framework. Using our formulations, we compare the performance of traditional Unicast routing and network coding with coding-oblivious and coding-aware routing on a variety of mesh network topologies, including some derived from contemporary mesh network testbeds. Our evaluations show that a route selection strategy that is aware of network coding opportunities leads to higher end-to-end throughput when compared to coding-oblivious routing strategies.
-
INFOCOM - An Analysis of Wireless Network Coding for Unicast Sessions: The Case for Coding-Aware Routing
IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications, 2007Co-Authors: Sudipta Sengupta, Shravan Rayanchu, Suman BanerjeeAbstract:A recent approach, COPE, for improving the throughput of Unicast Traffic in wireless multi-hop networks exploits the broadcast nature of the wireless medium through opportunistic network coding. In this paper, we analyze throughput improvements obtained by COPE-type network coding in wireless networks from a theoretical perspective. We make two key contributions. First, we obtain a theoretical formulation for computing the throughput of network coding on any wireless network topology and any pattern of concurrent Unicast Traffic sessions. Second, we advocate that routing be made aware of network coding opportunities rather than, as in COPE, being oblivious to it. More importantly, our work studies the tradeoff between routing flows "close to each other" for utilizing coding opportunities and "away from each other" for avoiding wireless interference. Our theoretical formulation provides a method for computing source-destination routes and utilizing the best coding opportunities from available ones so as to maximize the throughput. We handle scheduling of broadcast transmissions subject to wireless transmit/receive diversity and link interference in our optimization framework. Using our formulations, we compare the performance of traditional Unicast routing and network coding with coding-oblivious and coding-aware routing on a variety of mesh network topologies, including some derived from contemporary mesh network testbeds. Our evaluations show that a route selection strategy that is aware of network coding opportunities leads to higher end-to-end throughput when compared to coding-oblivious routing strategies.
