Sciweavers

417 search results - page 61 / 84
» A randomized algorithm for the joining protocol in dynamic d...
Sort
View
CN
2010
183views more  CN 2010»
13 years 8 months ago
A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
Mehdi Esnaashari, Mohammad Reza Meybodi
INFOCOM
2000
IEEE
14 years 1 months ago
Dynamic Routing of Bandwidth Guaranteed Tunnels with Restoration
— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a pr...
Murali S. Kodialam, T. V. Lakshman
ICNP
2009
IEEE
14 years 3 months ago
Principles of Safe Policy Routing Dynamics
—We introduce the Dynamic Policy Routing (DPR) model that captures the propagation of route updates under arbitrary changes in topology or path preferences. DPR introduces the no...
Sam Epstein, Karim Mattar, Ibrahim Matta
CCS
2007
ACM
14 years 2 months ago
Robust group key agreement using short broadcasts
A group key agreement protocol (GKA) allows a set of players to establish a shared secret key which can be used to secure a subsequent communication. Several efficient constantrou...
Stanislaw Jarecki, Jihye Kim, Gene Tsudik
TON
2010
129views more  TON 2010»
13 years 7 months ago
QoS-based manycasting over optical burst-switched (OBS) networks
Abstract—Many distributed applications require a group of destinations to be coordinated with a single source. Multicasting is a communication paradigm to implement these distrib...
Balagangadhar G. Bathula, Vinod Vokkarane