Randomized algorithms and probabilistic analysis in wireless networking

Authors:
Aravind Srinivasan
Affiliations:
Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD
Venue:
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Year:
2007

Citing 16
Cited 1

Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels

IEEE Transactions on Information Theory
Constrained random walks on random graphs: routing algorithms for large scale wireless sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Span: an energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks

Wireless Networks
Approximating the Domatic Number

SIAM Journal on Computing
End-to-end packet-scheduling in wireless ad-hoc networks

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Sharp thresholds For monotone properties in random geometric graphs

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Algorithmic aspects of capacity in wireless networks

SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Collecting correlated information from a sensor network

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The bin-covering technique for thresholding random geometric graph properties

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons

Journal of Computer and System Sciences
Energy conservation via domatic partitions

Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Throughput scalability of wireless hybrid networks over a random geometric graph

Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach

Proceedings of the 12th annual international conference on Mobile computing and networking
Backbone construction in selfish wireless networks

Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Algorithms for wireless sensor networks

EWSN'06 Proceedings of the Third European conference on Wireless Sensor Networks
The capacity of wireless networks

IEEE Transactions on Information Theory

Probabilistic Analysis of Wireless Systems Using Theorem Proving

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

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.