Sciweavers

33 search results - page 1 / 7
» Improved lower bound for deterministic broadcasting in radio...
Sort
View
CORR
2008
Springer
68views Education» more  CORR 2008»
13 years 4 months ago
Improved lower bound for deterministic broadcasting in radio networks
We consider the problem of deterministic broadcasting in radio networks when the nodes have limited knowledge about the topology of the network. We show that for every determinist...
Carlos Brito, Shailesh Vaya
ALGOSENSORS
2009
Springer
13 years 11 months ago
Near-Optimal Radio Use for Wireless Network Synchronization
In this paper we consider the model of communication where wireless devices can either switch their radios off to save energy (and hence, can neither send nor receive messages), o...
Milan Bradonjic, Eddie Kohler, Rafail Ostrovsky
WDAG
2010
Springer
183views Algorithms» more  WDAG 2010»
13 years 2 months ago
What Is the Use of Collision Detection (in Wireless Networks)?
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
Johannes Schneider, Roger Wattenhofer
PODC
2005
ACM
13 years 10 months ago
On reliable broadcast in a radio network
— We consider the problem of reliable broadcast in an infinite grid (or finite toroidal) radio network under Byzantine and crash-stop failures. We present bounds on the maximum...
Vartika Bhandari, Nitin H. Vaidya
GLOBECOM
2009
IEEE
13 years 11 months ago
On the Connectivity of Key-Distribution Strategies in Wireless Sensor Networks
Abstract—Wireless sensor networks (WSNs) are usually missioned to gather critical information in hostile and adversarial environments, which make them susceptible to compromise a...
Hosein Shafiei, Ahmad Khonsari, Mohammad Sadegh Ta...