scholarly journals Measuring the Complexity of Mobile Agents Designed with Aspect/J

10.28945/2615 ◽  
2003 ◽  
Author(s):  
Jana Dospisil ◽  
Arin Khemngoen

This paper describes research in measuring the code complexity of mobile agent applications designed with aspect-oriented programming (AOP) as captured in the AspectJ™ language. The modularized code encapsulating agent interactions is characterized by class hierarchies which are shared structures. Mobile agent design suffers from frequent changes in interaction protocols which leads to chaotic development. Additional subclassing, modification to protocols, restructuring of the class hierarchies, changes to visibility of attributes and methods overloading result in increased complexity of the code and disorder. Our experonce with fine tuning of protocols shows that the probability that a subclass will not consistently extend the protocol content of its superclass is increasing with the depth of hierarchy. The tools like Hyper/Jand Aspect/J support the separation of concerns thus allowing different approach to evolving the protocol content rather than extending the class hierarchies. In this paper we present the approach to analyzing protocol design and assessing the complexity by measuring the entropy of the mobile agent application code designed with Aspect/J. The comparison of complexity measures with the same mobile agent application designed and maintained as typical Java application indicates reduction in complexity in favor of design with Aspect/J.

10.28945/2611 ◽  
2003 ◽  
Author(s):  
Jana Dospisil

The modularized code encapsulating object interactions is characterized by class hierarchies. In the implementation of mobile agents, we have observed that the changes in agent interaction protocols lead to uncontrolled subclassing and consequently to disorder. This phenomenon is known as entropy. The additional subclassing, modification to protocols, restructuring of the class hierarchies, changes to visibility of attributes, and method overloading result in increased co mplexity of the code. This problem in agent design has been tackled by Kendall (Kendall, 1999) who proposed development using Aspect/J and separation of concerns. Since there has been no proof of reduced complexity, we have proposed metrics for software complexity estimation, and ranking of compositional elements developed with As-pect/J. The metrics have been tested on Java code for mobile agents.


2017 ◽  
Vol 2 (1) ◽  
pp. 27-32
Author(s):  
Botchkaryov. A. ◽  

The way of functional coordination of methods of organization adaptive data collection processes and methods of spatial self-organization of mobile agents by parallel execution of the corresponding data collection processes and the process of motion control of a mobile agent using the proposed protocol of their interaction and the algorithm of parallel execution planning is proposed. The method allows to speed up the calculations in the decision block of the mobile agent by an average of 40.6%. Key words: functional coordination, adaptive data collection process, spatial self-organization, mobile agents


2014 ◽  
Vol 543-547 ◽  
pp. 4198-4201
Author(s):  
Xiao Guang Li ◽  
Zhan Jun Gao

Mobile agent is one of the most prominent technologies believed to be playing an important role in future e-commerce. After presented an intelligent e-commerce model based on OBI ( open buying on the internet) , we developed a modified approach for the security of mobile agents and e-commerce, and designed an intelligent shopping algorithm based on variable time negotiation function. The presented model has been evaluated by simulation experiment. It has been found that the presented model is efficient.


2017 ◽  
Vol 13 (1) ◽  
pp. 155014771668484 ◽  
Author(s):  
Huthiafa Q Qadori ◽  
Zuriati A Zulkarnain ◽  
Zurina Mohd Hanapi ◽  
Shamala Subramaniam

Recently, wireless sensor networks have employed the concept of mobile agent to reduce energy consumption and obtain effective data gathering. Typically, in data gathering based on mobile agent, it is an important and essential step to find out the optimal itinerary planning for the mobile agent. However, single-agent itinerary planning suffers from two primary disadvantages: task delay and large size of mobile agent as the scale of the network is expanded. Thus, using multi-agent itinerary planning overcomes the drawbacks of single-agent itinerary planning. Despite the advantages of multi-agent itinerary planning, finding the optimal number of distributed mobile agents, source nodes grouping, and optimal itinerary of each mobile agent for simultaneous data gathering are still regarded as critical issues in wireless sensor network. Therefore, in this article, the existing algorithms that have been identified in the literature to address the above issues are reviewed. The review shows that most of the algorithms used one parameter to find the optimal number of mobile agents in multi-agent itinerary planning without utilizing other parameters. More importantly, the review showed that theses algorithms did not take into account the security of the data gathered by the mobile agent. Accordingly, we indicated the limitations of each proposed algorithm and new directions are provided for future research.


2014 ◽  
Vol 519-520 ◽  
pp. 1239-1242
Author(s):  
Xiao Hu Yu

An improved congestion control mechanism based on mobile agent for wireless sensor networks is proposed, which includes node-level congestion and link-level congestion control. The formers congestion information is collected and distributed by mobile agents (MA). When mobile agent travels through the networks, it can select a less-loaded neighbor node as its next hop and update the routing table according to the nodes congestion status. Minimum package of node outgoing traffic was preferentially transmitted in the link-level congestion. Simulation result shows that proposed mechanism attains high delivery ratio and throughput with reduced delay when compared with the existing technique.


1970 ◽  
Vol 2 ◽  
pp. 61-62
Author(s):  
Óscar Urra ◽  
Sergio Ilarri

In a vehicular network, vehicles can exchange interesting information (e.g., about accidents, traffic status, etc.) using short-range wireless communications. Besides, the vehicles can be equipped with additional sensors that can directly obtain data from the environment. How to efficiently process and collect these data is an open problem. We argue that mobile agent technology could be helpful.


Author(s):  
Paulo Marques

One central problem preventing widespread adoption of mobile agents as a code structuring primitive is that current mainstream middleware implementations do not convey it simply as such. In fact, they force all the development to be centered on mobile agents, which has serious consequences in terms of software structuring and, in fact, technology adoption. This chapter discusses the main limitations of the traditional platform-based approach, proposing an alternative: component-based mobile agent systems. Two case studies are discussed: the JAMES platform, a traditional mobile agent platform specially tailored for network management, and M&M, a component-based system for agent-enabling applications. Finally, a bird’s eye perspective on the last 15 years of mobile agent systems research is presented along with an outlook on the future of the technology. The authors hope that this chapter brings some enlightenment on the pearls and pitfalls surrounding this interesting technology and ways for avoiding them in the future.


Sign in / Sign up

Export Citation Format

Share Document