Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

SAGA
2007
Springer

favoriteEmaildiscussreport

78views Control Systems» more SAGA 2007»

Randomized Algorithms and Probabilistic Analysis in Wireless Networking

13 years 10 months ago

Randomized Algorithms and Probabilistic Analysis in Wireless Networking

Download www.cs.umd.edu

Abstract. Devices connected wirelessly, in various forms including computers, hand-held devices, ad hoc networks, and embedded systems, are expected to become ubiquitous all around us. Wireless networks pose interesting new challenges, some of which do not arise in standard (wired) networks. This survey discusses some key probabilistic notions – both randomized algorithms and probabilistic analysis – in wireless networking.

Aravind Srinivasan

Real-time Traffic

Ad Hoc Networks | Key Probabilistic Notions | SAGA 2007 | Wireless Networks |

claim paper

Related Content

» Robust computation of aggregates in wireless sensor networks distributed randomized algori...

» A probabilistic algorithm for efficient and robust data propagation in wireless sensor net...

» Randomized and distributed selfconfiguration of wireless networks twolayer Markov random f...

» Probabilistic quorum systems in wireless ad hoc networks

» Probabilistic Analysis of Hierarchical Cluster Protocols for Wireless Sensor Networks

» Randomized Selfstabilizing Algorithms for Wireless Sensor Networks

» On neighbor discovery in wireless networks with directional antennas

» Probabilistic Coverage in Wireless Sensor Networks

» Surveillance Wireless Sensor Networks Deployment Quality Analysis

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	SAGA
Authors	Aravind Srinivasan

Comments (0)