Next Article in Journal
A Formal Approach to the Selection by Minimum Error and Pattern Method for Sensor Data Loss Reduction in Unstable Wireless Sensor Network Communications
Next Article in Special Issue
Wireless Sensor Network-Based Service Provisioning by a Brokering Platform
Previous Article in Journal
Metal–Organic Frameworks as Active Materials in Electronic Sensor Devices
Previous Article in Special Issue
Social Welfare Control in Mobile Crowdsensing Using Zero-Determinant Strategy
Article Menu
Issue 5 (May) cover image

Export Article

Open AccessArticle
Sensors 2017, 17(5), 1109;

Effective Social Relationship Measurement and Cluster Based Routing in Mobile Opportunistic Networks

1,* , 1
School of Software, Central South University, Changsha 410083, China
Department of Computer Science, New York Institute of Technology, New York, NY 10023, USA
This paper is an extended version of our paper published in A Novel Social-based Clustering and Routing Scheme in Mobile Opportunistic Networks. In Proceedings of the International Conference on Identification, Information and Knowledge in the Internet of Things, Beijing, China, 20–21 October 2016.
Authors to whom correspondence should be addressed.
Academic Editors: Leonhard M. Reindl, Yunchuan Sun, Zhipeng Cai and Antonio Jara
Received: 27 February 2017 / Revised: 12 April 2017 / Accepted: 8 May 2017 / Published: 12 May 2017
Full-Text   |   PDF [1200 KB, uploaded 12 May 2017]   |  


In mobile opportunistic networks, the social relationship among nodes has an important impact on data transmission efficiency. Motivated by the strong share ability of “circles of friends” 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 “circles of friends”. 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 “circles of friends” 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. View Full-Text
Keywords: mobile opportunistic network; routing; clustering; social relationship; circles of friends mobile opportunistic network; routing; clustering; social relationship; circles of friends

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Zeng, F.; Zhao, N.; Li, W. Effective Social Relationship Measurement and Cluster Based Routing in Mobile Opportunistic Networks. Sensors 2017, 17, 1109.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top