Search results for "Distributed computing"

Circuit-Elimination based Link-State Routing in Mobile Ad-hoc Networks

2007

Circuit-elimination based connected dominating set formation is an efficient technique for reducing routing overhead in mobile ad hoc networks. In this paper, we propose a new message dissemination algorithm which utilizes such techniques to reduce the number of nodes that generate or forward link state advertisements in link state routing protocols. Simulation results with both static and dynamic network topologies demonstrate the potential of the proposed algorithm to reduce routing overhead, compared with a benchmark link state routing protocol, OLSR.

Modeling and predicting the Spanish Bachillerato academic results over the next few years using a random network model

2016

[EN] Academic performance is a concern of paramount importance in Spain, where around of 30% of the students in the last two courses in high school, before to access to the labor market or to the university, do not achieve the minimum knowledge required according to the Spanish educational law in force. In order to analyze this problem, we propose a random network model to study the dynamics of the academic performance in Spain. Our approach is based on the idea that both, good and bad study habits, are a mixture of personal decisions and influence of classmates. Moreover, in order to consider the uncertainty in the estimation of model parameters, we perform a lot of simulations taking as t…

On Metadata Support for Integrating Evolving Heterogeneous Data Sources

2019

With the emergence of big data technologies, the problem of structure evolution of integrated heterogeneous data sources has become extremely topical due to dynamic and diverse nature of big data. To solve the big data evolution problem, we propose an architecture that allows to store and process structured and unstructured data at different levels of detail, analyze them using OLAP capabilities and semi-automatically manage changes in requirements and data expansion. In this paper, we concentrate on the metadata essential for the operation of the proposed architecture. We propose a metadata model to describe schemata and supplementary properties of data sets extracted from sources and tran…

2015

Abstract. The coupling of Earth system model components, which work on different grids, into an Earth System Model (ESM) provokes the necessity to transfer data from one grid to another. Additionally, each of these model components might require data import onto its specific grid. Usually, one of two approaches is used: Either all input data is preprocessed to the employed grid, or the imported data is interpolated on-line, i.e. during model integration to the required grid. For the former, each change in the model resolution requires the re-preprocessing of all data. The latter option implies that in each model integration computing time is required for the grid mapping. If all components …

A Neural Multi-Agent Architecture for an Autonomous Mobile Robot Control

1999

The aim of this paper is to introduce a multi-agent architecture for an autonomous robot control oriented to obtain high design modularity and high parallelism of decision processes. A multi-agent approach allows us to design several specialized agents and each of them is optimized in order to solve a single part of the whole task. Each agent is able to cooperate with other agent exchanging information, so the robot is able to make the appropriate policy of management to reach a prefixed goal. We tested the proposed architecture with a simple application: an autonomous mobile robot performs object retrieval tasks into unknown structured environments. The robot is not given a priori map of t…

Cross-technology wireless experimentation: Improving 802.11 and 802.15.4e coexistence

2016

In this demo we demonstrate the functionalities of a novel experimentation framework, called WiSHFUL, that facilitates the prototyping and experimental validation of innovative solutions for heterogeneous wireless networks, including cross-technology coordination mechanisms. The framework supports a clean separation between the definition of the logic for optimizing the behaviors of wireless devices and the underlying device capabilities, by means of a unifying platform-independent control interface and programming model. The use of the framework is demonstrated through two representative use cases, where medium access is coordinated between IEEE-802.11 and IEEE-802.15.4 networks.

Challenging aspects in Consensus protocols for networks

2008

Results on consensus protocols for networks are presented. The basic tools and the main contribution available in the literature are considered, together with some of the related challenging aspects: estimation in networks and how to deal with disturbances is considered. Motivated by applications to sensor, peer-to- peer, and ad hoc networks, many papers have considered the problem of estimation in a consensus fashion. Here, the unknown but bounded (UBB) noise affecting the network is addressed in details. Because of the presence of UBB disturbances convergence to equilibria with all equal components is, in general, not possible. The solution of the epsiv-consensus problem, where the states…

Scavenger – A Framework for Efficient Evaluation of Dynamic and Modular Algorithms

2015

Machine Learning methods and algorithms are often highly modular in the sense that they rely on a large number of subalgorithms that are in principle interchangeable. For example, it is often possible to use various kinds of pre- and post-processing and various base classifiers or regressors as components of the same modular approach. We propose a framework, called Scavenger, that allows evaluating whole families of conceptually similar algorithms efficiently. The algorithms are represented as compositions, couplings and products of atomic subalgorithms. This allows partial results to be cached and shared between different instances of a modular algorithm, so that potentially expensive part…

Work Partitioning on Parallel and Distributed Agent-Based Simulation

2017

Work partitioning is a key challenge with ap- plications in many scientific and technological fields. The problem is very well studied with a rich literature on both distributed and parallel computing architectures. In this paper we deal with the work partitioning problem for parallel and distributed agent-based simulations which aims at (i) balancing the overall load distribution, (ii) minimizing, at the same time, the communication overhead due to agents' inter-dependencies. We introduce a classification taxonomy of work partitioning strategies and present a space-based work partitioning ap- proach, based on a Quad-tree data structure, which enables to: identify a good space partitioning …

On implicit data structures for priority queues

1985

Comparaison avec une structure liee simple et implementation de certaines structures de donnees implicites pour les files d'attente de priorite. Le minutage des experiences montre que les structures implicites sont plutot lentes