Sciweavers

154 search results - page 20 / 31
» Epidemic Broadcast Trees
Sort
View
INFOCOM
2007
IEEE
15 years 3 months ago
Cooperative Strategies and Optimal Scheduling for Tree Networks
Abstract— In this paper, we develop and analyze a lowcomplexity cooperative protocol that significantly increases the average throughput of multi-hop upstream transmissions for ...
Alexandre de Baynast, Omer Gurewitz, Edward W. Kni...
TAMC
2007
Springer
15 years 3 months ago
Approximately Optimal Trees for Group Key Management with Batch Updates
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...
Minming Li, Ze Feng, Ronald L. Graham, Frances F. ...
AINA
2005
IEEE
15 years 3 months ago
Dynamical Construction of a Core-Based Group-Shared Multicast Tree in Mobile Ad Hoc Networks
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
Bing-Hong Liu, Ming-Jer Tsai, Wei-Chei Ko
INFOCOM
2009
IEEE
15 years 4 months ago
Defending Mobile Phones from Proximity Malware
—As mobile phones increasingly become the target of propagating malware, their use of direct pair-wise communication mechanisms, such as Bluetooth and WiFi, pose considerable cha...
Gjergji Zyba, Geoffrey M. Voelker, Michael Liljens...
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
14 years 11 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...