830 search results - page 104 / 166 » Route kernels for trees |
SPAA
1996
ACM
15 years 4 months ago
1996
ACM
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
154
click to vote
TMC
2012
13 years 2 months ago
2012
—We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evalu...
100
click to vote
JSAC
2006
14 years 12 months ago
2006
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
101
click to vote
INFOCOM
2002
IEEE
15 years 4 months ago
2002
IEEE
Abstract— Network calculus is known to apply in general only to feedforward routing networks, i.e., networks where routes do not create cycles of interdependent packet flows. In...
101
click to vote
ALGOSENSORS
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. In this paper, we present an Intrusion Detection System designed for wireless sensor networks and show how it can be configured to detect Sinkhole attacks. A Sinkhole at...