Skip to main content
SpringerLink
Log in

Randomized Broadcast Channel Access Algorithms for Ad Hoc Networks

  • Published:
International Journal of Wireless Information Networks Aims and scope Submit manuscript

Abstract

The problem of broadcast channel access in single-hop and multihop ad hoc networks is considered. Two novel randomized and distributed channel access algorithms are developed and analyzed for single-hop and multihop networks, respectively. These algorithms are designed based on maximizing the worst-case channel efficiency, by optimizing some key parameters, including the backoff probability distribution and the slot length. The proposed algorithm for single-hop networks offers significantly higher throughput than the CSMA methods when the traffic load is heavy, while still achieving good performance when the load is light or medium. The proposed algorithm for multihop networks can flexibly adapt to the traffic load, and offers much better throughput performance than the existing broadcast scheduling algorithms in light or medium load.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. D. Newman and K. Tolly, “Wireless LANs: How far? How fast?, ” Data Comm., pp. 77–87, March 1995.

  2. A. I. Elwalid and D. Mitra, “Effective Bandwidth of General Markovian Traffic Sources and Admission Control of High Speed Net-works, ” IEEE/ACM Trans. Network., Vol. 1, No. 3, pp. 329–343, June 1993.

    Google Scholar 

  3. J.-H. Ryu and D.-H. Cho, “A New Routing Scheme Concerning Energy Conservation in Wireless Home Ad-Hoc Networks, ” IEEE of Trans. Consumer Electronics, Vol. 47, No. 1, pp. 1–5, Feb. 2001.

    Google Scholar 

  4. S. Singh, “Quality of Service Guarantees in Mobile Computing, ” Comput. Commun., Vol. 19, No. 1, pp. 359–371, April 1996.

    Google Scholar 

  5. C. R. Lin and M. Gerla, “Adaptive Clustering for Mobile Wireless Networks, ” IEEE J. Select. Areas Commun., Vol. 15, No. 7, pp. 1265–1275, Sept. 1997.

    Google Scholar 

  6. Z. J. Hass, M. Gerla, D. B. Johnson, C. E. Perkins, M. B. Pursley, M. Steenstrup, C.-K. Toh, and J. F. Hayes, “Guest EditorialWireless Ad Hoc Networks, ” IEEE J. Select. Areas Commun., Vol. 17, No. 8, pp. 1329–1332, Aug. 1999.

    Google Scholar 

  7. F. A. Tobagi and L. Kleinrock, “Packet Switching in Radio Channels. Part I: Carrier Sense Multiple Access Modes and Their Throughput Delay Characteristics, ” IEEE Trans. Commun., Vol. 23, No. 12, pp. 1400–1416, 1975.

    Google Scholar 

  8. R. Rom and M. Sidi, Multiple Access Protocols, Springer-Verlag, New York, 1990.

    Google Scholar 

  9. S. Basagni, D. Bruschi, and I. Chlamtac, “A Mobility-Transparent Deterministic Broadcast Mechanism for Ad Hoc Networks, ” IEEE Trans. Network., Vol. 7, No. 6, pp. 799–807, Dec. 1999.

    Google Scholar 

  10. J. L. Sobrinho and A. S. Krishnakumar, “Quality-of-Service in Ad Hoc Carrier Sense Multiple Access Wireless Networks, ” IEEE J. Select. Areas Commun., Vol. 17, No. 8, pp. 1353–1368, Aug. 1999.

    Google Scholar 

  11. Z. Cai and M. Lu, “SND-MAC: An Efficient Media Access Method for Integrated Service in High Speed Wireless Networks, ” Proc. of IEEE 2000 Workshop on Wireless Networks and Mobile Computing, Aug. 2000.

  12. A. Ephremides and T. V. Truong, “Scheduling Broadcasts in Multihop Radio Networks, ” IEEE Trans. Commun., Vol. 38, No. 4, pp. 456–460, 1990.

    Google Scholar 

  13. B. Hajek and G. Sasaki, “Link Scheduling in Polynomial Time, ” IEEE Trans. Inform. Theory, Vol. 34, pp. 910–917, 1988.

    Google Scholar 

  14. A. M. Chou and V. O. K. Li, “Slot Allocation Strategies for TDMA Protocols in Multihop Packet Radio Networks, ” Proc. of IEEE INFOCOM'92, pp. 710–716, 1992.

  15. K. Hung and T. Yum, “Fair and Efficient Transmission Scheduling in Multihop Packet Radio Networks, ” Proc. of IEEE GLOBECOM'92, pp. 6–10, 1992

  16. R. Ramaswami and K. K. Parhi, “Distributed Scheduling of Broadcasts in a Radio Network, ” Proc. of IEEE INFOCOM'89, pp. 497–504, 1989.

  17. I. Chlamtac and A. Farago, “Making Transmission Schedules Immune to Topology Changes in Multi-hop Packet Radio Networks, ” IEEE Trans. Network., Vol. 2, No. 1, pp. 23–29, 1994.

    Google Scholar 

  18. J. H. Ju and V. O. K. Li, “An Optimal Topology-Transparent Scheduling Method in Multihop Packet Radio Networks, ” IEEE TransNetwork., Vol. 6, No. 3, pp. 298–306, 1998.

    Google Scholar 

  19. Z. J. Haas and J. Deng, “Dual Busy Tone Multiple Access (DBTMA)—Performance Evaluation, ” Proc. of VTC'99, Vol. 1, pp. 314–319, 1999.

    Google Scholar 

  20. F. A. Tobagi and L. Kleinrock, “Packet Switching in Radio Channels. Part II: The Hidden Terminal Problem in Carrier Sence Multiple-Access and the Busy-Tone Solution, ” IEEE Trans. Commun., Vol. 23, No. 12, pp. 1417–1433, 1975

    Google Scholar 

  21. J. Deng and Z. J. Hass, “Dual Busy Tone Multiple Access (DBTMA): A New Medium Access Control for Packet Radio Networks, ” Proc. of IEEE IWPC'98, pp. 973–977, Oct. 1998.

  22. S. Wu and Y. Tseng, “Intelligent Medium Access for Mobile Ad Hoc Networks with Busy Tones and Power Control, ” IEEE J. Select. Areas Commun., Vol. 18, No. 9, Sept. 2000.

  23. K. Nakano and S. Olariu, “Randomized Initialization Protocols For Ad Hoc Networks, ” IEEE Trans. Parallel Distrib. Syst., Vol. 11, No. 7, pp. 749–759, July 2000.

    Google Scholar 

  24. E. D. Kaplan, Ed., Understanding GPS: Principles and Applications, Boston: Artech House, 1996.

  25. B. Parkinson and S. Gilbert, “Navstar: Global Positioning System— Ten Years Later, ” Proc. IEEE, pp. 1177–1186, 1983.

  26. P. Clifford, “http://www.jesus.ox.ac.uk/,clifford/a5/chap2/node9.html, ” May 2000.

  27. S. Kishore, P. Agrawal, K. M. Sivalingam, and J. C. Chen, “MAC Layer Scheduling Strategies During Handoff for Wireless Mobile Multimedia Networks, ” Proc. IEEE International Conference on Personal Wireless Communications (ICPWC), pp. 100–104, Dec. 1997.

  28. D. J. Baker and A. Ephremides, “The Architecture Organization of a Mobile Radio Network via a Distributed Algorithm, ” IEEE Trans. Commun., Vol. COM-29, pp. 1694–1701, Nov. 1981.

  29. T. Hou and V. O. K. Li, “Transmission Range Control in Multihop Packet Radio Networks, ” IEEE Trans. Commun., Vol. COM-34, pp. 38–44, Jan. 1986.

  30. L. Hu, “A Novel Topology Control for Multihop Packet Radio Networks, ” Proc. IEEE INFOCOM'91, pp. 1084–1093, Jan. 1991.

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Texas A&M University, College Station, Texas, 77843

    Zhijun Cai & Mi Lu

  2. Department of Electrical Engineering, Columbia University, New York, New York, 10027

    Xiaodong Wang

Authors
  1. Zhijun Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mi Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaodong Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cai, Z., Lu, M. & Wang, X. Randomized Broadcast Channel Access Algorithms for Ad Hoc Networks. International Journal of Wireless Information Networks 9, 243–258 (2002). https://doi.org/10.1023/A:1021051928969

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021051928969

Search

Navigation