Sciweavers

625 search results - page 77 / 125
» Semi-preemptive routing on trees
Sort
View
TMC
2012
11 years 11 months ago
Fast Data Collection in Tree-Based Wireless Sensor Networks
—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...
Özlem Durmaz Incel, Amitabha Ghosh, Bhaskar K...
JSAC
2006
157views more  JSAC 2006»
13 years 8 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
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...
Shu Huang, Rudra Dutta, George N. Rouskas
INFOCOM
2002
IEEE
14 years 1 months ago
Application of Network Calculus to General Topologies using Turn-Prohibition
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...
David Starobinski, Mark G. Karpovsky, Lev Zakrevsk...
ALGOSENSORS
2007
Springer
13 years 10 months ago
Intrusion Detection of Sinkhole Attacks in Wireless Sensor Networks
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...
Ioannis Krontiris, Tassos Dimitriou, Thanassis Gia...
SIGCOMM
1998
ACM
14 years 22 days ago
QoSMIC: Quality of Service Sensitive Multicast Internet Protocol
In this paper, we present, QoSMIC, a multicast protocol for the Internet that supports QoS-sensitive routing, and minimizes the importance of a priori con guration decisions such...
Michalis Faloutsos, Anindo Banerjea, Rajesh Pankaj