Skip to main content

A Relationship between Densities and Numbers of Hidden Stations of Packet Radio Network

  • Conference paper
  • First Online:
Book cover Information Networking: Wired Communications and Management (ICOIN 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2343))

Included in the following conference series:

  • 330 Accesses

Abstract

An interesting relationship between the throughput of CSMA and a connection ratio which reflects a density of a PRN, which is shown in this paper, motivate us to derive equations giving a number of hidden stations as a function of connection ratio. A new method of computational experiment through this equation is also presented which allows us to evaluate effects of hidden terminals on PRNs easily.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. F. A. Tobagi and L. Kleinrock, “Packet Switching in Radio Channels: Part II-The Hidden Terminal Problem in CSMA and Busy-Tone Solution,” IEEE Trans. on Communications, COM-23, pp. 1417–1433, 1975.

    Article  Google Scholar 

  2. T. Minami, M. Ichimura, and H. Matsuno, “An algorithm for optimal simultaneous transmission scheduling on packet radio network,” Trans. IEICE, Vol. J82-B, No. 6, pp. 1151–1158, 1999.

    Google Scholar 

  3. T. S. Yum and K. W. Hung, “Design algorithms for multihop packet radio networks with multiple directional antennas stations,” IEEE Trans. Commun., Vol. 40, No. 11, pp. 1716–1724, 1992.

    Article  Google Scholar 

  4. H. Shigeno and Y. Matsushita, “Design and performance evaluation of new peer-to-peer MAC scheme STDA/MA for wireless LAN using directional antennas,” Trans. IEICE, Vol. J79-B-I, No. 2, pp. 41–50, 1996.

    Google Scholar 

  5. O. Akizuki, S. Suzuki, K. Mutsuura, and S. Ooshita, “TDMA with parallel transmission: TDMA/PT,” Trans. IEICE, Vol. J78-B-I, No. 12, pp. 846–854, 1995.

    Google Scholar 

  6. A. S. Tanenbaum: Computer networks (third edition), Prentice-Hall Inc., 1996.

    Google Scholar 

  7. A. Alan Bertossi and A. Maurizio Bonuccelli, “Code assignment for hiddenterminal interference avoidance in multihop packet radio network,” IEEE/ACM Trans. on Networking 3, pp. 441–449, 1995.

    Google Scholar 

  8. T. Ozugur and M. Naghshineh and P. Kermani and C. M. Olsen and B. Rezvani and J. A. Copeland, “Balanced Media Access Methods for Wireless Networks,” Proc. of ACM/IEEE Mobi Com, pp. 21–32, 1998.

    Google Scholar 

  9. L. Kleinrock and F. A. Tobagi, “Packet Switching in Radio Channels: Part I-Carrier Sense Multiple Access Modes and Their Throughput Delay Characteristics,” IEEE Trans. on Communications, COM-23, pp. 1400–1416, 1975.

    Article  Google Scholar 

  10. P. Karn, “MACA-a new channel access method for packet radio,” ARRL/CRRL Amateur Radio 9th, Computer Networking Conference, pp. 134–140, 1990.

    Google Scholar 

  11. H. Matsuno, T. Ebisui, and H. Ando, “Effect of an extra ability to central stations in CTMA,” Trans. IPS Japan, Vol. 39, No. 4, pp. 1049–1057, 1998.

    Google Scholar 

  12. C. L. Fullmer and J. J. Garcia-Luna-Aceves, “Solutions to Hidden Terminal Problems in Wireless Networks,” Proc. of ACM SIGCOMM’ 97, pp. 39–49, 1997.

    Google Scholar 

  13. V. Bharghavan, A. Demers, S. Shenker, and L. Zhang, “MACAW: A Media Access Protocol for Wireless LAN’s,” Proc of ACM SIGCOMM’ 94, pp. 212–225, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shigeyasu, T., Ishinaka, H., Matsuno, H. (2002). A Relationship between Densities and Numbers of Hidden Stations of Packet Radio Network. In: Chong, I. (eds) Information Networking: Wired Communications and Management. ICOIN 2002. Lecture Notes in Computer Science, vol 2343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45803-4_56

Download citation

  • DOI: https://doi.org/10.1007/3-540-45803-4_56

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44256-1

  • Online ISBN: 978-3-540-45803-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics