The extension of the laboratory testbed, with the introduction of more routing protocols, such as MaxProp, and more mobility models for mobile nodes are included on the authors' plans for future studies.
Mobile nodes are synchronized via in-band software synchronization within the same framework.
The proposed framework has been tested using a railway scenario in which several static and mobile nodes are interacting.
This type of service is guaranteed only if these mobile nodes are one-hop away from the edge of the Internet.
Moreover, there is no password table in the server nodes end, which is preferable since mobile nodes are usually memory-restricted devices.
In this paper, we propose assigning mobile nodes to mobile servers using efficient heuristic algorithms such that communication requirements among mobile nodes are successfully met by mobile servers.
Assuming the mobile nodes are uniformly distributed along the circumference of a circle, the optimal solution to the network planning problem, minimizing a weighted sum of transmit energy costs and installation costs, can be stated as a convex minimization problem.
When, all mobile nodes are in stationary mode.
Thus, the components of mobile nodes are much stronger than static ones.
All mobile nodes are free to move in all direction during simulation.
Mobile nodes are opportunistically exploited to collect and disseminate data bundles through the VDTN network.
