Search results for "Distributed algorithm"
showing 9 items of 39 documents
QoS-Aware Fault Detection in Wireless Sensor Networks
2013
Wireless sensor networks (WSNs) are a fundamental building block of many pervasive applications. Nevertheless the use of such technology raises new challenges regarding the development of reliable and fault-tolerant systems. One of the most critical issues is the detection of corrupted readings amidst the huge amount of gathered sensory data. Indeed, such readings could significantly affect the quality of service (QoS) of the WSN, and thus it is highly desirable to automatically discard them. This issue is usually addressed through “fault detection” algorithms that classify readings by exploiting temporal and spatial correlations. Generally, these algorithms do not take into account QoS re…
Energy Efficiency Optimization for Multi-cell Massive MIMO : Centralized and Distributed Power Allocation Algorithms
2021
This paper investigates the energy efficiency (EE) optimization in downlink multi-cell massive multiple-input multiple-output (MIMO). In our research, the statistical channel state information (CSI) is exploited to reduce the signaling overhead. To maximize the minimum EE among the neighbouring cells, we design the transmit covariance matrices for each base station (BS). Specifically, optimization schemes for this max-min EE problem are developed, in the centralized and distributed ways, respectively. To obtain the transmit covariance matrices, we first find out the closed-form optimal transmit eigenmatrices for the BS in each cell, and convert the original transmit covariance matrices desi…
Optimal gossip algorithm for distributed consensus SVM training in wireless sensor networks
2009
In this paper, we consider the distributed training of a SVM using measurements collected by the nodes of aWireless Sensor Network in order to achieve global consensus with the minimum possible inter-node communications for data exchange. We derive a novel mathematical characterization for the optimal selection of partial information that neighboring sensors should exchange in order to achieve consensus in the network. We provide a selection function which ranks the training vectors in order of importance in the learning process. The amount of information exchange can vary, based on an appropriately chosen threshold value of this selection function, providing a desired trade-off between cla…
A grid ant colony algorithm for the orienteering problem
2005
In this paper we propose a distributed ant colony algorithm to solve large scale orienteering problem instances. Our approach is based on a multi-colony strategy where each colony works in an independent portion (cluster) in the original graph. This results in no need for communicating pheromones information among colonies and in increasing speedup. We have implemented our algorithm as a .NET Web services infrastructure following a grid computing philosophy and we provide some promising experimental results to show the feasibility and effectiveness of our approach
Visual dynamic environment for distributed systems
2002
Algorithms, based on information fusion, are often embodied in visual perception systems. Distributed architectures have been recently proposed to perform integrated computation. The complexity of distributed systems regards both their design, and the software environment to develop applications. Visual and iconic programming style intends to provide expressive tools to implement, to debug, and to execute programs in distributed environment. Multi-layers graphs languages seem suitable to handle such complexity. This paper describes the design of a visual dynamic environment (VDE), which is based on a graph-grammar. A new class of dynamic visual interfaces is also introduced, and its propert…
Parallel and Distributed Resource Allocation With Minimum Traffic Disruption for Network Virtualization
2017
Wireless network virtualization has been advocated as one of the most promising technologies to provide multifarious services and applications for the future Internet by enabling multiple isolated virtual wireless networks to coexist and share the same physical wireless resources. Based on the multiple concurrent virtual wireless networks running on the shared physical substrate, service providers can independently manage and deploy different end-users services. This paper proposes a new formulation for bandwidth allocation and routing problem for multiple virtual wireless networks that operate on top of a single substrate network to minimize the operation cost of the substrate network. We …
Decentralized classification in societies of autonomous and heterogenous robots
2011
This paper addresses the classification problem for a set of autonomous robots that interact with each other. The objective is to classify agents that “behave” in “different way”, due to their own physical dynamics or to the interaction protocol they are obeying to, as belonging to different “species”. This paper describes a technique that allows a decentralized classification system to be built in a systematic way, once the hybrid models describing the behavior of the different species are given. This technique is based on a decentralized identification mechanism, by which every agent classifies its neighbors using only local information. By endowing every agent with such a local classifie…
Decentralized Deployment of Mobile Sensors for Optimal Connected Sensing Coverage
2008
In this paper, we address the optimal connected sensing coverage problem, i.e., how mobile sensors with limited sensing capabilities can cooperatively adjust their locations so as to maximize the extension of the covered area while avoiding any internal “holes”, areas that are not covered by any sensor. Our solution consists in a distributed motion algorithm that is based on an original extension of the Voronoi tessellation.
Distributed n-player approachability via time and space average consensus
2012
Abstract In this paper we consider repeated coalitional games with transferable utilities (TU) over networks. Namely, we consider a set of n players that have to distribute among themselves a vector of rewards (one for each player). In our network version there is no coordinator allocating the rewards, but the agents have to agree on a common time-averaged vector by updating the local estimates of the reward vector. The common time-averaged reward vector has to approach a suitable constraint set, called core of the game, that guarantees that no agents benefit from quitting the grand coalition. We propose a doubly (over time and space) averaging distributed algorithm. At every iteration, eac…