Sciweavers

552 search results - page 76 / 111
» Routing complexity of faulty networks
Sort
View
ICPADS
2007
IEEE
15 years 5 months ago
Energy-efficient anonymous multicast in mobile ad-hoc networks
Protecting personal privacy and energy efficiency are two primary concerns for mobile ad hoc networks. However, no energy-efficient multicast algorithm designed for preserving ano...
Jung-Chun Kao, Radu Marculescu
ICCD
2006
IEEE
137views Hardware» more  ICCD 2006»
15 years 8 months ago
Implementation and Evaluation of On-Chip Network Architectures
— Driven by the need for higher bandwidth and complexity reduction, off-chip interconnect has evolved from proprietary busses to networked architectures. A similar evolution is o...
Paul Gratz, Changkyu Kim, Robert G. McDonald, Step...
DSD
2006
IEEE
131views Hardware» more  DSD 2006»
15 years 2 months ago
Designing Efficient Irregular Networks for Heterogeneous Systems-on-Chip
Abstract-- Networks-on-Chip will serve as the central integration platform in future complex SoC designs, composed of a large number of heterogeneous processing resources. Most res...
Christian Neeb, Norbert Wehn
SIGMOD
2011
ACM
206views Database» more  SIGMOD 2011»
14 years 1 months ago
Sampling based algorithms for quantile computation in sensor networks
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
Zengfeng Huang, Lu Wang, Ke Yi, Yunhao Liu
106
Voted
MOBIHOC
2008
ACM
15 years 10 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li