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: | Yihan Dong, Liu Chang, Jingwen Luo, Jia Wu |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-07-01
|
Series: | Electronics |
Subjects: | |
Online Access: | https://www.mdpi.com/2079-9292/10/13/1595 |
Similar Items
-
Research on Time-Aware Group Query Method with Exclusion Keywords
by: Liping Zhang, et al.
Published: (2023-10-01) -
Virtual Grid-Based Routing for Query-Driven Wireless Sensor Networks
by: Shushant Kumar Jain, et al.
Published: (2023-07-01) -
An Efficient Top-k Query Scheme Based on Multilayer Grouping
by: Zongmin Cui, et al.
Published: (2019-01-01) -
Efficient Group <i>K</i> Nearest-Neighbor Spatial Query Processing in Apache Spark
by: Panagiotis Moutafis, et al.
Published: (2021-11-01) -
A Swell Neural Network Algorithm for Solving Time-Varying Path Query Problems with Privacy Protection
by: Man Zhao
Published: (2024-03-01)