Sciweavers

2571 search results - page 311 / 515
» Approximation schemes for wireless networks
Sort
View
OTM
2007
Springer
16 years 22 days ago
Network Coding Protocols for Secret Key Distribution
Abstract. Recent contributions have uncovered the potential of network coding, i.e. algebraic mixing of multiple information flows in a network, to provide enhanced security in pa...
Paulo F. Oliveira, João Barros
CISS
2008
IEEE
16 years 1 months ago
Subgradient methods in network resource allocation: Rate analysis
— We consider dual subgradient methods for solving (nonsmooth) convex constrained optimization problems. Our focus is on generating approximate primal solutions with performance ...
Angelia Nedic, Asuman E. Ozdaglar
ICC
2007
IEEE
150views Communications» more  ICC 2007»
15 years 10 months ago
Fast Proactive Recovery from Concurrent Failures
Abstract-- Recovery of traffic in connectionless pure IP networks has traditionally been handled by a full re-convergence of the network state. This process operates in a time scal...
Audun Fosselie Hansen, Olav Lysne, Tarik Cicic, St...
CORR
2008
Springer
115views Education» more  CORR 2008»
15 years 6 months ago
Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design
In this paper, we consider single-source, single-sink (ss-ss) multi-hop relay networks, with slow-fading Rayleigh links and single-antenna relay nodes operating under the half-dupl...
K. Sreeram, S. Birenjith, P. Vijay Kumar
ICNP
2007
IEEE
16 years 28 days ago
A Probabilistic Coverage Protocol for Wireless Sensor Networks
—We propose a new probabilistic coverage protocol (denoted by PCP) that considers probabilistic sensing models. PCP is fairly general and can be used with different sensing model...
Mohamed Hefeeda, Hossein Ahmadi