“…(e) is used to find the upper limit of k (= y,), assuming a complete coinciidence between C,, and C,, thus:PHdn,)2 Prob {a station or more, from the other (N-n,) I n, channels, The (N-n,) stations, in the above probability, can be divided into two groups, s, and sz , where the s, stations are known to be idle while the A:, stations may be either idle or active. From Figure 4(c): = O Thus: s, = max (0, [(N-n,) -(e-cJ]} s2 = (N-n,) -s, PHT(lt,) = 1 -[ Prob {none of the sI idle stations is full) Y, = min {(cs-n), (CId)} stations, is (are:) idle and full out of CO, were busy in the previous slot) sI = [(N-n,) -(c-c$] ; if(N-nl) > (c-cJ ; i f (N-n,) c (c-cd .…”