This article is devoted to the optimal protocol for the leader-following consensus of second-order multiagent systems. Remarkably, the global consensus cost functional and the directed topology are pregiven, and the o...
详细信息
This article is devoted to the optimal protocol for the leader-following consensus of second-order multiagent systems. Remarkably, the global consensus cost functional and the directed topology are pregiven, and the optimal protocol to be sought is distributed. This makes the Riccati-based strategies inapplicable, by which merely centralized protocol can be derived. As the main contribution of this article, an effective strategy of seeking a distributed optimal protocol is proposed for second-order agents over the digraph of the directed tree. Detailedly, the feasibility of distributed optimal protocol is first affirmed, that is, the existence of optimal gain parameters can be guaranteed. Then, by recursively deriving the completely explicit formulas of the consensus errors of relative position and velocity, an online implementable algorithm is developed to achieve the parameterization of the cost functional, that is, to obtain the explicit formula of the cost functional with respect to gain parameters of all agents. Lastly, the desired optimal gain parameters are obtained by minimizing the explicit formula.
The design is discussed of distributed algorithms for the single-source shortest-path problem to run on an asynchronous directed network in which some of the edges may be associated with negative weights, and thus in ...
详细信息
The design is discussed of distributed algorithms for the single-source shortest-path problem to run on an asynchronous directed network in which some of the edges may be associated with negative weights, and thus in which a cycle of negative total weight may also exist. The only existing solution in the literature for this problem is due to K.M. Chandy and J. Misra (1982), and it has, in the worst case, an unbounded message complexity. A synchronous version of the Chandy-Misra algorithm is described and studied, and it is proved that for a network with m edges and n nodes, the worst case message and time complexities of this algorithm are O(mn) and O(n), respectively. This algorithm is then combined with an efficient synchronizer to yield an asynchronous protocol that retains the same message and time complexities.
Video surveillance systems have become an indispensable tool for the security and organization of public and private areas. Most of the current commercial video surveillance systems rely on a classical client/server a...
详细信息
ISBN:
(纸本)9781509001545
Video surveillance systems have become an indispensable tool for the security and organization of public and private areas. Most of the current commercial video surveillance systems rely on a classical client/server architecture to perform person and object recognition. In order to support the more complex and advanced video surveillance systems proposed in the last years, companies are required to invest resources in order to maintain the servers dedicated to the recognition tasks. In this work we propose a novel distributed protocol that exploits the computational capabilities of the surveillance devices (i.e. cameras) to perform the recognition of the person. The cameras fall back to a centralized server if their hardware capabilities are not enough to perform the recognition. By means of simulations, we show that our algorithm is able to reduce up to 5 0 % the load of the server with no negative impact on the quality of the surveillance service.
Storage management in Wireless Sensor Networks (WSN) is a critical issue. While WSN have a vast storage capacity on the aggregate, that capacity cannot be used entirely. Eventually, the entire WSN fails when the first...
详细信息
ISBN:
(纸本)9781467355018;9781467354998
Storage management in Wireless Sensor Networks (WSN) is a critical issue. While WSN have a vast storage capacity on the aggregate, that capacity cannot be used entirely. Eventually, the entire WSN fails when the first sensor has its own storage capacity depleted, leaving a large amount of unutilized storage capacity. This paper has two main contributions: enhancement of the overall storage capacity in WSNs and a novel routing approach, which we call a deterministic "random" walk. We suggest a distributed protocol for storage aggregation that allows individual sensors to build "on-demand" and deterministic distributed Storage Chains (DSC). These chains represent adjacencies between sensors who share their storage capacity. Consequently, sensors are no longer subjected to their local storage constrains, but to the global storage capacity of the WSN. Our simulation results show that the performances of our deterministic protocol are similar to those of a random walk [1]. Moreover, the great advantage of our deterministic protocol is that no information has to be maintained about the structure of its links. Finally, although our protocol is responsible for global storage enhancement it is implemented distributedly, which is an important scalability property [2] in WSN.
Wireless sensor networks are often deployed in hostile environments, where an adversary can physically capture some of the nodes. Once a node is captured, the attacker can re-program it and replicate the node in a lar...
详细信息
ISBN:
(纸本)9781595936844
Wireless sensor networks are often deployed in hostile environments, where an adversary can physically capture some of the nodes. Once a node is captured, the attacker can re-program it and replicate the node in a large number of clones, thus easily taking over the network. The detection of node replication attacks in a wireless sensor network is therefore a fundamental problem. A few distributed solutions have recently been proposed. However, these solutions are not satisfactory. First, they are energy and memory demanding: A serious drawback for any protocol that is to be used in resource constrained environment such as a sensor network. Further, they are vulnerable to specific adversary models introduced in this paper. The contributions of this work are threefold. First, we analyze the desirable properties of a distributed mechanism for the detection of node replication attacks. Second, we show that the known solutions for this problem do not completely meet our requirements. Third, we propose a new Randomized, Efficient, and distributed (RED) protocol for the detection of node replication attacks and we show that it is completely satisfactory with respect to the requirements. Extensive simulations also show that our protocol is highly efficient in communication, memory, and computation, that it sets out an improved attack detection probability compared to the best solutions in the literature, and that it is resistant to the new kind of attacks we introduce in this paper, while other solutions are not.
We study a distributed protocol for time-division multiple access (TDMA) with applications in wireless body area networks. Our scheme is derived from a bio-inspired algorithm known as Pulse-Coupled Oscillator, in whic...
详细信息
ISBN:
(纸本)9781424456383
We study a distributed protocol for time-division multiple access (TDMA) with applications in wireless body area networks. Our scheme is derived from a bio-inspired algorithm known as Pulse-Coupled Oscillator, in which each node in the network update its state based on its knowledge of the neighborhood. The protocol we propose is suitable for negotiation of a shared resource in a distributed manner, and is adaptive to changes in the network size or in the nodes' demands. We discuss the implementation of such scheme from an application perspective, and discuss the impact of the physical layer on its performance.
This paper studies the coordinated aggregation problem of a multi-agent system. Particularly, all the agents reach a consensus within a pre-specified target region. However, only a subset of agents have access to this...
详细信息
This paper studies the coordinated aggregation problem of a multi-agent system. Particularly, all the agents reach a consensus within a pre-specified target region. However, only a subset of agents have access to this target region, and each agent merely interacts with its neighbors by communication. Moreover, there exist unknown heterogeneous delays in communication channels. The underlying communication topology is characterized by a digraph. To accommodate the practical digital disposal, a sampled-data distributed protocol is proposed, where the sampling is asynchronous in the sense that the sampling periods of distinct agents are heterogeneous. The resulting closed-loop system from the proposed sampled-data distributed protocol is in a hybrid fashion that the continuous system is fed-back by using discrete states at sampling instants. The convergence performance of this hybrid closed-loop system is analyzed based on the contraction theory. More specifically, it is first shown that all the states are coordinated to aggregate within the target region, i.e., coordinated aggregation. With this result, it is next shown that all the states are coordinated towards a consensus, i.e., state agreement. These together guarantee the fulfillment of the concerned coordinated aggregation objective. Finally, a simulation example is given to validate the theoretical results. (C) 2021 Elsevier Ltd. All rights reserved.
Vehicular Ad Hoc Networks (VANETs) have received considerable attention in recent years. VANETs provide many services and applications such as Internet access Voice over Internet protocol (VoIP) and information dissem...
详细信息
ISBN:
(纸本)9780769545769
Vehicular Ad Hoc Networks (VANETs) have received considerable attention in recent years. VANETs provide many services and applications such as Internet access Voice over Internet protocol (VoIP) and information dissemination. Due to dynamic changes in the network topologies, various routing protocols have been studied in the vehicular environments. However, the communications between source and destination vehicles involve many intermediate vehicles, and due to the high mobility of vehicles, these communication links become disconnected. In this paper, we propose a distributed routing protocol in VANETs with the help of roadside units (RSUs). The proposed scheme includes vehicle registration, finding the location of destination vehicle and the handover maintenance. The simulation results show that our proposed protocol is suitable for vehicles communications in VANETs.
Rather than the conventional pure consensus, this article proposes a pulsewidth modulation (PWM) protocol for an improved interval consensus of multiagent systems from the distributed perspective. In particular, the c...
详细信息
Rather than the conventional pure consensus, this article proposes a pulsewidth modulation (PWM) protocol for an improved interval consensus of multiagent systems from the distributed perspective. In particular, the consensus of all the agents is achieved within a prescribed interval, which is merely available to partial agents, though. The PWM protocol effectively relieves the running burden of the agents without the additional analogue-to-digital conversion. The modulation periods of different agents are allowed to be heterogeneous. By nominating the agents that have access to the given interval as leaders and others as followers, the proposed distributed PWM protocol introduces a projection operator for the leaders in order for the collective aggregation. In terms of the graph connectivity condition of containing a spanning tree, it is shown that the concerned interval consensus objective is realized by the proposed distributed PWM protocol. Simulations are eventually performed to validate the established theoretical results.
Wireless underground sensor networks (WUSNs) enable many applications such as underground pipeline monitoring, power grid maintenance, mine disaster prevention, and oil upstream monitoring among many others. While the...
详细信息
Wireless underground sensor networks (WUSNs) enable many applications such as underground pipeline monitoring, power grid maintenance, mine disaster prevention, and oil upstream monitoring among many others. While the classical electromagnetic waves do not work well in WUSNs, the magnetic induction (MI) propagation technique provides constant channel conditions via small size of antenna coils in the underground environments. In this paper, instead of adopting currently layered protocols approach, a distributed cross-layer protocol design is proposed for MI-based WUSNs. First, a detailed overview is given for different communication functionalities from physical to network layers as well as the QoS requirements of applications. Utilizing the interactions of different layer functionalities, a distributed environment-aware protocol, called DEAP, is then developed to satisfy statistical QoS guarantees and achieve both optimal energy savings and throughput gain concurrently. Simulations confirm that the proposed cross-layer protocol achieves significant energy savings, high throughput efficiency and dependable MI communication for WUSNs.
暂无评论