H.Vignesh Ramamoorthy

Work place: Department of Computer Science and Computer Application, Sree Saraswathi Thyagaraja College, Pollachi-642107, Coimbatore, India

E-mail: hvigneshram@gmail.com


Research Interests: World Wide Web, Data Structures and Algorithms


H. Vignesh Ramamoorthy received his M.Sc (Software Engineering) from Anna University, Chennai in 2010, MCA from Bharathiar University in 2012, Post Graduate Diploma in Mobile Computing from Annamalai University in 2012. He is currently working as an Assistant Professor in Sree Saraswathi Thyagaraja College, Pollachi, Coimbatore District and also pursuing his part time M.Phil in the same institution. He has presented more than 13 papers in National and International Conferences and has 10 publications in various journals. His areas of interests are Networking, Security Issues and Mobile Computing.

Author Articles
An Interactive Teaching – Learning Tool for Underprivileged Children in Rural Schools

By H.Vignesh Ramamoorthy P.J.Balakumaran H.Karthikeyani

DOI: https://doi.org/10.5815/ijmecs.2013.07.03, Pub. Date: 8 Jul. 2013

In a country like India, there are children who starve for food, water and cannot spend time for studying and they have to work hard, to get one meal a day. The dropouts in schools are high because of various reasons. Education is not at affordable cost, government must bring some schemes. 80% schools suffer from shortage of teachers, infrastructural gaps and several habitations. There are also frequent allegations of government schools being riddled with absenteeism and mismanagement and appointments are based on political convenience. Despite the allure of free lunch-food in the government schools, many parents send their children to private schools. As a result, proponents of low cost private schools, critiqued government schools as being poor value for money. Furthermore, many international schools with most modern Information Communication Technology (ICT) tools are mushrooming even in remote villages because the rural elites who are able to afford school fees in a country where large number of families live in absolute poverty. The major objective of this paper is to develop an interactive teaching-learning tool with multimedia applications for underprivileged children in rural schools. This tool will help the rural school children to have quality education at an affordable cost.

[...] Read more.
A New Proposal for Route Finding in Mobile AdHoc Networks

By H.Vignesh Ramamoorthy D.Suganya Devi

DOI: https://doi.org/10.5815/ijcnis.2013.07.01, Pub. Date: 8 Jun. 2013

Mobile Ad hoc Network (MANET) is a kind of wireless ad-hoc network, and is a self-configuring network of mobile routers (and associated hosts) connected by wireless links – the union of which forms an arbitrary topology. The routers are free to move randomly and organize themselves arbitrarily, thus the network's wireless topology may change rapidly and unpredictably. Such a network may operate in a standalone fashion, or may be connected to the larger Internet. There are various routing protocols available for MANETs. The most popular ones are DSR, AODV and DSDV. This paper examines two routing protocols for mobile ad hoc networks– the Destination Sequenced Distance Vector (DSDV and the Ad hoc On- Demand Distance Vector routing (AODV). Generally, the routing algorithms can be classified into Reactive and Proactive. A Hybrid algorithm combines the basic properties of reactive and proactive into one. The proposed approach is a novel routing pattern based on Ant Colony Optimization and Multi Agent System. This pattern integrates two different algorithms together and helps to get optimum routes for a particular radio range. The approaches used here are Ant Colony Optimization (ACO) and Multi Agent System (MAS). The proposed integrated approach has a relatively short route establishment time while using a small number of control messages which makes it a scalable routing approach. The overhead of this routing approach will be inexpensive and also will enable to have an alternate route during route failure. This proposed route finding scheme in order to provide high connectivity of nodes, will minimize the route discovery latency and the end-to-end delay.

[...] Read more.
Other Articles