2 problems

Let $m$ be the number of friendly nodes, $n$ the number of channel uses, $N_{\mathrm{w}}$ the number of Willies, and let $\gamma>2$. Under the strategy in which nodes sufficiently…

Let $m$ be the number of friendly nodes, $n$ the number of channel uses, and let $\gamma>2$. Friendly nodes at distance less than $\iota>0$ from Bob are turned off, while every oth…