Sciweavers

436 search results - page 22 / 88
» On generalized gossiping and broadcasting
Sort
View
IPPS
1998
IEEE
14 years 2 months ago
Fault-Tolerant Broadcasting in Toroidal Networks
A non-redundant fault-tolerant broadcasting algorithm in a faulty k-ary n-cube is designed. The algorithm can adapt up to 2n,2 node failures. Compared to the optimal algorithm in a...
Bader Almohammad, Bella Bose
SIGECOM
2005
ACM
130views ECommerce» more  SIGECOM 2005»
14 years 3 months ago
Graceful service degradation (or, how to know your payment is late)
When distributing digital content over a broadcast channel it’s often necessary to revoke users whose access privileges have expired, thus preventing them from recovering the co...
Alexandr Andoni, Jessica Staddon
MOBIHOC
2008
ACM
14 years 9 months ago
An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...
Reza Mahjourian, Feng Chen, Ravi Tiwari, My T. Tha...
DIALM
2007
ACM
144views Algorithms» more  DIALM 2007»
14 years 1 months ago
Reliable Local Broadcast in a Wireless Network Prone to Byzantine Failures
Reliable broadcast can be a very useful primitive for many distributed applications, especially in the context of sensoractuator networks. Recently, the issue of reliable broadcas...
Vartika Bhandari, Nitin H. Vaidya
STACS
2001
Springer
14 years 2 months ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...