Stimulating cooperation in self-organizing mobile ad hoc networks
Mobile Networks and Applications
Modelling incentives for collaboration in mobile ad hoc networks
Performance Evaluation - Selected papers from the first workshop on modeling and optimization in mobile, ad hoc and wireless networks (WiOpt'2003)
Ad Hoc Networking
Hitting probabilities and hitting times for stochastic fluid flows: The bounded model
Probability in the Engineering and Informational Sciences
Stochastic 2-dimensional fluid model
ACM SIGMETRICS Performance Evaluation Review
| Hi-index | 0.00 |
In conventional mobile telephone networks, users communicate directly with a base station, via which their call is transferred to the recipient. In an ad hoc mobile network, there is no base-station infrastructure and users need to communicate between themselves, either directly if they are close enough, or via transit nodes if they are not.A number of interesting questions immediately arise in the modeling of ad hoc mobile networks. One that has received attention in the literature concerns how to encourage users to act as transit nodes for calls that they are not partaking in. Solutions to this problem have involved each user maintaining a `credit balance' which is increased by forwarding transit calls and decreased by transmitting one's own calls.A second question concerns the `amount of resource' that a network needs in order to be able to operate with a reasonable quality of service. We shall consider this question by modeling each user's battery energy and credit balance as fluids, the rate of increase or decrease of which is modulated by the network occupancy. This results in a network of stochastic fluid models, each modulated by the same background process.In this paper, we shall assume that there is no bound on the energy or the credit that a user's handset can accumulate. Using this model, we can calculate the critical rates of recharge that are necessary and sufficient to guarantee that no calls are lost. For recharge rates less than the critical values, we propose a reduced-load approach to the analysis of the network.