Checkpoint placement algorithms for mobile agent system

2006-2007 > Academic research: refereed > Refereed conference paperVersion of RecordPublishe

Design and Analysis of SD_DWCA - A Mobility based clustering of Homogeneous MANETs

This paper deals with the design and analysis of the distributed weighted clustering algorithm SD_DWCA proposed for homogeneous mobile ad hoc networks. It is a connectivity, mobility and energy based clustering algorithm which is suitable for scalable ad hoc networks. The algorithm uses a new graph parameter called strong degree defined based on the quality of neighbours of a node. The parameters are so chosen to ensure high connectivity, cluster stability and energy efficient communication among nodes of high dynamic nature. This paper also includes the experimental results of the algorithm implemented using the network simulator NS2. The experimental results show that the algorithm is suitable for high speed networks and generate stable clusters with less maintenance overhead

A Java-based Mobile Agent Framework for Distributed Network Applications

Recently, a new paradigm has emerged forstructuring and developing distributed network applications inopen distributed and heterogeneous environments. Manyapplication areas, such as electronic commerce, mobilecomputing, network management and information retrieval canbenefit from the application of the Mobile Agent technology. Theexploitation of Mobile Agents offers several peculiar advantages,such as reduction of network latency, asynchronous execution,robust and fault tolerant behavior. Java technology provides aplatform-independent, portable software environment whichmakes it an excellent tool for mobile agent development. MobileAgents are mainly intended to be used for applicationsdistributed over large scale (slow) networks because they allowsaving communication costs by moving computation to the hoston which the target data resides. However, it has not becomepopular due to some problems such as security. In this paper, wepresent a distributed network architecture based on the MobileAgent approach. A network of communicating servers each ofwhich support multiple clients is our goal. We also propose asecurity approach for mobile agents, which protect critical dataof mobile agents from malicious attacks, by using cryptographictechniques. We implement a bank service application to be testedon our mobile agent framework. The results suggest that fornetworks with high latency, Mobile Agents may provideimprovements over more conventional client-server systems

CIC : an integrated approach to checkpointing in mobile agent systems

Internet and Mobile Computing Lab (in Department of Computing)Refereed conference paper2006-2007 > Academic research: refereed > Refereed conference paperVersion of RecordPublishe

Two Distributed Algorithms for E-ticket Validation Protocols for Mobile Clients

The e-ticket (electronic ticket) validation problem has relevance in mobile computing environment because of the multiple submission of a ticket that is possible due to intermittent disconnections and mobility of hosts. Here, we propose protocols that are not only sensitive to disconnection but also to location. One of the proposed protocols is the variant of the distributed protocol proposed by Pedone (2000) for Internet users. This shows that a distributed protocol for static network can be restructured for distributed computation in a mobile computing environment. We have also proposed another protocol that uses a hierarchical location database of mobile hosts (Pitoura and Samaras, 2001)

Self-organizing peer-to-peer social networks

This is the author's accepted manuscript. The final published article is available from the link below. Copyright @ 2008 The Authors.Peer-to-peer (P2P) systems provide a new solution to distributed information and resource sharing because of its outstanding properties in decentralization, dynamics, flexibility, autonomy, and cooperation, summarized as DDFAC in this paper. After a detailed analysis of the current P2P literature, this paper suggests to better exploit peer social relationships and peer autonomy to achieve efficient P2P structure design. Accordingly, this paper proposes Self-organizing peer-to-peer social networks (SoPPSoNs) to self-organize distributed peers in a decentralized way, in which neuron-like agents following extended Hebbian rules found in the brain activity represent peers to discover useful peer connections. The self-organized networks capture social associations of peers in resource sharing, and hence are called P2P social networks. SoPPSoNs have improved search speed and success rate as peer social networks are correctly formed. This has been verified through tests on real data collected from the Gnutella system. Analysis on the Gnutella data has verified that social associations of peers in reality are directed, asymmetric and weighted, validating the design of SoPPSoN. The tests presented in this paper have also evaluated the scalability of SoPPSoN, its performance under varied initial network connectivity and the effects of different learning rules.National Natural Science of Foundation of Chin