Skip to main content

Achievable Region in Slotted ALOHA Throughput for One-Relay Two-Hop Wireless Network Coding

  • Conference paper
Ad Hoc Networks (ADHOCNETS 2009)

Abstract

This paper presents achievable regions in slotted ALOHA throughput both without and with network coding for one-relay two-hop wireless networks between two end node groups. In this paper, there are no restrictions on the total traffic and the number of end nodes per group. It follows that the relay node will be generally involved with asymmetric bidirectional traffic. This paper derives closed-form expressions of the throughput and packet delay per group both without and with network coding from a theoretical perspective regardless of whether the buffer on the relay node is saturated or not. Furthermore, we show that the maximum throughput per group with network coding can be achieved at the boundary of the relay buffer saturation and unsaturation which is expressed as the solution of a polynomial equation in two group node traffics. As a result, we clarify the enhancement of the achievable region in slotted ALOHA throughput by applying network coding.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ishmael, J., Bury, S., Pezaros, D., Race, N.: Deploying Rural Community Wireless Mesh Networks. IEEE Internet Computing 12(4), 22–29 (2008)

    Article  Google Scholar 

  2. Ipakchi, A., Albuyeh, F.: Grid of the Future. IEEE Power and Energy Magazine 7(2), 52–62 (2009)

    Article  Google Scholar 

  3. Ahlswede, R., Li, S., Yeung, R.: Network Information Flow. IEEE Transactions on Information Theory 46(4), 1204–1216 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  4. Li, S.R., Yeung, R.W., Cai, N.: Linear Network Coding. IEEE Transactions on Information Theory 49(2), 371–381 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  5. Ho, T., Médard, M., Koetter, R., Karger, D.R., Effros, M., Shi, J., Leong, B.: A Random Linear Network Coding Approach to Multicast. IEEE Transactions on Information Theory 52(10), 4413–4430 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Katti, S., Rahul, H., Hu, W., Katabi, D., Médard, M., Crowcroft, J.: XOR’s in the Air: Practical Wireless Network Coding. IEEE/ACM Transactions on Networking 16(3), 497–510 (2008)

    Article  Google Scholar 

  7. Matsuda, T., Noguchi, T., Takine, T.: Broadcasting with Randomized Network Coding in Dense Wireless Ad Hoc Networks. IEICE Transactions on Communications E91-B(10), 3216–3225 (2008)

    Google Scholar 

  8. Hasegawa, J., Yomo, H., Kondo, Y., Davis, P., Sakakibara, K., Miura, R., Obana, S.: Bidirectional Packet Aggregation and Coding for Efficient VoIP Transmission in Wireless Multi-Hop Networks. IEICE Transactions on Communications E92-B(10), 3060–3070 (2009)

    Google Scholar 

  9. Sagduyu, Y.E., Ephremides, A.: Cross-Layer Optimization of MAC and Network Coding in Wireless Queueing Tandem Networks. IEEE Transactions on Information Theory 54(2), 554–571 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  10. Le, J., Lui, J., Chiu, D.M.: How Many Packets can We Encode? — An Analysis of Practical Wireless Network Coding. In: IEEE INFOCOM (2008)

    Google Scholar 

  11. Gitman, I.: On the Capacity of Slotted ALOHA Networks and Some Design Problems. IEEE Transactions on Communications COM-23(3), 305–317 (1975)

    Google Scholar 

  12. Tobagi, F.A.: Analysis of a Two-Hop Centralized Packet Radio Network—Part I: Slotted ALOHA. IEEE Transactions on Communications COM-28(2), 196–207 (1980)

    Google Scholar 

  13. Tobagi, F.A.: Analysis of a Two-Hop Centralized Packet Radio Network—Part II: Carrier Sense Multiple Access. IEEE Transactions on Communications COM-28(2), 208–216 (1980)

    Google Scholar 

  14. Umehara, D., Hirano, T., Denno, S., Morikura, M.: Throughput Analysis of Wireless Relay Slotted ALOHA Systems with Network Coding. In: IEEE Global Communications Conference (2008)

    Google Scholar 

  15. Umehara, D., Hirano, T., Denno, S., Morikura, M., Sugiyama, T.: Wireless Network Coding in Slotted ALOHA with Two-Hop Unbalanced Traffic. IEEE Journal on Selected Areas in Communications 27(5), 647–661 (2009)

    Article  Google Scholar 

  16. Abramson, N.: The Throughput of Packet Broadcasting Channels. IEEE Transactions on Communications COM-25(1), 117–128 (1977)

    Google Scholar 

  17. Kleinrock, L.: Queueing Systems, Volume II: Computer Applications. John Wiley and Sons, Chichester (1976)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Umehara, D., Denno, S., Morikura, M., Sugiyama, T. (2010). Achievable Region in Slotted ALOHA Throughput for One-Relay Two-Hop Wireless Network Coding. In: Zheng, J., Mao, S., Midkiff, S.F., Zhu, H. (eds) Ad Hoc Networks. ADHOCNETS 2009. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11723-7_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11723-7_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11722-0

  • Online ISBN: 978-3-642-11723-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics