Sciweavers

1388 search results - page 66 / 278
» Approximability of Robust Network Design
Sort
View
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 9 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
LCN
2007
IEEE
14 years 1 months ago
Sensor Networking in Aquatic Environments - Experiences and New Challenges
Abstract—In this paper we present the design and implementation of a small-scale marine sensor network. The network monitors the temperature in the Baltic Sea on different height...
Thiemo Voigt, Fredrik Österlind, Niclas Finne...
ICNP
2006
IEEE
14 years 1 months ago
Benefit-based Data Caching in Ad Hoc Networks
—Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing e...
Bin Tang, Himanshu Gupta, Samir R. Das
MONET
2007
160views more  MONET 2007»
13 years 7 months ago
Joint Design of Routing and Medium Access Control for Hybrid Mobile Ad Hoc Networks
Efficient routing and medium access control (MAC) are very important for Mobile Ad hoc Networks (MANETs). Most existing routing and MAC protocols consider homogeneous ad hoc networ...
Xiaojiang Du, Dapeng Wu
ICCAD
2000
IEEE
109views Hardware» more  ICCAD 2000»
14 years 2 days ago
Latency-Guided On-Chip Bus Network Design
Abstract— Deep submicron technology scaling has two major ramifications on the design process. First, reduced feature size significantly increases wire delay, thus resulting in...
Milenko Drinic, Darko Kirovski, Seapahn Meguerdich...