Sciweavers

366 search results - page 41 / 74
» Communication Complexity with Synchronized Clocks
Sort
View
DSN
2003
IEEE
15 years 5 months ago
Node Failure Detection and Membership in CANELy
Fault-tolerant distributed systems based on fieldbuses may benefit to a great extent from the availabilityof semantically rich communication services,such as those provided by g...
José Rufino, Paulo Veríssimo, Guilhe...
SRDS
1999
IEEE
15 years 4 months ago
Fault Injection based on a Partial View of the Global State of a Distributed System
Validating distributed systems is particularly difficult, since failures may occur due to a correlated occurrence of faults in different parts of the system. This paper describes ...
Michel Cukier, Ramesh Chandra, David Henke, Jessic...
ICASSP
2011
IEEE
14 years 3 months ago
A knapsack problem formulation for relay selection in secure cooperative wireless communication
—Cooperative jamming (CJ) schemes support secure wireless communication in the presence of one or more eavesdroppers. Larger numbers of cooperative relays provide better secrecy ...
Shuangyu Luo, Hana Godrich, Athina P. Petropulu, H...
BSN
2009
IEEE
141views Sensor Networks» more  BSN 2009»
15 years 6 months ago
Low-Complexity, High-Throughput Multiple-Access Wireless Protocol for Body Sensor Networks
Wireless systems that form a body-area network must be made small and low power without sacrificing performance. To achieve high-throughput communication in low-cost wireless bod...
Seung-mok Yoo, Chong-Jing Chen, Pai H. Chou
INFOCOM
2005
IEEE
15 years 5 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik