A Routing Query Algorithm Based on Time-Varying Relationship Group in Opportunistic Social Networks
With the fast development of IoT and 5G technologies, opportunity social networks composed of portable mobile devices have become a hot research topic in recent years. However, arbitrary node movement in opportunity networks and the absence of end-to-end pathways make node communication unstable. At...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-07-01
|
| Series: | Electronics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2079-9292/10/13/1595 |
| _version_ | 1797528062330404864 |
|---|---|
| author | Yihan Dong Liu Chang Jingwen Luo Jia Wu |
| author_facet | Yihan Dong Liu Chang Jingwen Luo Jia Wu |
| author_sort | Yihan Dong |
| collection | DOAJ |
| description | With the fast development of IoT and 5G technologies, opportunity social networks composed of portable mobile devices have become a hot research topic in recent years. However, arbitrary node movement in opportunity networks and the absence of end-to-end pathways make node communication unstable. At the same time, the problem of ignoring human social preferences and relying on wrong message relay nodes lead to a low data transmission rate and high network overhead. Based on the above issues, we propose a time-varying relationship groups-based routing query algorithm for mobile opportunity networks (Time-varying Relationship Groups, TVRGs). Firstly, we construct the relationship groups based on the time-varying characteristics according to the intimacy between users. Secondly, we calculate the importance of nodes by their connectivity time and communication frequency. Finally, we find the suitable message relay nodes according to the similarity of node weights and their action trajectories and design the routing query algorithm accordingly. The simulation results show that the algorithm can vastly improve the message query success rate, effectively improve the data transmission efficiency, and reduce the average delay and system overhead compared with the existing routing algorithms. |
| first_indexed | 2024-03-10T09:52:48Z |
| format | Article |
| id | doaj.art-6032cce5dc414bb19006b2622f34c87f |
| institution | Directory Open Access Journal |
| issn | 2079-9292 |
| language | English |
| last_indexed | 2024-03-10T09:52:48Z |
| publishDate | 2021-07-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Electronics |
| spelling | doaj.art-6032cce5dc414bb19006b2622f34c87f2023-11-22T02:37:17ZengMDPI AGElectronics2079-92922021-07-011013159510.3390/electronics10131595A Routing Query Algorithm Based on Time-Varying Relationship Group in Opportunistic Social NetworksYihan Dong0Liu Chang1Jingwen Luo2Jia Wu3School of Computer Science and Engineering, Central South University, Changsha 410075, ChinaSchool of Computer Science and Engineering, Central South University, Changsha 410075, ChinaSchool of Computer Science and Engineering, Central South University, Changsha 410075, ChinaSchool of Computer Science and Engineering, Central South University, Changsha 410075, ChinaWith the fast development of IoT and 5G technologies, opportunity social networks composed of portable mobile devices have become a hot research topic in recent years. However, arbitrary node movement in opportunity networks and the absence of end-to-end pathways make node communication unstable. At the same time, the problem of ignoring human social preferences and relying on wrong message relay nodes lead to a low data transmission rate and high network overhead. Based on the above issues, we propose a time-varying relationship groups-based routing query algorithm for mobile opportunity networks (Time-varying Relationship Groups, TVRGs). Firstly, we construct the relationship groups based on the time-varying characteristics according to the intimacy between users. Secondly, we calculate the importance of nodes by their connectivity time and communication frequency. Finally, we find the suitable message relay nodes according to the similarity of node weights and their action trajectories and design the routing query algorithm accordingly. The simulation results show that the algorithm can vastly improve the message query success rate, effectively improve the data transmission efficiency, and reduce the average delay and system overhead compared with the existing routing algorithms.https://www.mdpi.com/2079-9292/10/13/1595mobile group constructionopportunity social networkquery routingtime-varying group information forwarding |
| spellingShingle | Yihan Dong Liu Chang Jingwen Luo Jia Wu A Routing Query Algorithm Based on Time-Varying Relationship Group in Opportunistic Social Networks Electronics mobile group construction opportunity social network query routing time-varying group information forwarding |
| title | A Routing Query Algorithm Based on Time-Varying Relationship Group in Opportunistic Social Networks |
| title_full | A Routing Query Algorithm Based on Time-Varying Relationship Group in Opportunistic Social Networks |
| title_fullStr | A Routing Query Algorithm Based on Time-Varying Relationship Group in Opportunistic Social Networks |
| title_full_unstemmed | A Routing Query Algorithm Based on Time-Varying Relationship Group in Opportunistic Social Networks |
| title_short | A Routing Query Algorithm Based on Time-Varying Relationship Group in Opportunistic Social Networks |
| title_sort | routing query algorithm based on time varying relationship group in opportunistic social networks |
| topic | mobile group construction opportunity social network query routing time-varying group information forwarding |
| url | https://www.mdpi.com/2079-9292/10/13/1595 |
| work_keys_str_mv | AT yihandong aroutingqueryalgorithmbasedontimevaryingrelationshipgroupinopportunisticsocialnetworks AT liuchang aroutingqueryalgorithmbasedontimevaryingrelationshipgroupinopportunisticsocialnetworks AT jingwenluo aroutingqueryalgorithmbasedontimevaryingrelationshipgroupinopportunisticsocialnetworks AT jiawu aroutingqueryalgorithmbasedontimevaryingrelationshipgroupinopportunisticsocialnetworks AT yihandong routingqueryalgorithmbasedontimevaryingrelationshipgroupinopportunisticsocialnetworks AT liuchang routingqueryalgorithmbasedontimevaryingrelationshipgroupinopportunisticsocialnetworks AT jingwenluo routingqueryalgorithmbasedontimevaryingrelationshipgroupinopportunisticsocialnetworks AT jiawu routingqueryalgorithmbasedontimevaryingrelationshipgroupinopportunisticsocialnetworks |