Sciweavers

242 search results - page 28 / 49
» Deterministic small-world communication networks
Sort
View
IPPS
2006
IEEE
15 years 5 months ago
An adaptive stabilization framework for distributed hash tables
Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
Gabriel Ghinita, Yong Meng Teo
LCN
2008
IEEE
15 years 6 months ago
Efficient power management for Wireless Sensor Networks: A data-driven approach
—Providing energy-efficient continuous data collection services is of paramount importance to Wireless Sensor Network (WSN) applications. This paper proposes a new power manageme...
MingJian Tang, Jinli Cao, Xiaohua Jia
SIGMETRICS
2006
ACM
156views Hardware» more  SIGMETRICS 2006»
15 years 5 months ago
Maximizing throughput in wireless networks via gossiping
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
Eytan Modiano, Devavrat Shah, Gil Zussman
VTC
2010
IEEE
143views Communications» more  VTC 2010»
14 years 10 months ago
Partner Selection and Power Control for Asymmetrical Collaborative Networks
—We derive an adaptive power control method for a collaborative network utilizing partner selection that aims to minimize the frame error rate (FER). We model a decodeand-forward...
Weisi Guo, Ioannis Chatzigeorgiou, Ian J. Wassell,...
SPAA
2010
ACM
15 years 4 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela