Sciweavers

899 search results - page 60 / 180
» On Wiretap Networks II
Sort
View
126
Voted
INFOCOM
2007
IEEE
15 years 9 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
97
Voted
GLOBECOM
2006
IEEE
15 years 9 months ago
Toposemantic Network Clustering
— We study the problem of building an optimal network-layer clustering hierarchy, where the optimality can be defined using three potentially conflicting metrics: state, delay ...
Leonid B. Poutievski, Kenneth L. Calvert, Jim Grif...
SRDS
2006
IEEE
15 years 9 months ago
Generalised Repair for Overlay Networks
We present and evaluate a generic approach to the repair of overlay networks which identifies general principles of overlay repair and embodies these as a reusable service. At th...
Barry Porter, François Taïani, Geoff C...
137
Voted
ICNP
2003
IEEE
15 years 8 months ago
Characterizing Overlay Multicast Networks
Overlay networks among cooperating hosts have recently emerged as a viable solution to several challenging problems, including multicasting, routing, content distribution, and pee...
Sonia Fahmy, Minseok Kwon
P2P
2003
IEEE
115views Communications» more  P2P 2003»
15 years 8 months ago
NanoPeer Networks and P2P Worlds
We present the NanoPeers architecture paradigm, a peer-to-peer network of lightweight devices, lacking all or most of the capabilities of their computer-world counterparts. We ide...
Peter Triantafillou, Nikos Ntarmos, Sotiris E. Nik...