Hybrid searching scheme supported by dynamic weighted distributed label clustering in social networks
Jheng-Huei Chen, Jenq‐Shiou Leu, Kuen-Han Li · 2013
Information searching is the most common application in the social network. Choosing appropriate users as the clusterheads in a clustering based social network can facilitate to effectively spread query messages, resulting in efficient searching performance. To do so, we propose a hybrid searching (HS) scheme and use the dynamic weighted distributed label clustering (DW-DLC) structure to assist the searching process. The DW-DLC structure can accelerate the process of finding target information in the social network. The simulation results depict that the HS+DW-DLC scheme can reduce the average searching delay time by more than 90% even in a information-scarce social network which only 8% of total nodes can provide the target information. Meanwhile, HS+DW-DLC can generate a lowest average message overhead, which may burden the network, compared to other schemes.