Sciweavers

47 search results - page 2 / 10
» Speeding up Protocols for Small Messages
Sort
View
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
13 years 6 months ago
Unconditionally reliable message transmission in directed networks
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
Bhavani Shankar, Prasant Gopal, Kannan Srinathan, ...
ENTCS
2007
95views more  ENTCS 2007»
13 years 5 months ago
Rijndael for Sensor Networks: Is Speed the Main Issue?
We present an implementation of Rijndael for wireless sensor networks running on Eyes sensor nodes. In previous works, Rijndael has not been considered a suitable encryption algor...
Andrea Vitaletti, Gianni Palombizio
INFOCOM
2002
IEEE
13 years 10 months ago
Gossip-based ad hoc routing
— Many ad hoc routing protocols are based on (some variant of) flooding. Despite various optimizations, many routing messages are propagated unnecessarily. We propose a gossipin...
Zygmunt J. Haas, Joseph Y. Halpern, Erran L. Li
CSL
2004
Springer
13 years 10 months ago
Parameterized Model Checking of Ring-Based Message Passing Systems
The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems,  ¢¡ , comprised of finite, but arbitrarily many,...
E. Allen Emerson, Vineet Kahlon
ICNP
1999
IEEE
13 years 9 months ago
A New Proposal for RSVP Refreshes
As a soft-state protocol, RSVP specifies that each RSVP node sends periodic control messages to maintain the state for active RSVP sessions. The protocol overhead due to such peri...
Lan Wang, Andreas Terzis, Lixia Zhang