6 problems

Consider the relayed communication model in which communication is currently established with at most one hop, and let $k<\infty$ be a fixed maximum number of hops, allowing relayi…

Let $b \geq 0$ and $c \in (0,\tilde{c}_+)$ be relevant frustration parameters. Consider the average fading and average path-loss in the mobile network model, with expected values g…

Optimal spreading-time conjecture. With finer tuning of concentration-of-measure and coupling techniques, it may be possible to obtain

Logarithmic-gap conjecture. With finer tuning of the concentration-of-measure techniques, the current gap can be narrowed to

Exact spreading-time conjecture. The spreading time is conjectured to have exact order

Upper-bound conjecture. Random-walk mobility models with slower mixing times should yield smaller benefits, and the independent, fast-mixing model should always provide an upper bo…