Connected Dominating Sets(CDSs) can serve as virtual backbones for wireless networks, which can effectively alleviate the serious broadcast storms problem. However, it is not easy to construct the minimum CDS due to t...
详细信息
Connected Dominating Sets(CDSs) can serve as virtual backbones for wireless networks, which can effectively alleviate the serious broadcast storms problem. However, it is not easy to construct the minimum CDS due to the NP-hard nature of the problem. In this paper, we proposed a distributed CDS construction algorithm. Our algorithm includes two stages, Maximum Independent Set(MIS) construction stage and CDS construction stage. In the first stage, a node with more neighbors and smaller ID has the priority to become a member of the MIS. In the second stage, some connectors are selected to make the MIS connected. And redundant connectors are cut off to further reduce the CDS size. The theoretical analysis and simulation results show that our algorithm performs well in terms of CDS size and message complexity.
The number of Electric Vehicles (EVs) is expected to rise in the coming future as an aim to be eco-friendly. However, a high penetration of EVs may result in power outages or transformer damage due to overloading. Sma...
详细信息
The number of Electric Vehicles (EVs) is expected to rise in the coming future as an aim to be eco-friendly. However, a high penetration of EVs may result in power outages or transformer damage due to overloading. Smart Grid technology enables us to manage the charging of EVs in the form of demand side management. In this paper we applied the distributed scheduling algorithm, which we called Aggregate Power Sharing (APS), proposed by [Chen et al, 2014] to coordinate the charging schedules of EVs in a residential area in Pattaya, Thailand, being supplied by a distribution transformer. This area was one of the pilot projects for Smart Grid in Thailand. We compare APS with a popular water-filling scheduling algorithm and with the no scheduling case. With the two scheduling algorithms, the aggregate power consumption in the area does not violate the target aggregate load profile and more EVs can be supported by the transformer, compared to the no-scheduling case. In addition, the APS scheduling provides better fairness than water-filling since each EV is essentially charged at the same rate, independent of the state of charge of the batteries.
We develop a new distributed algorithm to solve the ridge regression problem with feature partitioning of the observation matrix. The proposed algorithm, named D-Ridge, is based on the alternating direction method of ...
详细信息
We develop a new distributed algorithm to solve the ridge regression problem with feature partitioning of the observation matrix. The proposed algorithm, named D-Ridge, is based on the alternating direction method of multipliers (ADMM) and estimates the parameters when the observation matrix is distributed among different agents with feature (or vertical) partitioning. We formulate the associated ridge regression problem as a distributed convex optimization problem and utilize the ADMM to obtain an iterative solution. Numerical results demonstrate that D-Ridge converges faster than its diffusion-based contender does.
This paper investigates the problem of solving a unique solution to discrete-time Lyapunov equations (DTLE) using multi-agent networks. We propose a distributed algorithm where each agent only uses partial information...
详细信息
This paper investigates the problem of solving a unique solution to discrete-time Lyapunov equations (DTLE) using multi-agent networks. We propose a distributed algorithm where each agent only uses partial information of the matrices. The agents of the algorithm reach a consensus by exchanging information with their neighbors over an undirected connected graph. We provide convergence analysis and the convergence rate estimate for the proposed algorithm. Finally, convergence performance is verified by numerical simulations.
Mobile Edge Clouds (MECs) with 5G will create new opportunities to develop latency-critical applications in domains such as intelligent transportation systems, process automation, and smart grids. However, it is not c...
详细信息
ISBN:
(纸本)9781538651407
Mobile Edge Clouds (MECs) with 5G will create new opportunities to develop latency-critical applications in domains such as intelligent transportation systems, process automation, and smart grids. However, it is not clear how one can cost-efficiently deploy and manage a large number of such applications given the heterogeneity of devices, application performance requirements, and workloads. This work explores cost and performance dynamics for IoT applications, and proposes distributed algorithms for automatic deployment of IoT applications in heterogeneous environments. Placement algorithms were evaluated with respect to metrics including number of required runtimes, applications' slowdown, and the number of iterations used to place an application. Iterative search-based distributed algorithms such as Size Interval Actor Assignment in Groups (SIAA_G) outperformed random and bin packing algorithms, and are therefore recommended for this purpose. Size Interval Actor Assignment in Groups at Least Utilized Runtime (SIAA_G_LUR) algorithm is also recommended when minimizing the number of iterations is important. The tradeoff of using SIAA_G algorithms is a few extra runtimes compared to bin packing algorithms.
Differential privacy is a cryptographically-motivated formal privacy definition that is robust against strong adversaries. The principal component analysis (PCA) algorithm is frequently used in signal processing, mach...
详细信息
ISBN:
(纸本)9781538646595
Differential privacy is a cryptographically-motivated formal privacy definition that is robust against strong adversaries. The principal component analysis (PCA) algorithm is frequently used in signal processing, machine learning, and statistics pipelines. In many scenarios, private or sensitive data is distributed across different sites: in this paper we propose a differentially private distributed PCA scheme to enable collaborative dimensionality reduction. We investigate the performance of the proposed algorithm on synthetic and real datasets and show empirically that our algorithm can reach the same level of utility as the non-private PCA for some parameter choices, which indicates that it is possible to have meaningful utility while preserving privacy.
Unmanned aerial vehicles (UAVs) can supplement the existing ground-based heterogeneous cellular networks (Het-Nets), by replacing/supporting damaged infrastructure, providing real-time video support at the site of an ...
详细信息
ISBN:
(纸本)9781538663592;9781538663585
Unmanned aerial vehicles (UAVs) can supplement the existing ground-based heterogeneous cellular networks (Het-Nets), by replacing/supporting damaged infrastructure, providing real-time video support at the site of an emergency, offloading traffic in congested areas, extending coverage, and filling coverage gaps. In this paper, we introduce distributed algorithms that leverage UAV mobility, enhanced inter-cell interference coordination (ICIC), and cell range expansion (CRE) techniques defined in 3GPP Release-10 and 3GPP Release-11. Through Monte-Carlo simulations, we compare the system-wide 5th percentile spectral efficiency (5pSE) while optimizing the performance using a brute force algorithm, a heuristic-based sequential algorithm, and a deep Q-learning algorithm. The autonomous UAVs jointly optimize their location, ICIC parameters, and CRE to maximize 5pSE gains and minimize the outage probability. Our results show that the ICIC technique relying on a simple heuristic outperforms the ICIC technique based on deep Q-learning. Taking advantage of the multiple optimization parameters for interference coordination, the heuristic based ICIC technique can achieve 5pSE values that are reasonably close to those achieved with exhaustive brute force search techniques, at a significantly lower computational complexity.
In distributed system it may pose some problems to visualize the exact nature of functioning and the sequence of events in various nodes of the said system and such insights are essential to comprehend and analyze the...
详细信息
ISBN:
(纸本)9781728102603
In distributed system it may pose some problems to visualize the exact nature of functioning and the sequence of events in various nodes of the said system and such insights are essential to comprehend and analyze the behavior of different algorithms executing in different nodes of the system mentioned. This paper describes a framework that has been implemented to help visualize and analyze the working behavior of various algorithms on distributed system. Using this platform it is possible for students and researchers to gain insight into the working of various nodes of a distributed system, check their interactions at run time and thus to test different algorithms in a simulated as well as actual environment. The framework lets the student to check the behavior of certain standard built-in distributed algorithms, viz., Leader Election using Bully and Ring algorithms, Ricart-Agrawala's Mutual Exclusion Algorithm and Chandy-Mishra-Hash deadlock detection algorithm. The users can also write their own algorithms and use a program generator module to generate programs for different nodes using this framework. Subsequent to the execution, a graphical analyzer module aids the user by showing the execution behavior of the algorithm using a space-time graphical diagram that makes use of Lamport's Time Stamping algorithm. The framework provides built-in system-level supports to facilitate exclusive access to shared resources and detects distributed deadlock also.
This paper investigates a distributed design for boosting methods, especially AdaBoost, over multi-agent networks. In fact, we present a distributed AdaBoost algorithm for solving a distributed classification problem ...
详细信息
This paper investigates a distributed design for boosting methods, especially AdaBoost, over multi-agent networks. In fact, we present a distributed AdaBoost algorithm for solving a distributed classification problem in machine learning through sharing classifiers among agents. Our algorithm can effectively avoid overfitting, efficiently merge the feature information of other agents, and moreover, largely reduce the communication cost in comparison with some existing centralized or distributed algorithms. Furthermore, simulations with a real classification dataset is given to show the effectiveness of the proposed algorithm. The performance of the proposed algorithm matches that of the centralized AdaBoost algorithm.
Despite the fact that many real world problems change over time, many distributed Constraint Optimization Problem (DCOP) algorithms assume that the problem is constant or changing at a negligible rate. In addition, th...
详细信息
Despite the fact that many real world problems change over time, many distributed Constraint Optimization Problem (DCOP) algorithms assume that the problem is constant or changing at a negligible rate. In addition, these algorithms also assume that changes to the environment are instantaneously observable. However, in highly dynamic environments with communication delays, both of these assumptions can be violated resulting in problem solving with out-of-date information. In this study, we explore the relationship between environmental dynamics, information stagnancy, and solution quality in Dynamic DCOP problems. By using recent advances in the analysis of dynamic, distributed problems, we show that information stagnancy can be characterized and used to accurately predict the behavior of a protocol. To evaluate our finding, we use the distributed Stochastic Algorithm (DSA) as a basis. Through extensive empirical testing, we show that the prediction function is accurate.
暂无评论