108 search results - page 19 / 22 » Improved bounds and algorithms for graph cuts and network re... |
PODC
2005
ACM
14 years 1 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
—In a sensor network, in practice, the communication among sensors is subject to: 1) errors that can cause failures of links among sensors at random times; 2) costs; and 3) const...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. This paper studies the problem Minimu...
GLOBECOM
2010
IEEE
13 years 5 months ago
2010
IEEE
In wireless sensor networks (WSNs), sensor nodes are typically subjected to energy constraints and often prone to topology changes. While duty cycling has been widely used for ener...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...