Key node selection based on a genetic algorithm for fast patching in social networks. (19th February 2019)

• Record Type: Journal Article
• Authors: Kim, Bongjae; Jung, Jinman; Heo, Junyoung; Min, Hong
• Other Names: Ko Hoon guestEditor.; Marreiros Goreti guestEditor.; Cong Vinh Phan guestEditor.
• Is Part Of: Concurrency and computation. Volume 33:Number 2(2021)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2019-02-19
• Subjects: genetic algorithm -- key node selection -- patching -- social networks; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.5194
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: Online social network users provide considerable amounts of personal information and share this information with friends without space‐time limitations. The tight connectivity among users of social networks causes the rapid spreading of information. Given the popularity of social networking sites, there is a high probability of attacks. Worms target popular users with interesting information to infect them, as their higher reputations have more power in social networks. Therefore, timely patch propagation schemes must be able to inhibit the activity of worms. To improve the patch propagation speed, it is important to select key nodes that are the starting points of the patch process. In this paper, we proposed a key node selection scheme based on a genetic algorithm to find the most significant contribution nodes of patch propagation. We modeled the usage patterns of an online social network user and simulated the proposed scheme with data from this user. Simulation results show that the proposed scheme propagates patches more rapidly than existing schemes.