Sciweavers

334 search results - page 45 / 67
» Inapproximability of Survivable Networks
Sort
View
INFOCOM
2010
IEEE
13 years 7 months ago
Castor: Scalable Secure Routing for Ad Hoc Networks
—Wireless ad hoc networks are inherently vulnerable, as any node can disrupt the communication of potentially any other node in the network. Many solutions to this problem have b...
Wojciech Galuba, Panos Papadimitratos, Marcin Potu...
WDAG
2007
Springer
105views Algorithms» more  WDAG 2007»
14 years 2 months ago
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
Jérémie Chalopin, Shantanu Das, Nico...
IM
1997
13 years 10 months ago
Unified Fault, Resource Management and Control in ATM-based IBCN
In this paper we present the initial specification of a system that covers both the control and management planes of network operation, with emphasis on fault, performance, and co...
Stelios Sartzetakis, Panos Georgatsos, George E. K...
ADHOC
2008
146views more  ADHOC 2008»
13 years 8 months ago
A secure group key management scheme for hierarchical mobile ad hoc networks
In this paper, we present a secure group key management scheme for hierarchical mobile ad-hoc networks. Our approach aims to improve both scalability and survivability of group ke...
Dijiang Huang, Deep Medhi
GLOBECOM
2010
IEEE
13 years 6 months ago
Energy-Efficient WDM Network Planning with Dedicated Protection Resources in Sleep Mode
Abstract--Energy-efficient optical networks are gaining momentum as environmental-friendly solutions with reduced operational costs. Energy-efficiency can be achieved by using devi...
Ajmal Muhammad, Paolo Monti, Isabella Cerutti, Len...