Sciweavers

3910 search results - page 344 / 782
» Analyzing Cross-Connected Networks
Sort
View
INFOCOM
2007
IEEE
16 years 1 months ago
Randomized k-Coverage Algorithms For Dense Sensor Networks
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
Mohamed Hefeeda, M. Bagheri
DCOSS
2007
Springer
16 years 27 days ago
Localization for Anchoritic Sensor Networks
We introduce a class of anchoritic sensor networks, where communications between sensor nodes are undesirable or infeasible due to, e.g., harsh environments, energy constraints, or...
Yuliy M. Baryshnikov, Jian Tan
ESA
2007
Springer
92views Algorithms» more  ESA 2007»
16 years 27 days ago
Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation
Abstract. The small world phenomenon, a.k.a. the six degree of separation between individuals, was identified by Stanley Milgram at the end of the 60s. Milgram experiment demonstr...
Pierre Fraigniaud
HPCC
2007
Springer
16 years 26 days ago
CDACAN: A Scalable Structured P2P Network Based on Continuous Discrete Approach and CAN
Abstract. CAN is a famous structured peer-to-peer network based on ddimensional torus topology with constant degree and logarithmical diameter, but suffers from poor scalability wh...
Lingwei Li, Qunwei Xue, Deke Guo
MSN
2007
Springer
192views Sensor Networks» more  MSN 2007»
16 years 26 days ago
Secure Group Communication with Self-healing and Rekeying in Wireless Sensor Networks
We have developed a self-healing key distribution scheme for secure multicast group communications for wireless sensor network environment. We present a strategy for securely distr...
Firdous Kausar, Sajid Hussain, Jong Hyuk Park, Ash...