{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:27:44Z","timestamp":1760243264771,"version":"build-2065373602"},"reference-count":23,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2014,12,25]],"date-time":"2014-12-25T00:00:00Z","timestamp":1419465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>With the development of mobile Internet, wireless communication via mobile devices has become a hot research topic, which is typically in the form of Delay Tolerant Networks (DTNs). One critical issue in the development of DTNs is routing. Although there is a lot research work addressing routing issues in DTNs, they cannot produce an advanced solution to the comprehensive challenges since only one or two aspects (nodes\u2019 movements, clustering, centricity and so on) are considered when the routing problem is handled. In view of these defects in the existing works, we propose a novel solution to address the routing issue in social DTNs. By this solution, mobile nodes are divided into different clusters. The scheme, Spray and Wait, is used for the intra-cluster communication while a new forwarding mechanism is designed for the inter-cluster version. In our solution, the characteristics of nodes and the relation between nodes are fully considered. The simulation results show that our proposed scheme can significantly improve the performance of the routing scheme in social DTNs.<\/jats:p>","DOI":"10.3390\/s150100285","type":"journal-article","created":{"date-parts":[[2014,12,26]],"date-time":"2014-12-26T05:52:39Z","timestamp":1419573159000},"page":"285-303","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["CCS-DTN: Clustering and Network Coding-Based Efficient Routing in Social DTNs"],"prefix":"10.3390","volume":"15","author":[{"given":"Zhenjing","family":"Zhang","sequence":"first","affiliation":[{"name":"Tianjin University, Tianjin 300072, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maode","family":"Ma","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5777-569X","authenticated-orcid":false,"given":"Zhigang","family":"Jin","sequence":"additional","affiliation":[{"name":"Tianjin University, Tianjin 300072, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2014,12,25]]},"reference":[{"key":"ref_1","unstructured":"Vahdat, A., and Becker, D. (2000). Epidemic Routing for Partially-connected Ad Hoc Networks, Duke University. Technical Report CS-200006."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Ramanathan, R., Hansen, P., Basu, R., Rosales-Hain, R., and Krishnan, R. (2007, January 11\u201314). Prioritized Epidemic Routing for Opportunistic Networks. San Juan, Puerto Rico.","DOI":"10.1145\/1247694.1247707"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Spyropoulos, T., Psounis, K., and Raghavendra, C.S. Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks. Available online: http:\/\/chants.cs.ucsb.edu\/2005\/papers\/paper-SpyPso.pdf.","DOI":"10.1145\/1080139.1080143"},{"key":"ref_4","unstructured":"Spyropoulos, T., Psounis, K., and Raghavendra, C.S. (2004, January 4\u20137). Single-copy routing in intermittently connected mobile networks. Santa Clara, CA, USA."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/961268.961272","article-title":"Probabilistic Routing in Intermittently Connected Networks","volume":"Volume 7","author":"Lindgren","year":"2003","journal-title":"ACM SIGMOBILE Mobile Computing and Communications Review"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Ahmed, S., and Kanhere, S. (2007, January 15\u201318). Cluster-based Forwarding in Delay Tolerant Public Transport Networks. Dublin, Ireland.","DOI":"10.1109\/LCN.2007.70"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1483","DOI":"10.1016\/j.comcom.2010.03.005","article-title":"HYMAD: Hybrid DTN-MANET Routing for Dense and Highly Dynamic Wireless Networks","volume":"33","author":"Whitbeck","year":"2010","journal-title":"Comput. Commun."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1874","DOI":"10.1109\/TWC.2010.06.081216","article-title":"Clustering and Cluster-Based Routing Protocol for Delay-Tolerant Mobile Networks","volume":"9","author":"Dang","year":"2010","journal-title":"IEEE Transact. Wirel. Commun."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1261","DOI":"10.1007\/s11390-012-1302-4","article-title":"Local Community Detection Using Link Similarity","volume":"27","author":"Wu","year":"2012","journal-title":"J. Comput. Sci. Technol."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1016\/j.camwa.2011.10.001","article-title":"Towards efficient and practical network coding in delay tolerant networks","volume":"63","author":"Zhao","year":"2012","journal-title":"Comput. Math. Appl."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Ahmed, S., and Kanher, S. (2009, January 26\u201330). HUBCODE: Message Forwarding using Hub-based Network Coding in Delay Tolerant Networks. Tenerife, Canary Islands, Spain.","DOI":"10.1145\/1641804.1641853"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1109\/MCOM.2012.6231292","article-title":"Beyond traditional DTN routing: Social networks for opportunistic communication","volume":"50","author":"Schurgot","year":"2012","journal-title":"IEEE Commun. Mag."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Shrestha, N., and Sassatelli, L. (2013, January 2\u20135). On Optimality of Routing Policies in Delay-Tolerant Mobile Social Networks. Dresden, Germany.","DOI":"10.1109\/VTCSpring.2013.6692663"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Daly, E., and Haahr, M. (2007, January 9\u201314). Social Network Analysis for Routing in Disconnected Delay-Tolerant MANETs. Montr\u00e9al, QC, Canada.","DOI":"10.1145\/1288107.1288113"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Hui, P., Crowcroft, J., and Yoneki, E. (2008, January 27\u201330). Bubble Rap: Social-based Forwarding in Delay Tolerant Networks. Hong Kong, China.","DOI":"10.1145\/1374618.1374652"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Erramilli, V., Crovella, M., Chaintreau, A., and Diot, C. (2008, January 27\u201330). Delegation Forwarding. Hong Kong, China.","DOI":"10.1145\/1374618.1374653"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Nelson, S., Bakht, M., and Kravets, R. (2009, January 19\u201325). Encounter-Based routing in DTNs. Rio de Janeiro, Brazil.","DOI":"10.1109\/INFCOM.2009.5061994"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Jahanbakhsh, K., Shoja, G., and King, V. (2010, January 22\u201323). Social-Greedy: A Socially-Based Greedy Routing Algorithm for Delay Tolerant Networks. Pisa, Italy.","DOI":"10.1145\/1755743.1755773"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Hossmann, T., Spyropoulos, T., and Legendre, F. (2010, January 14\u201319). Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN routing. San Diego, CA, USA.","DOI":"10.1109\/INFCOM.2010.5462135"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Wang, K., Guo, H., Wu, M., Yang, Z., and Liu, Y. (2013, January 2\u20135). An Efficient Routing Algorithm Based on Social Awareness in DTNs. Dresden, Germany.","DOI":"10.1109\/VTCSpring.2013.6691872"},{"key":"ref_21","first-page":"533","article-title":"An Efficient Routing Scheme Based on Social Relations in Delay-Tolerant Networks","volume":"280","author":"Kim","year":"2014","journal-title":"Ubiquitous Inf. Technol. Appl."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1007\/s11390-013-1357-x","article-title":"Impact of strangers on opportunistic routing performance","volume":"28","author":"Yuan","year":"2013","journal-title":"J. Comput. Sci. Technol."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/j.adhoc.2008.04.001","article-title":"Using Group Structures for Efficient Routing in Delay Tolerant Networks","volume":"7","author":"Thomas","year":"2009","journal-title":"Ad Hoc Netw."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/15\/1\/285\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T21:11:43Z","timestamp":1760217103000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/15\/1\/285"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,25]]},"references-count":23,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2015,1]]}},"alternative-id":["s150100285"],"URL":"https:\/\/doi.org\/10.3390\/s150100285","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2014,12,25]]}}}