Buffer occupation in wireless social networks
WASA'13 Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications
| Hi-index | 0.00 |
We study the fundamental lower bound for node buffer size in intermittently connected wireless networks. The intermittent connectivity is caused by the possibility of node inactivity due to some external constraints. We find even with infinite channel capacity and node processing speed, buffer occupation in each node does not approach zero in a static random network where each node keeps a constant message generation rate. Given the condition that each node has the same probability $(p)$ of being inactive during each time slot, there exists a critical value $(p_c(\lambda ))$ for this probability from a percolation-based perspective. When $(pp_c(\lambda ))$, the network is in the subcritical case, and there is a tight lower bound $(\Theta (\sqrt{n}))$ for buffer occupation, where $(n)$ is the number of nodes in the network.