The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we consider the privacy preserving problem in an agreement network under interception attacks. First, we introduce a consensus protocol with privacy preserving, where each node hides their initial states into a set of random sequences, and then injects the sequences into the process of consensus. Second, we assume that an attacker with limited power can intercept the data transmitted...
In this paper, we consider the privacy preserving problem of consensus protocol. First, we introduce a privacy preserving scheme, where each node produces and transmits a sequence of random values with their mean equaling to the node's initial state. We show that the network can reach average consensus with privacy preserving scheme, and provide a sufficient condition under which the initial state...
In real applications, network resources are generally limited. Motivated by the significance of optimizing network, the consensus centrality index is proposed to quantify how fast a leader could guide all the nodes in a network to reach the desired consensus. On the basis of complex networks, the relation of the consensus centrality distribution and the degree distribution in several model and real...
In this paper, we address the fixed-time consensus problem for multi-agent systems in networks with directed and switching interaction topology. With the introduction of mirror operation, two global distributed nonlinear consensus protocols are constructed for each first-order agent under strongly connected information flow. The distinctive feature of this paper is to address the explicit bounds of...
In this paper, we consider a class of controlled consensus problem, where a subset of agents called informed agents can receive the information from a leader with constant state. First, we derive sufficient conditions for guaranteeing all the agents reach consensus on the leader state under fixed and switched topology, respectively. Second, we investigate the problem of selecting informed agents for...
Multipopulation Genetic Algorithms (MGAs) are island model genetic algorithms composed of spatially semi-isolated sub-populations, each evolving in parallel by its own pace and occasionally interacting with its neighborhoods by interchanging (usually good) individuals, called migration. Since the migration process is the kernel mechanism of MGAs for preventing premature convergence, many previous...
In recent years, stability of consensus protocol with time delay has attracted a lot of interests. On the basis of local information exchange with limited time delay, the states of all the agents reach consensus with a second order consensus protocol under certain conditions, where the convergence speed is determined by eigenvalue spectrum of network Laplacian and system parameters. In this paper,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.