ICTACT Journal on Communication Technology

S. Ramesh ¹, R. Indira ¹, R. Praveen ², P. Ganesh Kumar ³

Affiliations
1 Department of Computer Science and Engineering, Anna University Regional Centre, Madurai, IN
2 Department of Computer Science and Engineering, Anna University Regional Centre, Madurai, IS
3 Department of Electronics and Communication Engineering, KLN College of Engineering, IN

Abstract

The Intermittently Connected Mobile Networks (ICMN) is a disconnected mobile network where a complete connectivity never exists. The intermittent connectivity is due to the dense nature of the network. The dense nature is mainly due to the high mobility of the nodes in the network. Routing in such a sparse network is arduous. Due to the disconnected attribute of the network, the encounter of the suspicious nodes in the network also remains a tedious task. In this paper, we put forward a secure routing that aids in detecting and preventing intrusion of malicious nodes. The routing process is made adorable through Spray and Wait (SNW). Since ICMN is prompt to higher delays certain authentication series are used to enable secure communication within the network. The amalgamation of SNW with authentication series leads a novel routing protocol named S-Spray (Secured-Spray) which is highly secure.

Keywords

Mobile Network, ICMN, Delay Tolerant Network, S-Spray, Spray and Wait, Authentication Series.

Full Text

     

N. J. Nithya Nandhini ¹, S. Ramesh ¹, P. Ganesh Kumar ²

Affiliations
1 Department of Computer Science and Engineering, Anna University – Regional Office, Madurai, IN
2 Department of Electronics and Communication Engineering, K. L. N College of Engineering, IN

Abstract

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.

Keywords

Selfish Node, Replica Allocation, Routing, Ant Colony Algorithm, Mobile Nodes, Selfish Node Detection.

Full Text