Abstract
In this paper, a new pinning control scheme called DF (data flow)-based pinning scheme is proposed. The new scheme can obtain the similar pinning efficiency with BC-based pinning scheme in real-world networks. Comparing with BC-based pinning scheme, DF-based pinning scheme has two main advantages. First, it just needs local information of network. Second, the new pinning scheme has a much lower time complexity than BC-based pinning scheme. In this paper, we have pinned two real-world networks (the US airline routing map network and the protein–protein network in yeast) to compare the new pinning scheme with degree-based, BC-based, LBC-based pinning schemes and we also pin a small-world network, a scale-free network to analyze DF-based pinning scheme in detail. Based on the Lyapunov stability theory, the validity of the scheme is proved. Finally, the numerical simulations are verified the effectiveness of the proposed method.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
