Sciweavers

218 search results - page 6 / 44
» Adaptive Gossip-Based Broadcast
Sort
View
IMCSIT
2010
13 years 5 months ago
Fast Construction of Broadcast Scheduling and Gossiping in Dynamic Ad Hoc Networks
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
Krzysztof Krzywdzinski
IDEAS
2002
IEEE
223views Database» more  IDEAS 2002»
14 years 15 days ago
Energy-Efficient Data Broadcasting in Mobile Ad-Hoc Networks
Energy saving is the most important issue in wireless mobile computing due to power constraints on mobile units. Data broadcasting is the main method of information dissemination ...
Le Gruenwald, Muhammad Javed, Meng Gu
EUROCRYPT
2007
Springer
13 years 11 months ago
Round-Efficient Secure Computation in Point-to-Point Networks
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
Jonathan Katz, Chiu-Yuen Koo
RTAS
1996
IEEE
13 years 11 months ago
AIDA-based real-time fault-tolerant broadcast disks
The proliferation of mobile computers and wireless networks requires the design of future distributed real-time applications to recognize and deal with the signi cant asymmetry be...
Azer Bestavros
RTCSA
1999
IEEE
13 years 12 months ago
Adaptive Data Broadcast Strategy for Transactions with Multiple Data Requests in Mobile Computing Environments
Data Broadcast in mobile environments has received much attention in recent years and a large number of algorithms proposed. However, existing work in the literature only assume a ...
Joe Chun-Hung Yuen, Edward Chan, Kam-yiu Lam