retagged by
1,224 views
0 votes
0 votes
retagged by

2 Answers

0 votes
0 votes
The Adaptive tree Walk Protocol (ATWP) is a protocol that is used to resolve contention for a shared channel in a network. In a situation where multiple stations are contending for the use of a shared channel, the ATWP uses a binary tree structure to determine which station gets access to the channel first.

In your scenario, stations 7 and 8 are contending for the use of a shared channel at the same time. In order to resolve this contention, the ATWP would use a binary tree structure to determine which of these stations gets access to the channel first. The number of bit slots needed to resolve this contention would depend on the number of stations contending for the channel, as well as the specific implementation of the ATWP.

As a general rule, the number of bit slots needed to resolve contention using the ATWP increases as the number of contending stations increases. In the case of stations 7 and 8 contending for the use of a shared channel, it is likely that at least a few bit slots would be needed to resolve the contention. However, without more information about the specific implementation of the ATWP and the number of stations contending for the channel, it is not possible to provide a more precise answer.
0 votes
0 votes

contention is a media access method , used when broadcasting medium is to be shared .A contention period (contention slot) is the min. time a host must transmit such that it can be sure that no other host packets has been transmitting data, that is no collision .

Adaptive Tree Walking Protocol (ATWP)
in this we use binary tree and then perform dfs(depth first search) while checking for the transmissions and collisions.
Consider the below table as a Binary tree and nodes as 1,2,… (basically the slot #)
and 1’ ,2’ , …. are those  stations .
Each row is a level.
7’ and 8’ are the station which become suddenly ready to send.

nodes remarks
0 contains every slot. (7’ and 8’ also, so collision possible)
{1},{2} 2 contains 7’ ,8’ , so there can be a collision in this slot
{[3] ,[4] }  ,    { [5] ,[6] } there will be again a collision in 6 (slot #)
{ [ (1’ ,2’) ],  [ (3’ , 4’)] } ,  { [ ( 5’ ,6’) ], [ (7’ , 8’) ]} there won’t be collision.

highlighted and underlined the slots i have considered
7’ , 8’ , 6 , 2 ,0
, as in these slots i find more than 1 station ready to send data at once.
total slots needed = 5 bits , to resolve the contention

 

edited by

Related questions

0 votes
0 votes
2 answers
2
dhruba asked Jun 5, 2023
1,163 views
Binary search is performed on a sorted array of n elements. The search key is not in the array and falls between the elements at positions m and m+1 (where 1 ≤ m < n). ...
6 votes
6 votes
2 answers
4
Vikrant Singh asked Jan 29, 2015
4,470 views
In P-persistent CSMA network there are 5 systems in a slot. The probability of station not transmitting the data is 0.6. Only two stations should transmit the data to avo...