To see the other types of publications on this topic, follow the link: Mobile agents.
Dissertations / Theses on the topic 'Mobile agents'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Mobile agents.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Vanzan, Alessio <1993>. "Mobile Agents Rendezvous in Networks Despite a Malicious Agent." Master's Degree Thesis, Università Ca' Foscari Venezia, 2017. http://hdl.handle.net/10579/10604.
Full textAbstract:
The use of mobile agents, i.e., autonomous software entities , finds its
application in many settings such as Network Maintenance, Electronic commerce
and Intelligent search.
Given a network, we have a set of mobile agents that moves from node to node
in order to achieve a common task. Security is an important issue that can
arise in such environment and that has been widely studied in literature.
In particular, it is important to study the problem of having a host or an
agent that hinders or harms the honest agents in their tasks.
In this thesis we consider a scenario in which one of the mobile agents may
behave maliciously and thus act in order to prevent the other agents to complete
their goal. We study the Rendezvous problem,i.e.,
the problem of gathering a set of mobile agents at a single node of a network, starting from a
initial scattered configuration and despite the presence of a Malicious agent, and in particular, we propose a novel solution in the bidirectional hypercube network.
2
Tajer, Jean. "Detection of malicious hosts against agents in Mobile Agent networks." Thesis, University of Portsmouth, 2018. https://researchportal.port.ac.uk/portal/en/theses/detection-of-malicious-hosts-against-agents-in-mobile-agent-networks(beca3871-a989-4137-9a4d-13c88d8893d9).html.
Full textAbstract:
Over the last decade, networks have become increasingly advanced in terms of size, complexity and the level of heterogeneity, due to increase of number of users, devices and implementation of cloud among big enterprises and developing smart cities. As networks become more complicated, the existing client-server paradigm suffers from problems such as delay, jitter, bad quality of service, insufficient scalability, availability and flexibility. The appearance of mobile agents' technology is getting popular as means for an efficient way to access remote resources on computer networks. Mobile Agent- systems usually benefit from the following: asynchronous execution, dynamic adaptation, fault-tolerance improvement in network latency, protocol encapsulation, reduction in network load and robustness. However, one of the major technical obstacles to a wider acceptance of the mobile agent is security which is the modus operandi to protect the mobile agents against malicious hosts. This work proposes how the Mobile Agents (MA), supported by a new solid models (detection and protection), can present a new way of securing mobile agents against malicious hosts. The work contributes in proposing a new computing model for protection against malicious hosts. This model is based on trust, which is a combination of two kinds of trust: policy enforcement and control and punishment. The originality of this model is the introduction of the concept of setting up an active storage element in the agent space, called as "home away from home", for partial result storage and separation as well as digital signing of the destination of the mobile agent. An efficient flooding detection scheme is developed by integrating the sketch technique with the Divergence Measures (Hellinger Distance, Chi-Square and Power Divergences). This type of integration can be considered unique in comparison with existing solutions over a Mobile Agent network. The sketch data- structure summarizes the mobile agent's process of calls generating into a fixed set of data for developing a probability model. The Divergence Measures techniques, combined with a Mobile Agent traffic, efficiently identifies attacks, by monitoring the distance between current traffic distribution and the estimated distribution, based on history information. Compared to the previous detection system and existing works, the proposed techniques achieve the advantages of higher accuracy and flexibility, to deal with low intensity attacks and the ability to track the period of attack. Simulation results are presented to demonstrate the performance of the proposed detection model. This work achieves in outperforming the existing detection solutions by tuning the Divergence Measures. An evaluation of the scheme is done via the receiver-operating characteristic (ROC). The work achieves in outperforming the existing detection solutions by tuning the Power Divergence with a value of β=2.2. With this value of β, the detection scheme leads to a very attractive performance in terms of True Positive Rate (100%), False Positive Rate (3.8%) and is capable of detecting low intensity attacks. Moreover, the Power Divergence with β=2.2 presents a better detection accuracy of 98.1% in comparison with Hellinger Distance (60%) and Chi-square (80%). Since the scenarios in consideration in this work can be reasonably related to any type of network, the strength of the proposed model can alternatively be applied to any enterprise network.
3
Braun, Oliver. "Constructing mobile agents using transformations." [S.l.] : [s.n.], 2004. http://137.193.200.177/ediss/braun-oliver/meta.html.
Full text
4
Burvall, Niklas. "Contact Center with Mobile Agents." Thesis, Uppsala University, Department of Information Technology, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-98322.
Full textAbstract:
A Contact Center assists a company with customer relations such as support and telemarketing using telephones but also with email, SMS and chat. Incoming calls are routed by the contact center to the best match according to the polices set up and the queue status. In a contact center context the person handling the calls is called an agent. It would be beneficial to be able to reach agents which are not at the contact center but at home or in the field.
This master thesis investigates how such a mobile agent can be connected to acontact center with respect to security, handling more than just voice interactions (i.e. chat and email) and requirements on network infrastructure from a mobile perspective. A prototype client is developed using Java ME connecting to a Genesys contact center, describing the requirements a client has on network, mobile device and security. The results show that eventhough a mobile agent is possible using todays technologies, some features still need to be added to the mobile phones API, such as better call control and keeping focus during incoming calls.
5
Ma, Haiqing. "Network management by mobile agents." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ35073.pdf.
Full text
6
Abbas, Shehla. "Distributed calculations using mobile agents." Thesis, Bordeaux 1, 2008. http://www.theses.fr/2008BOR13716/document.
Full textAbstract:
Cette thèse traite l’utilisation des agents mobiles dans le domaine des algo- rithmes distribués en les déplaçant de manière aléatoire dans le réseau. Initialement k agents mobiles ayant les identités uniques sont placés dans le réseau. On décrit un algorithme distribué pour calculer un arbre couvrant dans les réseaux dynamiques en utilisant les agents mobiles. Les agents marquent les noeuds sur les quelles ils arrivent. Ils utilisent deux techniques di?érentes : le clonage dans lequel un agent crée son propre clone pour faire quelques tâches et le marquage sur la tableau de bord (un espace mémoire sur les noeuds). Ces techniques sont utilisés dans les applications comme l’arbre couvrant, le rassemblement et la collecte d’information. Chacun des agents détient une information partielle. Quand deux ou plusieurs agents se rencontrent sur un noeud, ils fusionnent en un seul agent. On s’intéresse alors au temps nécessaire ou tous les k agents fusionnent en un seul et unique agent. On présent une chaîne de Markov pour le comportement des agents, et on montre comment on peut utiliser cette technique pour calculer la bourne supérieur. On étudie le même problème quand les agents mobile commencent la marche aléatoire sous un régime stationnaire. On a aussi étudié le problème de Handshake et on l’a analysé en utilisant les agents mobilesThis thesis deals with the use of mobile agents in distributed algorithms by performing random walks in the network. k mobile agents having unique identities are placed initially in a network. We describe a distributed algorithm for computing spanning trees in dynamic networks by using mobile agents. The agents mark the nodes on which they arrive. They use two di?erent techniques. In one problem they use the cloning in which an agent creates its own clone to do some task assigned. In the second, the mobile agents mark on the whiteboard (a memory location on the nodes). These techniques are used in applications such as spanning tree, gathering and collecting information. The mobile agents have limited knowledge and hence, they are not intelligent and do not have computational capabilities. When two or more agents meet at a node of the underlying graph, they merge into a single agent. The parameter of interest is the expected time for all the agents to merge into a single agent. We present a Markov chain, modelling the agents behavior, and show how this can be used to upper bound the expected time for all the k agents to merge into a single agent. We study the same problem when the mobile agents start their walk directly under stationary regime. Handshake problem is also studied and analyzed using mobile agents
7
Baumann, Joachim. "Control algorithms for mobile agents." [S.l.] : Universität Stuttgart , Fakultät Informatik, 1999. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB8536753.
Full text
8
Tufekcioglu, Refik. "Communication models in mobile computing systems and mobile agents." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2000. http://handle.dtic.mil/100.2/ADA378775.
Full textAbstract:
Thesis (M.S. in Computer Science) Naval Postgraduate School, March 2000.Thesis advisor(s): Michael, James B. "March 2000." Includes bibliographical references (p. 131-137). Also available in print.
9
Bouchard, Sébastien. "On the Deterministic Gathering of Mobile Agents." Electronic Thesis or Diss., Sorbonne université, 2019. http://www.theses.fr/2019SORUS175.
Full textAbstract:
Les systèmes distribués sont un modèle théorique capable de représenter une multitude de systèmes bâtis autour de la coopération d'entités autonomes dans le but d'accomplir une tâche commune. Leur champ applicatif est immense, et s'étend de l'informatique ou de la robotique, en modélisant des processus partageant la mémoire d'un ordinateur, des ordinateurs communiquant par envois de messages, ou encore des cohortes de robots, à la compréhension du comportement des animaux sociaux. Les agents mobiles font partie des entités étudiées dans ce domaine. Ils se distinguent des autres notamment par leur capacité à se déplacer spontanément. L'une des tâches les plus étudiées les mettant en scène est celle du rassemblement. Les agents mobiles sont dispersés dans un environnement inconnu. Aucun d'eux n'a d'informations à propos des autres, ou la capacité de communiquer avec eux, à moins de se trouver au même endroit. Chacun d'eux découvre peu à peu les environs, rencontre d'autres agents et se coordonne avec eux jusqu'à ce que tous soient rassemblés et le détectent. Une fois tous les agents rassemblés, ils peuvent communiquer et se coordonner pour une autre tâche. Cette thèse s'intéresse à la faisabilité et à l'efficience du rassemblement, en particulier face à deux difficultés majeures: l'asynchronie et l'occurrence de fautes Byzantines. Dans un contexte asynchrone, les agents n'ont aucun contrôle sur leur vitesse, qui peut varier arbitrairement et indépendamment des autres. Se coordonner est alors un défi. Quand une partie des agents subit des fautes Byzantines, on peut considérer ces agents comme malicieux, se fondant parmi les autres (bons) agents pour les induire en erreur et empêcher que le rassemblement ait lieuDistributed systems are a theoretical model with a huge application field. It can represent a multitude of systems in which several autonomous entities cooperate to achieve a common task. The applications range from computer science related ones like processes sharing memory inside a computer, computers exchanging messages, and cohorts of robots to understanding social animals behavior. When the entities involved are able to move spontaneously, they are called mobile agents, and one of the most studied problems regarding mobile agents is gathering. The mobile agents are spread in an unknown environment, with no a priori information about the others and without the ability to communicate with other agents, unless colocated. Each of them gradually discovers its surroundings, meets some other agents, coordinates with them, until all agents are gathered and detect it. Once all agents gathered, they can communicate and coordinate for some future task. This thesis addresses the feasibility and complexity of gathering, in particular when facing two major difficulties: asynchrony and occurrence of Byzantine faults. When tackling the former, the agents have no control over their speed, which can vary arbitrarily and independently from each other. This makes coordination more challenging. When facing the latter, some of the agents are Byzantine, they can be viewed as malicious and using the difficulty to distinguish them from other (good) agents to try to prevent the gathering
10
Shibli, Muhammad Awais. "Building Secure Systems using Mobile Agents." Thesis, KTH, Computer and Systems Sciences, DSV, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4622.
Full textAbstract:
The progress in the field of computer networks and Internet is increasing with tremendous volume in recent years. This raises important issue with regards to security. Several solutions emerged in the past which provide security at host or network level. These traditional solutions like antivirus, firewall, spy-ware, and authentication mechanisms provide security to some extends, but they still face the challenge of inherent system flaws, OS bugs and social engineering attacks. Recently, some interesting solution emerged like Intrusion Detection and Prevention systems, but these too have some problems, like detecting and responding in real time, because they mostly require inputs from system administrator. Optimistically, we have succeeded in protecting the hosts to some extent by applying the reactive approach, such as antivirus, firewall and intrusion detection and response systems, But, if we critically analyze this approach, we will reach the conclusion that it has inherent flaws, since the number of penetrations, Internet crime cases, identity and financial data thefts, etc. are rising exponentially in recent years. The main reason is that we are using only reactive approach, i.e. protection system is activated only when some security breach occurs. Secondly, current techniques try to fix the overall huge problem of security using only small remedies (firewall, antivirus and intrusion detection and preventions system) – “point solutions”. Therefore, there is a need to develop a strategy using Mobile Agents in order to operate in reactive and proactive manners, what requires providing security on the principle of defense in depth. So, that ultimate goal of securing a system as a whole can be achieved. System is assumed to be secure if unauthorized access (penetrations) is not possible and system is safe against damages. This strategy will include three aspects: (a) autonomously detect vulnerabilities on different hosts (in a distributed network) before an attacker can exploit (b) protect hosts by detecting attempts of intrusions and responding to them in real time; and finally (c) perform tasks related to security management.
11
Sun, Kuan Ieong. "The secure wireless mobile agents system." Thesis, University of Macau, 2003. http://umaclib3.umac.mo/record=b1447897.
Full text
12
Shibli, Awais. "Security Infrastructure and Applicationsfor Mobile Agents." Doctoral thesis, KTH, Data- och systemvetenskap, DSV, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-12764.
Full textAbstract:
Research areas of this dissertation are security for mobile agents, for applications based on mobile agents, and for distributed network environments in which mobile agents execute. Mobile agents paradigm has captured researchers’ and industry’s interests long time ago because of its innovative capabilities and attractive applications. The ability of mobile agents to autonomously migrate from host to host, transferring their code and internal state, enables them to accomplish tasks in network and distributed environments more conveniently, robustly, and efficiently than traditional client-server applications. But, in spite of significant benefits of the mobile agent paradigm, the technology is still mainly in a research domain and so far it has not been adopted on a large scale by the industry and users. One of the reasons for that is security related issues and security concerns. Current research in the area of mobile agents’ security is focused mainly on protection and security of agents and agents’ runtime platforms. But most of the currently available mobile agent systems do not support comprehensive security requirements for a general mobile agents paradigm. Therefore, there is a need for a complete and comprehensive security infrastructure for mobile agents, not only in the form of security services and mechanisms for agents’ runtime execution, but also as a complete set of infrastructural components, along with methodology for creation, classification, adoption, and validation of mobile agents before their deployment in real-environments. In addition, protection of mobile agents code and their baggage during execution is also needed. The lack of such concept, infrastructure and security solutions is hindrance for wider adoption of mobile agent systems at the time of this research. In our research, we solve these comprehensive requirements with solutions that can be classified in two groups: The first group is solutions for designing, implementation and deployment of a security infrastructure for mobile agents, along with methodology for secure deployment and execution of mobile agents. The proposed infrastructure for mobile agents is based on a methodology for creation, classification and validation of trusted mobile agents. It includes security architecture for publishing, discovery and adoption of mobile agents. Moreover, it provides integrated system for mobile agent deployment that supports launching, authorization and execution of mobile agents. Mobile agents execution is based on a protective approach, as compared to traditional detective or preventive methods, that not only provides code protection, but code execution and data privacy as well. The second group is solutions for use of security infrastructure and, in particular, secure and trusted mobile agents for real-life applications. The main result in this group is the design and implementation of a network intrusion detection and prevention system based on mobile agents. The system efficiently solves several problems of existing IDS/IPS. It can detect new vulnerabilities before they are exploited by hackers, it can process and filter large volumes of log entries, it reacts to intrusions in real–time, it provides protection against unknown attacks, it supports and improves commercial IDS/IPS products, and it also efficiently handles software patches. The system not only improves use of existing popular IDS/IPS, but it also eliminates several of their core problems. In addition, it is self–protected by full encryption, both of mobile agents and their execution platforms, and therefore not vulnerable to attacks against its own components and resources.QC20100525
13
Wagealla, Waleed. "Reliable mobile agents for distributed computing." Thesis, Nottingham Trent University, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.272441.
Full textAbstract:
The emergence of platform-independent, mobile code technologies has created big opportunities for Internet-based applications. Mobile agents are being utilized to perform a variety of tasks from personalized computing to business-critical transactions. Unfortunately, these advances were not matched by correspondent research into the reliability of these new technologies. This work has been undertaken to investigate the faulttolerance of this new paradigm. Agent programs' mobility and autonomy of execution has introduced a new class of failures different to that of traditional distributed systems. Therefore, fault tolerance is one of the main problems that must be resolved to improve the adoption of an agents' paradigm. The investigation of mobile agents reliability in this thesis resulted in the development of REMA (REliable Mobile Agents), which guarantees the reliable execution, migration, and communication of mobile agents in the presence of faults that might affect the agents hosts or their communication network. We introduced an algorithm for the transparent detection of faults that might affect agent execution, migration, and communication. A decentralized structure was used to divide the agent dynamic distributed system into network-partitioning proof spaces. Lightweight messaging was adopted as the basic error detection engine, which together with the loosely coupled detection managers provided an efficient, low overhead detection mechanism for agent-based distributed processing. The problem of taking checkpoint of agent execution is hampered by the lack of the accessibility of the underlying structure of the JVM. Thus, an alternative solution has been achieved through the REMA Checkpoint and Recovery (REMA-CR) package. REMA-CR provides the developer with powerful classes and methods that allow for capturing the critical data of agents' execution. The developed recovery protocol offers a communication-pairs, independent checkpointing strategy at a low-cost, that covers all possible faults that might invalidate reliable agent execution, migration and communication and maintains the exactly once execution property. The results and the performance of REMA confirmed our objectives of providing a fault tolerant wrapper for agents and their applications with acceptable overhead cost.
14
McInerney, James. "Intelligent agents for mobile location services." Thesis, University of Southampton, 2014. https://eprints.soton.ac.uk/365495/.
Full textAbstract:
Understanding human mobility patterns is a significant research endeavour that has recently received considerable attention. Developing the science to describe and predict how people move from one place to another during their daily lives promises to address a wide range of societal challenges: from predicting the spread of infectious diseases, improving urban planning, to devising effective emergency response strategies. Individuals are also set to benefit from this area of research, as mobile devices will be able to analyse their mobility pattern and offer context-aware assistance and information. For example, a service could warn about travel disruptions before the user is likely to encounter them, or provide recommendations and mobile vouchers for local services that promise to be of high value to the user, based on their predicted future plans. More ambitiously, control systems for home heating and electric vehicle charging could be enhanced with knowledge of when the user will be home. In this thesis, we focus on such anticipatory computing. Some aspects of the vision of context-awareness have been pursued for many years, resulting in mature research in the area of ubiquitous systems. However, the combination of surprisingly rapid adoption of advanced mobile devices by consumers and the broad acceptance of location-based apps has surfaced not only new opportunities, but also a number of pressing challenges. In more detail, these challenges are the (i) prediction of future mobility, (ii) inference of features of human location behaviour, and (iii) use of prediction and inference to make decisions about timely information or control actions. Our research brings together, for the first time, the entire workflow that a mobile location service needs to follow, in order to achieve an understanding of mobile user needs and to act on such understanding effectively. This framing of the problem highlights the shortcomings of existing approaches which we seek to address. In the current literature, prediction is only considered for established users, which implicitly assumes that new users will continue to use an initially inaccurate prediction system long enough for it to improve and increase in accuracy over time. Additionally, inference of user behaviour is mostly concerned with interruptibility, which does not take into account the constructive role of intelligent location services that goes beyond simply avoiding interrupting the user at inopportune times (e.g., in a meeting, or while driving). Finally, no principled decision framework for intelligent location services has been provided that takes into account the results of prediction and inference. To address these shortcomings, we make three main contributions to the state of the art. Firstly, we provide a novel Bayesian model that relates the location behaviour of new and established users, allowing the reuse of structure learnt from rich mobility data. This model shows a factor of 2.4 improvement over the state-of-the-art baseline in heldout data likelihood in experiments using the Nokia Lausanne dataset. Secondly, we give new tools for the analysis and prediction of routine in mobility, which is a latent feature of human behaviour, that informs the service about the user’s availability to follow up on any information provided. And thirdly, we provide a fully worked example of an intelligent mobile location service (a crowdsourced package delivery service) that performs decision-making using predictive densities of current and future user mobility. Simulations using real mobility data from the Orange Ivory Coast dataset indicate a 81.3% improvement in service efficiency when compared with the next best (non-anticipatory) approach.
15
Giansiracusa, Michelangelo Antonio. "A secure infrastructural strategy for safe autonomous mobile agents." Thesis, Queensland University of Technology, 2005. https://eprints.qut.edu.au/16052/1/Michaelangelo_Giansiracusa_Thesis.pdf.
Full textAbstract:
Portable languages and distributed paradigms have driven a wave of new applications and processing models. One of the most promising, certainly from its early marketing, but disappointing (from its limited uptake)is the mobile agent execution and data processing model. Mobile agents are autonomous programs which can move around a heterogeneous network such as the Internet, crossing through a number of different security domains, and perform some work at each visited destination as partial completion of a mission for their agent user.
Despite their promise as a technology and paradigm to drive global electronic services (i.e.any Internet-driven-and-delivered service, not solely e-commerce related activities), their up take on the Internet has been very limited. Chief among the reasons for the paradigm's practical under-achievement is there is no ubiquitous frame work for using Internet mobile agents, and non-trivial security concerns abound for the two major stake holders (mobile agent users and mobile agent platform owners).
While both stake holders have security concerns with the dangers of the mobile agent processing model, most investigators in the field are of the opinion that protecting mobile agents from malicious agent platforms is more problematic than protecting agent platforms from malicious mobile agents. Traditional cryptographic mechanisms are not well-suited to counter the bulk of the threats associated with the mobile agent paradigm due to the untrusted hosting of an agent and its intended autonomous, flexible movement and processing.
In our investigation, we identified that the large majority of the research undertaken on mobile agent security to date has taken a micro-level perspective. By this we mean research focused solely on either of the two major stakeholders, and even then often only on improving measures to address one security issue dear to the stake holder - for example mobile agent privacy (for agent users) or access control to platform resources (for mobile agent platform owners).
We decided to take a more encompassing, higher-level approach in tackling mobile agent security issues. In this endeavour, we developed the beginnings of an infrastructural-approach to not only reduce the security concerns of both major stakeholders, but bring them transparently to a working relationship. Strategic utilisation of both existing distributed system trusted-third parties (TTPs) and novel mobile agent paradigm-specific TTPs are fundamental in the infrastructural framework we have devised.
Besides designing an application and language independent frame work for supporting a large-scale Internet mobile agent network, our Mobile Agent Secure Hub Infrastructure (MASHIn) proposal encompasses support for flexible access control to agent platform resources. A reliable means to track the location and processing times of autonomous Internet mobile agents is discussed, withfault-tolerant handling support to work around unexpected processing delays. Secure,highly-effective (incomparison to existing mechanisms) strategies for providing mobile agent privacy, execution integrity, and stake holder confidence scores were devised - all which fit comfortably within the MASHIn framework. We have deliberately considered the interests - withoutbias -of both stake holders when designing our solutions.
In relation to mobile agent execution integrity, we devised a new criteria for assessing the robustness of existing execution integrity schemes. Whilst none of the existing schemes analysed met a large number of our desired properties for a robust scheme, we identified that the objectives of Hohl's reference states scheme were most admirable - particularly real - time in - mission execution integrity checking. Subsequently, we revised Hohl's reference states protocols to fit in the MASHIn framework, and were able to overcome not only the two major limitations identified in his scheme, but also meet all of our desired properties for a robust execution integrity scheme (given an acceptable decrease in processing effiency).
The MASHIn offers a promising new perspective for future mobile agent security research and indeed a new frame work for enabling safe and autonomous Internet mobile agents. Just as an economy cannot thrive without diligent care given to micro and macro-level issues, we do not see the security prospects of mobile agents (and ultimately the prospects of the mobile agent paradigm) advancing without diligent research on both levels.
16
Giansiracusa, Michelangelo Antonio. "A Secure Infrastructural Strategy for Safe Autonomous Mobile Agents." Queensland University of Technology, 2005. http://eprints.qut.edu.au/16052/.
Full textAbstract:
Portable languages and distributed paradigms have driven a wave of new applications and processing models. One of the most promising, certainly from its early marketing, but disappointing (from its limited uptake)is the mobile agent execution and data processing model. Mobile agents are autonomous programs which can move around a heterogeneous network such as the Internet, crossing through a number of different security domains, and perform some work at each visited destination as partial completion of a mission for their agent user. Despite their promise as a technology and paradigm to drive global electronic services (i.e.any Internet-driven-and-delivered service, not solely e-commerce related activities), their up take on the Internet has been very limited. Chief among the reasons for the paradigm's practical under-achievement is there is no ubiquitous frame work for using Internet mobile agents, and non-trivial security concerns abound for the two major stake holders (mobile agent users and mobile agent platform owners). While both stake holders have security concerns with the dangers of the mobile agent processing model, most investigators in the field are of the opinion that protecting mobile agents from malicious agent platforms is more problematic than protecting agent platforms from malicious mobile agents. Traditional cryptographic mechanisms are not well-suited to counter the bulk of the threats associated with the mobile agent paradigm due to the untrusted hosting of an agent and its intended autonomous, flexible movement and processing. In our investigation, we identified that the large majority of the research undertaken on mobile agent security to date has taken a micro-level perspective. By this we mean research focused solely on either of the two major stakeholders, and even then often only on improving measures to address one security issue dear to the stake holder - for example mobile agent privacy (for agent users) or access control to platform resources (for mobile agent platform owners). We decided to take a more encompassing, higher-level approach in tackling mobile agent security issues. In this endeavour, we developed the beginnings of an infrastructural-approach to not only reduce the security concerns of both major stakeholders, but bring them transparently to a working relationship. Strategic utilisation of both existing distributed system trusted-third parties (TTPs) and novel mobile agent paradigm-specific TTPs are fundamental in the infrastructural framework we have devised. Besides designing an application and language independent frame work for supporting a large-scale Internet mobile agent network, our Mobile Agent Secure Hub Infrastructure (MASHIn) proposal encompasses support for flexible access control to agent platform resources. A reliable means to track the location and processing times of autonomous Internet mobile agents is discussed, withfault-tolerant handling support to work around unexpected processing delays. Secure,highly-effective (incomparison to existing mechanisms) strategies for providing mobile agent privacy, execution integrity, and stake holder confidence scores were devised - all which fit comfortably within the MASHIn framework. We have deliberately considered the interests - withoutbias -of both stake holders when designing our solutions. In relation to mobile agent execution integrity, we devised a new criteria for assessing the robustness of existing execution integrity schemes. Whilst none of the existing schemes analysed met a large number of our desired properties for a robust scheme, we identified that the objectives of Hohl's reference states scheme were most admirable - particularly real - time in - mission execution integrity checking. Subsequently, we revised Hohl's reference states protocols to fit in the MASHIn framework, and were able to overcome not only the two major limitations identified in his scheme, but also meet all of our desired properties for a robust execution integrity scheme (given an acceptable decrease in processing effiency). The MASHIn offers a promising new perspective for future mobile agent security research and indeed a new frame work for enabling safe and autonomous Internet mobile agents. Just as an economy cannot thrive without diligent care given to micro and macro-level issues, we do not see the security prospects of mobile agents (and ultimately the prospects of the mobile agent paradigm) advancing without diligent research on both levels.
17
Tang, Zhijun. "Information-theoretic management of mobile sensor agents." Connect to resource, 2005. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1126882086.
Full textAbstract:
Thesis (Ph. D.)--Ohio State University, 2005.Title from first page of PDF file. Document formatted into pages; contains xiii, 170 p.; also includes graphics (some col.). Includes bibliographical references (p. 162-170). Available online via OhioLINK's ETD Center
18
Miller, Paul Sheridan Mikler Armin. "Automated syndromic surveillance using intelligent mobile agents." [Denton, Tex.] : University of North Texas, 2007. http://digital.library.unt.edu/permalink/meta-dc-5141.
Full text
19
Hanumantha, Rao Karthik. "Dynamic configuration management using mobile intelligent agents." Thesis, Wichita State University, 2009. http://hdl.handle.net/10057/2430.
Full textAbstract:
With the increasing complexity of Aircraft Data Network the need for configuration
management has become a necessity as the tolerance level is absolutely minimal. It is also
known that most of the network faults are due to invalid configurations on the network devices.
As fault detection plays a vital role in detecting invalid configurations, configuration
management forms its basis.
The aim of network configuration management is to supervise the network information so
that the changes on networks can be tracked and managed. Also the topology of network can be
better understood with each device’s configured parameters (interface settings, routing protocols
etc).
With the existing web based framework for Aircraft Data Network, we could use it for
configuration management by adding a few more modules. The reason for using web based is
that it can be controlled remotely and its ease of use. And also our web based architecture uses
secure protocols and a centralized database. Mobile agents are used to carry the necessary data to
configure the nodes in the network. The suggested framework would reduce the complexity of
network configuration as well as improve the performance with reduced network time-delays and
information bottlenecks.Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical and Computer Engineering
20
Basha, Nagi Nabil. "Survey and analysis of intelligent mobile agents." Thesis, McGill University, 2002. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=32754.
Full textAbstract:
The notion of mobile agent, a software component that can move autonomously between the different nodes of a network is gaining wide popularity in business and in academia. The term mobile agent was first introduced in 1994. Since then, lots of research has been carried out in various aspects of the newly introduced paradigm. It might even be surprising to know that a recent census reports the existence of more than 70 mobile agent systems. Therefore, there is a need to gather and analyze what has been done so far in this new area.This survey reviews the field of mobile agents by summarizing the key concepts and giving an overview of the most important implementations. Design and implementation issues of mobile agents are analyzed in general. Some of the most important mobile agent systems are presented and discussed. Java's support for mobile agent development is thoroughly examined. In addition, the role of the Common Object Request Broker Architecture (CORBA) as a broker between mobile agents and their environment is also analyzed. Most importantly, a survey of the major security concerns is provided followed by an analysis of the currently available techniques to address these concerns. Last but not least, a detailed analysis of the Foundation for Intelligent Physical Agents (FIPA) standards for interoperability between heterogeneous agents and their hosts is included. This survey will help in understanding the potentials of mobile agents and why they have not caught on. Once progress is made in the areas of security, programming language support for specific mobile agent requirements, and standards for coordination between heterogeneous agents, it is expected that the mobile agent paradigm will dramatically revolutionize the way the Internet is being used now.
21
Seymour, Mark. "Automating Internet auctions with adaptable mobile agents." Thesis, University College London (University of London), 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.313025.
Full text
22
Kalogridis, Georgios. "Preemptive mobile code protection using spy agents." Thesis, Royal Holloway, University of London, 2011. http://repository.royalholloway.ac.uk/items/1863e436-1c99-0cae-8a59-c6bee0c9553e/9/.
Full textAbstract:
This thesis introduces 'spy agents' as a new security paradigm for evaluating trust in remote hosts in mobile code scenarios. In this security paradigm, a spy agent, i.e. a mobile agent which circulates amongst a number of remote hosts, can employ a variety of techniques in order to both appear 'normal' and suggest to a malicious host that it can 'misuse' the agent's data or code without being held accountable. A framework for the operation and deployment of such spy agents is described. Subsequently, a number of aspects of the operation of such agents within this framework are analysed in greater detail. The set of spy agent routes needs to be constructed in a manner that enables hosts to be identified from a set of detectable agent-specific outcomes. The construction of route sets that both reduce the probability of spy agent detection and support identification of the origin of a malicious act is analysed in the context of combinatorial group testing theory. Solutions to the route set design problem are proposed. A number of spy agent application scenarios are introduced and analysed, including: a) the implementation of a mobile code email honeypot system for identifying email privacy infringers, b) the design of sets of agent routes that enable malicious host detection even when hosts collude, and c) the evaluation of the credibility of host classification results in the presence of inconsistent host behaviour. Spy agents can be used in a wide range of applications, and it appears that each application creates challenging new research problems, notably in the design of appropriate agent route sets.
23
Karousatou, Christina. "Distributed algorithms for energy constrained mobile agents." Thesis, Aix-Marseille, 2017. http://www.theses.fr/2017AIXM0373/document.
Full textAbstract:
Dans cette thèse, nous étudions et concevons des algorithmes pour des agents mobiles se déplaçant dans un graphe avec une énergie limité, restreignant leurs mouvements. Chaque agent mobile est une entité, équipée d’une batterie, qui peut parcourir les arêtes du graphe et visiter les noeuds du graphe. A chaque mouvement, l’agent consomme une partie de son énergie. Contrairement à divers modèles bien étudiés pour les agents mobiles, très peu de recherches ont été menées pour le modèle compte tenu des limites d’énergie. Nous étudions les problèmes fondamentaux de l’exploration d’un graphe, du gathering et du collaborative delivery dans ce modèleIn this thesis we study and design algorithms for solving various well-known problems for mobile agents moving on a graph, with the additional constraint of limited energy which restricts the movement of the agents. Each mobile agent is an entity, equipped with a battery, that can traverse the edges of the graph and visit the nodes of the graph, consuming a part of its energy for movement. In contrast to various well-studied models for mobile agents, very little research has been conducted for the model considering the energy limitations. We study the fundamental problems of graph exploration, gathering and collaborative delivery in this model
24
Bohoris, Christos. "Network performance management using mobile software agents." Thesis, University of Surrey, 2003. http://epubs.surrey.ac.uk/844000/.
Full textAbstract:
In recent years a lot of promise has surrounded the potential impact of mobile software agents in the area of network management. The work aims to present a clear- direction of practical exploitation of mobile agents for network management tasks. Three different case studies of network performance management were examined in order to evaluate the effectiveness of the agent mobility strategy and autonomous behaviour applied within the specific context. This work importantly allowed the identification of 'Constrained' mobility, an agent migration strategy especially suited for network management tasks, involving a mobile agent autonomously migrating to a single network element where its execution is confined. The mobile agent benefits identified relate primarily to the easy support for programmability of network elements and the autonomous, self-configurable agent operation. An important drawback is that the advanced capabilities of modem mobile agent frameworks typically incur significant performance overheads and these were confirmed through a detailed performance evaluation comparing mobile agents to distributed object and mobile code approaches. In the direction of addressing this drawback, the work proposes network management solutions based on specially formulated execution environments that retain important mobile agent benefits while reducing network performance overheads.
25
Barbu, Andreea. "Developing mobile agents through a formal approach." Paris 12, 2005. https://athena.u-pec.fr/primo-explore/search?query=any,exact,990002282380204611&vid=upec.
Full textAbstract:
Nous nous intéressons dans cette thèse à la modélisation et à la vérification de systèmes d'agents mobiles. Le développement d'une structure pour les agents mobiles demande le développement de solutions pour un ensemble de problèmes spécifiques dû à la mobilité. Une question dans le développement de logiciel est : le programme proposé est-il vraiment une solution pour le problème considéré. Une façon de répondre à cette question consiste à utiliser les méthodes formelles. Dans notre approche, nous construisons un modèle du problème (la spécification) en uitilisant le Pi calcul d'ordre supérieur. En ayant ce modèle formel comme base, Nous pouvons vérifier que ce modèle possède les propriétés voulues ; valider le modèle à travers es simulations ; être capable de prouver que l'implémentation est cohérente par rapport à la spécification. En profitant de nos résultats, nous avons implémenté un prototype qui permet la validation de systèmes d'agents mobiles conçus avec le Pi-calcul d'ordre supThis thesis deals with the modelling and validation of mobile agent systems. The development of a support structure for mobile agents demans the development of solutions for set of specific problems that appear due to mobility. A basic question in software development is if the proposed program is really a solution for the considered problem. One way to answer this question is through the use of formal methods. In our approach, the first step is to build a model of the solution (specification) using the higher-order Pi-calculus. Having this formal model as a base, we can : validate the model through simulations ; carry out mathematical tests to guarantee that this model possesses the required properties (verification) ; being able to prove that the implementation is correct with respect to the specification. Making use of our results, we have implemented a prototype called HOPiTool which allows the possibility of validation of mobile agent systems conceived with higher-order Pi-calc
26
Miller, Paul. "Automated Syndromic Surveillance using Intelligent Mobile Agents." Thesis, University of North Texas, 2007. https://digital.library.unt.edu/ark:/67531/metadc5141/.
Full textAbstract:
Current syndromic surveillance systems utilize centralized databases that are neither scalable in storage space nor in computing power. Such systems are limited in the amount of syndromic data that may be collected and analyzed for the early detection of infectious disease outbreaks. However, with the increased prevalence of international travel, public health monitoring must extend beyond the borders of municipalities or states which will require the ability to store vasts amount of data and significant computing power for analyzing the data. Intelligent mobile agents may be used to create a distributed surveillance system that will utilize the hard drives and computer processing unit (CPU) power of the hosts on the agent network where the syndromic information is located. This thesis proposes the design of a mobile agent-based syndromic surveillance system and an agent decision model for outbreak detection. Simulation results indicate that mobile agents are capable of detecting an outbreak that occurs at all hosts the agent is monitoring. Further study of agent decision models is required to account for localized epidemics and variable agent movement rates.
27
Barbu, Andreea Best Eike Pelz Elisabeth. "Developing mobile agents through a formal approach." Créteil : Oldenburg : Université de Paris-Val-de-Marne ; Carl von Ossietzky-Forschungsstelle, 2005. http://doxa.scd.univ-paris12.fr:80/theses/th0228238.pdf.
Full textAbstract:
Thèse de doctorat : Informatique : Paris 12 : 2005. Thèse de doctorat : Informatique : Oldenburg, Carl v. Ossietzky Universität : 2005.Thèse soutenue en co-tutelle. Titre provenant de l'écran-titre. Bibliogr. p. 166173. Index.
28
Sriraman, Sandhya. "An Annotated Bibliography of Mobile Agents in Networks." Thesis, University of North Texas, 2002. https://digital.library.unt.edu/ark:/67531/metadc3310/.
Full textAbstract:
The purpose of this thesis is to present a comprehensive colligation of applications of mobile agents in networks, and provide a baseline association of these systems. This work has been motivated by the fact that mobile agent systems have been deemed proficuous alternatives in system applications. Several mobile agent systems have been developed to provide scalable and cogent solutions in network-centric applications. This thesis examines some existing mobile agent systems in core networking areas, in particular, those of network and resource management, routing, and the provision of fault tolerance and security. The inherent features of these systems are discussed with respect to their specific functionalities. The applicability and efficacy of mobile agents are further considered in the specific areas mentioned above. Although an initial foray into a collation of this nature, the goal of this annotated bibliography is to provide a generic referential view of mobile agent systems in network applications.
29
Dengiz, Orhan Smith Alice E. "Maximizing connectivity and performance in mobile ad hoc networks using mobile agents." Auburn, Ala., 2007. http://repo.lib.auburn.edu/2007%20Fall%20Dissertations/Dengiz_Orhan_22.pdf.
Full text
30
Tyagi, Satyam. "Extensions to Jinni Mobile Agent Architecture." Thesis, University of North Texas, 2001. https://digital.library.unt.edu/ark:/67531/metadc2773/.
Full textAbstract:
We extend the Jinni mobile agent architecture with a multicast network transport layer, an agent-to-agent delegation mechanism and a reflection based Prolog-to-Java interface. To ensure that our agent infrastructure runs efficiently, independently of router-level multicast support, we describe a blackboard based algorithm for locating a randomly roaming agent. As part of the agent-to-agent delegation mechanism, we describe an alternative to code-fetching mechanism for stronger mobility of mobile agents with less network overhead. In the context of direct and reflection based extension mechanisms for Jinni, we describe the design and the implementation of a reflection based Prolog-to-Java interface. The presence of subtyping and method overloading makes finding the most specific method corresponding to a Prolog call pattern fairly difficult. We describe a run-time algorithm which provides accurate handling of overloaded methods beyond Java's reflection package's limitations.
31
Chen, Yao. "YAVO, on-line trading system using mobile agents." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0023/MQ51991.pdf.
Full text
32
Pourafzal, Ashkan. "MEROMA, Managing the Environmental Resources of Mobile Agents." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0023/MQ50859.pdf.
Full text
33
Wang, YunBo. "The applicability of mobile agents, a comparative study." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0017/MQ55253.pdf.
Full text
34
Velazquez, Elio. "Mobile agents in distributed search, a comparative study." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ57761.pdf.
Full text
35
Pourafzal, Ashkan. "Meroma : managing the environmental resources of mobile agents." Thesis, McGill University, 1998. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=21626.
Full textAbstract:
Mobile Agentry is a promising new technology towards the vision of a widely scaleable electronic market. Mobile agents are computational entities which can autonomously migrate from host to host. They migrate like nomadic tribes due to the lack of environmental resources. Whereas the nomads would migrate if the weather was too cold or the food was running out, the agents migrate when the computing power is too low or the memory allowance is running out.It is apparent from the previous analogy with the nomads, that environmental resources play a crucial role in the agent's lifecycle. Even though most agent systems provide environmental resource management of agents to some degree, not all aspects of resource management are in place yet. If the industry continues to embrace mobile agentry, there will be a gargantous amount of heterogeneous agent systems and agents in the near future. Bearing in mind this fact, as well as the dynamic nature of mobile agents and environmental resources, environmental resource management is strongly recommended.
In this thesis, we present the criteria to be considered as environmental resources of the agents. We analyze in detail the agent paradigm to find where environmental resource management should be applied, and, based on our analysis, present two solutions to enhance the applicability of the agent paradigm. For completeness, we present similar work in other agent groups.
36
Perez, Diaz Fernando. "Firey-inspired synchronization in swarms of mobile agents." Thesis, University of Sheffield, 2016. http://etheses.whiterose.ac.uk/16552/.
Full textAbstract:
Synchronization can be a necessary prerequisite to perform coordinated actions or reach consensus in decentralized multi-agent systems, such as robotic swarms and sensor networks. One of the simplest distributed synchronization algorithms is firefly synchronization, also known as pulse-coupled oscillator synchronization. In this framework, each agent possesses an internal oscillator and the completion of oscillation cycles is signaled by means of short pulses, which can be detected by other neighboring agents. This thesis focuses on a realistic mode of interaction for practical implementations, in which agents have a restricted field of view used to detect pulses emitted by other agents. The effect of agent speed on the time required to achieve synchronization is studied. Simulations reveal that synchronization can be fostered or inhibited by tuning the agent (robot) speed, leading to distinct dynamical regimes. These findings are further validated in physical robotic experiments. In addition, an analysis is presented on the effect that the involved system parameters have on the time it takes for the ensemble to synchronize. To assess the effect of noise, the propagation of perturbations over the system is analyzed. The reported findings reveal the conditions for the control of clock or activity synchronization in swarms of mobile agents.
37
Velazquez, Elio Carleton University Dissertation Computer Science. "Mobile agents in distributed search: a comparative study." Ottawa, 2001.
Find full text
38
González, Marta C. "Contact networks of mobile agents and spreading dynamics." [S.l. : s.n.], 2006. http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-29332.
Full text
39
Arumugam, Subramanian. "aZIMAS Web mobile agent system /." [Gainesville, Fla.] : University of Florida, 2003. http://purl.fcla.edu/fcla/etd/UFE0000632.
Full text
40
Xu, Ke. "Mobile agent security through multi-agent cryptographic protocols." Thesis, University of North Texas, 2004. https://digital.library.unt.edu/ark:/67531/metadc4473/.
Full textAbstract:
An increasingly promising and widespread topic of research in distributed computing is the mobile agent paradigm: code travelling and performing computations on remote hosts in an autonomous manner. One of the biggest challenges faced by this new paradigm is security. The issue of protecting sensitive code and data carried by a mobile agent against tampering from a malicious host is particularly hard but important. Based on secure multi-party computation, a recent research direction shows the feasibility of a software-only solution to this problem, which had been deemed impossible by some researchers previously. The best result prior to this dissertation is a single-agent protocol which requires the participation of a trusted third party. Our research employs multi-agent protocols to eliminate the trusted third party, resulting in a protocol with minimum trust assumptions. This dissertation presents one of the first formal definitions of secure mobile agent computation, in which the privacy and integrity of the agent code and data as well as the data provided by the host are all protected. We present secure protocols for mobile agent computation against static, semi-honest or malicious adversaries without relying on any third party or trusting any specific participant in the system. The security of our protocols is formally proven through standard proof technique and according to our formal definition of security. Our second result is a more practical agent protocol with strong security against most real-world host attacks. The security features are carefully analyzed, and the practicality is demonstrated through implementation and experimental study on a real-world mobile agent platform. All these protocols rely heavily on well-established cryptographic primitives, such as encrypted circuits, threshold decryption, and oblivious transfer. Our study of these tools yields new contributions to the general field of cryptography. Particularly, we correct a well-known construction of the encrypted circuit and give one of the first provably secure implementations of the encrypted circuit.
41
Günter, Manuel. "Customer-based IP service monitoring with mobile software agents /." Basel [u.a.] : Birkhäuser, 2002. http://www.loc.gov/catdir/enhancements/fy0812/2002074391-d.html.
Full text
42
Gunupudi, Vandana. "Performance Evaluation of Data Integrity Mechanisms for Mobile Agents." Thesis, University of North Texas, 2003. https://digital.library.unt.edu/ark:/67531/metadc4366/.
Full textAbstract:
With the growing popularity of e-commerce applications that use software agents, the protection of mobile agent data has become imperative. To that end, the performance of four methods that protect the data integrity of mobile agents is evaluated. The methods investigated include existing approaches known as the Partial Result Authentication Codes, Hash Chaining, and Set Authentication Code methods, and a technique of our own design, called the Modified Set Authentication Code method, which addresses the limitations of the Set Authentication Code method. The experiments were run using the DADS agent system (developed at the Network Research Laboratory at UNT), for which a Data Integrity Module was designed. The experimental results show that our Modified Set Authentication Code technique performed comparably to the Set Authentication Code method.
43
Carlier, David. "Représentation permanente, coordonnée par une carte à microprocesseur, d'un utilisateur mobile." Lille 1, 1998. https://pepite-depot.univ-lille.fr/LIBRE/Th_Num/1998/50376-1998-27.pdf.
Full textAbstract:
L'informatique mobile est un domaine en pleine expansion notamment grace a la vulgarisation des reseaux de telephonie mobile tels que le gsm. Ces reseaux utilisent principalement une liaison radio et permettent de tout endroit de transmettre non seulement de la parole mais aussi des donnees informatiques. La mobilite des terminaux impose des contraintes de poids et d'encombrement drastiques et, par consequent, une quantite et une qualite des ressources limitees : puissance de calcul, taille memoire, interface homme-machine et autonomie d'energie imposant des connexions intermittentes. Le but de cette these est de proposer un modele permettant a un utilisateur mobile, a partir d'un terminal quelconque, d'utiliser des ressources lui etant attribuees sur des stations fixes connectees a un reseau. Le concept d'agent mobile permet d'associer a un utilisateur mobile un assistant logiciel le suivant dans ses deplacements afin de garantir une disponibilite optimale. Cet agent garantit une permanence minimale de l'utilisateur lorsque celui-ci n'est pas connecte. Le travail s'est, par consequent, concentre sur trois points : - la delegation de taches du terminal utilise par l'usager vers son agent mobile permettant de disposer d'un meilleur environnement d'execution. - une gestion du retour des resultats de taches vers l'usager en fonction de ses preferences, du materiel utilise et de ses connexions. - la personnalisation du terminal utilise par l'usager et une securite de la liaison avec son agent mobile grace a une carte a microprocesseur.
44
Lal, Mayank. "Motion planning algorithms for a group of mobile agents." Texas A&M University, 2008. http://hdl.handle.net/1969.1/86038.
Full textAbstract:
Building autonomous mobile agents has been a major research effort for a while
with cooperative mobile robotics receiving a lot of attention in recent times. Motion
planning is a critical problem in deploying autonomous agents. In this research we
have developed two novel global motion planning schemes for a group of mobile agents
which eliminate some of the disadvantages of the current methods available. The first
is the homotopy method in which the planning is done in polynomial space. In this
method the position in local frame of each mobile agent is mapped to a complex
number and a time varying polynomial contains information regarding the current
positions of all mobile agents, the degree of the polynomial being the number of
mobile agents and the roots of the polynomial representing the position in local
frame of the mobile agents at a given time. This polynomial is constructed by finding
a path parameterized in time from the initial to the goal polynomial (represent the
initial and goal positions in local frame of the mobile agents) so that the discriminant
variety or the set of polynomials with multiple roots is avoided in polynomial space.
This is equivalent to saying that there is no collision between any two agents in going
from initial position to goal position. The second is the homogeneous deformation
method. It is based on continuum theory for motion of deformable bodies. In this
method a swarm of vehicles is considered at rest in an initial configuration with no
restrictions on the initial shape or the locations of the vehicles within that shape. A
motion plan is developed to move this swarm of vehicles from the initial configuration to a new configuration such that there are no collisions between any vehicles at
any time instant. It is achieved via a linear map between the initial and desired
final configuration such that the map is invertible at all times. Both the methods
proposed are computationally attractive. Also they facilitate motion coordination
between groups of mobile agents with limited or no sensing and communication.
45
Cozzolino, Clifford Joseph. "DADS - A Distributed Agent Delivery System." Thesis, University of North Texas, 2002. https://digital.library.unt.edu/ark:/67531/metadc3352/.
Full textAbstract:
Mobile agents require an appropriate platform that can facilitate their migration and execution. In particular, the design and implementation of such a system must balance several factors that will ensure that its constituent agents are executed without problems. Besides the basic requirements of migration and execution, an agent system must also provide mechanisms to ensure the security and survivability of an agent when it migrates between hosts. In addition, the system should be simple enough to facilitate its widespread use across large scale networks (i.e Internet). To address these issues, this thesis discusses the design and implementation of the Distributed Agent Delivery System (DADS). The DADS provides a de-coupled design that separates agent acceptance from agent execution. Using functional modules, the DADS provides services ranging from language execution and security to fault-tolerance and compression. Modules allow the administrator(s) of hosts to declare, at run-time, the services that they want to provide. Since each administrative domain is different, the DADS provides a platform that can be adapted to exchange heterogeneous blends of agents across large scale networks.
46
Amin, Kaizar Abdul Husain. "Resource Efficient and Scalable Routing using Intelligent Mobile Agents." Thesis, University of North Texas, 2003. https://digital.library.unt.edu/ark:/67531/metadc4240/.
Full textAbstract:
Many of the contemporary routing algorithms use simple mechanisms such as flooding or broadcasting to disseminate the routing information available to them. Such routing algorithms cause significant network resource overhead due to the large number of messages generated at each host/router throughout the route update process. Many of these messages are wasteful since they do not contribute to the route discovery process. Reducing the resource overhead may allow for several algorithms to be deployed in a wide range of networks (wireless and ad-hoc) which require a simple routing protocol due to limited availability of resources (memory and bandwidth). Motivated by the need to reduce the resource overhead associated with routing algorithms a new implementation of distance vector routing algorithm using an agent-based paradigm known as Agent-based Distance Vector Routing (ADVR) has been proposed. In ADVR, the ability of route discovery and message passing shifts from the nodes to individual agents that traverse the network, co-ordinate with each other and successively update the routing tables of the nodes they visit.
47
INAGAKI, Yasuyoshi, Katsuhiko TOYAMA, and Nobuo KAWAGUCHI. "MAGNET: ad hoc network system based on mobile agents." Elsevier, 2000. http://hdl.handle.net/2237/15448.
Full text
48
Kalyani, Yogesh. "Towards the use of mobile agents for privacy negotiation." Thesis, University of Ottawa (Canada), 2006. http://hdl.handle.net/10393/27379.
Full textAbstract:
With the increase in popularity of e-Commerce, concern for privacy has also increased. Users are becoming increasingly concerned about what personal information they could reveal when they go online. Currently, an e-Commerce Website does not provide full support to conduct negotiations concerning personal information between a user and a Web site. A user has to comply with the privacy policy specified on the Web site and has two choices: either they abandon the transaction or accept the privacy practices of the host. The Platform for Privacy Preferences (P3P) [16] specification, a W3C standard, enables Web sites to specify their privacy practices in a standardized manner. The presence of P3P policies enables users to configure their Web browsers to constrain what they can and cannot do when visiting sites. However, one major limitation of P3P is that no support is given within the specification for negotiation of privacy preferences between a user and a Web site. As e-Commerce is growing, a proper negotiation mechanism should be in place to enhance user control over personal information, so users can decide what personal information they wish to release to the Web site.
This thesis proposes a novel mechanism to address this limitation, focusing on the use of mobile agents with a web ontology language (OWL) for privacy negotiation. Thus far in the literature there appears to be no working mobile agent mechanism that does privacy policy negotiation, particularly in the context of P3P. The architecture proposed here explicitly incorporates the concept of variable end-user requirements with respect to privacy. It is designed keeping in mind a negotiation scenario where the user device has limited resources (i.e., poor connectivity) and cannot negotiate directly with desired Web sites, but, obviously, less constrained user devices may also benefit from this work.
Despite the advantages of a mobile-agent-based architecture, there are several issues which hinder the deployment of mobile agents in real life scenarios. Two major security concerns associated with a mobile agent paradigm are malicious agents and malicious hosts. In this thesis, malicious host concerns have been addressed by proposing a Trace Based protocol. This protocol is designed keeping in mind the desired security properties required, and also considering other factors like resource constrained devices and bandwidth preservation.
49
Al-Jaljouli, Raja Computer Science & Engineering Faculty of Engineering UNSW. "A proposed security protocol for data gathering mobile agents." Awarded by:University of New South Wales. School of Computer Science and Engineering, 2006. http://handle.unsw.edu.au/1959.4/23999.
Full textAbstract:
We address the security issue of the data which mobile agents gather as they are traversing the Internet. Our goal is to devise a security protocol that truly secures the data which mobile agents gather. Several cryptographic protocols were presented in the literature asserting the security of gathered data. Formal verification of the protocols reveals unforeseen security flaws, such as truncation or alteration of the collected data, breaching the privacy of the gathered data, sending others data under the private key of a malicious host, and replacing the collected data with data of similar agents. So the existing protocols are not truly secure. We present an accurate security protocol which aims to assert strong integrity, authenticity, and confidentiality of the gathered data. The proposed protocol is derived from the Multi-hops protocol. The protocol suffers from security flaws, e.g. an adversary might truncate/ replace collected data, or sign others data with its own private key without being detected. The proposed protocol refines the Multi-hops protocol by implementing the following security techniques: utilization of co-operating agents, scrambling the gathered offers, requesting a visited host to clear its memory from any data acquired as a result of executing the agent before the host dispatches the agent to the succeeding host in the agent???s itinerary, and carrying out verifications on the identity of the genuine initiator at the early execution of the agent at visited hosts, in addition to the verifications upon the agent???s return to the initiator. The proposed protocol also implements the common security techniques such as public key encryption, digital signature, etc. The implemented security techniques would rectify the security flaws revealed in the existing protocols. We use STA, an infinite-state exploration tool, to verify the security properties of a reasonably small instance of the proposed protocol in key configurations. The analysis using STA reports no attack. Moreover, we carefully reason the correctness of the security protocol for a general model and show that the protocol would be capable of preventing or at least detecting the attacks revealed in the existing protocols.
50
Fan, Xiaobo. "Applying mobile agents to implement resilient authentication in networks." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0021/MQ55053.pdf.
Full text