A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Pocket switched networks and human mobility in conference environments
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
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
Performance modeling of epidemic routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Prioritized epidemic routing for opportunistic networks
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
Power law and exponential decay of inter contact times between mobile devices
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Contention-Aware Performance Analysis of Mobility-Assisted Routing
IEEE Transactions on Mobile Computing
An optimal probabilistic forwarding protocolin delay tolerant networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Multicasting in delay tolerant networks: a social network perspective
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
The ONE simulator for DTN protocol evaluation
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
IEEE/ACM Transactions on Networking (TON)
Impact of altruism on opportunistic communications
ICUFN'09 Proceedings of the first international conference on Ubiquitous and future networks
The effects of node cooperation level on routing performance in delay tolerant networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Selfishness, altruism and message spreading in mobile social networks
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
On the cache-and-forward network architecture
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Recognizing exponential inter-contact time in VANETs
INFOCOM'10 Proceedings of the 29th conference on Information communications
Optimal activation and transmission control in delay tolerant networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Routing in socially selfish delay tolerant networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Information propagation speed in mobile and delay tolerant networks
IEEE Transactions on Information Theory
Evaluating the impact of social selfishness on the epidemic routing in delay tolerant networks
IEEE Communications Letters
Win-Coupon: An incentive framework for 3G traffic offloading
ICNP '11 Proceedings of the 2011 19th IEEE International Conference on Network Protocols
Mobile Data Offloading through Opportunistic Communications and Social Participation
IEEE Transactions on Mobile Computing
Coalition-Based Cooperative Packet Delivery under Uncertainty: A Dynamic Bayesian Coalitional Game
IEEE Transactions on Mobile Computing
On Modeling The Impact of Selfish Behaviors on Limited Epidemic Routing in Delay Tolerant Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
Due to the uncertainty of the connections in delay tolerant networks, the source may need help from other nodes and make these nodes serve as relays to forward the messages to the destination. To further improve the performance, the source may also make these nodes serve as agents, which can help the source to make other nodes serve as relays. However, nodes may not be willing to help the source without any reward because of the selfish nature. This means that the source has to pay certain reward to the nodes that provide help. Furthermore, such fees may be varying with time. For example, if the nodes guess that the source is eager to transmit the message to the destination, they may ask for more reward. In addition, the reward that the source obtains from the destination may be varying with time, too. For example, the sooner the destination gets the message, the more reward may be. In such complex case, it may not be good for the source to request help all the time. This paper proposes a unifying theoretical framework based on Ordinary Differential Equations to evaluate the total reward that the source can obtain. Then, based on the framework, we study the optimal control problem by Pontryagin's Maximum Principle and prove that the optimal policy confirms to the threshold form in some cases. Simulations based on both synthetic and real motion traces show the accuracy of the framework. Furthermore, we demonstrate that the performance of the optimal policy is the best through extensive numerical results.