A protocol for topology-dependent transmission scheduling in wireless networks
- 20 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1333-1337
- https://doi.org/10.1109/wcnc.1999.796954
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 an- other, which provides a very efficient spatial reuse of the ba ndwidth avail- able. 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 dy- namic 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
This publication has 10 references indexed in Scilit:
- A distributed time-slot assignment protocol for mobile multi-hop broadcast packet radio networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- An optimal topology-transparent scheduling method in multihop packet radio networksIEEE/ACM Transactions on Networking, 1998
- Solutions to hidden terminal problems in wireless networksACM SIGCOMM Computer Communication Review, 1997
- Making transmission schedules immune to topology changes in multi-hop packet radio networksIEEE/ACM Transactions on Networking, 1994
- MACAWPublished by Association for Computing Machinery (ACM) ,1994
- Scheduling broadcasts in multihop radio networksIEEE Transactions on Communications, 1990
- Distributed assignment algorithms for multihop packet radio networksIEEE Transactions on Computers, 1989
- Some complexity results about packet radio networks (Corresp.)IEEE Transactions on Information Theory, 1984
- Packet Switching in Radio Channels: Part III--Polling and (Dynamic) Split-Channel Reservation Multiple AccessIEEE Transactions on Communications, 1976
- Packet Switching in Radio Channels: Part II--The Hidden Terminal Problem in Carrier Sense Multiple-Access and the Busy-Tone SolutionIEEE Transactions on Communications, 1975