Impossibility Results for Byzantine-Tolerant State Observation, Synchronization, and Graph Computation Problems by Ajay D. Kshemkalyani, Anshuman Misra

“…In a distributed algorithm, each process has access only to its local variables and incident edge parameters. …”
Get full text

Gateway Selection Game in Cyber-Physical Systems by Hao Wang, Jianzhong Li, Hong Gao

“…We first give a bandwidth allocation model of gateways and propose a distributed algorithm for clients of gateway selection in order to increase the total bandwidth of their own kind. …”
Get full text

On Guaranteed Detectability for Surveillance Sensor Networks by Yanmin Zhu

“…In this paper, we propose a fully distributed algorithm GAP for energy-efficient event detection for surveillance applications. …”
Get full text

Workplace energy management with EVs by a novel distributed mixed-integer linear programming algorithm by Yuki Sakamoto, Takumi Namba, Kiyotsugu Takaba

“…Moreover, we propose a novel distributed algorithm that achieves a high-quality feasible solution to the MILP to consider the employees' privacy and decision-making. …”
Get full text

Distributed Voronoi coverage algorithm in wireless sensor networks by XU Peng-fei1, CHEN Zhi-gang1, DENG Xiao-heng1

“…On the hypothesis conditions that wireless sensor networks only covered partial target region and the commu-nication radius was no less than twice of the sensing radius,a coverage-preserved and connected distributed Voronoi cov-erage algorithm was presented.Firstly,a method of detecting coverage redundancy sensors based on the local Voronoi re-gions was proposed,whose computational complexity was unconcerned with the density of sensors.Then,an en-ergy-prior self-scheduling strategy based on local Voronoi neighbors was proposed,where those sensors that were com-munication neighbors but not local Voronoi neighbors could synchronously execute self-scheduling,which improved the astringency of distributed scheduling.The simulation results show that the average number and coverage-degree of active sensors produced by the proposed algorithm are close to the centralized algorithm and smaller than the general distributed algorithm,while the proposed algorithm has more advantages in terms of active sensors’ average energy,scheduling as-tringency and runtime.…”
Get full text

Dynamic Economic Dispatch of AC/DC Microgrid Based on the Finite-Step Consensus Algorithm by JIANG Ke;WU Feng;ZHANG Xinsong;ZONG Xuanjun

“…Furthermore, a distributed algorithm based on the finite-step consensus algorithm is proposed, in which the incremental cost of each distributed generation unit is set as a consensus variable, and all units can obtain the optimal values by exchanging information only with its neighboring. …”
Get full text

The Extension of Auxiliary Problem Principle for Solving Dynamic Economic Dispatch Problem in Power Systems by Yaming Ren

“…Considering the special case where the objective function is composed of two separable convex functions, the auxiliary problem principle (APP) is an effective parallel distributed algorithm for solving the special case. Inspired by the principle of APP, a natural idea to solve separable convex optimization problem with m ≥ 3 is to extend the method of APP, resulting in the APP-like algorithm. …”
Get full text

QoS-Aware Fault Detection in Wireless Sensor Networks by Alessandra De Paola, Giuseppe Lo Re, Fabrizio Milazzo, Marco Ortolani

“…This paper proposes a fully distributed algorithm for detecting data faults, taking into account the response time besides the classification accuracy. …”
Get full text

Two-layer distributed cache in D2D integrated fog-RAN by Chengyu XIA, Yanxiang JIANG

“…With the development of mobile communications,people’s demands for low-latency transmission networks are rapidly increasing.Fog-RAN,as a new architecture suitable for 5G/B5G communication networks,has broad application prospects.Considering the fog network of device-to-device communication,a two-layer distributed cache based on device-to-device communication and fog-RAN was proposed to reduce the delay for users to download files.Firstly,a closed-form solution of the download delay of the two-layer cache and a closed-form solution of the delay gain were obtained.On this basis,a distributed algorithm was designed to obtain the best cache strategy,so that each fog-based wireless access point (F-AP) or user equipment (UE) only needed to use the information of the neighboring devices to complete the caching.The simulation results show that the two-layer distributed cache can effectively reduce the download delay.…”
Get full text

Statistically Bounding Detection Latency in Low-Duty-Cycled Sensor Networks by Yanmin Zhu

“…We propose a lightweight distributed algorithm for coordinating the wakeup scheduling of the sensor nodes. …”
Get full text

An Optimal CDS Construction Algorithm with Activity Scheduling in Ad Hoc Networks by Chakradhar Penumalli, Yogesh Palanichamy

“…Here the CDS is a distributed algorithm with activity scheduling based on unit disk graph [UDG]. …”
Get full text

Application-Oriented Fault Detection and Recovery Algorithm for Wireless Sensor and Actor Networks by Jinglin Du, Li Xie, Xiaoyan Sun, Ruoqin Zheng

“…This paper proposed an application-oriented fault detection and recovery algorithm (AFDR), a novel distributed algorithm to reestablish connectivity. AFDR identifies critical actors and designates backups for them. …”
Get full text

Knowledge-based Algorithms for BDI-agents by Nikolay Vyacheslavovich Shilov, Natalia Olegovna Garanina

“…Multiagent algorithm is a knowledge-based distributed algorithm that solves some problems by means of cooperative work of agents. …”
Get full text

Approximation Algorithms for Maximum Link Scheduling under SINR-Based Interference Model by Zi-Ao Zhou, Chang-Geng Li

“…In addition, based on our centralized method, we present a polynomial time, randomized, distributed algorithm, which only requires estimates of the number of links, and maximum and minimum link lengths. …”
Get full text

A Distributed Resilience Enhancement Strategy for Multi-microgrids Based on System of Systems Architecture by Linxinyan LIN, Junpeng ZHU, Yue YUAN

“…Finally, the synchronous alternating direction multiplier method based on a dynamic multiplier update strategy is adopted to solve the problem of parameter selection of the distributed algorithm, thus improving the convergence and practicability of the algorithm. …”
Get full text

Distributed networked localization using neighboring distances only through a computational topology control approach by Xiaochu Wang, Ting Sun, Changhao Sun, Junqi Wang

“…For large-scale wireless sensor networks, the nonlinear localization problem where only neighboring distances are available to each individual sensor nodes have been attracting great research attention. In general, distributed algorithms for this problem are likely to suffer from the failures that localizations are trapped in local minima. …”
Get full text

A Smoothing Newton Method for Real-Time Pricing in Smart Grids Based on User Risk Classification by Linsen Song, Gaoli Sheng

“…Finally, we give a comparison between the proposed model and the unclassified risk model and the proposed algorithm and the distributed algorithm for real-time pricing, time-of-use pricing, and fixed pricing, respectively. …”
Get full text

Resource scheduling strategy based on simulated annealing algorithm in hybrid D2D cellular networks by Xiang YU, Haibo ZHANG, Lu YANG

“…D2D communication is a short distance communication mode in the future 5G network.In the process of communication,the information is transmitted from the sender to the receiver directly,without the need to transmit through the base station.The introduction of D2D communication in the traditional cellular network can greatly improve the total throughput of the system,increase the utilization of spectrum resources and reduce the power consumption of the transmitter.A resource allocation method which was used in hybrid D2D cellular network was mainly introduced,spectrum resources was distributed by Lagrange multiplier method combined with simulated annealing algorithm,a consideration of channel capacity and energy consumption of the resource scheduling strategy based on simulated annealing algorithm was put forward.This algorithm was simulated by the simulation platform in Vienna,compared to the traditional greedy optimization algorithm,it can significantly increase the total system throughput and bandwidth utilization and reduce the power consumption.In addition,the distributed algorithm was adopted,that D2D users searched for a suitable target channel and calculated their transmit power according to the algorithm steps,which reduced the signaling overhead of the base station.…”
Get full text

Distributed Control Algorithms for Nonholonomic Mobile Robots With Time-Varying Position Constraints and Event-Triggered Communication by Zhihua Zhang, Chaoli Wang, Xuan Cai

“…It is assumed that the position of each robot is subject to generic time-varying constraints, and that the communication graph contains a directed spanning tree. A novel distributed algorithm that employs coordinate transformation with transverse functions and dynamic systems to generate reference signals is presented. …”
Get full text

EMP: Exploiting Mobility Patterns for Collaborative Localization in Sparse Mobile Networks by Yanmin Zhu, Zhenzhen Tian, Jiadi Yu

“…EMP implements a range-free distributed algorithm, with which each user collaboratively estimates its current location by fusing two localization sources, that is, network connectivity with other nodes and mobility patterns . …”
Get full text