IJCST Logo

 

INTERNATIONAL JOURNAL OF COMPUTER SCIENCE & TECHNOLOGY (IJCST)-VOL IV ISSUE I, VER. 2, JAN. TO MARCH, 2013


International Journal of Computer Science and Technology Vol. 4 Issue 1, Ver. 2
S.No. Research Topic Paper ID
   37 A New System for the Development of Collision Free in VANET

Vanita Rani, Dr. Renu Dhir

Abstract

In VANET, or Intelligent Vehicular Ad-Hoc Networking, defines an intelligent way of using Vehicular Networking. InVANET integrates on multiple ad-hoc networking technologies such as WiFi IEEE 802.11, WAVE IEEE 1609, WiMAX IEEE 802.16, and Bluetooth for easy, accurate, effective and simple communication between vehicles on dynamic mobility. Effective measures such as media communication between vehicles can be enabled as well methods to track the automotive vehicles are also preferred. InVANET helps in defining safety measures in vehicles, streaming communication between vehicles, infotainment and telematics. The type of InVANET applications and inherent characteristics such as different network energy level and movement of vehicles from one network to other network makes this task (prior information about traffic) quite challenging. In this paper we focus on Inter Vehicle Communication (IVC) and Roadside to Vehicle Communication (RVC) network, one algorithm has been developed and proposed for implementation in real life IVC and RVC application. This paper’s contribution is a reliable broadcasting method that is especially designed for an optimum performance of public-safety related applications.
Full Paper

IJCST/41/2/A-1315
   38 A Short Survey on Steganography

Manoj Kumar, Anuj Rani

Abstract

Steganography is an art of hiding information in innocuous looking cover objects. The main goal of steganography is to avoid drawing intuition about transmission of message. The terms ‘Steganography’ and ‘Steganalysis’ are used in information hiding process. Steganography basically deals with hiding information in digital media while steganalysis is the method of detecting the presence of hidden message in it. The term ‘Steganography’ is often confused with ‘Cryptography’ which converts message into indecipherable form. Progress made in the field of steganography in terms of using different multimedia files such as images, audio, video, text files as cover objects for hiding information is attracting more people to work in this area.
Full Paper

IJCST/41/2/A-1316
   39 Implementation of Hybrid Cloud Model Based University Scenario Using PKI

B. Santhosh Kumar, Dr. Latha Parthiban, Sabout Nagaraju

Abstract

Education plays a vital role in every human’s life. The purpose of maintaining the education quality and imparting them through various educational institutions is taken up by a university. In the present day education system many colleges will be affiliated to a university which takes the responsibility of maintaining good standards. In this paper a Hybrid cloud model is proposed through which many colleges affiliated to a university can exchange the confidential data with the university in a secure way. Each of the college is implemented as a private cloud with the Public Key Infrastructure (PKI) and the university as a public cloud with the PKI. So the combination of them gives a hybrid cloud model based approach.
Full Paper

IJCST/41/2/A-1317
   40 Iterative Probabilistic Scheduling with Parallel Processing Process

Avtar Singh, Dr.Sandeep Kumar

Abstract

Iterative Probabilistic Scheduling (IPS) is a scheduling algorithm that uses probabilistic approach to schedule traffic and to allocate recourses. It uses Virtual Output Queuing (VOQ) strategy and model is based on Poisson arrivals and M/M/1 queuing system. We proposed IPS with Parallel Processing (WPP) that adds another loop to normal IPS so that more than one packet can be scheduled simultaneously. The VOQs performs the calculation of probability and determines the HOQ packet with high probability which is the one to be schedule. Proposed IPS WPP is compared with normal IPS algorithm.
Full Paper

IJCST/41/2/A-1318
   41 Towards Security and Privacy Issues from Single Cloud to MultiCloud

M. Menaka, C.Deepa, K. Sankar

Abstract

Cloud computing provides an exclusively latest model for enterprise computing since it switches a fixed-cost infrastructure into a new prototype based on utility-oriented services on the subscription basis. Distributed resources and services that belong to different organizations or sites can be shared among the users who significantly reduce the need for investment in computing resources by the organizations. Success of cloud storage providers can present a considerable risk to customers, as it becomes exceptionally expensive to change storage providers. Dealing with “single cloud” providers is less popular due to risks of reliability, failure, service availability and security of data stored. Contrarily, multi-cloud, improves the availability, integrity and confidentiality of information stored in the cloud through encryption, encoding and replication of the data on diverse clouds. Multi-clouds improve the perceived data availability and, in most cases, reduce the access latency significantly, when compared with cloud providers individually. We explored that there has been very little attention devoted by the research community on security and privacy issues of multi cloud providers than with the use of single clouds. This paper is aimed at surveying privacy and security issues of single and multi-cloud and suggests promoting the use of multi-clouds due to minimized security risks that affects the cloud computing user.
Full Paper

IJCST/41/2/A-1319
   42 Mobile Data Collection Using an Android Device

Harpinder Singh

Abstract

Advancements in the field of Information and Communication technology has altered the way we collect, process, distribute and use information for the benefit of the society. In spite of this revolution larger part of the society has not benefited from this technological progress. Data collection projects like collecting information about a disease breakout in a region, socio-economic or census surveys, collecting geo-tagged data during a disaster or creating of inventories of natural resources utilize a lot of resources like personnel, camera’s, GPS (Global Positioning System) device etc which are costly. The collected information is in the form of hand written text, images and GPS points. Lot of time is taken to collect, process and convert this data into useful information. This paper reviews ODK (Open Data Kit) an open-source suite of tools with the help of which data for such projects can be collected and sent to a centralized server using an android device in real time and with least resources.
Full Paper

IJCST/41/2/A-1320
   43 Design of Energy Efficient Charge Recovery Digital Circuits Using Adiabatic Logic Techniques

B. Dilli Kumar, M. Bharathi

Abstract

The power consumption of the electronic devices can be reduced by adopting different design styles. Adiabatic logic style is said to be an attractive solution for such low power electronic applications. This paper presents an energy efficient technique for digital circuits that uses adiabatic logic. The proposed technique has less power dissipation when compared to the conventional CMOS design style. This paper evaluates the basic universal gates NOT, NAND and NOR in different adiabatic logic styles and their results were compared with the conventional CMOS design. The simulation results indicate that the proposed technique is advantageous in many of the low power digital applications.
Full Paper

IJCST/41/2/A-1321
   44 A Comprehensive Survey on Topology Control Algorithms for Wireless Ad-Hoc Networks

K. Sankar

Abstract

In recent years, the technological improvement in wireless communication and mobile computing stimulated a consistent growth both in number and types of implementations for wireless networks. Minimizing power consumption thus improving power efficiency can significantly extend the wireless devices battery longevity and its serviceability. A node must learn neighbourhood nodes that are in direct communication range, before it initiates communication. The gathered relevant information is kept in its internal data structures to apply with routing. The wireless ad-hoc nodes acclimatize dynamically its topology knowledge range, leading to faster convergence of its neighbouring nodes. The intention of topology control is to restrict communication deliberately and use multi-hop paths instead of direct communication links between nodes, even if they are within the communication range of each other. Thus, connectivity or fault-tolerance is preserved while reducing transmission power, improving network capacity, better SNR and also enhanced spatial reuse. In this paper, we present an overview of a range of centralized and distributed topology control algorithms. We also provide an extensive comparison of these algorithms and suggest the metrics to refine future topology control algorithms.
Full Paper

IJCST/41/2/A-1322
   45 An Overview to the Proposed Technique for Image Authentication Using LDPC Codes

Imran Ali Khan, Bhanu Pratap Singh Sengar

Abstract

Image authentication is important in content delivery via untrusted intermediaries, such as peer-to-peer (P2P) file sharing. Many differently encoded versions of the original image might exist. In addition, intermediaries might tamper with the contents. Distinguishing legitimate diversity from malicious manipulations is the challenge addressed in this dissertation. We proposed an approach using encryption and LDPC source coding for the image authentication problem. The key idea is to provide a Slepian-Wolf encoded quantized image projection as authentication data which is again encrypted using a secret key cryptography before ready to send. This can be correctly decoded with the help of an authentic image as side information.
Full Paper

IJCST/41/2/A-1323
   46 Cloud Computing: Business Edge
Sucheta Arora

Abstract

Cloud computing comes into focus only when you think about what IT always needs: a way to increase capacity or add capabilities on the fly without investing in new infrastructure, training new personnel, or licensing new software. Cloud computing encompasses any subscription- based or pay per use service that, in real time over the internet, extends IT’s existing capabilities. It is a style of computing which is having dynamically scalable virtualized resources provided as a service over the Internet. It reduces the time required to procure heavy resources and boot new server instances in minutes, allowing one to quickly scale capacity, both up and down, as ones requirement changes. In this article we try to cover the issues that a company needs to consider when evaluating a cloud service and also identifies some issues and risks involved in controlling cloud computing services and provides recommendations on their appropriate use. We have also discussed about the predictions and future of cloud computing, it is imperative for these enterprises to critically evaluate the feasibility of this technology for their specific businesses. Cloud Computing has many antecedents and equally as many attempts to define it. Cloud Computing offers flexibility whilst simultaneously reducing costs – with the positive side effect of sustainability.
Full Paper

IJCST/41/2/A-1324
   47 Vigorous and Efficient Detection of Replicated Videos in Huge Databases

V.V. Syam, Ramakoteeswara Rao Badana, Sudhir Kumar Raju Gadiraju

Abstract

We present video fingerprints approach which is an efficient and accurate method for duplicate video detection in a large database. To create finger prints We consider a compact and robust frame based descriptor and the color layout descriptor, which are further encoded by Vector Quantization (VQ).We propose a new superior performance giving non metric distance measure to find the similarity between the query and a database video fingerprint for accurate duplicate detection. With existing indexing techniques Using a non metric distance measure Efficient search cannot be performed for high-dimensional data. Therefore, we develop novel search algorithms based on pre computed distances and new dataset pruning techniques yielding practical retrieval times. We perform experiments with a database of 48 000 videos, worth 1700 h of content. For individual queries with an average duration of 65 s (about 50% of the average database video length),the duplicate video is retrieved in 0.042 s, on Intel Xeon with CPU2.33 GHz, with a very high accuracy of 97.8%.
Full Paper

IJCST/41/2/A-1325
   48 Scenario Based Performance Analysis of Routing Protocols in Mobile Ad-Hoc Networks

Komal Kataria, Sukhjit Singh, Ashwani Kumar

Abstract

Mobile Ad-Hoc Networks are admiring day by day due to growing popularity of mobile devices. Routing is a critical task in Mobile Adhoc Network as the nodes move freely in it. Many routing protocols have been proposed like reactive, proactive and hybrid so far to improve the routing performance and reliability. In this research we have conducted a number of simulations in order to evaluate the two of most popular adhoc routing protocols OLSR and DSR based on the performance metrics like Throughput, packet loss ratio and average end to end delay Using NS-2 simulator. This paper presents a fair comparison in OLSR and DSR.
Full Paper

IJCST/41/2/A-1326
   49 Anomalies Detection and Recovery in Firewall Policies

G. Ganesh Sriram, B. I. Swarna Sri, N.Rama Devi, K. Gouthami, S. Arjun Kumar

Abstract

Firewalls are a well known and advanced security mechanisms which ensure the security of private networks in different businesses organization and institutions. The reliability of security provided by a firewall merely depends on the quality of policy configuration of the firewall. Due to the complex nature of firewall configurations as well as the lack of systematic analysis mechanisms and tools it is very difficult task to manage the anomalies in its policies. Detection and recovery of anomalies in firewall policies became a challenging job for the researchers. In this paper we have introduced a novel idea to detect and prevent the anomalies from firewall policies. We have adopted a rule-based segmentation technique to identify firewall anomalies policies and derive effective and secure resolutions. We introduced a grid-based representation technique, with an intuitive cognitive sense about policy anomaly. We also discuss the concept of implementation part of a visualization-based firewall policy analysis tool called Firewall Anomaly Management Environment (FAME). In addition, we have shown an experimental result how efficiently our approach can discover and resolve anomalies in firewall policies.
Full Paper

IJCST/41/2/A-1327
   50 A Survey of Recent Image Segmentation Techniques for MRI Brain Images

S. Valarmathy, R. Ramani, Dr. N. Suthanthira Vanitha

Abstract

Firewalls are a well known and advanced security mechanisms which ensure the security of private networks in different businesses organization and institutions. The reliability of security provided by a firewall merely depends on the quality of policy configuration of the firewall. Due to the complex nature of firewall configurations as well as the lack of systematic analysis mechanisms and tools it is very difficult task to manage the anomalies in its policies. Detection and recovery of anomalies in firewall policies became a challenging job for the researchers. In this paper we have introduced a novel idea to detect and prevent the anomalies from firewall policies. We have adopted a rule-based segmentation technique to identify firewall anomalies policies and derive effective and secure resolutions. We introduced a grid-based representation technique, with an intuitive cognitive sense about policy anomaly. We also discuss the concept of implementation part of a visualization-based firewall policy analysis tool called Firewall Anomaly Management Environment (FAME). In addition, we have shown an experimental result how efficiently our approach can discover and resolve anomalies in firewall policies.
Full Paper

IJCST/41/2/A-1328
   51 Design and Implementation of CTS CMOS Charge Pump

Sakshi Rajput

Abstract

This CMOS charge pump is suitable for low voltage applications, can be operate with very low voltage supply voltage. In this charge pump MOS transistor are used as charge transfer switches to eliminate the effect of threshold voltage in each pumping stage. The output of the dynamic inverter controllers the MOS switch of each pumping stage for reducing the risk of reverse current and for this we need not extra circuitry. The Charge pump circuit is able to generate booth positive and Negative voltage. The converter consists of a charge pump circuit operated at 20 MHz from 1.5V to 5V. The desired output voltages, 6.46V to 20V.
Full Paper

IJCST/41/2/A-1329
   52 Human Identification by Gait Using Model Base Approach

Oshin Sharma, Sushil Kumar Bansal

Abstract

Recognition of any individual is a task to identify people. Human identification using Gait is method to identify an individual by the way he walk or manner of moving on foot. Gait recognition is a type of biometric recognition and related to the behavioural characteristics of biometric recognition. Gait offers ability of distance recognition or at low resolution. In this paper we present the review of gait recognition system, different approaches and classification categories of Gait recognition like model free and model based approach, MDA, PCA, BPNN, SVM.
Full Paper

IJCST/41/2/A-1330
   53 VLSI Implementation of Decision Tree Classification Using C4.5 Algorithm

Delna Davis, J Samson Immanuel

Abstract

In recent years, the size of the data being collected and analysed increased tremendously. Because of this, Data mining techniques have become important to researchers in science, engineering, medicine, business and security domains. The main difficulty in datamining is classification. Decision Tree Classification (DTC) is the most accepted solution for this problem, that gives high precision while handling very large amount of data. This paper presents VLSI implementation of flexible architecture for Decision Tree classification in data mining using c4.5 algorithm.
Full Paper

IJCST/41/2/A-1331
   54 A Review of Clustering Algorithms

Suchita S. Mesakar, M. S. Chaudhari

Abstract

Data mining is the process of extracting meaningful data or knowledge from large amount of data. Clustering is the dynamic field of research in data mining. Data clustering is used in variety of applications like pattern matching, machine learning, image segmentation and information retrieval. The aim of clustering is to group data into clusters or groups, so that data in the same cluster are more similar to each other than to those in other clusters. There is large amount of data available in the database; fast retrieval of data from database is always required. So clustering the data will ease the task of retrieval of data from database. This paper presents an overview of various clustering algorithms used for clustering numerical and categorical data.
Full Paper

IJCST/41/2/A-1332
   55 Design and Implementation of High Pumping Efficiency CMOS Charge Pump

Sakshi Rajput

Abstract

In this paper, low threshold CMOS charge pump is designed and different analysis has been done. To remove the threshold drop as in Dynamic charge pump this architecture is used. This low threshold CMOS charge pump removes the threshold drop across the last diode connected transistor using a circuitry which provides dynamic switching.
Full Paper

IJCST/41/2/A-1333
   56 Advanced Encryption Standard and Fault Detection for High Performance

Jishamol T.K, K. Rahimunnisa, Ginu Thomas

Abstract

Advanced Encryption Standard (AES) algorithm is a symmetric block cipher that can encrypt and decrypt the information. This paper presents the AES Algorithm. The look up table is used for implementing the AES S-box and inverse S-box. The AES has been built as the first choice for many cryptographic applications because of the high level of security. However the faults that can accidently occur in the hardware implementation may cause erroneous encrypted or decrypted output that, results in losing the original information. At the end of this design, a parity based fault detection scheme for high performance AES is also presented.
Full Paper

IJCST/41/2/A-1334
   57 Software Quality Assurance Based on Order Statistics

Dr. R. Satya Prasad, D. Haritha

Abstract

Statistical Process Control is an effective technique to optimize the quality and productivity of large scale software firms. Control charts are extensively used to monitor the process to note the variations in the software process that are results of unpredictable causes that behave in an unintended way results in fixing the bug in a flash by the team lead. For an effective monitoring of failure process the time between every rth failure (r is a natural number >=2) instead of inter-failure times is considered for developing a variable control chart called Time Control Charts. This paper projects a controlling framework based on order statistics of the cumulative quantity between observations of time domain failure data using mean value function of Logarithmic Poisson Execution Time Model (LPETM), which is a Non Homogenous Poisson Process (NHPP). The two unknown parameters of the Logarithmic model are arrived at, using The Maximum Likelihood Estimation (MLE).
Full Paper

IJCST/41/2/A-1335
   58 Detection and Removal of Packet Dropper Nodes for Congestion Control Over MANET

Reeta Bourasi, Sandeep Sahu

Abstract

Mobile Ad-Hoc network is wireless network of mobile nodes, with no centralized management and control. Network congestion has a severe impact on the throughput, routing and lifespan, etc. of a network. Packet dropper nodes have a major and worst impact in congestion over the MANET. Packet dropping nodes do not forward the incoming packets and may send the acknowledgement to the sender node. In this paper, we focus on the data packet dropping in Mobile Ad-hoc Network in both dense and a few node counts. The packet dropper nodes are eliminated using a new algorithm by adding a reliability factor of each node which is increased when the node receives the acknowledgement of the forwarded packet to assure that the node has actually forwarded the packet and have not dropped it. For showing the working of the algorithm, simulations has been created using NS2.
Full Paper

IJCST/41/2/A-1336
   59 Analysis of Web Page Prediction by Markov Model and Modified Markov Model With Association Rule Mining

Sampath P, Ramya D

Abstract

Web prediction is a classification problem in which we have to predict the next set of Web pages that a user may visit based on the knowledge of the previously visited pages. Predicting user’s behavior can be applied effectively in various critical applications in the internet environment. Such application has traditional tradeoffs between modeling complexity and prediction accuracy. The web usage mining techniques are used to analyze the web usage patterns for a web site. The user access log is used to fetch the user access patterns. The access patterns are used in the prediction process. Markov model and all-Kth Markov model are used in Web prediction. A modified Markov model is proposed to alleviate the issue of scalability in the number of paths. The framework can improve the prediction time without compromising prediction accuracy. The proposed system is to compare the prediction accuracy with the markov model and modified markov model. The system improves the accuracy with scalability considerations.Finally the result will shows which would have better prediction accuracy.
Full Paper

IJCST/41/2/A-1337
   60 PC Based Speed Control of Stepper Motor Using Wired Communication

Jeetender Singh Chauhan, Atul Kumar Pandey, Gyan Prabhakar

Abstract

Stepper motors are used in many devices and appliances that are part of our everyday life. Sensing variables such as position, velocity or current for the purpose of control is a common problem in many industrial drive applications Sensing signals that truly represents system variables, such as absolute shaft position, may be a difficult either because of cost or physical limitations. In such cases we must estimate all or some of the missing variables from limited measurements that may be noisy. The objective of this project is to design and implement a Microcontroller circuit to control the stepper motor via keypad. This enables the Microcontroller circuit to control the speed and step angle of the stepper motor. When user input different commands through the keypad. This project gives exact concept of interfacing a high voltage electrical device or DC / AC motor to high sensitive personal computer system. The developed system we can develop the GUI to monitor and control the speed of stepper motor. The project can be divided into two element which hardware and software. The hardware of the proposed system and interfacing with computer using RS232 serial communication port. We are using the RS-232 as the communication medium between PC and controller.
Full Paper

IJCST/41/2/A-1338
   61 A New Algorithmic Approach to Improve MCDS Based Routing In Mobile Ad-Hoc Network

Shalu Singh, Ekta Singhal, Neha jain

Abstract

In recent year, many Researchers have proposed to restrict the routing process in Mobile Ad hoc networks by formation of a Virtual Backbone. A virtual backbone can reduce the Communication Overhead, increase the Bandwidth Efficiency, reduce Channel Bandwidth Consumption, decrease Management. Thus virtual backbone is being employed to optimize the number and locations of the resource centers in a give Wireless Ad hoc network. Only virtual backbone situated nodes act as routers and thus other nodes need not to acquire, keep, or update routing information. Generally CDS concept is implemented as virtual backbone in Mobile Ad hoc network and it must be of Minimum Size. Algorithms to find CDS in Ad hoc networks is divided into two types of Centralized (Global) Algorithms and Decentralized (Local) Algorithms.
Full Paper

IJCST/41/2/A-1339
   62 Task Division Algorithm for Mobile Cloud Computing (TDAMCC)

Nachiketa Shrivastava, Ravimohan, Sumit Sharma, Manjul Dhoomketu Shrivastava

Abstract

Cloud Computing is spreading rapidly around the world and cloud applications are being used extensively for facilitating users for not only storage management but for providing load sharing and easy delivery of the applications. Mobile cloud computing is an area which is also leveraging the advantages of the cloud computing in development, maintenance and high performance of the mobile devices. Since mobile devices are low resources in terms of processing power, memory and screen area therefore it is required that the mobile applications should apply as small work on mobile as possible. This paper presents an algorithm for dividing the loads being carried by mobile devices over the cloud which performs the task of searching on the clouds and provides results to the mobile device which first demands the particular items and then shows the generated results to the mobile user. For achieving the task an application is being developed which shall add all the contact details on the cloud dynamically and will maintain the result. Whenever a user applies the search for contacts another part of the application will send the search to the cloud which will perform the actual search and will send the generated results to the mobile device. The proposed work a framework which can be applied for any data which requires extensive load on CPU and makes the mobile burdened for processing.
Full Paper

IJCST/41/2/A-1340
   63 Review: Performance Evaluator of Optimized Text Summary Algorithm

Madhuri K. Gawali, M. S. Bewoor, Dr. S. H. Patil

Abstract

Large amount of information is available on internet. The information available on internet is in unstructured manner, retrieving relevant documents containing the required information is difficult. Due to huge amount of data, query-specific document summarization has become an important problem. It is difficult task for the user to go through all these documents, as the number of documents available on particular topic will be more. It will be helpful for the user if query specific document summery is generated. Comparing different clustering algorithms those provide better result for summarization. Based on this we provide input as one query and get all the documents related to that and on these document different clustering algorithm are used to get results of each Algorithm. Then comparing each result with each other in terms of speed, memory, and quality of summary. After comparison we can decide which algorithm is better for summarization. So it will help to find the better query dependent clustering algorithm for text document summarization.
Full Paper

IJCST/41/2/A-1341
   64 Content Based Video Retrieval Using Multi Features

M. Nagaraju, B. Srinuvasukumar

Abstract

Content-based retrieval allows finding information by searching its content rather than its attributes. The challenge facing Content-Based Video Retrieval (CBVR) is to design systems that can accurately and automatically process large amounts of heterogeneous videos. Moreover, content-based video retrieval system requires in its first stage to segment the video stream into separate shots. Afterwards features are extracted for video shots representation. And finally, choose a similarity/distance metric and an algorithm that is efficient enough to retrieve query – related videos results. There are two main issues in this process; the first is how to determine the best way for video segmentation and key frame selection. The second is the features used for video representation. Various features can be extracted for this sake including either low or high level features. A key issue is how to bridge the gap between low and high level features. This paper proposes a system for a content based video retrieval system that tries to address the aforementioned issues by using adaptive threshold for video segmentation and key frame selection as well as using both low level features together with high level semantic object annotation for video representation. Experimental results show that the use of multi features increases both precision and recall rates by about 13% to 19 % than traditional system that uses only color feature for video retrieval.
Full Paper

IJCST/41/2/A-1342
   65 A Secure Authentication Scheme for Blocking Misbehaving Users in Anonymizing Network

Sathiya D, Aravinthan K

Abstract

Some of the users start defacing the websites through anonymous network. Finding the misbehaving users in anonymizing network such as tor is not possible as they allow users to access internet services privately by using a series of routers to hide the client’s IP address from the server. As a result, administrators block all known exit nodes of anonymizing networks, denying anonymous access to misbehaving and behaving users alike. To address this problem distributed nymble with client puzzle techniques are introduced in which honest users remain anonymous and their requests are unlinkable, a server can complain about a particular anonymous user and gain the ability to blacklist the user for future connections, this blacklisted user’s accesses before the complaint remain anonymous and users are aware of their blacklist status before accessing a service and also the system is agnostic to different servers definitions of misbehavior. Scalability and robustness is achieved automatically as a result of the distributed system.
Full Paper

IJCST/41/2/A-1343
   66 Dynamic Load Balancing Algorithms for Distributed Networks

M. Thejovathi

Abstract

In this paper, We propose two efficient algorithms. Referred as Rate-based Load Balancing via Virtual Routing (RLBVR) and Queue-based Load Balancing via Virtual Routing (QLBVR), which belong to the above RAP and QRAP policies. we classify the dynamic distributed load balancing algorithms for heterogeneous distributed computer systems into three policies: Queue Adjustment Policy (QAP), Rate Adjustment Policy (RAP), and Queue and Rate Adjustment Policy (QRAP). We also consider algorithms Estimated Load Information Scheduling Algorithm (ELISA) and Perfect Information Algorithm, which were introduced in the literature, to implement QAP policy. Our focus is to analyze and understand the behaviours of these algorithms in terms of their load balancing abilities under varying load conditions (light, moderate, or high) and the minimization of the mean response time of jobs. We compare the above classes of algorithms by a number of rigorous simulation experiments to elicit their behaviours under some influencing parameters, such as load on the system and status exchange intervals. We also extend our experimental verification to large scale cluster systems such as a Mesh architecture, which is widely used in real-life situations. From these experiments, recommendations are drawn to prescribe the suitability of the algorithms under various situations.
Full Paper

IJCST/41/2/A-1344
   67 A Swarm Intelligence Algorithm to Prevent Selective Jamming Attacks in Wireless Network

Gomathi S, Aravindhan K

Abstract

Open nature of the wireless medium leaves it vulnerable to intentional interference attacks, typically referred to as jamming. When intentional interference combined with wireless transmission it can be used as a launch pad for mounting denial-of-Service attacks on wireless networks. The advantages of selective jamming in terms of network performance degradation and adversary effort by presenting two case studies a selective attack on TCP and one on routing. Adversary active only for a short period of time selectively target messages of high importance. Selective jamming attacks can be launched by performing real-time packet classification at the physical layer. The jammer may decode the first few bits of a packet for recovering useful packet identifiers such as packet type, source and destination address. These attacks can be prevented by three schemes: commitment, cryptographic puzzle and AONTS. The combination of cryptographic primitives with physical layer attributes is used for preventing real-time packet classification and a swarm intelligence algorithm is used for preventing jamming attacks in wireless networks. Swarm intelligence algorithm is proficient enough to adapt changes in network topology and traffic. The sender and receiver change the channels in order to stay away from the jammer, in channel hoping technique.
Full Paper

IJCST/41/2/A-1345
   68 A Comparison of Two Intrusion Detection Systems

R.China Appala Naidu, P.S.Avadhani

Abstract

In this paper the performance of the intrusion detection system SNORT, SURICATA are analyzed and tested for Packet loss. It is observed that there is a significant increase in the packet drop when the traffic speed is increased simultaneously. Similarly when the packet size is increased then the drop in packets also decreases.
Full Paper

IJCST/41/2/A-1346
   69 Image Based Personalized Search from the Picture Sharing Websites

V. Sangeetha, Amzed Ali Shaik

Abstract

Although search has become a popular feature in many search engines, including Yahoo!, MSN, Google, etc., the majority of image searches use very little, if any, image information. Due to the success of text-based search of Web pages and, in part, to the difficulty and expense of using image based signals, most search engines return images solely based on the text of the pages from which the images are linked.Web search engines help users find useful information on the World Wide Web (WWW). However, when the same query is submitted by different users, typical search engines return the same result regardless of who submitted the query. Users are increasingly pursuing complex task oriented goals on the Web, such as making travel arrangements, managing finances or planning purchases. Searchers create and use external records of their actions and the corresponding results by writing/ typing notes, using copy and paste functions, and making printouts. The social media sites, such as Flickr and del.icio.us, allow users to upload content and annotate it with descriptive labels known as tags, join special-interest groups, etc. We believe user-generated metadata expresses user’s tastes and interests and can be used to modified information to an individual user. Specifically, we describe a machine learning method that analyzes a corpus of tagged content to find hidden topics. We then these learned topics to select content that matches user’s interests. We empirically validated this approach on the social picture-allocation site Flickr, which allows users to annotate icon s with freely chosen tags and to search for icon s labeled with a certain tag. We use metadata associated with icon s tagged with an ambiguous query term to identify topics corresponding to different senses of the term, and then modified results of icon search by displaying to the user only those icon s that are of interest to her.
Full Paper

IJCST/41/2/A-1347
   70 Software Defect Prediction Using One Pass Data Mining Algorithm

Marri Syam Sudhakar, BR. Sarat Kumar

Abstract

The software defect prediction is one of the most important areas that attracts researcher’s to prevent the defect that going to damage the system that will construct. The current software defect prediction focuses on First identifying numbers of defects remains in already constructed system. Second discovering software defects rules that are useful to future discussions about software defects. Finally classifying the defect proneness of software components. This paper focus only on second type i.e. describes the framework for finds defect Association in software defect database. Using association rules mining. It constructs all request patterns in the historical database. Then discover strong association rules in defect database. The experimental results shows that algorithm which presented in this paper at perform previous work.
Full Paper

IJCST/41/2/A-1348