Research Article
A Generalized Framework for Throughput Analysis in Sparse Mobile Networks
@INPROCEEDINGS{10.1109/WIOPT.2009.5291630, author={Ramanan Subramanian and Badri Vellambi and Faramarz Fekri}, title={A Generalized Framework for Throughput Analysis in Sparse Mobile Networks}, proceedings={7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks}, publisher={IEEE}, proceedings_a={WIOPT}, year={2010}, month={5}, keywords={Modeling simulations and performance analysis; Mobility modeling and management; Opportunistic and cooperative communications}, doi={10.1109/WIOPT.2009.5291630} }- Ramanan Subramanian
Badri Vellambi
Faramarz Fekri
Year: 2010
A Generalized Framework for Throughput Analysis in Sparse Mobile Networks
WIOPT
IEEE
DOI: 10.1109/WIOPT.2009.5291630
Abstract
Consider a sparse mobile network employing the emph{store, carry, and forward} paradigm of communication in which nodes wait for contacts with other nodes and rely on their mobility to carry data to the destination. In this paper, we investigate the problem of analytically computing the throughput capacity of such a network in terms of its parameters, using queuing-theoretic techniques. We also propose an accurate analytical framework valid for any mobility model that exhibits emph{stationarity}. We then employ the embedded-Markov-Chain approach, using which we show that the capacity of such a network can be accurately determined by computing certain well-defined functions of mobility parameters for any given mobility model. We also incorporate practical constraints posed by finite node-storage, and by contention between nodes for the bandwidth resource, in order to obtain a realistic model for the throughput. Finally, we illustrate the proposed framework under two specific cases: the random-walk and restricted-random-waypoint -mobility models, and validate the same using simulations.
