The Experts below are selected from a list of 5079 Experts worldwide ranked by ideXlab platform
Joerg Kliewer - One of the best experts on this subject based on the ideXlab platform.
-
on secure network coding with uniform wiretap sets
2013 International Symposium on Network Coding (NetCod), 2013Co-Authors: Wentao Huang, Michael Langberg, Joerg KliewerAbstract:This paper studies secure Unicast Communication over a network with uniform wiretap sets and shows that, when network nodes can independently generate randomness, determining the secrecy capacity is at least as difficult as the k-Unicast network coding problem. In particular, we show that a general k-Unicast problem can be reduced to the problem of finding the secrecy capacity of a corresponding single Unicast network with uniform link capacities and any one wiretap link. We propose a low-complexity linear optimization-based achievable strategy involving global random keys that can be generated anywhere in the network, and an efficient greedy algorithm that further improves achievable rate by exploiting local random keys.
-
NetCod - On secure network coding with uniform wiretap sets
2013 International Symposium on Network Coding (NetCod), 2013Co-Authors: Wentao Huang, Michael Langberg, Joerg KliewerAbstract:This paper studies secure Unicast Communication over a network with uniform wiretap sets and shows that, when network nodes can independently generate randomness, determining the secrecy capacity is at least as difficult as the k-Unicast network coding problem. In particular, we show that a general k-Unicast problem can be reduced to the problem of finding the secrecy capacity of a corresponding single Unicast network with uniform link capacities and any one wiretap link. We propose a low-complexity linear optimization-based achievable strategy involving global random keys that can be generated anywhere in the network, and an efficient greedy algorithm that further improves achievable rate by exploiting local random keys.
Wentao Huang - One of the best experts on this subject based on the ideXlab platform.
-
on secure network coding with uniform wiretap sets
2013 International Symposium on Network Coding (NetCod), 2013Co-Authors: Wentao Huang, Michael Langberg, Joerg KliewerAbstract:This paper studies secure Unicast Communication over a network with uniform wiretap sets and shows that, when network nodes can independently generate randomness, determining the secrecy capacity is at least as difficult as the k-Unicast network coding problem. In particular, we show that a general k-Unicast problem can be reduced to the problem of finding the secrecy capacity of a corresponding single Unicast network with uniform link capacities and any one wiretap link. We propose a low-complexity linear optimization-based achievable strategy involving global random keys that can be generated anywhere in the network, and an efficient greedy algorithm that further improves achievable rate by exploiting local random keys.
-
NetCod - On secure network coding with uniform wiretap sets
2013 International Symposium on Network Coding (NetCod), 2013Co-Authors: Wentao Huang, Michael Langberg, Joerg KliewerAbstract:This paper studies secure Unicast Communication over a network with uniform wiretap sets and shows that, when network nodes can independently generate randomness, determining the secrecy capacity is at least as difficult as the k-Unicast network coding problem. In particular, we show that a general k-Unicast problem can be reduced to the problem of finding the secrecy capacity of a corresponding single Unicast network with uniform link capacities and any one wiretap link. We propose a low-complexity linear optimization-based achievable strategy involving global random keys that can be generated anywhere in the network, and an efficient greedy algorithm that further improves achievable rate by exploiting local random keys.
Lewis M. Mackenzie - One of the best experts on this subject based on the ideXlab platform.
-
ICPP - Latency of double-tree broadcast in wormhole-routed hypercubes
International Conference on Parallel Processing 2001., 2001Co-Authors: Alireza Shahrabi, Mohamed Ould-khaoua, Lewis M. MackenzieAbstract:Several analytical models have been proposed in the literature for wormhole-routed multicomputers. However, all these models have been discussed in the context of Unicast Communication and there has been comparatively little activity in the area of analytical modelling of collective Communication algorithms like broadcast. This paper presents an analytical model for predicting latency of broadcast messages in wormhole-routed hypercubes. Results obtained through simulation experiments show that the model exhibits a good degree of accuracy in predicting broadcast latency under different working conditions.
Michael Langberg - One of the best experts on this subject based on the ideXlab platform.
-
on secure network coding with uniform wiretap sets
2013 International Symposium on Network Coding (NetCod), 2013Co-Authors: Wentao Huang, Michael Langberg, Joerg KliewerAbstract:This paper studies secure Unicast Communication over a network with uniform wiretap sets and shows that, when network nodes can independently generate randomness, determining the secrecy capacity is at least as difficult as the k-Unicast network coding problem. In particular, we show that a general k-Unicast problem can be reduced to the problem of finding the secrecy capacity of a corresponding single Unicast network with uniform link capacities and any one wiretap link. We propose a low-complexity linear optimization-based achievable strategy involving global random keys that can be generated anywhere in the network, and an efficient greedy algorithm that further improves achievable rate by exploiting local random keys.
-
Allerton - On a capacity equivalence between multiple multicast and multiple Unicast
2013 51st Annual Allerton Conference on Communication Control and Computing (Allerton), 2013Co-Authors: Ming Fai Wong, Michael Langberg, Michelle EffrosAbstract:An equivalence between multiple multicast and multiple Unicast network coding is proven in a 2007 paper by Dougherty and Zeger. The result is extended to index coding under the assumption of linear coding in recent work by Maleki et al. In this work, we extend the result to arbitrary (e.g. possibly noisy) memoryless networks under an asymptotic definition of reliability. We show the equivalence for non-linear index codes as a special case. Our result implies that solving the multiple Unicast Communication problem is sufficient to solve all Communication problems in memoryless networks.
-
NetCod - On secure network coding with uniform wiretap sets
2013 International Symposium on Network Coding (NetCod), 2013Co-Authors: Wentao Huang, Michael Langberg, Joerg KliewerAbstract:This paper studies secure Unicast Communication over a network with uniform wiretap sets and shows that, when network nodes can independently generate randomness, determining the secrecy capacity is at least as difficult as the k-Unicast network coding problem. In particular, we show that a general k-Unicast problem can be reduced to the problem of finding the secrecy capacity of a corresponding single Unicast network with uniform link capacities and any one wiretap link. We propose a low-complexity linear optimization-based achievable strategy involving global random keys that can be generated anywhere in the network, and an efficient greedy algorithm that further improves achievable rate by exploiting local random keys.
H. Hassanein - One of the best experts on this subject based on the ideXlab platform.
-
IPCCC - SeMAC: robust broadcast MAC protocol for multi-hop wireless ad hoc networks
2006 IEEE International Performance Computing and Communications Conference, 2006Co-Authors: H. HassaneinAbstract:In an ad hoc network, broadcast data Communication is an unavoidable type of data transmission that provides synchronization, routing, and other messages to all the neighboring devices. Guaranteeing that all neighboring MTs receive broadcast messages is a hard task in multi-hop wireless ad hoc networks, especially when the traffic load is heavy. In this paper, we propose the sequential medium access control (SeMAC) protocol which aims at collision-free Communication and reduced overhead for predictable broadcast message to sustain dynamic changes in network topology, as well as facilitate smooth operation of peer-to-peer Unicast in multi-hop ad hoc networks SeMAC is intended to complement the IEEE 802.11 DCF function and is shown in this paper to greatly enhance the performance of broadcast and Unicast Communication of the IEEE 802.11.
