Randomized Algorithms and Probabilistic Analysis in Wireless Networking

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.

[1]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2001, MobiCom '01.

[2]  Norman Abramson,et al.  The ALOHA SYSTEM. , 1972 .

[3]  Ness B. Shroff,et al.  Performance of Random Access Scheduling Schemes in Multi-Hop Wireless Networks , 2006, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[4]  Ayalvadi J. Ganesh,et al.  Performance Analysis of Contention Based Medium Access Control Protocols , 2006, IEEE Transactions on Information Theory.

[5]  Uriel Feige,et al.  Approximating the domatic number , 2000, STOC '00.

[6]  S. Muthukrishnan,et al.  The bin-covering technique for thresholding random geometric graph properties , 2005, SODA '05.

[7]  Seungjoon Lee,et al.  Backbone construction in selfish wireless networks , 2007, SIGMETRICS '07.

[8]  Bhaskar Krishnamachari,et al.  Sharp thresholds For monotone properties in random geometric graphs , 2003, STOC '04.

[9]  Franklin F. Kuo,et al.  Computer-Communication Networks , 1973 .

[10]  Aravind Srinivasan,et al.  End-to-end packet-scheduling in wireless ad-hoc networks , 2004, SODA '04.

[11]  Sergio D. Servetto,et al.  Constrained random walks on random graphs: routing algorithms for large scale wireless sensor networks , 2002, WSNA '02.

[12]  David J. Aldous.  Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels , 1987, IEEE Trans. Inf. Theory.

[13]  L. Goddard.  Information Theory , 1962, Nature.

[14]  Ramesh Govindan,et al.  Scale Free Aggregation in Sensor Networks , 2004, ALGOSENSORS.

[15]  Kay Römer.  European Workshop on Wireless Sensor Networks , 2006 .

[16]  Eytan Modiano,et al.  Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach , 2006, MobiCom '06.

[17]  Aravind Srinivasan,et al.  Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons , 2003, J. Comput. Syst. Sci..

[18]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[19]  Aravind Srinivasan,et al.  Algorithmic aspects of capacity in wireless networks , 2005, SIGMETRICS '05.

[20]  Robert B. Ash,et al.  Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.

[21]  Leandros Tassiulas,et al.  Throughput Scalability of Wireless Hybrid Networks over a Random Geometric Graph , 2005, Wirel. Networks.

[22]  Donald F. Towsley,et al.  On the capacity of hybrid wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[23]  Roger Wattenhofer.  Algorithms for Wireless Sensor Networks , 2006, EWSN.

[24]  Imran A. Pirwani,et al.  Energy conservation via domatic partitions , 2006, MobiHoc '06.

[25]  Micah Adler.  Collecting correlated information from a sensor network , 2005, SODA '05.