Sciweavers

3147 search results - page 9 / 630
» Distributed averaging in dynamic networks
Sort
View
CORR
2008
Springer
217views Education» more  CORR 2008»
13 years 9 months ago
A Distributed Merge and Split Algorithm for Fair Cooperation in Wireless Networks
Abstract-- This paper introduces a novel concept from coalitional game theory which allows the dynamic formation of coalitions among wireless nodes. A simple and distributed merge ...
Walid Saad, Zhu Han, Mérouane Debbah, Are H...
TSP
2008
100views more  TSP 2008»
13 years 9 months ago
Geographic Gossip: Efficient Averaging for Sensor Networks
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....
SRDS
2010
IEEE
13 years 7 months ago
Fault-Tolerant Aggregation for Dynamic Networks
Data aggregation is a fundamental building block of modern distributed systems. Averaging based approaches, commonly designated gossip-based, are an important class of aggregation ...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...
PIMRC
2010
IEEE
13 years 7 months ago
Connectivity in wireless networks with dynamic key compromise and recovery
Abstract--This paper considers the problem of key management in wireless networks. In particular, we investigate the effect of dynamic key compromise and recovery on connectivity i...
Satashu Goel, Aylin Yener
INFOCOM
2009
IEEE
14 years 4 months ago
Coalitional Games for Distributed Collaborative Spectrum Sensing in Cognitive Radio Networks
— Collaborative spectrum sensing among secondary users (SUs) in cognitive networks is shown to yield a significant performance improvement. However, there exists an inherent tra...
Walid Saad, Zhu Han, Mérouane Debbah, Are H...