Sciweavers

2149 search results - page 215 / 430
» Distributed Algorithms for Approximating Wireless Network Ca...
Sort
View
MSN
2007
Springer
15 years 7 months ago
Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks
Abstract. We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor net...
Harri Haanpää, André Schumacher, ...
AINA
2008
IEEE
15 years 8 months ago
PRODUCE: A Probability-Driven Unequal Clustering Mechanism for Wireless Sensor Networks
There has been proliferation of research on seeking for distributing the energy consumption among nodes in each cluster and between cluster heads to extend the network lifetime. H...
Jung-Hwan Kim, Sajjad Hussain Chauhdary, WenCheng ...
PODC
2012
ACM
13 years 4 months ago
Iterative approximate byzantine consensus in arbitrary directed graphs
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang
GLOBECOM
2007
IEEE
15 years 8 months ago
A Proactive Network Coding Strategy for Pervasive Wireless Networking
— In recent years, network coding has proved to be an efficient tool to disseminate data through a network. A number of practical schemes have been proposed to implement network...
Elena Fasolo, Michele Rossi, Jörg Widmer, Mic...
CORR
2010
Springer
107views Education» more  CORR 2010»
15 years 9 days ago
Distributed Detection over Time Varying Networks: Large Deviations Analysis
—We apply large deviations theory to study asymptotic performance of running consensus distributed detection in sensor networks. Running consensus is a stochastic approximation t...
Dragana Bajovic, Dusan Jakovetic, João Xavi...