Sciweavers

1498 search results - page 13 / 300
» Collection tree protocol
Sort
View
INFOCOM
1997
IEEE
14 years 2 months ago
Restricted Dynamic Steiner Trees for Scalable Multicast in Datagram Networks
The paper addresses the issue of minimizing the number of nodes involved in routing over a multicast tree and in the maintenance of such a tree in a datagram network. It presents a...
Ehud Aharoni, Reuven Cohen
CADE
2005
Springer
14 years 10 months ago
Regular Protocols and Attacks with Regular Knowledge
We prove that, if the initial knowledge of the intruder is given by a deterministic bottom-up tree automaton, then the insecurity problem for cryptographic protocols with atomic ke...
Tomasz Truderung
IEEEIAS
2007
IEEE
14 years 4 months ago
Modeling Security Protocols as Games
We model security protocols as a game tree using concepts of game semantics. The model interprets protocol specifications as strategies over a game tree that represents the type ...
Mohamed Saleh, Mourad Debbabi
CCGRID
2002
IEEE
14 years 2 months ago
End-Host Multicast Communication Using Switch-Trees Protocols
—Switch-trees are peer-to-peer algorithms for building and improving end-host multicast trees. Nodes switch parents to reduce tree cost or lower source-member latency. A node swi...
David A. Helder, Sugih Jamin
TMC
2008
156views more  TMC 2008»
13 years 9 months ago
Rendezvous Planning in Wireless Sensor Networks with Mobile Elements
Recent research shows that significant energy saving can be achieved in wireless sensor networks by using mobile elements (MEs) capable of carrying data mechanically. However, the ...
Guoliang Xing, Tian Wang, Zhihui Xie, Weijia Jia