Sciweavers

1716 search results - page 84 / 344
» Approximation Algorithms for Data Broadcast in Wireless Netw...
Sort
View
ADHOCNOW
2008
Springer
14 years 3 months ago
Approximating Minimum-Power k-Connectivity
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...
Zeev Nutov
CCS
2007
ACM
14 years 3 months ago
Robust group key agreement using short broadcasts
A group key agreement protocol (GKA) allows a set of players to establish a shared secret key which can be used to secure a subsequent communication. Several efficient constantrou...
Stanislaw Jarecki, Jihye Kim, Gene Tsudik
BIOWIRE
2007
Springer
14 years 3 months ago
Epcast: Controlled Dissemination in Human-Based Wireless Networks Using Epidemic Spreading Models
Epidemics-inspired techniques have received huge attention in recent years from the distributed systems and networking communities. These algorithms and protocols rely on probabili...
Salvatore Scellato, Cecilia Mascolo, Mirco Musoles...
ADHOC
2010
292views more  ADHOC 2010»
13 years 9 months ago
Sleep/wake scheduling for multi-hop sensor networks: Non-convexity and approximation algorithm
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...
Yan Wu, Sonia Fahmy, Ness B. Shroff
INFOCOM
2009
IEEE
14 years 3 months ago
Minimum-Latency Beaconing Schedule in Multihop Wireless Networks
— Minimum-latency beaconing schedule (MLBS) in synchronous multihop wireless networks seeks a schedule for beaconing with the shortest latency. This problem is NP-hard even when ...
Peng-Jun Wan, Xiao-Hua Xu, Lixin Wang, Xiaohua Jia...