Sciweavers

1414 search results - page 105 / 283
» Performance Bounds in Communication Networks with Variable-R...
Sort
View
INFOCOM
2010
IEEE
13 years 7 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...
CLUSTER
1999
IEEE
13 years 8 months ago
Simulative performance analysis of gossip failure detection for scalable distributed systems
Three protocols for gossip-based failure detection services in large-scale heterogeneous clusters are analyzed and compared. The basic gossip protocol provides a means by which fai...
Mark W. Burns, Alan D. George, Bradley A. Wallace
PIMRC
2008
IEEE
14 years 3 months ago
Distributed network utility optimization in wireless sensor networks using power control
—We extend the existing network utility maximization (NUM) framework for wired networks to wireless sensor networks by formulating it in order to take into account interference a...
George Tichogiorgos, Kin K. Leung, Archan Misra, T...
TIT
2010
146views Education» more  TIT 2010»
13 years 3 months ago
Information propagation speed in mobile and delay tolerant networks
Abstract--The goal of this paper is to increase our understanding of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multi-hop pat...
Philippe Jacquet, Bernard Mans, Georgios Rodolakis
INFOCOM
2012
IEEE
11 years 11 months ago
Robust multi-pipeline scheduling in low-duty-cycle wireless sensor networks
—Data collection is one of the major traffic pattern in wireless sensor networks, which requires regular source nodes to send data packets to a common sink node with limited end...
Yongle Cao, Shuo Guo, Tian He