Performance analysis of mobile agent failure recovery in e-service applications
In recent years, most of researchers are incorporating the mobile agents in most of the e-service applications especially in e-learning to improve the network latency and to reduce the network traffic. On the other side, the security issues degrade the mobile agent usage. The main intention of the attacker is to kill or modify the behavior of the agent in the middle of the journey to degrade the trustiness of the agent environment. To recover the killed or modified mobile agent in the original form, this paper proposed a novel K-response recovery model. For K-response recovery model, every host dispatching the agent should have the clone to recover the agent and send the response to the preceding host about the agent status (alive). During the recovery of the mobile agent all the components (agent code, itinerary, credential information, collected information and state) are able to recover. The K-response model is experimented for the 1-response scenario and its experimental results proved that the preceding host will get the response with in the time out period of the clone.

title: Generating routing table for free roaming mobile agent in distributed environment
abstract: Free roaming mobile agent [D. Xu, L. Harn, M. Narasimhan, J. Luo. ''An Improved Free-Roaming Mobile Agent Security Protocol against Colluded Truncation Attacks.'' In Proceedings of the 30th Annual international Computer Software and Applications Conference(COMPSAC,06), Volume 2, Page(s):309-314,Chigago, Sept. 2006,  S. Venkatesan, C. Chellappan, ''Protecting free roaming mobile agent against multiple colluded truncation attacks'', In proceedings of the 3rd International conference on Mobile Multimedia Communication (Mobimedia'07), page(s): 293-297, August 2007.] is to collect information from more number of remote host using the shortest route. The routing table available in the router is not applicable for the free roaming mobile agent to roam around the network, so each and every server must have the routing information. This paper proposes a model to generate the routing table for the free roaming mobile agent to roam around the network by calculating the link cost between the nodes. Link cost between the servers is measured by the energy consumed to reach the destination. Link cost is measured by the transmission of agent instead of sending the message because here the route is calculated for agent roaming. The cost for transferring the message and the agent differs because of the migration and transfer. In agent transmission, the whole thing will be migrated to the remote host. But in the message transmission, the particular message is transmitted. Routing table in the destination will be generated automatically by the mobile agent while it visits the destination host and the routing table of the source host will be generated after the agent returns to its home (source host).

title: Protecting free-roaming mobile agent against multiple colluded truncation attacks
abstract: Mobile agent environment is one of the emerging technology to reduce the network traffic. Various security issues are identified and protected. Now the new security issue in this environment is the multiple colluded truncation attacks in the Free-roaming mobile agents. This paper proposes the identity verification mechanism to protect the multiple colluded truncation attacks The identification is verified from the beginning dummy offer of the creator of the agent.

title: Three Degree of Freedom Tracking in Realtime Using a Wrist-Mounted Laser Range Finder

title: Hardware/software cosynthesis: multiple constraint satisfaction and component retrieval
abstract: Hardware/software cosynthesis is a complex process that involves transforming a high-level system specification to an implemented hardware/software system that meets the specification constraints. One phase of the cosynthesis process is described: partitioning the specification into components and binding them to hardware/software resources. Partitioning requires an effective means to explore the design space, challenges include: supporting constraint-driven retrieval; and evaluating candidate solutions considering the interaction of multiple constraints. The cosynthesis tool described assigns scores to candidate solutions using multiple design constraints, but rather than the simple sum approach predominant in cosynthesis research, it uses a vector of rank data that does not require that equal weight be given to all criteria. Our results to date show that not only can we process a scaleable, selectable set of design constraints, but when compared with a 2 constraint Fidducia-Matheyses (FM) approach, we achieve better results. The flexible component retrieval is accomplished using our database system; the database is unique for three reasons: it uses a hardware description language as the basis for its conceptual model; it allows flexible, ad hoc querying over designs; and it uses a fine granularity of component modeling to enable detailed search conditions required by the cosynthesis tool.