Election Based Hybrid Channel Access

  • Xin Wang
  • J. J. Garcia-Luna-Aceves
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4479)


We propose an Election based Hybrid Channel Access (EHCA) protocol for ad hoc network to achieve high throughput and bounded channel access delay at the same time. EHCA reduces the contentions during the channel scheduling formation through fair node elections, which are based on the topology information. Only the elected nodes contend for the channel and broadcast the scheduling result. Numerical analysis and simulation results show that EHCA outperforms alternative designs.


  1. 1.
    Arikan, E.: Some Complexity Results about Packet Radio Networks. IEEE Transactions on Information Theory 30(4), 681–685 (1984)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Bao, L.: MALS: Multiple Access Scheduling Based on Latin Squares. In: IEEE MILCOM 2004, October 31-November 3, 2004, IEEE Computer Society Press, Los Alamitos (2004)Google Scholar
  3. 3.
    Bao, L., Garcia-Luna-Aceves, J.J.: A New Approach to Channel Access Scheduling for Ad Hoc Networks. In: ACM Seventh Annual International Conference on Mobile Computing and networking (Mobicom), Rome, Italy, ACM Press, New York (2001)Google Scholar
  4. 4.
    Chlamtac, I., Farago, A.: Making Transmission Schedules Immune to Topology Changes in Multi-hop Packet Radio Networks. IEEE/ACM Transactions on Networking 2(1), 23–29 (1994)CrossRefGoogle Scholar
  5. 5.
    Gupta, P., Kumar, P.R.: The Capacity of Wireless Networks. IEEE Trans. on Inf. Theory 46, 388–404 (2000)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    IEEE Standard for Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications (Nov. 1997)Google Scholar
  7. 7.
    Ju, J.-H., Li, V.O.K.: An Optimal Topology-Transparent Scheduling Method in Multi-hop Packet Radio Networks. IEEE/ACM Transactions on Networking 6(3), 298–306 (1998)CrossRefGoogle Scholar
  8. 8.
    Oikonomou, K., Stavrakakis, I.: Analysis of a Probabilistic Topology-Unaware TDMA MAC Policy for Ad-Hoc Networks. IEEE JSAC, Special Issue on Quality-of-Service Delivery in Variable Topology Networks 22(7), 1286–1300 (2004)Google Scholar
  9. 9.
    Perkins, C., Belding-Royer, E., Das, S.: RFC 3561- Ad hoc On-Demand Distance Vector (AODV) Routing (Jul. 2003)Google Scholar
  10. 10.
    Qualnet Simulator. Scalable Network Technologies, http://www.scalable-networks.com/
  11. 11.
    Rentel, C.H.: Network Time Synchronization and Code-based Scheduling for Wireless Ad Hoc Networks. Ph.D. Thesis, Carleton University (January 2006)Google Scholar
  12. 12.
    Socolofsky, T., Kale, C.: RFC 1180 - A TCP/IP Tutorial (Jan. 1991)Google Scholar
  13. 13.
    Tang, Z., Garcia-Luna-Aceves, J.J.: A Protocol for Topology-Dependent Transmission Scheduling. In: Proceedings of IEEE Wireless Communications and Networking Conference (WCNC), New Orleans, September 21-24, 1999, IEEE Computer Society Press, Los Alamitos (1999)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2007

Authors and Affiliations

  • Xin Wang
    • 1
  • J. J. Garcia-Luna-Aceves
    • 1
    • 2
  1. 1.Computer Engineering Department, University of California, Santa Cruz, Santa Cruz, CA 95064USA
  2. 2.Palo Alto Research Center (PARC), 3333 Coyote Hill Road, Palo Alto, CA 94304USA

Personalised recommendations