Node buffer size in intermittently connected wireless networks with infrastructure support

We study the occupied buffer size in intermittently connected wireless networks with Base Stations (BS´s). In this kind of networks, the link between two nodes is intermittent because of external constraints, and there exists Base Stations following the uniform distribution. With the condition that each node has the same probability 1 - p to be inactive during each time slot, there exists a critical value p_c(λ) for this probability according to the theory of percolation. When p <; p_c(λ), the network is in the subcritical case, otherwise it is in the supercritical case. We have proved that, in static network with BS´s, the achievable lower bound for occupied buffer size is Θ(√√n/m) in the subcritical case, and Θ(1) in the supercritical case, where n is the number of nodes in the network, and m is the number of base stations. In the mobile network with BS´s where mobility is independent and identically distributed(i.i.d.), if redundancy is not allowed, the results are Θ(n/m) and Θ(1) in the subcritical and supercritical case respectively.