Search results for "Distributed"
showing 10 items of 1260 documents
REPUTATION MANAGEMENT ALGORITHMS IN DISTRIBUTED APPLICATIONS
2020
Nowadays, several distributed systems and applications rely on interactions between unknown agents that cooperate in order to exchange resources and services. The distributed nature of these systems, and the consequent lack of a single centralized point of control, let agents to adopt selfish and malicious behaviors in order to maximize their own utility. To address such issue, many applications rely on Reputation Management Systems (RMSs) to estimate the future behavior of unknown agents before establishing actual interactions. The relevance of these systems is even greater if the malicious or selfish behavior exhibited by a few agents may reduce the utility perceived by cooperative agents…
Robust and Efficient Data Gathering for Wireless Sensor Networks
2006
This paper describes a new strategy for data gathering in wireless sensor networks that takes into account the need for both energy saving, typical of such networks, and for a reasonable tradeoff between robustness and efficiency. The proposed algorithm implements an efficient strategy for retransmission of lost packets by discovering alternative routes and making clever use of multiple paths when necessary; in order to do that we build upon the general framework presented in recent works, that provided a formulation of duplicate and order insensitive aggregation functions, and by taking advantage of some intrinsic characteristics of the wireless sensor networks, we exploit implicit acknowl…
A Networking Framework for Multi-Robot Coordination
2008
Autonomous robots operating in real environments need to be able to interact with a dynamic world populated with objects, people, and, in general, other agents. The current generation of autonomous robots, such as the ASIMO robot by Honda or the QRIO by Sony, has showed impressive performances in mechanics and control of movements; moreover, recent literature reports encouraging results about the capability of such robots of representing themselves with respect to a dynamic external world, of planning future actions and of evaluating resulting situations in order to make new plans. However, when multiple robots are supposed to operate together, coordination and communication issues arise; w…
Vulnerability evaluation of distributed reputation management systems
2017
In distributed environments, Reputation Management Systems (RMSs) aim to estimate agents' trustworthiness by exploiting different sources of information. The distributed nature of these systems makes them vulnerable to several types of security attacks, and the response provided by a specific RMS depends on various factors, such as the algorithms adopted for estimating the reputation values and the communication protocols used to enable the cooperation among agents. This work examines the most important security attacks against RMSs and proposes a set of metrics for a quantitative evaluation of the RMS vulnerabilities. A parallel simulation framework is used to automatically give a vulnerab…
Reputation Management for Distributed Service-Oriented Architectures
2010
Nowadays, several network applications require that consumer nodes acquire distributed services from unknown service providers on the Internet. The main goal of consumer nodes is the selection of the best services among the huge multitude provided by the network. As basic criteria for this choice, service cost and Quality-of-Service (QoS) can be considered, provided that the underlying Service-Oriented Architecture (SOA) be augmented in order to support the declaration of this information. The correct behavior of such new SOA platforms, however, will depend on the presence of some mechanisms that allow consumer nodes to evaluate trustworthiness of service providers. This work proposes a new…
Image Segmentation through a Hierarchy of Minimum Spanning Trees
2012
Many approaches have been adopted to solve the problem of image segmentation. Among them a noticeable part is based on graph theory casting the pixels as nodes in a graph. This paper proposes an algorithm to select clusters in the images (corresponding to relevant segments in the image) corresponding to the areas induced in the images through the search of the Minimum Spanning Tree (MST). In particular is is based on a clustering algorithm that extracts clusters computing a hierarchy of Minimum Spanning Trees. The main drawback of this previous algorithm is that the dimension of the cluster is not predictable and a relevant portion of found clusters can be composed by micro-clusters that ar…
Verification of Symbolic Distributed Protocols for Networked Embedded Devices
2020
The availability of versatile and interconnected embedded devices makes it possible to build low-cost networks with a large number of nodes running even complex applications and protocols in a distributed manner. Common tools used for modeling and verification, such as simulators, present some limitations as application correctness is checked off-board and only focuses on source code. Execution in the real network is thus excluded from the early stages of design and verification. In this paper, a system for modeling and verification of symbolic distributed protocols running on embedded devices is introduced. The underlying methodology is rooted in a symbolic programming paradigm that makes …
The egoistic approach to parallel process migration into heterogeneous workstation network
1996
Abstract A new approach to the allocation of processes in a distributed system is discussed. The proposed solution deals with process migration into heterogeneous systems by means of a strategy that delegates the individual parallel applications to manage the migration of their processes by themselves, on the basis of their own performance objectives. This approach is discussed in opposition to the global scheduling based one, and the load balancing objective is pursued as an effect of the optimization of individual applications. A new performance evaluation criterion is introduced that consists in monitoring the delays that occur when two parallel processes run towards a common synchroniza…
Combining textual and visual cues for content-based image retrieval on the World Wide Web
2002
A system is proposed that combines textual and visual statistics in a single index vector for content-based search of a WWW image database. Textual statistics are captured in vector form using latent semantic indexing (LSI) based on text in the containing HTML document. Visual statistics are captured in vector form using color and orientation histograms. By using an integrated approach, it becomes possible to take advantage of possible statistical couplings between the content of the document (latent semantic content) and the contents of images (visual statistics). The combined approach allows improved performance in conducting content-based search. Search performance experiments are report…
Time-Constrained Node Visit Planning for Collaborative UAV-WSN Distributed Applications.
2022
Unmanned Aerial Vehicles (UAVs) are often studied as tools to perform data collection from Wireless Sensor Networks (WSNs). Path planning is a fundamental aspect of this endeavor. Works in the current literature assume that data are always ready to be retrieved when the UAV passes. This operational model is quite rigid and does not allow for the integration of the UAV as a computational object playing an active role in the network. In fact, the UAV could begin the computation on a first visit and retrieve the data later. Potentially, the UAV could orchestrate the distributed computation to improve its performance, change its parameters, and even upload new applications to the sensor network…