Mobile Networks and Applications

, Volume 16, Issue 2, pp 255–266 | Cite as

Mathematical Analysis of Throughput Bounds in Random Access with ZigZag Decoding

Article

Abstract

We investigate the throughput improvement that ZigZag decoding (Gollakota and Katabi 2008) can achieve in multi-user random access systems. ZigZag is a recently proposed 802.11 receiver design that allows successful reception of packets despite collision. Thus, the maximum achievable throughput of a wireless LAN can be significantly improved by using ZigZag decoding. We analyze the throughput bounds in four different idealized multi-access system models for the case when ZigZag decoding is used. We also provide results for the Aloha and CSMA models where exact closed form solutions are infeasible to calculate. Our analysis and simulation results show that ZigZag decoding can significantly improve the maximum throughput of the random access system.

Keywords

ZigZag decoding random access throughput analysis CSMA 

References

  1. 1.
    Abramson N (1970) The aloha system: another alternative for computer communications. In: AFIPS ’70 (fall): proceedings of the November 17–19, 1970, fall joint computer conference, pp 281–285Google Scholar
  2. 2.
    Bertsekas D, Gallager R (1992) Data networks, 2nd edn. Prentice-Hall, Inc., Upper Saddle River, NJ, USAGoogle Scholar
  3. 3.
    Capetanakis J (1979) Tree algorithms for packet broadcast channels. IEEE Trans Inform Theory 25(5):505–515MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    Ephremides A, Hajek B (1998) Information theory and communication networks: an unconsummated union. IEEE Trans Inform Theory 44:2416–2434MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Gollakota S, Katabi D (2008) Zigzag decoding: combating hidden terminals in wireless networks. In: SIGCOMM ’08: proceedings of the ACM SIGCOMM 2008 conference on data communicationGoogle Scholar
  6. 6.
    Kaplan M (1979) A sufficient condition for nonergodicity of a Markov chain. IEEE Trans Inform Theory 25:470MathSciNetMATHCrossRefGoogle Scholar
  7. 7.
    Kleinrock L, Tobagi F (1975) Packet switching in radio channels: part i–carrier sense multiple-access modes and their throughput-delay characteristics. IEEE Trans Commun 23(12):1400–1416MATHCrossRefGoogle Scholar
  8. 8.
    Mosely J, Humblet P (1985) A class of efficient contention resolution algorithms for multiple access channels. IEEE Trans Commun 33(2):145–151CrossRefGoogle Scholar
  9. 9.
    Mutsuura K, Okada H, Ohtsuki K, Tezuka Y (1989) A new control scheme with capture effect for random access packet communications. In: IEEE international conference on communications (ICC’89), vol 2, pp 938–944Google Scholar
  10. 10.
    Namislo C (1984) Analysis of mobile radio slotted aloha networks. IEEE J Sel Areas Commun 2(4):583–588CrossRefGoogle Scholar
  11. 11.
    Ngo MH, Krishnamurthy V, Tong L (2008) Optimal channel-aware aloha protocol for random access in wlans with multipacket reception and decentralized channel state information. IEEE Trans Signal Process 56(6):2575–2588MathSciNetCrossRefGoogle Scholar
  12. 12.
    Paek J, Neely M (2009) Mathematical analysis of throughput bounds in random access with zigzag decoding. In: 7th international symposium on modeling and optimization in mobile, ad hoc, and wireless networks (WiOpt’09)Google Scholar
  13. 13.
    Pakes AG (1969) Some conditions for ergodicity and recurrence of Markov chains. Oper Res 17(6):1059–1061MathSciNetCrossRefGoogle Scholar
  14. 14.
    Roberts LG (1975) Aloha packet system with and without slots and capture. SIGCOMM Comput Commun Rev 5(2):28–42CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of Southern CaliforniaLos AngelesUSA
  2. 2.Department of Electrical Engineering—Systems DivisionUniversity of Southern CaliforniaLos AngelesUSA

Personalised recommendations