0
\$\begingroup\$

I was wondering if it is possible to know the maximal and average number of time slots that will pass until and including the time slot in which there will be a successful broadcast, knowing that two stations want to transmit in the same time (for example sake, stations A and C want to broadcast in time t=0 with a probability p, none of the other stations want to broadcast at all).

I tried to look online and search in lecture notes, but couldn't find any resource dealing with that and it made me curious on how to deduct such information from the given adaptive tree walk protocol.

Image of the network:

enter image description here

\$\endgroup\$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.