In this paper, we propose a secondary consensus-based control layer for current sharing and voltage balancing in DC microGrids (mGs). Differently from existing approaches based on droop control, we assume decentralize...
详细信息
This paper aims to address a new class of multiscale coordination control problems for multivehicle systems that are subject to external disturbances. Each vehicle is measured by an independent scale due to the constr...
详细信息
This paper aims to address a new class of multiscale coordination control problems for multivehicle systems that are subject to external disturbances. Each vehicle is measured by an independent scale due to the constraints of physical environments. Based on the nearest neighbor-interaction rules, three algorithms of different convergence rates are presented such that the vehicles are guaranteed to achieve consensuson a common quantity for all but of their own scales. Simulation tests are performed to validate the effectiveness and robustness of these consensus algorithms. By introducing a Lyapunov potential function, the consensus analysis is further achieved for the three multiscale algorithms, regardless of them with an exponential, finite-time, or fixed-time convergence rate and in the presence of bounded disturbances.
Recent advances of hardware design and radio technologies have opened the way for an emerging category of networkenabled smart physical devices as a result of convergence in computing and wireless communication capabi...
详细信息
Recent advances of hardware design and radio technologies have opened the way for an emerging category of networkenabled smart physical devices as a result of convergence in computing and wireless communication capabilities. Inspired by biological interactions, distributed processing of data collected by individual devices is now becoming crucial to let the nodes self-learn relevant network-state information and self-organize without the support of a central unit. Focus of this paper is twofold. First, a novel network channel model tailored for dense deployments is developed and validated on real data. The model describes relevant channel features that are representative of site-specific static/dynamic multipath fading and are shared by all links of a network. Second, a new class of distributed weighted-consensus strategies is introduced to support distributed network calibration and localization in device-to-device networks. Network calibration allows the devices to self-learn the common channel parameters by successive refinements of local estimates and peer-to-peer information exchange. Network-localization enables each node to acquire augmented information about the whole network topology by distributed learning from local channel observations. The proposed distributed algorithms guarantee a fast convergence and can replace conventional centralized schemes. An experimental case study is discussed in a representative indoor environment for the purpose of system validation. Experimental results show that the proposed method can significantly improve the performance of conventional solutions.
Compressive Sensing has been utilized in Cognitive Radio Networks (CRNs) to exploit the sparse nature of the occupation of the primary users. Also, distributed spectrum sensing has been proposed to tackle the wireless...
详细信息
ISBN:
(纸本)9781509032549
Compressive Sensing has been utilized in Cognitive Radio Networks (CRNs) to exploit the sparse nature of the occupation of the primary users. Also, distributed spectrum sensing has been proposed to tackle the wireless channel problems, like node or link failures, rather than the common "centralized approach" for spectrum sensing. In this paper, we propose a distributed spectrum sensing framework based on consensus algorithms where SU nodes exchange their binary decisions to take global decisions without a fusion center to coordinate the sensing process. Each SU will share its decision with its neighbors, and at every new iteration each SU will take a new decision based on its current decision and the decisions it receives from its neighbors;in the next iteration, each SU will share its new decision with its neighbors. We show via simulations that the detection performance can tend to the performance of majority-rule Fusion Center based CRNs.
In this paper, we study a consensus algorithm for distributed spectrum sensing (DSS) in cognitive radio networks (CRN) integrating a Goodness of Fit based spectrum sensing scheme. Existing work in this area often appl...
详细信息
ISBN:
(纸本)9788393484850
In this paper, we study a consensus algorithm for distributed spectrum sensing (DSS) in cognitive radio networks (CRN) integrating a Goodness of Fit based spectrum sensing scheme. Existing work in this area often applies energy detector as a local spectrum sensing method for DSS, however in this case one needs to make the assumption that the noise level is the same at every node in the network, otherwise the threshold can not be set properly. In GoF based spectrum sensing, the threshold for the binary test depends only on the desired false alarm probability and not on the local noise powers. Motivated by this nice feature of GoF based spectrum sensing, we consider the goodness of fit (GoF) test statistic to be exchanged among cognitive radio (CR) users (consensus variable) instead of the energy. Moreover, a weighted consensus based DSS scheme is proposed and compared to the conventional consensus based on DSS. Simulations are conducted to show the effectiveness of the consensus algorithm based on GoF test.
We provide a generalization of Wolfowitz's theorem on the products of stochastic, indecomposable and aperiodic (SIA) matrices to metric spaces with nonpositive curvature. As a result we show convergence for a wide...
详细信息
We provide a generalization of Wolfowitz's theorem on the products of stochastic, indecomposable and aperiodic (SIA) matrices to metric spaces with nonpositive curvature. As a result we show convergence for a wide class of distributed consensus algorithms operating on these spaces.
In this paper, we propose a distributed max-min consensus algorithm for a discrete-time n-node system. Each node iteratively updates its state to a weighted average of its own state together with the minimum and maxim...
详细信息
In this paper, we propose a distributed max-min consensus algorithm for a discrete-time n-node system. Each node iteratively updates its state to a weighted average of its own state together with the minimum and maximum states of its neighbors. In order for carrying out this update, each node needs to know the positive direction of the state axis, as some additional information besides the relative states from the neighbors. Various necessary and/or sufficient conditions are established for the proposed max-min consensus algorithm under time-varying interaction graphs. These convergence conditions do not rely on the assumption on the positive lower bound of the arc weights. (C) 2015 Elsevier Ltd. All rights reserved.
Compressive Sensing has been utilized in Cognitive Radio Networks (CRNs) to exploit the sparse nature of the occupation of the primary users. Also, distributed spectrum sensing has been proposed to tackle the wireless...
详细信息
ISBN:
(纸本)9781509032556
Compressive Sensing has been utilized in Cognitive Radio Networks (CRNs) to exploit the sparse nature of the occupation of the primary users. Also, distributed spectrum sensing has been proposed to tackle the wireless channel problems, like node or link failures, rather than the common "centralized approach" for spectrum sensing. In this paper, we propose a distributed spectrum sensing framework based on consensus algorithms where SU nodes exchange their binary decisions to take global decisions without a fusion center to coordinate the sensing process. Each SU will share its decision with its neighbors, and at every new iteration each SU will take a new decision based on its current decision and the decisions it receives from its neighbors;in the next iteration, each SU will share its new decision with its neighbors. We show via simulations that the detection performance can tend to the performance of majorityrule Fusion Center based CRNs.
In the last decades, the increasing employment of unmanned aerial vehicles (UAVs) in civil applications has highlighted the potential of coordinated multi-aircraft missions. Such an approach offers advantages in terms...
详细信息
In the last decades, the increasing employment of unmanned aerial vehicles (UAVs) in civil applications has highlighted the potential of coordinated multi-aircraft missions. Such an approach offers advantages in terms of cost-effectiveness, operational flexibility, and mission success rates, particularly in complex scenarios such as search and rescue operations, environmental monitoring, and surveillance. However, achieving global situational awareness, although essential, represents a significant challenge, due to computational and communication constraints. This paper proposes a Distributed Moving Horizon Estimation (DMHE) technique that integrates consensus theory and Moving Horizon Estimation to optimize computational efficiency, minimize communication requirements, and enhance system robustness. The proposed DMHE framework is applied to a formation of UAVs performing target detection and tracking in challenging environments. It provides a fully distributed architecture that enables UAVs to estimate the position and velocity of other fleet members while simultaneously detecting static and dynamic targets. The effectiveness of the technique is proved by several numerical simulation, including an in-depth sensitivity analysis of key algorithm parameters, such as fleet network topology and consensus iterations and the evaluation of the robustness against node faults and information losses.
The Raft consensus algorithm is widely used in private networks as an alternative to the energy-intensive PoW consensus algorithm in blockchains. The Raft consensus algorithm's voting mechanism performs well in re...
详细信息
The Raft consensus algorithm is widely used in private networks as an alternative to the energy-intensive PoW consensus algorithm in blockchains. The Raft consensus algorithm's voting mechanism performs well in reliable and well-planned networks with optimized timeouts. However, in unreliable or poorly configured networks, it encounters several challenges. These include multiple candidacies, repeated election cycles, insufficient or failed leader elections during network splits, prolonged leader election times and vulnerability to Sybil attacks. In this study, a novel Hybrid Raft-PoW consensus algorithm is introduced. It integrates the hash puzzle-based competition of the PoW consensus algorithm with the fast leader election mechanism of the Raft consensus algorithm. This combination ensures both speed and certainty in leader election, ensuring that leadership is delegated to the most capable nodes. At the same time, it promotes decentralization by ensuring a fair distribution across nodes, achieving at least 80% leadership distribution. Therefore, the proposed Hybrid Raft-PoW consensus algorithm improves or eliminates problems caused by Raft consensus algorithm's leader election mechanism.
暂无评论