Abstract
Mobile Opportunistic Networks (MONs) are a class of wireless Delay Tolerant Networks that have been widely utilized in the areas of sporadic network connectivity. Many routing protocols in MONs assume that nodes are willing to forward messages to others. However, in real world scenarios, nodes behave selfishly and do not choose to be cooperative throughout due to a variety of reasons, ranging from lower energy levels to buffer shortages. Thus, it is imperative to develop incentive mechanisms to reward nodes for cooperation. In this paper, we propose a cost-aware cooperative theory-based routing protocol called CACR that is able to improve the delivery ratio and reduce the cost of nodes as well as incentivize them to participate in message routing. CACR is based on cooperative theory and adopts Shapley value to distribute the extra payoff for all participants to achieve the payment fairness according to the contribution of each participant. Subsequent simulations based on real-life traces show that CACR provides higher delivery rate and less transmission overheads than the existing routing protocols in MONs with selfish nodes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Fall, K.: Delay-tolerant network architecture for challenged internets. In: Annual Conference on the Special Interest Group on Data Communication, pp. 27–34. ACM, Karisruhe (2003)
Zhang, Z.: Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges. IEEE Commun. Surv. Tutor. 8(1), 24–37 (2006)
Zhang, L., Wang, X., Lu, J., Ren, M., Duan, Z., Cai, Z.: A novel contact prediction-based routing scheme for DTNs. Trans. Emerg. Telecommun. Technol. 28(1), 1–12 (2017)
Zhao, R., Wang, X., Lin, Y., Yang, Y., Hui, T., Zhang, L.: A controllable multi-replica routing approach for opportunistic networks. IEEJ Trans. Electr. Electron. Eng. 12(4), 589–600 (2017)
Zhao, R., Wang, X., Zhang, L., Lin, Y.: A social-aware probabilistic routing approach for mobile opportunistic social networks. Trans. Emerg. Telecommun. Technol. 28(12), 1–19 (2017)
Zhang, F., Wang, X., Jiang, L., Zhang, L.: Energy efficient forwarding algorithm in opportunistic networks. Chin. J. Electron. 25(5), 957–964 (2016)
Zhang, L., Cai, Z., Lu, J., Wang, X.: Mobility-aware routing in delay tolerant networks. Pers. Ubiquit. Comput. 19(7), 1111–1123 (2015)
Chen, Q., Cheng, S., Gao, H.: Energy-efficient algorithm for multicasting in duty-cycled sensor networks. Sensors 15(12), 31224–31243 (2015)
Lin, Y., Wang, X., Hao, F., Wang, L., Zhang, L., Zhao, R.: An on-demand coverage based self-deployment algorithm for big data perception in mobile sensing networks. Future Gener. Comput. Syst. 82, 220–234 (2018)
Li, L., Qin, Y., Zhong, X.: An incentive aware routing for selfish opportunistic networks: a game theoretic approach. In: IEEE 8th International Conference on Wireless Communications and Signal Processing, pp. 1–5. IEEE, Yang Zhou (2016)
Shevade, U., Song, H., Qiu, L.: Incentive-aware routing in DTNs. In: IEEE 16th International Conference on Network Protocols, pp. 238–247. IEEE, Orlando (2008)
Wu, F., Chen, T., Zhong, S., Qiao, C., Chen, G.: A game-theoretic approach to stimulate cooperation for probabilistic routing in opportunistic networks. IEEE Trans. Wirel. Commun. 12(4), 1573–1583 (2012)
Zhu, H., Lin, X., Lu, R., Fan, Y., Shen, X.: SMART: a secure multilayer credit-based incentive scheme for delay-tolerant networks. IEEE Trans. Veh. Technol. 58(8), 4628–4639 (2009)
Cai, Y., Fan, Y., Wen, D.: An incentive-compatible routing protocol for two-hop delay-tolerant networks. IEEE Trans. Veh. Technol. 65(1), 266–277 (2016)
Lo, C., Kuo, Y., Jiang, J.: Data dissemination strategy based on time validity for opportunistic networks. In: 8th International Conference on Ubiquitous and Future Networks, pp. 1040–1045. IEEE, Vienna (2016)
Huang, Y., Dong, Y., Zhang, S.: TTL sensitive social-aware routing in mobile opportunistic networks. In: 15th Consumer Communications and Networking Conference, pp. 810–814. IEEE, Las Vegas (2014)
Lu, R., Lin, X., Shi, Z.: IPAD: an incentive and privacy-aware data dissemination scheme in opportunistic networks. In: 32nd International Conference on Computer and Communications, pp. 445–449. IEEE, Turin (2013)
Gao, W., Li, Q., Zhao, B., Cao, G.: Multicasting in delay tolerant networks: a social network perspective. In: 10th ACM International Symposium on Mobile Ad Hoc Network and Computing, pp. 299–308. ACM, New Orleans (2009)
Scott, J., Gass, R., Crowcroft, J., Hui, P., Diot, C., Chaintreau. A.: Crawdad data set Cambridge/Haggle (2009). http://crawdad.cs.dartmouth.edu/cambridge/haggle/imote/infocom2006. Accessed 29 May 2009
Dhurandher, S., Sharma, D., Woungang, I.: GAER: genetic algorithm-based energy-efficient routing protocol for infrastructure-less opportunistic networks. J. Supercomput. 69(3), 1183–1214 (2014)
Li, Q., Zhu, S., Cao G.: Routing in socially selfish delay tolerant networks. In: 29nd International Conference on Computer and Communications, pp. 445–449. IEEE, San Diego (2010)
Acknowledgments
This work is partly supported by the National Key R&D Program of China (No. 2017YFB1402102), the Natural Science Basis Research Plan in Shaanxi Province of China (Nos. 2017JM6060, 2017JM6103), and the Fundamental Research Funds for the Central Universities of China (No. GK201801004).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Yu, S., Zhang, L., Li, L., Wang, X. (2019). Cost-Aware Cooperative Theory Based Routing in Mobile Opportunistic Networks. In: Shen, S., Qian, K., Yu, S., Wang, W. (eds) Wireless Sensor Networks. CWSN 2018. Communications in Computer and Information Science, vol 984. Springer, Singapore. https://doi.org/10.1007/978-981-13-6834-9_1
Download citation
DOI: https://doi.org/10.1007/978-981-13-6834-9_1
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-6833-2
Online ISBN: 978-981-13-6834-9
eBook Packages: Computer ScienceComputer Science (R0)