Sciweavers

7133 search results - page 165 / 1427
» Communication algorithms with advice
Sort
View
INFOCOM
1997
IEEE
15 years 8 months ago
An Algorithm to Compute Collusion Paths
In earlier work we have formulated a collusion problem that determines whether it is possible for a set of colluders to collectively discover a target set of information, starting...
Steven H. Low, Nicholas F. Maxemchuk
SIAMCOMP
2002
90views more  SIAMCOMP 2002»
15 years 4 months ago
A Virtually Synchronous Group Multicast Algorithm for WANs: Formal Approach
This paper presents a formal design for a novel group communication service targeted for WANs. The service provides Virtual Synchrony semantics. Such semantics facilitate the desi...
Idit Keidar, Roger Khazan
COMSUR
2011
203views Hardware» more  COMSUR 2011»
14 years 4 months ago
Overcoming Adversaries in Sensor Networks: A Survey of Theoretical Models and Algorithmic Approaches for Tolerating Malicious In
Interference is an unavoidable property of the wireless communication medium and, in sensor networks, such interference is exacerbated due to the energy-starved nature of the netw...
Maxwell Young, Raouf Boutaba
GLOBECOM
2007
IEEE
15 years 11 months ago
A Steepest Descent Relocation Algorithm for Placement of Sinks in a Sensor Network
— In this paper we use an information flow model for placement of traffic sinks in a wireless sensor network. Our mathematical model translates a communication network composed...
Mehdi Kalantari, Mark A. Shayman
ICC
2009
IEEE
136views Communications» more  ICC 2009»
15 years 11 months ago
Approximation Algorithm for QoS Routing with Multiple Additive Constraints
—In this paper, we study the problem of computing the supported QoS from a source to a destination with multiple additive constraints. The problem has been shown to be NP-complet...
Ronghui Hou, King-Shan Lui, Ka-Cheong Leung, Fred ...