Vol 2 Issue 2 April 2014-June 2014

Abstract: As Wireless Sensor Networks has ability to cope with node failures and it helps in mobility of nodes. So WSN needs effective security mechanisms because sensor networks may interact with sensitive data. This paper includes an overview on security and describes some unique security challenges a WSNs faces with. We will discuss about some security threats and review some proposed security challenges for WSNs.

Keywords: WSN, Security, Threats, Challenges, Attacks.

Title: A Survey on Wireless Sensor Network Security

Author: Payal Arora, Asha Gupta

International Journal of Computer Science and Information Technology Research

ISSN 2348-120X (online), ISSN 2348-1196 (print)

Research Publish Journals

Abstract: Education systems around the world are transitioning from the conventional educational practices to digitized learning. However the adoption remains largely unrealized in economically transitioning countries due to low adoption of usage factors. This is as a result of learning institutions’ focus on the technical supply-side factors with little emphasis on the end user factor perspective of mobile learning. There has been inadequate research and development in IT usage factors to inform education sector’s uptake of Mobile Learning adoption in learning institutions. While a number of adoption models have been proposed and applied to the developed countries, they require domestication in order to address the specific consumer needs of developing nations. This study therefore develops a theoretical model which best support learner centered adoption in educational institutions.

Keywords: Mobile Learning adoption, e-learning.

Title: A Theoretical End User Factor Model That Supports Mobile Learning

Author: RICHARD K. NYAKUNDI, STEPHEN KIMANI, CYRUS ABANTI   

International Journal of Computer Science and Information Technology Research

ISSN 2348-120X (online), ISSN 2348-1196 (print)

Research Publish Journals

Abstract: Data mining is important and useful tool amongst several systematic tools for extracting data that are accumulated in a database. Frequent pattern mining is one of data mining, which will extract the items that occur more number of times. Data may be of any kind, facts, numbers, or text. In recent years, Organizations are accumulating huge and increasing amounts of data in dissimilar formats and different databases. Frequent itemset mining, which focuses on finding a relationship among data. Change mining, detects and report any considerable changes if occurs in the set of mined itemsets from different time periods. This project extends the vibrant change mining problem, in the framework of frequent itemsets, by exploiting recurrent generalized itemsets to characterize information linked with infrequent patterns. To address this issue, I introduce two novel kinds of vibrant patterns, namely the HIGEN MINER (History Generalized pattern) and NON-REDUNDANT HIGEN MINERs. HIGEN MINER detects the mined frequent itemset, if any items become infrequent during next extraction those changes are focused and avoided by Apriori based support driven approach. NON-REDUNDANT HIGEN MINER, which stores items whose support value is minimum, these infrequent items may become frequent during next extraction. If it remains same, then these infrequent items are discarded.

Keywords: Frequent itemset mining, Change mining, Association Rule Extraction, Higen Miner, Non-Redundent Higen Miner.

Title: DISCOVERY OF FREQUENT AND NON-REDUNDENT ITEMSET USING HIGEN MINER

Author: S.KIRUTHIKA, T.SHEIK YOUSUF

International Journal of Computer Science and Information Technology Research

ISSN 2348-120X (online), ISSN 2348-1196 (print)

Research Publish Journals

Abstract: Cloud computing is emerging field because of its performance, high availability, least cost and many others. Besides this companies are binding there business from cloud computing because the fear of data leakage. Due lack of proper security control policy and weakness in safeguard which lead to many vulnerability in cloud computing. This paper has been written to focus on the problem of data leakage and proposes a framework works in two phases. First phase which is known as Data classification is done by client before storing the data. During this phase the data is to be categorized on the basis of CIA (Confidentiality, Integrity, and Availability). The client who wants to send the data for storage needs to give the value of C (confidentiality), I (integrity), A (Availability). The value of C is based on level of secrecy at each junction of data processing and prevents unauthorized disclosure, value of I based on how much assurance of accuracy is provided, reliability of information and unauthorized modification is required, and value of A is based on how frequently it is accessible. With the help of proposed formula, the priority rating is calculated. Accordingly data having the higher rating is considered to be critical and 3D security is recommended on that data. After completion of first phase the data which is received by cloud provider for storage, uses 3Dimentional technique for accessibility. The sensitive proved data will send for storage to cloud provider. According to the concept of 3D user who wants to access the data need to be authenticated, to avoid impersonation and data leakage. Now there is third entity who is either company’s (whose data is stored) employee or customer who want to access, they need to register first and then before every access to data, his/her identity is authenticated for authorization.

Keywords: Cloud security, Data protection, Cost Reduction, Data Storage, Confidentiality, Integrity, Availability.

Title: 3-D (Dimensional) security in Cloud Computing

Author: Ms. Gayatri Dhavale, Mr. Rajnish Kumar Baranwal, Mr. Kapil Nagare, Mrs. S.N. zaware

International Journal of Computer Science and Information Technology Research

ISSN 2348-120X (online), ISSN 2348-1196 (print)

Research Publish Journals

Abstract: This paper provides a brief introduction of operating system, their types, working, successive advancement in operating systems in past years and comparison with each other. The comparison is done on the basis of cost, function, architecture, uses, interface etc.

Keywords: Operating System, Linux, Windows etc.

Title: Operating System

Author: Pankaj Gupta, Piyush Kumar, Sandeep, Saksham Wason, Vishal Yadav

International Journal of Computer Science and Information Technology Research

ISSN 2348-120X (online), ISSN 2348-1196 (print)

Research Publish Journals

Abstract: Peer-2-Peer system exposes them to malicious activity. Peer-2-Peer system means computer in the system can act as both client and server. In a Peer-2-Peer network, the peers are computer systems which are connected to each other via the internet. Files can be shared directly between systems on the network without the need of a central server. Building trust relationships among peers can decrease the attacks of malicious peers. A good peer uploads authentic files and gives fair recommendations. A malicious peer performs both service and recommendation-based attacks. Uploading a virus infected (or) an inauthentic file is a service based attack. Giving a misleading recommendation intentionally is a recommendation based attack. Self Organizing Trust Model (SORT) detects the service based attack and recommendation based attack. If one peer wants to upload/download file from another peer means peer will send the query to peer that interacted in the past for learn the trust information of other peers. So, neighboring node will give the recommendation to peer. Based on the recommendation only Peer decides whether the node is good (or) malicious. Find the node is malicious node means peer will not interact with malicious node. Isolate the malicious node from the network. Find the node is good means peer interact with good peer. Peer stores a separate history of interactions for each Acquaintance.

Keywords: Peer-to-peer systems, trust management, reputation, security.

TItle: Managing Trust Relationships in Peer 2 Peer Systems

Author: R.S.SINJU, C.FELSY

International Journal of Computer Science and Information Technology Research

ISSN 2348-120X (online), ISSN 2348-1196 (print)

Research Publish Journals

Abstract: Key management between nodes can be addressed when public key infrastructure (PKI) or an online trusted third party (TTP) is available. These solutions cannot always be applied to resource constrained devices operating in pervasive environments because of both the lack of either a PKI or a TTP, and bandwidth overhead required by asymmetric cryptography. Robust air key management to allow two wireless communicating parties to commit over-the-air on a shared secret, even in the presence of a globally eavesdropping adversary. The Existing system no crypto but just plain text message exchange, for each one bit transmission, the sender of that bit not its value, which is indeed exchange in clear text. The proposed system using alpha algorithm in which a buffer is used to store all the data to be transferred from node to node in the network so that the transfer of data will be efficient. While sending the data bit by bit if any bit losses then particular bit will be stored in the buffer.

Keywords: key management, over the air (OTA), trusted third party (TTP).

Title: A Robust Air key Management using buffer concept

Author: B. BINDHU, Mrs. C. FELSY

International Journal of Computer Science and Information Technology Research

ISSN 2348-120X (online), ISSN 2348-1196 (print)

Research Publish Journals

Abstract: In predictable mobile networks, network nodes move in a predictable way and therefore have dynamically changing but predictable connectivity. This model is used to develop a predictable dynamic topologies as sequences of static snapshots. This model is used to design and evaluate a predictable mobile-routing protocol based on link-state routing, the routing protocol accounts for occurrences of additional, unpredictable changes, as well as their interaction with predictable changes. The protocol evaluates using simulations based on randomly generated topologies and spacecraft-network scenarios. This is also using the firewall detection, to control the information to the third party. This can be controlled by satisfying certain set of rules and conditions.

Keywords:  Routing, predictable mobility, spacecraft networks, space link.

Title: A Routing In Predictable Networks Using Firewall Detection for Satellite Networks

Author: Naga Lekshmi. S

ISSN 2348-1196 (print), ISSN 2348-120X (online)

International Journal of Computer Science and Information Technology Research

Research Publish Journals

Abstract: This paper presents different machine learning algorithms. Machine learning algorithms are becoming popular day by day in real time applications like intrusion detection system, diabetes mining, e-mail spam classification etc. The idea behind the data mining is very straight it is same like a human being become intelligent from examples and experience. In data mining; rules are developed by taking the behaviour of given system (data set). Then these rules are used to evaluate the behaviour/outcome for the given circumstances. The overall objective of this paper is to classify some well-known data mining algorithms.

Keywords:  Machine learning, Data mining, Decision trees, clustering.

Title: A REVIEW ON DATA MINING ALGORITHMS

Author: Maninder Singh

ISSN 2348-1196 (print), ISSN 2348-120X (online)

International Journal of Computer Science and Information Technology Research

Research Publish Journals

Abstract: Data mining is the useful technology for extracting knowledge buried in large storage of data. Discrimination is one of the negative effects of data mining. Automatic collection of data and data mining techniques such as classification  have cleared the way to make  automatic decisions, like loan granting/denial, insurance premium computation, giving job etc. In classification, if the banking training datasets are discriminated towards any sensitive attributes like gender, age, religion, etc., then the resulting decisions will have discrimination like loan rejection. Discrimination discovery and discrimination prevention are the two anti-discrimination techniques introduced in data mining. Gender discrimination, age discrimination, racial discrimination are some of the examples of discrimination. But all these discriminations come under the two class namely, direct and indirect discrimination. If the resulting decision depends directly on sensitive attributes, it comes under direct discrimination. If it depends on background knowledge like census data, other than the sensitive attributes it is indirect.  The discrimination problems in banking services like loan grant/deny are resolved with the help of anti-discrimination technique. Also the measures of discrimination are identified. The training data related to banking services are transformed in the correct way to remove the discriminatory biases, while maintaining data quality.

Keywords: Anti-discrimination, Classification, Pre-processing, Rule protection, Rule generalization.

Title: APPLYING ANTI-DISCRIMINATION TECHNIQUES IN BANKING SERVICES

Author:  P. SWARNA REKHA, M. KAYATHRI DEVI

International Journal of Computer Science and Information Technology Research

ISSN 2348-120X (online), ISSN 2348-1196 (print)

Research Publish Journals