Research
Analyse the Performance of Mobile Peer to Peer Network using Ant Colony Optimization
A mobile peer-to-peer computer network is the one in which each computer in the network can act as a client or server for the other computers in the network. The communication process among the nodes in the mobile peer to peer network requires more no of messages. Due to this large number of messages passing, propose an interconnection structure called distributed Spanning Tree (DST) and it improves the efficiency of the mobile peer to peer network. The proposed method improves the data availability and consistency across the entire network and also reduces the data latency and the required number of message passes for any specific application in the network. Further to enhance the effectiveness of the proposed system, the DST network is optimized with the Ant Colony Optimization method. It gives the optimal solution of the DST method and increased availability, enhanced consistency and scalability of the network. The simulation results shows that reduces the number of message sent for any specific application and average delay and increases the packet delivery ratio in the network.
Improving the Performance of Mobile Ad Hoc Network Using a Combined Credit Risk and Collaborative Watchdog Method
In mobile ad hoc networks, nodes can move freely and link/node failures occur frequently. This leads to frequent network partitions, which may significantly degrade the performance of data access in ad hoc networks. When the network partition occurs, mobile nodes in one network are not able to access data hosted by nodes in other networks. In mobile ad hoc network, some nodes may selfishly decide only to cooperate partially, or not at all, with other nodes. These selfish nodes could then reduce the overall data accessibility in the network. In this work, the impact of selfish nodes in a mobile ad hoc network from the perspective of replica allocation is examined. We term this selfish replica allocation. A combined credit risk method & collaborative watchdog is proposed to detect the selfish node and also apply the SCF tree based replica allocation method to handle the selfish replica allocation appropriately. The proposed method improves the data accessibility, reduces communication cost and average query delay and also to reduce the detection time and to improve the accuracy of watchdogs in the collaborative method.
