Abstract
Social-based routing approaches in delay-tolerant networks have attracted widespread attention in recent years, which attempt to import social behaviors and relations in real scene for node mobility. However, most social-based schemes resort to users’ contact history and social relations that are dynamic, causing it so hard to establish stable relations between nodes. In this paper, we propose a utility-aware data transmission scheme which considers both internal property and external contact of nodes. Inspired by the concept of transfer station in real life, we set a central group and choose nodes for message forwarding, which have higher utility, i.e., enough energy, adequate cache, and more nodes encountered during the motivation. Two extensions are proposed also to further reduce the overhead. Simulation results demonstrate the increase in delivery ratio and decrease in overhead ratio, especially in large scale scenarios.
Similar content being viewed by others
References
Kevin F (2003) A delay-tolerant network architecture for challenged Internets. Proceedings of the 2003 conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM 2003), Karlsruhe, German, pp 27–34
Ott J, Kutscher D (2005) A disconnection-tolerant transport for drive-thru internet environments. 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2005), Miami, USA, 3:1849–1862
Pentland A, Fletcher R, Hasson A (2004) Daknet: rethinking connectivity in developing nations. Computer 37(1):78–83
Samuel CN, Albert FH, Robin K (2007) Event-driven, role-based mobility in disaster recovery networks. Proceedings of the second ACM workshop for Challenged networks (CHANTS 2007), Montreal, pp 27–34
Philo J, Hidekazu O, Yong W, Margaret M, Li-Shiuan P, Daniel R (2002) Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with zebra net. Conference on Architectural Support for Programming Languages and Operating Systems(ASPLOS-X 2002), San Jose, CA, pp 96–107
Xiangchuan C, Amy LM (2001) Enabling disconnected transitive communication in mobile ad hoc networks. Workshop on Principles of Mobile Computing (POMC 2001), Rhode Island
DNTs. http://www.dtnrg.org
Vahdat A, Becker D (2000) Epidemic routing for partially connected ad-hoc networks. Technical Report, CS-2000-06, Duke University
Anders L, Avri D, Olov S (2003) Probabilistic routing in intermittently connected networks. ACM SIGMOBILE 7:19–20
Nikodin R, George T, Jean-Yves L (2012) Traps and pitfalls of using contact traces in performance studies of opportunistic networks. The 31st Annual IEEE International Conference on Computer Communications (IEEE INFOCOM 2012), Orlando, FL, pp 1377–1385
Cabacas, Regin, Ra, In-Ho (2014) A novel energy-aware priority transmission scheme based on context-metric queuing for delay tolerant networks. International Conference on Information Science, Electronics and Electrical Engineering (ISEEE 2014), Sapporo City, Hokkaido, Japan, 2:1095–1099
Shikha J (2014) Black hole attack in delay tolerant networks: a survey. Int J Comput Sci Engine Eng 2(4):2347–2693
Sanjay KD, Deepak KS, Aseem G, Diksha K (2013) Fixed and Mobile Infrastructure-Based Routing Protocol in Opportunistic Networks. Proceedings of All India Seminar on Biomedical Engineering 2012 (AISOBE 2012) Lecture Notes in Bioengineering pp 247–253
Haitao W, Lihua S, Jianzhou L, Jiaxin D (2012) Wireless self-organizing emergency communication network based on network clustering and information ferry. International Conference on Consumer Electronics, Communications and Networks (CECNet 2012), Yichang, China, pp 3704–3707
Shio KS, M PS, D KS (2010) A Survey of Energy-Efficient Hierarchical Cluster-Based Routing in Wireless Sensor Networks. Int J Advanc Networ Applic 2(2):570–580
Hirokazu M, Daisuke N, Noriyuki M, Hirokazu T (2010) Message ferry route design based on clustering for sparse Ad hoc networks. Lect Notes Comput Sci 6277:637–644
Lei Z, Boyang Y, Jianping P (2014) GeoMob: A Mobility-aware Geocast Scheme in Metropolitans via Taxicabs and Buses. The 33rd Annual IEEE International Conference on Computer Communications (INFOCOM 2014), Toronto, Canada, pp 1779–1787
Acknowledgments
This work is supported by the National Science Foundation of China under grants (61373137, 61373017, 61373139), Major Program of Jiangsu Higher Education Institutions (14KJA520002), Six Industries Talent Peaks Plan of Jiangsu (2013-DZXX-014), Jiangsu Qinglan Project and A Project Funded by Priority Academic Program Development of Jiangsu Higher Education Institutions (Information and Communication).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Xiao, F., Xie, X., Jiang, Z. et al. Utility-aware data transmission scheme for delay tolerant networks. Peer-to-Peer Netw. Appl. 9, 936–944 (2016). https://doi.org/10.1007/s12083-015-0354-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12083-015-0354-y