Sciweavers

1265 search results - page 37 / 253
» Randomized Algorithms and Probabilistic Analysis in Wireless...
Sort
View
ICASSP
2009
IEEE
13 years 5 months ago
Fast mean square convergence of consensus algorithms in WSNs with random topologies
The average consensus in wireless sensor networks is achieved under assumptions of symmetric or balanced topology at every time instant. However, communication and/or node failure...
Silvana Silva Pereira, Alba Pagès-Zamora
GLOBECOM
2008
IEEE
14 years 2 months ago
Distributed Multi-Interface Multi-Channel Random Access
— The aggregate capacity of wireless ad-hoc networks can be substantially increased if each wireless node is equipped with multiple network interface cards (NICs) and each NIC op...
Amir Hamed Mohsenian Rad, Vincent W. S. Wong
INFOCOM
2009
IEEE
14 years 2 months ago
Opportunistic Processing and Query of Motion Trajectories in Wireless Sensor Networks
—We study the problem of in-network processing and queries of trajectories of moving targets in a sensor network. The main idea is to exploit the spatial coherence of target traj...
Dengpan Zhou, Jie Gao
ICC
2007
IEEE
142views Communications» more  ICC 2007»
14 years 2 months ago
On MAC Scheduling and Packet Combination Strategies for Practical Random Network Coding
— The present paper investigates practical algorithms to efficiently exploit random network coding for data delivery in multi-hop wireless networks. In the past few years, a gre...
Elena Fasolo, Michele Rossi, Jörg Widmer, Mic...
SPAA
2000
ACM
14 years 22 hour ago
An experimental study of a simple, distributed edge coloring algorithm
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
Madhav V. Marathe, Alessandro Panconesi, Larry D. ...