Research Article Open Access

SECURING MOBILE ANT AGENT USING CHINESE REMAINDER THEOREM

Srinath Doss1 and Janet Jeyaraj2
  • 1 St. Peters University, India
  • 2 Dr.MGR University, India
Journal of Computer Science
Volume 9 No. 9, 2013, 1211-1216

DOI: https://doi.org/10.3844/jcssp.2013.1211.1216

Submitted On: 13 April 2013 Published On: 6 August 2013

How to Cite: Doss, S. & Jeyaraj, J. (2013). SECURING MOBILE ANT AGENT USING CHINESE REMAINDER THEOREM. Journal of Computer Science, 9(9), 1211-1216. https://doi.org/10.3844/jcssp.2013.1211.1216

Abstract

Recent days, research in wireless network becomes major area for the past few decades. In wireless routing many routing methods such as table driven, source driven; many characteristics such as reactive routing, proactive routing; many routing algorithms such as dijikstra’s shortest path, distributed bell-man ford algorithm are proposed in the literature. For effective wireless routing, the recent ant colony optimization proves better result than the existing methodologies. The ant colony optimization is a swarm intelligence technique which widely used for combinatorial optimization problems such as travelling salesman, network routing, clustering. The ant colony optimization is a real time routing protocol which offers highly reliable and optimal routing for both single path and multi path routing. As the ant is a small tiny mobile agent, providing security is critical issue. In this study, a secured ant colony optimization using Chinese remainder theorem is proposed.

  • 931 Views
  • 1,478 Downloads
  • 0 Citations

Download

Keywords

  • Wireless Network
  • Secured Routing
  • Ant Colony Optimization
  • Routing Attacks