Mobility modeling in wireless networks: categorization, smooth movement, and border effects
ACM SIGMOBILE Mobile Computing and Communications Review
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
The message delay in mobile ad hoc networks
Performance Evaluation - Performance 2005
A new networking model for biological applications of ad hoc sensor networks
IEEE/ACM Transactions on Networking (TON)
Optimal delay-power tradeoff in sparse delay tolerant networks: a preliminary study
Proceedings of the 2006 SIGCOMM workshop on Challenged networks
Relaying in mobile ad hoc networks: the Brownian motion mobility model
Wireless Networks
Performance modeling of epidemic routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Delay and capacity trade-offs in mobile ad hoc networks: a global perspective
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
The task of routing in epidemic networks faces certain difficulties involving minimizing the delivery delay with a reduced consumption of resources. Every node has severe power constraints and the network is also susceptible to temporary but random failure of nodes. In the previous work, the parameter of mobility has been considered a constant for a certain setting. In our setting, we consider a varying parameter of mobility. In this framework, we determine the optimal mobility pattern and a forwarding policy that a network should follow in order to meet the trade-off between delivery delay and power consumption. In addition, the mobility pattern should be such that it can be practically incorporated. In this paper, we formulate an optimization problem which is solved by using the principles of dynamic programming. The resultant strategy, OFACT - Optimal Forwarding Algorithm with Controlled Transmission range, has been studied through extensive simulations. The performance of OFACT has been compared with a few existing strategies. Our results show that this optimization problem has a global solution.