Sciweavers

867 search results - page 69 / 174
» Network Robustness and Graph Topology
Sort
View
APWEB
2006
Springer
13 years 11 months ago
Strongly Connected Dominating Sets in Wireless Sensor Networks with Unidirectional Links
A Connected Dominating Set (CDS) can serve as a virtual backbone for a wireless sensor network since there is no fixed infrastructure or centralized management in wireless sensor n...
Ding-Zhu Du, My T. Thai, Yingshu Li, Dan Liu, Shiw...
SRDS
2010
IEEE
13 years 5 months ago
Shedding Light on Enterprise Network Failures Using Spotlight
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...
Dipu John, Pawan Prakash, Ramana Rao Kompella, Ran...
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 6 months ago
Adding a referee to an interconnection network: What can(not) be computed in one round
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
Florent Becker, Martín Matamala, Nicolas Ni...
COMCOM
2008
100views more  COMCOM 2008»
13 years 7 months ago
Individual profile graphs for location management in PCS networks
A user's profile, for the purpose of location management in a personal communication service (PCS) network, is formalized as a subgraph of the network graph. This subgraph, t...
Chansophea Chuon, Sumanta Guha
SPAA
2003
ACM
14 years 1 months ago
Novel architectures for P2P applications: the continuous-discrete approach
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
Moni Naor, Udi Wieder