Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Computer Engineering
Influence Spread In Two-Layer Interdependent Networks: Designed Single-Layer Or Random Two-Layer Initial Spreaders?, Hana Khamfroush, Nathaniel Hudson, Samuel Iloo, Mahshid R. Naeini
Influence Spread In Two-Layer Interdependent Networks: Designed Single-Layer Or Random Two-Layer Initial Spreaders?, Hana Khamfroush, Nathaniel Hudson, Samuel Iloo, Mahshid R. Naeini
Computer Science Faculty Publications
Influence spread in multi-layer interdependent networks (M-IDN) has been studied in the last few years; however, prior works mostly focused on the spread that is initiated in a single layer of an M-IDN. In real world scenarios, influence spread can happen concurrently among many or all components making up the topology of an M-IDN. This paper investigates the effectiveness of different influence spread strategies in M-IDNs by providing a comprehensive analysis of the time evolution of influence propagation given different initial spreader strategies. For this study we consider a two-layer interdependent network and a general probabilistic threshold influence spread model …
Broadcasting With Prediction And Selective Forwarding In Vehicular Networks, Jainjun Yang, Zongming Fei
Broadcasting With Prediction And Selective Forwarding In Vehicular Networks, Jainjun Yang, Zongming Fei
Computer Science Faculty Publications
Broadcasting in vehicular networks has attracted great interest in research community and industry. Broadcasting on disseminating information to individual vehicle beyond the transmission range is based on inter-vehicle communication systems. It is crucial to broadcast messages to other vehicles as fast as possible because the messages in vehicle communication systems are often emergency messages such as accident warning or alarm. In many current approaches, the message initiator or sender selects the node among its neighbors that is farthest away from it in the broadcasting direction and then assigns the node to rebroadcast the message once the node gets out of …