Incremental Distributed Learning with JavaScript Agents for Earthquake and Disaster Monitoring

Smart mobile devices are fundamental date sources for crowd activity tracing. Large-scale mobile networks and the Internet-of-Things (IoT) expand and become part of perva-sive and ubiquitous computing offering distributed and trans-parent services. With the IoT, Crowd Sensing is extended by Things Sensing, creating heterogeneous smart environments. A unified and common data processing and communication methodology is required so that the IoT, mobile networks, and Cloud-based environments seamlessly integrate, which can be fulfilled by self-organizing mobile agents, discussed in this work. Currently, portability, resource constraints, security, and scalability of Agent Processing Platforms (APP) are essen-tial issues for the deployment of Multi-agent Systems (MAS) in highly heterogeneous networks. Beside the operational aspects of MAS, an organizational structure is required for the deployment of MAS in crowd sensing and social mining applications. The Planetary Nervous system (Nervousnet) consists of virtual sensors building the core functionality for such applica-tions running on smart phones with a Cloud-like architecture. The virtual sensors enable a holistic composition and modelling approach. Self-organizing and adaptive mobile agents are well known as the core cells of holistic and modular systems. In this work, both concepts are combined. JavaScript agents are introduced as virtual sensors in the Nervousnet environment, evaluated with a simulation of a distributed sensor fusion use-case in a mobile network based on real-world data from Nerv-ousnet, showing the suitability of the hybrid approach, benefit-ing from local and event-based sensor processing performed by the MAS.

In country like India the electricity board to read the meter readings from remote energy meters uses human agents. To overcome the disadvantage of using human agents, our initial works proposed mobile agents for accessing the remote energy meters from the electricity board .But with a single mobile agent, problems like load, lack of memory space and improper communication with clients cannot be solved. Now we developed a multi-agent system (MAS) which interconnects separately developed mobile agents, thus enabling the function beyond the capabilities of any singular mobile agent in the system. Every agent is allotted to a specific remote zone to perform a particular task. By using MAS, load balancing, delay in propagation time was reduced. When the work is extended for large area, the number of multiple agents required to do the process increases, which in turn will lead to more traffic and congestion while the agents report to the server. To overcome this congestion and traffic we have come up with an innovative idea of intelligent congestion avoidance and controlling software using multiple mobile agents technology for remote energy metering. The work will mainly involves the design of signaling agent; congestion controlling mobile agent and data capturing mobile agents . The web logic server (J2EE) will be used for developing server software, clients software, signaling agent, congestion controlling mobile agent and data capturing mobile agent programs as it is platform independent, and provides large number of application packages to develop distributed networking applications effectively and efficiently.

Developing A Multi-Agent System in JADE for Information Management in Educational Competence Domains

Mobile agents' paradigm is increasingly being used on the global Internet, distributed systems and ambient intelligence environment. Indeed, they can provide many advantages to the development of dynamic applications. More recently, mobile agent paradigm is of the best prevalent alternatives bringing most of suitable characteristics of pervasive environments, where people are surrounded by intelligent interfaces merged in daily life objects. Yet, the success of dynamic environment based mobile agents and multi agent systems will depend on how secure it can be made. Certainly, their use poses many security threats, because they are exposed to different malicious hosts' and nodes attacks. The aim of this paper is to propose CAPMA, Clone agent to protect mobile agents. The approach is based on adaptability concept and a clone agent, which is a prototype of the mobile agent with no critical code and sensitive data. The idea minimizes damages on the mobile agent.

Nowadays, the efficiency of multiagent systems in wireless sensor networks prompts the researchers to use these emerging mobile software packets in different simulated approaches or real-world applications. Heterogeneous and distributed wireless sensor networks could be integrated with the multiagent systems to map the real-world challenges into the artificial intelligence world. The multiagent systems have been applied from simulated approaches like object detection/tracking, healthcare, control/assistant, and security systems to real-world applications, including medical/human-care systems and unmanned aerial vehicles. Furthermore, the integration of wireless sensor networks with multiagent systems have emerged novel application, which is known as mobile robots. However, the extensive use of mobile agents in wireless sensor networks has posed different challenges for researchers, including security, resource, and timing limitation. In this work, we review recent simulated approaches and real-world applications of multiagent systems in wireless sensor networks, in which a set of common factors about the things that have been studied are extracted and compared to analyze the performance of mobile agent–based systems in the wireless sensor networks, as well. This analysis provides new research directions about multiagent systems in wireless sensor networks for interested researchers. Finally, a novel framework for dealing with the challenges of multiagent-based applications in the wireless sensor networks which have been mentioned is suggested.

Performance analysis of multi–agent system can be done by experiments with real system, simulation or analytic methods. Now, multi–agent technologies, e.g., (Deloach et al., 2001; JADE), are often based on Unified Modeling Lanuage (UML) (Booch et al., 1999; UML, 2007) or its modifications. The following analytical approaches: queuing network models (Kahkipuro, 1999), stochastic automata networks (Steward et al., 1995), stochastic Petri nets (King & Pooley, 1999), stochastic process algebra (Pooley, 1999), Markov chains can be used in performance evaluation of multi–agent systems. In this chapter, an analytical approach, which is based on Petri nets, is developed. This approach is applied to performance evaluation of layered multi–agent system. These layers are associated with the following types of agents: manager, bidder, and searcher ones. Time–out mechanisms are used in communication between agents. Our method is based on approximation using Erlang distribution. Erlang distributions create the family of distributions with different number of stages. In the paper (Babczynski & Magott, 2006a), an approximation method which is based on Erlang distribution has been applied for the above layered multi–agent system. In that paper, there was no bounds for time of waiting for messages from the agents. In present chapter, time–out mechanisms are used in communication between the agents. The chapter is an extension of the paper (Babczynski & Magott, 2006b) where PERT based approach was presented. Accuracy of our approximation method is verified using simulator. This simulator has been previously used in simulation experiments with the following multi–agent systems: personalized information system (Babczynski et al., 2004a), industrial system (Babczynski et al., 2004b), system with static agents and system with mobile agent (Babczynski et al., 2005). These systems have been expressed in standard FIPA (FIPA) which the JADE technology (JADE) is complied with. The chapter is organized as follows. In section 2, the multi–agent system is described. Then our approximation method is presented. In section 4, accuracy of our approximation method is verified by comparison with simulation results. Finally, there are conclusions.

A multi-agent system (MAS) is a system in which there is a cooperation of autonomous entities called 'agents', with intelligent behaviour, and have the power to coordinate their goals and action plans to solve a problem or achieve an objective. They are widely applied in telecommunications and e-commerce. In this paper we investigate the security of the distributed mobile agents' system. We also discuss the problem of availability of a mobile agent while exposing an overview about the DDoS which is the major attack that threatens the availability in a system. Furthermore, we establish a method to guarantee the confidentiality and secure mobility of a mobile agent during its migration in a distributed system by combining the principle of serialisation and cryptography.

Handheld devices, while growing rapidly, are inherently constrained and lack the capability of executing resource hungry applications. This paper presents the design and implementation of distributed analysis and load-balancing system for hand-held devices using multi-agents system. This system enables low resource mobile handheld devices to act as potential clients for Grid enabled applications and analysis environments. We propose a system, in which mobile agents will transport, schedule, execute and return results for heavy computational jobs submitted by handheld devices. Moreover, in this way, our system provides high throughput computing environment for hand-held devices.

. This paper analyzes the performance differences between static and mobile multiagent systems. To do so, we developed solutions to a distributed text search problem, each using a different approach to multiagent systems (static versus mobile) on an isolated test network. Changes were then made to the agent environment, various constraints applied, and the resulting effect on the systems measured. Each system was evaluated using a number of performance metrics to demonstrate the strengths and weaknesses of the respective approach. Key Words: Multiagent Systems, Mobile Agents, Static Agents 1.

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.

In this paper, we propose an evacuation support system that provides evacuation routes in case of disasters, and verify the usefulness of the system. Current popular wireless communication infrastructure is supported by a series of base stations and one base station handles a lot of communication. Therefore, when communication base stations break down due to disasters such as an earthquake, it may become difficult for people to use their smartphones based on the Internet. When the communication infrastructure is paralyzed, people will have great difficulty collecting information about the conditions of transportation systems and about the safety of family and friends using smartphones. Our proposed system addresses this problem by using multiple kinds of mobile agents in addition to static agents on smartphones that use a mobile ad hoc network (MANET). The proposed system collects information with mobile agents and diffuses information via mobile agents so that the system is able to provide an optimized evacuation route for each user in a dynamically changing disaster environment. In this paper, we extend our previously proposed evacuation support system to consider elevation information when constructing evacuation routes. When a tsunami or a flood tide occurs, low elevations may be under water. Therefore, this revised evacuation support system helps people to move to safer places by selecting higher elevation routes when warranted by the situation.

In this paper, we propose an extension of an evacuation support system that we have previously proposed (Taga, 2018). The system suggests evacuation routes in cases of disasters. We have confirmed the usefulness of the system. When a disaster occurs, we anticipate that the current popular wireless communication based on the Internet may not be very reliable. In order to accommodate such a problem, our proposed system employs multiple mobile agents and static agents on smartphones that use a mobile ad hoc network (MANET). The proposed system collects information by mobile agents as well as diffuses information by mobile agents so that the system provides an optimal evacuation route for each user in a dynamically changing disaster environment. In simulations, our system successfully guides evacuation users to safe areas. The system, however, does not consider the altitude of the evacuation routes. Therefore, the system may not be very useful in cases of flood. When a tsunami or a flood tide occurs, low altitude location may be under water. Therefore, evacuees need to move along high altitude routes. In this paper, we also take account of the altitude information for constructing evacuation routes.

According to the exponential growth of services available on large distributed networks, transport customers require relevant, interactive and instantaneous information during their travels. Thus, we designed and implemented a multi-agent information system (MIS) using the mobile agents. However, some network errors can occur during the moving of mobile. So, we define a negotiation ontology protocol where we incorporated architecture for negotiation process with an ontology-based knowledge management system (NOKMS) to facilitate, to automate the communications and to solve the problem of language interoperability between negotiation agents. Finally, we detailed the reassignment process by using dynamic reassigned tasks (DRT) algorithm. Our goal is to give users all needed information even if some information providers are no longer available. Thus we improve the quality of services (QoS) of the response time with the reasonable cost.

The paper deals with the consensus convergence analysis of discrete-time single-integrator multi-agent systems (MASs) in switching networks. Here, we suppose that the switching network is composed of strongly connected digraphs. By adopting a time-varying quadratic Lyapunov function, we give the rigorous proof that the consensus of the single-integrator MASs can be achieved by either a constant-gain protocol or a decaying-gain protocol. This Lyapunov function based consensus analysis method is different from some existed ones for unbalanced switching networks (e.g., the property of products of indecomposable and aperiodic matrices) and provides a new perspective to study the consensus problem of MASs in unbalanced switching networks with uncertainties (e.g., additive noises).

In recent years, there have been an increasing number of achievements dealing with the control of agent formations (Olfati-Saber, 2006; Tanner & Jadbabaie, 2007; Fax & Murray, 2004; Jadbabaie et al., 2003; Lin et al., 2004; Olfati-Saber & Murray, 2004). The formation control of multiple moving agents has emerged as a topic of widespread interest due to its broad range of applications in military missions, environmental surveying, and space missions. Multiple mobile autonomous agents coupled with each other through interactions can generate certain ordered behaviors, such as aggregation, cohesion, alignment, rotation and synchronization (Fax & Murray, 2004; Jadbabaie et al., 2003; Lin et al., 2004; Olfati-Saber & Murray, 2004). Among the typical approaches to formation control, distributed control strategies have aroused researchers’ outstanding attention because there is no centralized supervisor and only a little sense of communication information is needed. Recently, there has been a tendency to deal with the formation control as a consensus problem. In the multiagent systems, consensus means to reach an agreement by means of an interaction rule that specifies the information exchange between an agent and its neighbors (Fax & Murray, 2004; Jadbabaie et al., 2003; Lin et al., 2004; Olfati-Saber & Murray, 2004). Fax & Murry (Fax & Murray, 2004) analyzed the stability of the formation control with first-order consensus protocols based on the graph Laplacian. Jadbabaie et al. (Jadbabaie et al., 2003) demonstrated the results of the alignment problem which is concerned with reaching an agreement without computing any objective functions. Lin et al. (Lin et al., 2004) studied three formation strategies for groups of mobile autonomous agents with local communication topology. Moreover, by using a Lyapunov-based approach, Olfati-Saber & Murry (Olfati-Saber & Murray, 2004) solved the consensus problems in networks of agents with directed interconnection graphs and time delays. The key idea involved in nonlinear formation control is to preserve the inter-agent distances from decaying to zero during the motion for the purpose of collision avoidance. In the formation control, tracking control problems of multi-agent systems are studied increasingly, and many results have been obtained with nearest neighbor-based rule (Hong et al., 2006; Anderson et al., 2007; Chen & Tian, 2009). Hong et al. (Hong et al., 2006)