Sciweavers

1498 search results - page 104 / 300
» Collection tree protocol
Sort
View
120
Voted
AOSD
2006
ACM
15 years 6 months ago
Reflections on aspects and configurable protocols
The goals of aspect oriented software development (AOSD) and frameworks for configurable protocols (CPs) are similar in many respects. AOSD allows the specification of crosscuttin...
Matti A. Hiltunen, François Taïani, Ri...
107
Voted
ENTCS
2000
112views more  ENTCS 2000»
15 years 2 months ago
Typed Multiset Rewriting Specifications of Security Protocols
The language MSR has successfully been used in the past to prove undecidability about security protocols modeled according to the Dolev-Yao abstraction. In this paper, we revise t...
Iliano Cervesato
114
Voted
SODA
2010
ACM
178views Algorithms» more  SODA 2010»
15 years 12 months ago
Tree Embeddings for Two-Edge-Connected Network Design
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
ICC
2007
IEEE
180views Communications» more  ICC 2007»
15 years 9 months ago
Distributed Quad-Tree for Spatial Querying in Wireless Sensor Networks
— In contrast to the traditional wireless sensor network (WSN) applications that perform only data collection and aggregation, new generation of information processing applicatio...
Murat Demirbas, Xuming Lu
IPPS
2005
IEEE
15 years 8 months ago
A Performance Comparison of Tree and Ring Topologies in Distributed Systems
A distributed system is a collection of computers that are connected via a communication network. Distributed systems have become commonplace due to the wide availability of low-c...
Min Huang, Brett Bode