Sciweavers

2149 search results - page 336 / 430
» Distributed Algorithms for Approximating Wireless Network Ca...
Sort
View
QOSIP
2005
Springer
15 years 7 months ago
Topological Design of Survivable IP Networks Using Metaheuristic Approaches
Abstract. The topological design of distributed packet switched networks consists of finding a topology that minimizes the communication costs by taking into account a certain num...
Emílio C. G. Wille, Marco Mellia, Emilio Le...
WWW
2005
ACM
16 years 2 months ago
Hierarchical substring caching for efficient content distribution to low-bandwidth clients
While overall bandwidth in the internet has grown rapidly over the last few years, and an increasing number of clients enjoy broadband connectivity, many others still access the i...
Utku Irmak, Torsten Suel
DCOSS
2006
Springer
15 years 5 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama

Presentation
945views
13 years 7 months ago
A Decentralized Method for Maximizing k-coverage Lifetime in WSNs
In this paper, we propose a decentralized method for maximizing lifetime of data collection wireless sensor networks (WSNs) by making minimal number of nodes operate and putting ot...
CORR
2006
Springer
117views Education» more  CORR 2006»
15 years 1 months ago
Distributed Transmit Beamforming using Feedback Control
The concept of distributed transmit beamforming is implicit in many key results of network information theory. However, its implementation in a wireless network involves the funda...
Raghuraman Mudumbai, J. Hespanha, Upamanyu Madhow,...