Lower Bound for Node Buffer Size in Intermittently Connected Wireless Networks

• Published in: IEEE transactions on parallel and distributed systems Vol. 24; no. 4; pp. 754 - 766
• Main Authors: Wang, Xinbing, Yu, Tuo, Xu, Yuanzhong
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.04.2013; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Asymptotic properties; Buffer size; Buffers; Channel capacity; Computer networks; Delay; Heuristic; Lower bounds; Messages; Networks; Occupation; Routing; Studies; Throughput; Transmitters; Wireless networks; Wireless sensor networks
• ISSN: 1045-9219; 1558-2183
• DOI: 10.1109/TPDS.2012.119

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 (λ) for this probability from a percolation-based perspective. When p <; p c (λ), the network is in the supercritical case, and there is an achievable lower bound (In our paper, "achievable" means that node buffer size in networks can achieve the same order as the lower bound by applying some transmission scheme) for the occupied buffer size of each node, which is asymptotically independent of the size of the network. If p > p c (λ), the network is in the subcritical case, and there is a tight lower bound Θ(√n) for buffer occupation, where n is the number of nodes in the network.