In mobile ad hoc network, the nodes often move and keep on change its topology. Data packets can be forwarded from one node to another on demand. To increase the data accessibility data are replicated at nodes and made as sharable to other nodes. Assuming that all mobile host cooperative to share their memory and allow forwarding the data packets. But in reality, all nodes do not share the resources for the benefits of others. These nodes may act selfishly to share memory and to forward the data packets. This paper focuses on selfishness of mobile nodes in replica allocation and routing protocol based on Ant colony algorithm to improve the efficiency. The Ant colony algorithm is used to reduce the overhead in the mobile network, so that it is more efficient to access the data than with other routing protocols. This result shows the efficiency of ant based routing algorithm in the replication allocation.
N.J. Nithya Nandhini1, S. Ramesh2, P. Ganesh Kumar3
Anna University – Regional Office, Madurai, India1, Anna University – Regional Office, Madurai, India2, K. L. N College of Engineering, India3
Selfish Node, Replica Allocation, Routing, Ant Colony Algorithm, Mobile Nodes, Selfish Node Detection | Published By :
ICTACT
Published In :
ICTACT Journal on Communication Technology
( Volume: 4 , Issue: 4 )
Date of Publication :
December 2013
|