Steady-State Analysis of Buffer Occupancy for Different Forwarding Strategies in Mobile Opportunistic Network

We perform a study on the buffer occupancy
¹
and its steady-state properties in a mobile opportunistic network (MON) for different forwarding strategies. Nodes in MON adhere to replication based strategy in order to ensure reliable delivery. Such replications occur in bulks during intermittent and very short contact events, which often lead to buffer congestion in the relay nodes, thereby affecting the network performance. The state-of-the-art on buffer management in MON relies on local information exchange to measure buffer occupancy, which leads to overhead. Therefore, to find the average buffer occupancy, we first study the aggregated bulk transfer size using real-life contact traces and find that it follows a log-normal distribution. Since the contact rate has been observed to follow a Poisson distribution, we model the packet arrival process in each node as a compound Poisson process. Furthermore, the departure process is modeled as packets dropped due to time-to-live expiry, which is shown to have an exponential distribution. Using the above model, we derive the steady-state probability distribution of buffer occupancy of an arbitrary node for three different classes of replication scheme, viz., epidemic routing, probabilistic routing, and time-varying probabilistic routing. The results of this paper help in assessing how fast a node buffer gets depleted under different routing algorithms, which will help in designing better buffer management techniques and routing algorithms.