Randomized Algorithms and Probabilistic Analysis in Wireless Networking

  • Aravind Srinivasan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4665)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abramson, N.: The ALOHA system. In: Abramson, N., Kuo, F. (eds.) Computer-Communication Networks, Englewood Cliffs, New Jersey, Prentice Hall, Englewood Cliffs (1973)Google Scholar
  2. 2.
    Adler, M.: Collecting Correlated Information from a Sensor Network. In: Proc. ACM-SIAM Symposium on Discrete Algorithms, pp. 479–488. ACM Press, New York (2005)Google Scholar
  3. 3.
    Aldous, D.: Ultimate instability of exponential back-off protocol for acknowledgement-based transmission control of random access communication channels. In: IEEE Trans. on Information Theory, pp. 219–223. IEEE Computer Society Press, Los Alamitos (1987)Google Scholar
  4. 4.
    Brzezinski, A., Zussman, G., Modiano, E.: Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach. In: Proc. International Conference on Mobile Computing and Networking, pp. 26–37 (2006)Google Scholar
  5. 5.
    Chen, B., Jamieson, K., Balakrishnan, H., Morris, R.: Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks. ACM Wireless Networks 8, 481–494 (2002)MATHCrossRefGoogle Scholar
  6. 6.
    Dubhashi, D., Mei, A., Panconesi, A., Radhakrishnan, R., Srinivasan, A.: Fast Distributed Algorithms for (Weakly) Connected Dominating Sets and Linear-Size Skeletons. Journal of Computer and System Sciences 71, 467–479 (2005)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Enachescu, M., Goel, A., Govindan, R., Motwani, R.: Scale Free Aggregation in Sensor Networks. In: Proc. First International Workshop on Algorithmic Aspects of Wireless Sensor Networks (Algosensors) (2004)Google Scholar
  8. 8.
    Feige, U., Halldórsson, M.M., Kortsarz, G., Srinivasan, A.: Approximating the Domatic Number. SIAM Journal on Computing 32, 172–195 (2002)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Goel, A., Rai, S., Krishnamachari, B.: Sharp thresholds for monotone properties in random geometric graphs. Annals of Applied Probability, 2004 (to appear), (Preliminary version in Proc. ACM Symposium on Theory of Computing)Google Scholar
  10. 10.
    Gupta, P., Kumar, P.R.: The capacity of wireless networks. IEEE Transactions on Information Theory 46, 388–404 (2000)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    IEEE Trans. on Information Theory. IT-31, special issue (1985)Google Scholar
  12. 12.
    Joo, C., Shroff, N.B.: Performance of Random Access Scheduling Schemes in Multi-Hop Wireless Networks. In: Proc. IEEE International Conference on Computer Communications, pp. 19–27 (2007)Google Scholar
  13. 13.
    Kozat, U.C., Tassiulas, L.: Throughput Scalability of Wireless Hybrid Networks over a Random Geometric Graph. Wireless Networks 11, 435–449 (2005)CrossRefGoogle Scholar
  14. 14.
    Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: End-to-End Packet-Scheduling in Wireless Ad-Hoc Networks. In: Proc. ACM-SIAM Symposium on Discrete Algorithms, pp. 1014–1023 (2004)Google Scholar
  15. 15.
    Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Algorithmic Aspects of Capacity in Wireless Networks. In: Proc. ACM International Conference on Measurement and Modeling of Computer Systems, pp. 133–144 (2005)Google Scholar
  16. 16.
    Lee, S., Levin, D., Gopalakrishnan, V., Bhattacharjee, B.: Backbone construction in selfish wireless networks. In: Proc. ACM International Conference on Measurement and Modeling of Computer Systems (2007)Google Scholar
  17. 17.
    Liu, B., Liu, Z., Towsley, D.F.: On the Capacity of Hybrid Wireless Networks. In: Proc. IEEE INFOCOM (2003)Google Scholar
  18. 18.
    Muthukrishnan, S., Pandurangan, G.: The bin covering technique for thresholding random geometric graph properties. In: Proc. ACM-SIAM Symposium on Discrete Algorithms, pp. 989–998 (2005)Google Scholar
  19. 19.
    Pemmaraju, S.V., Pirwani, I.A.: Energy conservation via domatic partitions. In: Proc. ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 143–154 (2006)Google Scholar
  20. 20.
    Servetto, S.D., Barrenechea, G.: Constrained Random Walks on Random Graphs: Routing Algorithms for Large Scale Wireless Sensor Networks. In: Proc. ACM International Workshop on Wireless Sensor Networks and Applications, ACM Press, New York (2002)Google Scholar
  21. 21.
    Sharma, G., Ganesh, A., Key, P.: Performance Analysis of Contention Based Medium Access Control Protocols. In: Proc. IEEE International Conference on Computer Communications, pp. 1–12 (2006)Google Scholar
  22. 22.
    Wattenhofer, H.: Algorithms for Wireless Sensor Networks (Tutorial). In: Proc. European Workshop on Wireless Sensor Networks (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Aravind Srinivasan
    • 1
  1. 1.Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742USA

Personalised recommendations