Sciweavers

1783 search results - page 149 / 357
» Low-Complexity Distributed Scheduling Algorithms for Wireles...
Sort
View
MOBIDE
2010
ACM
15 years 3 months ago
Minimum-hot-spot query trees for wireless sensor networks
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optim...
Georgios Chatzimilioudis, Demetrios Zeinalipour-Ya...
INFOCOM
2005
IEEE
15 years 8 months ago
GLIDER: gradient landmark-based distributed routing for sensor networks
— We present Gradient Landmark-Based Distributed Routing (GLIDER), a novel naming/addressing scheme and associated routing algorithm, for a network of wireless communicating node...
Qing Fang, Jie Gao, Leonidas J. Guibas, V. de Silv...
IPPS
1999
IEEE
15 years 7 months ago
All-to-All Broadcast on Switch-Based Clusters of Workstations
This paper presents efficient all-to-all broadcast algorithms for arbitrary irregular networks with switch-based wormhole interconnection and unicast message passing. First, all-t...
Matthew G. Jacunski, P. Sadayappan, Dhabaleswar K....
INFOCOM
2009
IEEE
15 years 9 months ago
On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks
Abstract—Back-pressure based algorithms based on the algorithm by Tassiulas and Ephremides have recently received much attention for jointly routing and scheduling over multihop ...
Lei Ying, Sanjay Shakkottai, Aneesh Reddy
ICASSP
2010
IEEE
15 years 3 months ago
Guaranteed robust distributed estimation in a network of sensors
This paper proposes a guaranteed robust bounded-error distributed estimation algorithm. It may be employed to perform parameter estimation from data collected in a network of wire...
Jean-Benoist Leger, Michel Kieffer