Title :
A protocol for topology-dependent transmission scheduling in wireless networks
Author :
Tang, Zhenyu ; Garcia-Luna-Aceves, J.J.
Author_Institution :
Dept. of Comput. Eng., California Univ., Santa Cruz, CA, USA
Abstract :
A new channel access protocol for ad-hoc networks based on topology-dependent transmission scheduling, named collision-avoidance time allocation (CATA), is introduced. CATA allows nodes to contend for and reserve time slots by means of a distributed reservation and handshake mechanism. Contention is limited among nodes within two hops of one another, which provides a very efficient spatial reuse of the bandwidth available. CATA ensures that no collisions occur in successfully reserved time slots, even when hidden terminals exist. Reservations in CATA support unicasting, multicasting and broadcasting simultaneously, and adapt to dynamic service time. The throughput achieved by CATA is analyzed for the case of a fully-connected network topology. Numerical results show that CATA can achieve very high throughput
Keywords :
access protocols; network topology; packet radio networks; scheduling; telecommunication channels; telecommunication congestion control; CATA; ad-hoc networks; bandwidth; broadcasting; channel access protocol; collision-avoidance time allocation; distributed reservation; dynamic service time; fully-connected network topology; handshake mechanism; hidden terminals; multi-hop packet radio networks; multicasting; protocol; throughput; topology-dependent transmission scheduling; unicasting; wireless networks; Access protocols; Ad hoc networks; Dynamic scheduling; Intelligent networks; Media Access Protocol; Multiaccess communication; Multicast protocols; Processor scheduling; Spread spectrum communication; Wireless networks;
Conference_Titel :
Wireless Communications and Networking Conference, 1999. WCNC. 1999 IEEE
Conference_Location :
New Orleans, LA
Print_ISBN :
0-7803-5668-3
DOI :
10.1109/WCNC.1999.796954
