%0 Journal Article %1 noauthororeditor %A Kumar, S.J.K. Jagadeesh %D 2013 %J International Journal of Computational Science and Information Technology (IJCSITY) %K ACO, Distributed Global LRM,ORCS Management, Mobile Network, Peer Replica Spanning Tree, to %N 2 %P 1 -11 %R 10.5121/ijcsity.2013.1202 %T ANALYSE THE PERFORMANCE OF MOBILE PEER TO PEER NETWORK USING ANT COLONY OPTIMIZATION %U http://airccse.org/journal/ijcsity/papers/1213ijcsity02.pdf %V 1 %X 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.

@article{noauthororeditor, abstract = {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.}, added-at = {2020-01-10T12:59:47.000+0100}, author = {Kumar, S.J.K. Jagadeesh}, biburl = {https://www.bibsonomy.org/bibtex/25c68cc65474dc872c739926317fbb647/anderson_sam}, doi = {10.5121/ijcsity.2013.1202}, interhash = {79d6f6f39355c3e5be47b45e46335ef1}, intrahash = {5c68cc65474dc872c739926317fbb647}, journal = {International Journal of Computational Science and Information Technology (IJCSITY)}, keywords = {ACO, Distributed Global LRM,ORCS Management, Mobile Network, Peer Replica Spanning Tree, to}, month = may, number = 2, pages = {1 -11}, timestamp = {2020-01-10T12:59:47.000+0100}, title = {ANALYSE THE PERFORMANCE OF MOBILE PEER TO PEER NETWORK USING ANT COLONY OPTIMIZATION}, url = {http://airccse.org/journal/ijcsity/papers/1213ijcsity02.pdf}, volume = 1, year = 2013 }