Sciweavers

552 search results - page 94 / 111
» Routing complexity of faulty networks
Sort
View
IPSN
2007
Springer
14 years 1 months ago
Sparse data aggregation in sensor networks
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
JSAC
2010
153views more  JSAC 2010»
13 years 2 months ago
Autonomic traffic engineering for network robustness
Abstract--The continuously increasing complexity of communication networks and the increasing diversity and unpredictability of traffic demand has led to a consensus view that the ...
Ali Tizghadam, Alberto Leon-Garcia
CN
2010
95views more  CN 2010»
13 years 7 months ago
Loop-free alternates and not-via addresses: A proper combination for IP fast reroute?
The IETF currently discusses fast reroute mechanisms for IP networks (IP FRR). IP FRR accelerates the recovery in case of network element failures and avoids micro-loops during re...
Michael Menth, Matthias Hartmann, Rüdiger Mar...
GI
2004
Springer
14 years 28 days ago
A Low-Cost Solution for Frequent Symmetric Key Exchange in Ad-hoc Networks
: Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complex...
Markus Volkmer, Sebastian Wallner
CN
2008
108views more  CN 2008»
13 years 6 months ago
An approach to the identification of network elements composing heterogeneous end-to-end paths
Today's networks are becoming increasingly complex and the ability to effectively and efficiently operate and manage them is ever more challenging. Ways to provide end-to-end...
Alessio Botta, Antonio Pescapè, Giorgio Ven...