The message delay in mobile ad hoc networks
Performance Evaluation - Performance 2005
Spatial Node Distribution of the Random Waypoint Mobility Model with Applications
IEEE Transactions on Mobile Computing
Message ferry route design for sparse ad hoc networks with mobile nodes
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
A General Framework to Construct Stationary Mobility Models for the Simulation of Mobile Networks
IEEE Transactions on Mobile Computing
A hybrid routing approach for opportunistic networks
Proceedings of the 2006 SIGCOMM workshop on Challenged networks
Performance of ad hoc networks with two-hop relay routing and limited packet lifetime
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Random waypoint mobility model in cellular networks
Wireless Networks
Performance modeling of epidemic routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient routing in intermittently connected mobile networks: the single-copy case
IEEE/ACM Transactions on Networking (TON)
Stationary Distributions for the Random Waypoint Mobility Model
IEEE Transactions on Mobile Computing
| Hi-index | 0.00 |
Consider a mobile network wherein nodes are confined to move and communicate in a given area. The network is assumed to be sparse, wherein a direct communication path from a source node via multiple hops to a destination node almost never exists. The nodes resort to storing, carrying, and forwarding packets when a contact occurs, as a means of comm unication. This paper investigates the question of computing the throughput capacity of the resulting network, in other words, the rate at which a source node can send packets to a destination node using the other nodes in the network as relays. It proposes an accurate generalized framework valid for any mobility model that exhibits stationarity. The framework uses the embedded MarkovChain approach using which the capacity of such a network can be accurately determined by computing certain well-defined characteristic parameters from the mobility model. Constraints posed by limited node storage and contention between nodes for the wireless channel are also considered in order to obtain a realistic model for the throughput. The paper also illustrates the proposed framework under two specific cases: the random walk, random waypoint, and restricted random waypoint mobility models, and validates the same using simulations.