{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T19:10:49Z","timestamp":1760209849556,"version":"build-2065373602"},"reference-count":28,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2017,5,12]],"date-time":"2017-05-12T00:00:00Z","timestamp":1494547200000},"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>In mobile opportunistic networks, the social relationship among nodes has an important impact on data transmission efficiency. Motivated by the strong share ability of \u201ccircles of friends\u201d in communication networks such as Facebook, Twitter, Wechat and so on, we take a real-life example to show that social relationships among nodes consist of explicit and implicit parts. The explicit part comes from direct contact among nodes, and the implicit part can be measured through the \u201ccircles of friends\u201d. We present the definitions of explicit and implicit social relationships between two nodes, adaptive weights of explicit and implicit parts are given according to the contact feature of nodes, and the distributed mechanism is designed to construct the \u201ccircles of friends\u201d of nodes, which is used for the calculation of the implicit part of social relationship between nodes. Based on effective measurement of social relationships, we propose a social-based clustering and routing scheme, in which each node selects the nodes with close social relationships to form a local cluster, and the self-control method is used to keep all cluster members always having close relationships with each other. A cluster-based message forwarding mechanism is designed for opportunistic routing, in which each node only forwards the copy of the message to nodes with the destination node as a member of the local cluster. Simulation results show that the proposed social-based clustering and routing outperforms the other classic routing algorithms.<\/jats:p>","DOI":"10.3390\/s17051109","type":"journal-article","created":{"date-parts":[[2017,5,12]],"date-time":"2017-05-12T11:03:53Z","timestamp":1494587033000},"page":"1109","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Effective Social Relationship Measurement and Cluster Based Routing in Mobile Opportunistic Networks"],"prefix":"10.3390","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1541-1326","authenticated-orcid":false,"given":"Feng","family":"Zeng","sequence":"first","affiliation":[{"name":"School of Software, Central South University, Changsha 410083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nan","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Software, Central South University, Changsha 410083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjia","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Computer Science, New York Institute of Technology, New York, NY 10023, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2017,5,12]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Fall, K. (2003, January 25\u201329). A Delay-Tolerant Network Architecture for Challenged Internets. Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Karlsruhe, Germany.","DOI":"10.1145\/863955.863960"},{"key":"ref_2","unstructured":"Vahdat, A., and Becker, D. (2000). Epidemic Routing for Partially Connected Ad Hoc Networks, Duke University."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1109\/TNET.2002.801403","article-title":"Mobility Increases the Capacity of Ad Hoc Wireless Networks","volume":"10","author":"Grossglauser","year":"2002","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Boldrini, C., Conti, M., and Passarella, A. (2007, January 18\u201321). Impact of Social Mobility on Routing Protocols for Opportunistic Networks. Proceedings of the IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, Espoo, Finland.","DOI":"10.1109\/WOWMOM.2007.4351687"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Kadadha, M., Al-Ali, H., Al Mufti, M., Al-Aamri, A., and Mizouni, R. (2016, January 17\u201319). Opportunistic Mobile Social Networks: Challenges Survey and Application in Smart Campus. Proceedings of the IEEE 12th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), New York, NY, USA.","DOI":"10.1109\/WiMOB.2016.7763216"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.comnet.2015.10.018","article-title":"Data Routing Strategies in Opportunistic Mobile Social Networks","volume":"93","author":"Zhu","year":"2015","journal-title":"Comput. Netw."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/961268.961272","article-title":"Probabilistic Routing in Intermittently Connected Networks","volume":"7","author":"Lindgren","year":"2003","journal-title":"ACM SIGMOBILE Mob. Comput. Commun. Rev."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Spyropoulos, T., Psounis, K., and Raghavendra, C.S. (2005, January 26). Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks. Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking, Philadelphia, PA, USA.","DOI":"10.1145\/1080139.1080143"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Erramilli, V., Crovella, M., Chaintreau, A., and Diot, C. (2008, January 26\u201330). Delegation Forwarding. Proceedings of the ACM MobiHoc, Hong Kong, China.","DOI":"10.1145\/1374618.1374653"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Balasubramanian, A., Levine, B., and Balasubramanian, A. (2007, January 27\u201331). DTN Routing as a Resource Allocation Problem. Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM \u201907), Kyoto, Japan.","DOI":"10.1145\/1282380.1282422"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1111","DOI":"10.1007\/s00779-015-0880-x","article-title":"Mobility-Aware Routing in Delay Tolerant Networks","volume":"7","author":"Zhang","year":"2015","journal-title":"Pers. Ubiquitous Comput."},{"key":"ref_12","unstructured":"Lin, Y., Li, B., and Liang, B. (2008, January 19\u201322). CodeOR: Opportunistic Routing in Wireless Mesh Networks with Segmented Network Coding. Proceedings of the IEEE International Conference on Network Protocols, Orlando, FL, USA."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1368","DOI":"10.1109\/TNET.2011.2111382","article-title":"Efficient Network-Coding-Based Opportunistic Routing through Cumulative Coded Acknowledgments","volume":"19","author":"Koutsonikolas","year":"2011","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Khreishah, A., Khalil, I.M., and Wu, J. (2012, January 18\u201321). Universal Opportunistic Routing Scheme Using Network Coding. Proceedings of the 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, Seoul, Korea.","DOI":"10.1109\/SECON.2012.6275797"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1576","DOI":"10.1109\/TMC.2010.246","article-title":"BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks","volume":"10","author":"Hui","year":"2010","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Gao, W., Li, Q., Zhao, B., and Cao, G. (2009, January 18\u201321). Multicasting in Delay Tolerant Networks: A Social Network Perspective. Proceedings of the 10th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc\u201909), New Orleans, LA, USA.","DOI":"10.1145\/1530748.1530790"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1109\/TPDS.2012.171","article-title":"Geocommunity-Based Broadcasting for Data Dissemination in Mobile Social Network","volume":"24","author":"Fan","year":"2013","journal-title":"IEEE Trans. Parol. Distrib. Syst."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1109\/TPDS.2013.264","article-title":"On Social Delay-Tolerant Networking: Aggregation, Tie Detection, and Routing","volume":"25","author":"Wei","year":"2014","journal-title":"IEEE Trans. Parol. Distrib. Syst."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1641","DOI":"10.1016\/j.adhoc.2013.03.003","article-title":"The Rise and Fall of Spatio-Temporal Clusters in Mobile Ad Hoc Networks","volume":"11","author":"Orlinski","year":"2013","journal-title":"Ad Hoc Netw."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Mtibaa, A., May, M., Diot, C., and Ammar, M. (2010, January 14\u201319). PeopleRank: Social Opportunistic Forwarding. Proceedings of the IEEE INFOCOM, San Diego, CA, USA.","DOI":"10.1109\/INFCOM.2010.5462261"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Mei, A., Morabito, G., Santi, P., and Stefa, J. (2011, January 10\u201315). Social-Aware Stateless Forwarding in Pocket Switched Networks. Proceedings of the IEEE INFOCOM, Shanghai, China.","DOI":"10.1109\/INFCOM.2011.5935076"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1109\/TMC.2013.20","article-title":"Investigating the Privacy versus Forwarding Accuracy Tradeoff in Opportunistic Interest-Casting","volume":"13","author":"Costantino","year":"2014","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Distl, B., and Neuhaus, S. (2015, January 6\u201310). Social Power for Privacy Protected Opportunistic Networks. Proceedings of the 7th International Conference on Communication Systems and Networks (COMSNETS), Bangalore, India.","DOI":"10.1109\/COMSNETS.2015.7098697"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.adhoc.2016.07.004","article-title":"Modeling and Performance Evaluation of Security Attacks on Opportunistic Routing Protocols for Multihop Wireless Networks","volume":"50","author":"Salehi","year":"2016","journal-title":"Ad Hoc Netw."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"7684","DOI":"10.1109\/TVT.2015.2480761","article-title":"A Privacy-Preserving and Secure Framework for Opportunistic Routing in DTNs","volume":"65","author":"Zhang","year":"2016","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s10619-012-7113-3","article-title":"CAST: Context-Aware Security and Trust framework for Mobile Ad-hoc Networks using policies","volume":"2","author":"Li","year":"2013","journal-title":"Distrib. Parallel Databases"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Ker\u00e4nen, A., Ott, J., and K\u00e4rkk\u00e4inen, T. (2009, January 2\u20136). The ONE Simulator for DTN Protocol Evaluation. Proceedings of the 2nd International Conference on Simulation Tools and Techniques, Rome, Italy.","DOI":"10.4108\/ICST.SIMUTOOLS2009.5674"},{"key":"ref_28","unstructured":"(2017, May 11). CRAWDAD. Available online: http:\/\/www.crawdad.org\/uoi\/haggle\/20160828\/."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/17\/5\/1109\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T18:35:34Z","timestamp":1760207734000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/17\/5\/1109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,12]]},"references-count":28,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2017,5]]}},"alternative-id":["s17051109"],"URL":"https:\/\/doi.org\/10.3390\/s17051109","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2017,5,12]]}}}