Sciweavers

1255 search results - page 127 / 251
» On Simple and Secure Key Distribution
Sort
View
143
Voted
CONCUR
2009
Springer
15 years 1 months ago
On Convergence of Concurrent Systems under Regular Interactions
Convergence is often the key liveness property for distributed systems that interact with physical processes. Techniques for proving convergence (asymptotic stability) have been ex...
Pavithra Prabhakar, Sayan Mitra, Mahesh Viswanatha...
WDAG
1994
Springer
123views Algorithms» more  WDAG 1994»
15 years 7 months ago
Breakpoints and Time in Distributed Computations
This paper investigates how vector time can be used to set breakpoints in distributed computations for the purpose of analyzing and debugging distributed programs. A breakpoint is ...
Twan Basten
166
Voted
JCM
2010
98views more  JCM 2010»
15 years 2 months ago
High Speed Data Routing in Vehicular Sensor Networks
—In this paper, we show through a simple secure symmetric key based protocol design and experiments the feasibility of secure data collection in a vehicular sensor networks. This...
Harry Gao, Seth Utecht, Gregory Patrick, George Hs...
142
Voted
ICC
2008
IEEE
142views Communications» more  ICC 2008»
15 years 10 months ago
Tuning Up the Performance of Constant-Time Distributed Scheduling Algorithms via Majorization
— Scheduling algorithms assign contention probability for each link in Wireless Ad Hoc Networks and plays a key role in deciding the system performance. Recently, many lowcost di...
Han Cai, Do Young Eun
169
Voted
GSN
2009
Springer
155views Sensor Networks» more  GSN 2009»
15 years 7 months ago
Distributed Network Configuration for Wavelet-Based Compression in Sensor Networks
En-route data compression is fundamental to reduce the power consumed for data gathering in sensor networks. Typical in-network compression schemes involve the distributed computat...
Paula Tarrío, Giuseppe Valenzise, Godwin Sh...