Lichun Bao
ABSTRACT
Three types of collision-free channel access protocols for ad hoc networks are presented. These protocols are derived from a novel approach to contention resolution that allows each node to elect deterministically one or multiple winners for channel access in a given contention context (e.g., a time slot), given the identifiers of its neighbors one and two hops away. The new protocols are shown to be fair and capable of achieving maximum utilization of the channel bandwidth. The delay and throughput characteristics of the contention resolution algorithms are analyzed, and the performance of the three types of channel access protocols is studied by simulations.
- 1.P.W. Baier. CDMA or TDMA? CDMA for GSM? In 5th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, pages 1280-4, The Hague, Netherlands, 18-23 Sept. 1994. IOS Press.Google Scholar
Cross Ref
- 2.A.A. Bertossi and M.A. Bonuccelli. Code assignment for hidden terminal interference avoidance in multihop packet radio networks. In IEEE INFOCOM '92, volume 2, pages 701-9, Florence, Italy, 1992. Google ScholarDigital Library
- 3.I. Chlamtac and A. Farago. Making transmission schedules immune to topology changes in multi-hop packet radio networks. IEEE/ACM Transactions on Networking, 2(1):23-9, Feb 1994. Google ScholarDigital Library
- 4.I. Chlamtac and S. Kutten. A spatial-reuse TDMA/FDMA for mobile multi-hop radio networks. In Proceedings IEEE INFOCOM, pages 389-94, Washington, DC, March 1985.Google Scholar
- 5.I. Chlamtac and A. Lerner. Fair algorithms for maximal link activation in multihop radio networks. IEEE Transactions on Communications, 35(7):739-46, July 1987.Google ScholarCross Ref
- 6.I. Cidon and M. Sidi. Distributed assignment algorithms for multihop packet radio networks. IEEE Transactions on Computers, 38(10):1353-61, Oct 1989. Google ScholarDigital Library
- 7.B.P. Crow, I. Widjaja, L.G. Kim, and P.T. Sakai. IEEE 802.11 Wireless Local Area Networks. IEEE Communications Magazine, 35(9):116-26, Sept 1997. Google ScholarDigital Library
- 8.A. Ephremides and T.V. Truong. Scheduling broadcasts in multihop radio networks. IEEE Transactions on Communications, 38(4):456-60, April 1990.Google ScholarCross Ref
- 9.S. Even, O. Goldreich, S. Moran, and P. Tong. On the NP-completeness of certain network testing problems. Networks, 14(1):1-24, Spring 1984.Google ScholarCross Ref
- 10.W. Feller. An introduction to probability theory and its applications, volume 1. New York: John Wiley, 2nd edition, 1957.Google Scholar
- 11.W. Fuhrmann and A. Eizenhofer. Radio access protocol of the new GSM land mobile communication standard. In 38th IEEE Vehicular Technology Conference: Telecommunications Freedom - Technology on the Move, pages 30-7, Philadelphia, PA, USA, 15-17 June 1988.Google ScholarCross Ref
- 12.C.L. Fullmer and J J. Garcia-Luna-Aceves. Solutions to hidden terminal problems in wireless networks. In Proceedings ACM SIGCOMM, Cannes, France, September 1997. Google ScholarDigital Library
- 13.J.J. Garcia-Luna-Aceves and J. Raju. Distributed assignment of codes for multihop packet-radio networks. In MILCOM 97 Proceedings, pages 450-4, Monterey, CA, USA, 2-5 Nov. 1997.Google ScholarCross Ref
- 14.J.J. Garcia-Luna-Aceves and A. Tzamaloukas. Reversing The Collision-Avoidance Handshake in Wireless Networks. In Proc. ACM/IEEE Mobicom, Seattle, Washington, August 15-20 1999. Google ScholarDigital Library
- 15.L. Hu. Distributed code assignments for CDMA packet radio networks. IEEE/ACM Transactions on Networking, 1(6):668-77, Dec. 1993. Google ScholarDigital Library
- 16.M. Joa-Ng and I.T. Lu. Spread spectrum medium access protocol with collision avoidance in mobile ad-hoc wireless network. In IEEE INFOCOM '99, pages 776-83, New York, NY, USA, 21-25 March 1999.Google ScholarCross Ref
- 17.J.H. Ju and V.O.K. Li. An optimal topology-transparent scheduling method in multihop packet radio networks. IEEE/ACM Transactions on Networking, 6(3):298-306, June 1998. Google ScholarDigital Library
- 18.R. J. Larsen and M. L. Marx. An introduction to probability and its applications. Number p.165-167. Englewood Cliffs, N.J. : Prentice-Hall, 1985.Google Scholar
- 19.T. Makansi. Trasmitter-Oriented Code Assignment for Multihop Radio Net-works. IEEE Transactions on Communications, 35(12):1379-82, Dec. 1987.Google ScholarCross Ref
- 20.L.C. Pond and V.O.K. Li. A distributed time-slot assignment protocol for mobile multi-hop broadcast packet radio networks. In MILCOM 89, volume 1, pages 70-4, Boston, MA, USA, 1989.Google ScholarCross Ref
- 21.S. Ramanathan. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks, 5(2):81-94, 1999. Google ScholarDigital Library
- 22.R. Ramaswami and K.K. Parhi. Distributed scheduling of broadcasts in a radio network. In IEEE INFOCOM'89, volume 2, pages 497-504, Ottawa, Ont., Canada, 23-27 April 1989. IEEE Comput. Soc. Press.Google ScholarCross Ref
- 23.T.J. Shepard. A channel access scheme for large dense packet radio networks. In ACM SIGCOMM '96 Conference, pages 219-30, Stanford, CA, USA, 26-30 Aug. 1996. Google ScholarDigital Library
- 24.J.A. Silvester. Perfect scheduling in multi-hop broadcast networks. In Proceedings of the Sixth International Conference on Computer Communication, pages 449-54, London, UK, 7-10 Sept. 1982.Google Scholar
- 25.Z. Tang and J.J. Garcia-Luna-Aceves. A Protocol for Topology-Dependent Transmission Scheduling. In Proc. IEEE Wireless Communications and Networking Conference 1999 (WCNC 99), New Orleans, Louisiana, September 21-24 1999.Google Scholar
- 26.F. A. Tobagi and L. Kleinrock. Packet switching in radio channels: Part II - the hidden terminal problem in carrier sense multiple-access modes and the busy-tone solution. IEEE Transactions on communications, 23(12):1417-33, December 1975.Google ScholarCross Ref
- 27.C. Zhu and M.S. Corson. A five-phase reservation protocol (FPRP) for mobile ad hoc networks. In IEEE INFOCOM '98, volume 1, pages 322-31, San Francisco, CA, USA, 29 March-2 April 1998.Google Scholar
Index Terms
- A new approach to channel access scheduling for Ad Hoc networks
Recommendations
Distributed dynamic channel access scheduling for ad hoc networks
Special issue on wireless and mobile ad hoc networking and computingThree types of collision-free channel access protocols for ad hoc networks are presented. These protocols are derived from a novel approach to contention resolution that allows contending entities to elect one or multiple winners for channel access in ...
Channel access scheduling in Ad Hoc networks with unidirectional links
DIALM '01: Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communicationsA new family of collision-free channel access protocols for ad hoc networks with unidirectional links is introduced. These protocols are based on a distributed contention resolution algorithm that operates at each node based on the list of direct ...
Comments