576 research outputs found
Proceedings of the 2nd International Workshop on Security in Mobile Multiagent Systems
This report contains the Proceedings of the Second Workshop on Security on Security of Mobile Multiagent Systems (SEMAS2002). The Workshop was held in Montreal, Canada as a satellite event to the 5th International Conference on Autonomous Agents in 2001.
The far reaching influence of the Internet has resulted in an increased interest in agent technologies, which are poised to play a key role in the implementation of successful Internet and WWW-based applications in the future. While there is still considerable hype concerning agent technologies, there is also an increasing awareness of the problems involved. In particular, that these applications will not be successful unless security issues can be adequately handled. Although there is a large body of work on cryptographic techniques that provide basic building-blocks to solve specific security problems, relatively little work has been done in investigating security in the multiagent system context. Related problems are secure communication between agents, implementation of trust models/authentication procedures or even reflections of agents on security mechanisms. The introduction of mobile software agents significantly increases the risks involved in Internet and WWW-based applications. For example, if we allow agents to enter our hosts or private networks, we must offer the agents a platform so that they can execute correctly but at the same time ensure that they will not have deleterious effects on our hosts or any other agents / processes in our network. If we send out mobile agents, we should also be able to provide guarantees about specific aspects of their behaviour, i.e., we are not only interested in whether the agents carry out-out their intended task correctly. They must defend themselves against attacks initiated by other agents, and survive in potentially malicious environments.
Agent technologies can also be used to support network security. For example in the context of intrusion detection, intelligent guardian agents may be used to analyse the behaviour of agents on a firewall or intelligent monitoring agents can be used to analyse the behaviour of agents migrating through a network. Part of the inspiration for such multi-agent systems comes from primitive animal behaviour, such as that of guardian ants protecting their hill or from biological immune systems
A Dynamic Application Partitioning and Offloading Framework to Enhance the Capabilities of Transient Clouds Using Mobile Agents
Mobile cloud computing has emerged as a prominent area of research, a natural extension of cloud computing that proposes to offer solutions for enhancing the capabilities of smart mobile devices commonly plagued by resource constraints. As one of its promising models, transient clouds aim to address the internet connectivity shortfall inherent in most solutions through the formation of ad hoc networks by devices in close proximity, then the offloading some computations (Cyber Foraging) to the created cloud. However, transient clouds, at their current state, have several limitations, concerning their expansion on a local network having a large number of devices and the management of the instability of the network due to the constant mobility of the devices. Another issue is the fact code partitioning and offloading are not addressed to fit the need of such networks, thereby rendering the distributed computing mechanism barely efficient for the Transient Cloud. In this study, we propose a transient cloud-based framework that exploits the use of multi-agent systems, enabling a dynamic partitioning and offloading of code, and facilitating the movement and the execution of code partition packets in a multi-hop ad-hoc mesh network. When created and deployed, these intelligent mobile agents operate independently or collaboratively and adapt to the continual entry and exit of devices in the neighbourhood. The integration of these trending concepts in distributed computing within a framework offers a new architecture for resource-sharing among cooperating devices that addresses the varied issues that arise in dynamic environments
Towards a Reference Architecture for Context-Aware Services
This Chapter describes an infrastructure for multi-modal perceptual systems which aims at developing and realizing computer services that are delivered to humans in an implicit and unobtrusive way. The framework presented here supports the implementation of humancentric context-aware applications providing non-obtrusive assistance to participants in events such as meetings, lectures, conferences and presentations taking place in indoor "smart spaces". We emphasize on the design and implementation of an agent-based framework that supports "pluggable" service logic in the sense that the service developer can concentrate on the service logic independently of the underlying middleware. Furthermore, we give an example of the architecture’s ability to support the cooperation of multiple services in a meeting scenario using an intelligent connector service and a semantic web oriented travel service. The framework was developed as part of the project CHIL (Computers in the Human Interaction Loop). The vision of CHIL was to be able to provide context-aware human centric services which will operate in the background, provide assistance to the participants in the CHIL spaces and undertake tedious tasks in an unobtrusive way. To achieve this, significant effort had to be put in designing efficient context extraction components so that the CHIL system can acquire an accurate perspective of the current state of the CHIL space. However, the CHIL services required a much more sophisticated modelling of the actual event, rather than simple and fluctuating impressions of it. Furthermore, by nature the CHIL spaces are highly dynamic and heterogeneous; people join or leave, sensors fail or are restarted, user devices connect to the network, etc. To manage this diverse infrastructure, sophisticated techniques were necessary that can map all entities present in the CHIL system and provide information to all components which may require it. From these facts, one can easily understand that in addition to highly sophisticated components at an individual level, another mechanism (or a combination of mechanisms) should be present which can handle this infrastructure. The CHIL Reference Architecture for Multi Modal Systems lies in the background, and provides the solid, high performance and robust backbone for the CHIL services. Each individual need is assigned to a specially designed and integrated layer which is docked to the individual component, and provides all the necessary actions to enable the component to be plugged in the CHIL framework
Crowdsensing-driven route optimisation algorithms for smart urban mobility
Urban rörlighet anses ofta vara en av de främsta möjliggörarna för en hållbar statsutveckling.
Idag skulle det dock kräva ett betydande skifte mot renare och effektivare stadstransporter vilket skulle stödja ökad social och ekonomisk koncentration av resurser i städerna. En viktig prioritet för städer runt om i världen är att stödja medborgarnas rörlighet inom stadsmiljöer medan samtidigt minska trafikstockningar, olyckor och föroreningar. Att utveckla en effektivare och grönare (eller med ett ord; smartare) stadsrörlighet är en av de svåraste problemen att bemöta för stora metropoler. I denna avhandling närmar vi oss problemet från det snabba utvecklingsperspektivet av ITlandskapet i städer vilket möjliggör byggandet av rörlighetslösningar utan stora stora investeringar eller sofistikerad sensortenkik.
I synnerhet föreslår vi utnyttjandet av den mobila rörlighetsavkännings, eng. Mobile Crowdsensing (MCS), paradigmen i vilken befolkningen exploaterar sin mobilkommunikation och/eller mobilasensorer med syftet att frivilligt samla, distribuera, lokalt processera och analysera geospecifik information. Rörlighetavkänningssdata (t.ex. händelser, trafikintensitet, buller och luftföroreningar etc.) inhämtad från frivilliga i befolkningen kan ge värdefull information om aktuella rörelsesförhållanden i stad vilka, med adekvata databehandlingsalgoriter, kan användas för att planera människors
rörelseflöden inom stadsmiljön.
Såtillvida kombineras i denna avhandling två mycket lovande smarta rörlighetsmöjliggörare, eng. Smart Mobility Enablers, nämligen MCS och rese/ruttplanering.
Vi kan därmed till viss utsträckning sammanföra forskningsutmaningar från dessa två delar. Vi väljer att separera våra forskningsmål i två delar, dvs forskningssteg: (1) arkitektoniska utmaningar vid design av MCS-system och (2) algoritmiska utmaningar för tillämpningar av MCS-driven ruttplanering.
Vi ämnar att visa en logisk forskningsprogression över tiden, med avstamp i mänskligt dirigerade rörelseavkänningssystem som MCS och ett avslut i automatiserade ruttoptimeringsalgoritmer
skräddarsydda för specifika MCS-applikationer. Även om vi förlitar oss på heuristiska lösningar och algoritmer för NP-svåra ruttproblem förlitar vi oss på äkta applikationer med syftet att visa på fördelarna med algoritm- och infrastrukturförslagen.La movilidad urbana es considerada una de las principales desencadenantes de un desarrollo urbano sostenible. Sin embargo, hoy en día se requiere una transición hacia un transporte urbano más limpio y más eficiente que soporte una concentración de recursos sociales y económicos cada vez mayor en las ciudades. Una de las principales prioridades para las ciudades de todo el mundo es facilitar la movilidad de los ciudadanos dentro de los entornos urbanos, al mismo tiempo que se reduce la congestión, los accidentes y la contaminación. Sin embargo, desarrollar una movilidad urbana más eficiente y más verde (o en una palabra, más inteligente) es uno de los temas más difíciles de afrontar para las grandes áreas metropolitanas. En esta tesis, abordamos este problema desde la perspectiva de un panorama TIC en rápida evolución que nos permite construir movilidad sin la necesidad de grandes inversiones ni sofisticadas tecnologías de sensores. En particular, proponemos aprovechar el paradigma Mobile Crowdsensing (MCS) en el que los ciudadanos utilizan sus teléfonos móviles y dispositivos, para nosotros recopilar, procesar y analizar localmente información georreferenciada, distribuida voluntariamente. Los datos de movilidad recopilados de ciudadanos que voluntariamente quieren compartirlos (por ejemplo, eventos, intensidad del tráfico, ruido y contaminación del aire, etc.) pueden proporcionar información valiosa sobre las condiciones de movilidad actuales en la ciudad, que con el algoritmo de procesamiento de datos adecuado, pueden utilizarse para enrutar y gestionar el flujo de gente en entornos urbanos. Por lo tanto, en esta tesis combinamos dos prometedoras fuentes de movilidad inteligente: MCS y la planificación de viajes/rutas, uniendo en cierta medida los distintos desafíos de investigación. Hemos dividido nuestros objetivos de investigación en dos etapas: (1) Desafíos arquitectónicos en el diseño de sistemas MCS y (2) Desafíos algorítmicos en la planificación de rutas aprovechando la información del MCS. Nuestro objetivo es demostrar una progresión lógica de la investigación a lo largo del tiempo, comenzando desde los fundamentos de los sistemas de detección centrados en personas, como el MCS, hasta los algoritmos de optimización de rutas diseñados específicamente para la aplicación de estos. Si bien nos centramos en algoritmos y heurísticas para resolver problemas de enrutamiento de clase NP-hard, utilizamos ejemplos de aplicaciones en el mundo real para mostrar las ventajas de los algoritmos e infraestructuras propuestas
Using mobility and exception handling to achieve mobile agents that survive server crash failures
Mobile agent technology, when designed and used effectively, can minimize bandwidth consumption and autonomously provide a snapshot of the current context of a distributed system. Protecting mobile agents from server crashes is a challenging issue, since developers normally have no control over remote servers. Server crash failures can leave replicas, instable storage, unavailable for an unknown time period. Furthermore, few systems have considered the need for using a fault tolerant protocol among a group of collaborating mobile agents. This thesis uses exception handling to protect mobile agents from server crash failures. An exception model is proposed for mobile agents and two exception handler designs are investigated. The first exists at the server that created the mobile agent and uses a timeout mechanism. The second, the mobile shadow scheme, migrates with the mobile agent and operates at the previous server visited by the mobile agent. A case study application has been developed to compare the performance of the two exception handler designs. Performance results demonstrate that although the second design is slower it offers the smaller trip time when handling a server crash. Furthermore, no modification of the server environment is necessary. This thesis shows that the mobile shadow exception handling scheme reduces complexity for a group of mobile agents to survive server crashes. The scheme deploys a replica that monitors the server occupied by the master, at each stage of the itinerary. The replica exists at the previous server visited in the itinerary. Consequently, each group member is a single fault tolerant entity with respect to server crash failures. Other schemes introduce greater complexity and performance overheads since, for each stage of the itinerary, a group of replicas is sent to servers that offer an equivalent service. In addition, future research is established for fault tolerance in groups of collaborating mobile agents
Recommended from our members
VoyageWithUs : a recommender platform that enhances group travel planning
Group travel planning poses unique challenges such as choosing hotels, restaurants and venues while catering to everyone’s wants and needs, or sharing trip itineraries and artifacts among trip participants. State of the art travel planning applications such as Yelp and TripAdvisor, while integrating with social networks and making recommendations, don’t offer recommendations for specific groups of travelers. On the other hand, while TripCase offers trip planning capabilities and email sharing, it doesn’t offer a full interactive travel planner that allows groups to contribute to the travel planning process. This report proposes an approach to making personalized group travel recommendations based on hybrid recommendation techniques that aggregates individual recommendations to find common ground between trip participants. This is achieved by designing a recommender system that uses data from a location based social network(LBSN) and makes recommendations based on the trip location, then refines them by applying incremental filters which are responsible for incorporating user preferences, similarity to other users and user context. Finally, it takes the generated recommendations for each trip participant and ranks them such that the items most highly ranked are the ones most likely to fit everyone’s preferences. The rationale for choosing a hybrid recommender system is to address common issues such as the cold start problem, where the quality of the recommendations is affected by either too few reviewers for a certain point of interest(POI) or too few reviews generated by trip participants. These issues, along with a coverage of related work is detailed in the first part of this report. In order to make the applicability of the recommender more tangible, I integrated it into a proof of concept mobile application that also allows travelers to collaborate and share travel planning artifacts, and generates itineraries based on the recommendations made. The recommender accuracy was measured against recommendations made by state of the art applications, while individual filters were evaluated using commonly used metrics. The recommender was tested in a series of relevant scenarios proving the effectiveness of the approach in making group travel recommendations, versus individual recommendations generated by other applications.Electrical and Computer Engineerin
Simulation-based Validation for Autonomous Driving Systems
Simulation is essential to validate autonomous driving systems. However, a
simple simulation, even for an extremely high number of simulated miles or
hours, is not sufficient. We need well-founded criteria showing that simulation
does indeed cover a large fraction of the relevant real-world situations. In
addition, the validation must concern not only incidents, but also the
detection of any type of potentially dangerous situation, such as traffic
violations.
We investigate a rigorous simulation and testing-based validation method for
autonomous driving systems that integrates an existing industrial simulator and
a formally defined testing environment. The environment includes a scenario
generator that drives the simulation process and a monitor that checks at
runtime the observed behavior of the system against a set of system properties
to be validated. The validation method consists in extracting from the
simulator a semantic model of the simulated system including a metric graph,
which is a mathematical model of the environment in which the vehicles of the
system evolve. The monitor can verify properties formalized in a first-order
linear temporal logic and provide diagnostics explaining their non
satisfaction. Instead of exploring the system behavior randomly as many
simulators do, we propose a method to systematically generate sets of scenarios
that cover potentially risky situations, especially for different types of
junctions where specific traffic rules must be respected. We show that the
systematic exploration of risky situations has uncovered many flaws in the real
simulator that would have been very difficult to discover by a random
exploration process
Energy-Constrained Delivery of Goods with Drones Under Varying Wind Conditions
In this paper, we study the feasibility of sending drones to deliver goods
from a depot to a customer by solving what we call the Mission-Feasibility
Problem (MFP). Due to payload constraints, the drone can serve only one
customer at a time. To this end, we propose a novel framework based on
time-dependent cost graphs to properly model the MFP and tackle the delivery
dynamics. When the drone moves in the delivery area, the global wind may change
thereby affecting the drone's energy consumption, which in turn can increase or
decrease. This issue is addressed by designing three algorithms, namely: (i)
compute the route of minimum energy once, at the beginning of the mission, (ii)
dynamically reconsider the most convenient trip towards the destination, and
(iii) dynamically select only the best local choice. We evaluate the
performance of our algorithms on both synthetic and real-world data. The
changes in the drone's energy consumption are reflected by changes in the cost
of the edges of the graphs. The algorithms receive the new costs every time the
drone flies over a new vertex, and they have no full knowledge in advance of
the weights. We compare them in terms of the percentage of missions that are
completed with success (the drone delivers the goods and comes back to the
depot), with delivered (the drone delivers the goods but cannot come back to
the depot), and with failure (the drone neither delivers the goods nor comes
back to the depot).Comment: typo author's nam
- …