TY  - JOUR
AU  - Doss, Srinath 
AU  - Jeyaraj, Janet 
PY  - 2013
TI  - SECURING MOBILE ANT AGENT USING CHINESE REMAINDER THEOREM
JF  - Journal of Computer Science
VL  - 9
IS  - 9
DO  - 10.3844/jcssp.2013.1211.1216
UR  - https://thescipub.com/abstract/jcssp.2013.1211.1216
AB  - 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.