Sciweavers

625 search results - page 102 / 125
» Routing in Trees
Sort
View
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
14 years 4 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
SENSYS
2004
ACM
14 years 3 months ago
Synopsis diffusion for robust aggregation in sensor networks
Previous approaches for computing duplicate-sensitive aggregates in sensor networks (e.g., in TAG) have used a tree topology, in order to conserve energy and to avoid double-count...
Suman Nath, Phillip B. Gibbons, Srinivasan Seshan,...
TON
2008
126views more  TON 2008»
13 years 9 months ago
Hyperbolic embedding of internet graph for distance estimation and overlay construction
Estimating distances in the Internet has been studied in the recent years due to its ability to improve the performance of many applications, e.g., in the peer-topeer realm. One sc...
Yuval Shavitt, Tomer Tankel
TC
2010
13 years 8 months ago
Stateless Multicasting in Mobile Ad Hoc Networks
—There are increasing interest and big challenge in designing a scalable and robust multicast routing protocol in a mobile ad hoc network (MANET) due to the difficulty in group ...
Xiaojing Xiang, Xin Wang, Yuanyuan Yang
AINA
2005
IEEE
14 years 3 months ago
Global Connectivity for Mobile IPv6-Based Ad Hoc Networks
The IPv6-enabled network architecture has recently attracted much attention. In this paper, we address the issue of connecting MANETs to global IPv6 networks while supporting IPv6...
Chiung-Ying Wang, Cheng-Ying Li, Ren-Hung Hwang, Y...