Publish/Subscribe in a mobile enviroment
Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
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
PeopleNet: engineering a wireless virtual social network
Proceedings of the 11th annual international conference on Mobile computing and networking
Introduction to Probability Models, Ninth Edition
Introduction to Probability Models, Ninth Edition
Social network analysis for routing in disconnected delay-tolerant MANETs
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
A socio-aware overlay for publish/subscribe communication in delay tolerant networks
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Efficient routing in intermittently connected mobile networks: the multiple-copy case
IEEE/ACM Transactions on Networking (TON)
AINAW '08 Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops
ContentPlace: social-aware data dissemination in opportunistic networks
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
An experimental study of large-scale mobile social network
Proceedings of the 18th international conference on World wide web
Context and resource awareness in opportunistic network data dissemination
WOWMOM '08 Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks
Barter trade improves message delivery in opportunistic networks
Ad Hoc 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
Routing in socially selfish delay tolerant networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Mobicent: a credit-based incentive system for disruption tolerant network
INFOCOM'10 Proceedings of the 29th conference on Information communications
Opportunistic networking: data forwarding in disconnected mobile ad hoc networks
IEEE Communications Magazine
Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
Incentive-aware routing in DTNs
ICNP '08 Proceedings of the 2008 IEEE International Conference on Network Protocols
| Hi-index | 0.00 |
Data dissemination in opportunistic networks has been extensively studied in recent years. In the resource-constrained opportunistic networks (e.g., the buffer size, the communication bandwidth and the energy of nodes are scarce), the nodes usually behave selfishly. In other words, the nodes only store data objects they are interested in and are not willing to contribute their own resource to store and forward data objects for other nodes. Their selfish behaviors significantly decrease the data dissemination performance of opportunistic networks. In this paper, a Reciprocal Incentive Scheme (RIS) is put forward, which can create a win-win situation for the Internet Service Provider, A-type nodes (the nodes which can freely download a large amount of content from the Internet) and B-type nodes (the nodes which must pay much money to the ISP for downloading data objects from the Internet by direct connection). When RIS is deployed in a selfish opportunistic network, we analyze in detail how these selfish nodes select data objects for their limited buffer to maximize their revenue. Furthermore, this paper investigates the relationship between the decisions made by the nodes and the scope of network information they maintain. Extensive trace-driven simulations based on MIT trace are conducted to evaluate the data dissemination performance of the whole system when all nodes try to maximize their revenue during the process of data dissemination. The results demonstrate that RIS could increase the average delivery ratio of each channel by 18 % and reduce the average receiving delay of each channel by 40 %. Moreover, B-type nodes only need to pay much less money for each subscribed data object than the situation where no incentive scheme is adopted in the system. The simulation results also show that the larger scope of network information the nodes maintain, the better performance RIS can achieve.