[Computer Network Course]

. Slotted ALOHA): Suppose there are N nodes in a slotted ALOHA network. Every node is trying to transmit a packet at every time slot with probability p, independently of each other. It takes one time slot to transmit a packet. (a) Express the offered load (the average number of packets per time slot that are arriving to the network) in terms (b) Show the throughput (the average number of successfully transmitted packets per time slot) is equal to Np(1 - (c) Suppose the nodes can somehow change the probability of transmission p in their favor. Find value of p that d) Let us denote the maximum throughput by T(N), using the value of p from part (c). We call T(N) as capacity of N and p. p)N-1 maximizes the throughput of the network. Calculate the capacity if there are infinite number of nodes, in other words, find lim No T(N). I hope the answer looks familiar to you!) . Slotted ALOHA): Suppose there are N nodes in a slotted ALOHA network. Every node is trying to transmit a packet at every time slot with probability p, independently of each other. It takes one time slot to transmit a packet. (a) Express the offered load (the average number of packets per time slot that are arriving to the network) in terms (b) Show the throughput (the average number of successfully transmitted packets per time slot) is equal to Np(1 - (c) Suppose the nodes can somehow change the probability of transmission p in their favor. Find value of p that d) Let us denote the maximum throughput by T(N), using the value of p from part (c). We call T(N) as capacity of N and p. p)N-1 maximizes the throughput of the network. Calculate the capacity if there are infinite number of nodes, in other words, find lim No T(N). I hope the answer looks familiar to you!)