Adaptive Tree Walk Protocol

In this assignment, your program needs to: a) Retrieve the specific value of N and the stations that have a frame to send from the input file; display the value of N and the stations that have a frame to send on the screen. b) Use ATWP to determine what stations would send a frame during the upcoming timeslots; display the names of the stations that would send a frame during upcoming timeslots on the screen.

• In the OSI model, Link Layer can be described as two sub-layers:
• LLC: Logical Link Control
• MAC: Medium Access Control
• In broadcast networks, one key issue is to determine how to use the shared channel.
• MAC sublayer says who goes next on a broadcast channel.
• Static vs Dynamic Channel Allocation
• Station Model, Single Channel, Collision
• Continuous/Slotted Time, Carrier Sense & No Carrier Sense

• Limited-Contention Protocols:
• Uses contention protocols at light load to provide low delay
• Uses collision-free protocols at high load to provide good channel efficiency
• Adaptive Tree Walk Protocol – ATWP
• Stations are arranged in a binary tree in which all stations under the whole tree are permitted to transmit at the beginning.
• If there is collision, we halve the number of stations permitted.
• This process is repeated until one station transmits or Or we are at the bottom of the tree.
• After transmission, it backtracks the tree to do the same thing for other stations having a frame to send.

• The objective of this assignment is designing and implementing a program which uses Adaptive Tree Walk Protocol (ATWP).
• The program must detect the collisions and determine the order of stations that send their frames to the network at each time slot.

Note: You only need to implement the original version of ATWP