Medium Access Control (MAC)

– Collisions of packets must be avoided. – Bandwidth must not be underutilized. • Random Access: – Nodes contend for the channel whenever they have a packet. – Simplest example is Slotted Aloha: Nodes transmit packets whenever they arrive. – Most popular is CSMA/CA, the basis for IEEE 802.11. • Transmission Scheduling: – Time is divided in frames, and each frame in a number of slots. – Each node can transmit during a preassigned set of slots. – If node has the slot, but nothing to transmit, the slot is wasted. – The simplest example is TDMA/CDMA/FDMA.

[1]  Andrea J. Goldsmith,et al.  Capacity regions for wireless ad hoc networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[2]  Israel Cidon,et al.  Distributed Assignment Algorithms for Multihop Packet Radio Networks , 1989, IEEE Trans. Computers.

[3]  J. J. Garcia-Luna-Aceves,et al.  Transmission scheduling in ad hoc networks with directional antennas , 2002, MobiCom '02.

[4]  Chenxi Zhu,et al.  A Five-Phase Reservation Protocol (FPRP) for Mobile Ad Hoc Networks , 2001, Wirel. Networks.

[5]  Anthony Ephremides,et al.  Scheduling broadcasts in multihop radio networks , 1990, IEEE Trans. Commun..

[6]  Leandros Tassiulas,et al.  Jointly optimal routing and scheduling in packet radio networks , 1992, IEEE Trans. Inf. Theory.

[7]  Ness B. Shroff,et al.  Opportunistic transmission scheduling with resource-sharing constraints in wireless networks , 2001, IEEE J. Sel. Areas Commun..