International Journal of Advanced Networking and Applications

3687-3691

Authors: Fatemeh SoleimaniRoozbahani; Reza ShojaeiBarjouei; Sanaz Nikghadam Hojjati

Nowadays organizations are using information systems for optimizing processes in order to increase coordination and interoperability across the organizations. Since Oil and Gas Industry is one of the large industries in whole of the world, there is a need to compatibility of its Information Systems (IS) which consists three categories of systems: Field IS, Plant IS and Enterprise IS to create interoperability and approach the optimizing processes as its result. In this paper we introduce the different models of information systems integration, identify the types of information systems that are using in the upstream and downstream sectors of petroleum industry, and finally based on expert’s opinions will identify a suitable model for information systems integration in this industry.

3698-3703

Authors: Pinki Sharma; Jyotsna Sengupta; P. K. Suri

Security and Performance aspects of cloud computing are the major issues which have to be tended to in Cloud Computing. Intrusion is one such basic and imperative security problem for Cloud Computing. Consequently, it is essential to create an Intrusion Detection System (IDS) to detect both inside and outside assaults with high detection precision in cloud environment. In this paper, cloud intrusion detection system at hypervisor layer is developed and assesses to detect the depraved activities in cloud computing environment. The cloud intrusion detection system uses a hybrid algorithm which is a fusion of WLI- FCM clustering algorithm and Back propagation artificial Neural Network to improve the detection accuracy of the cloud intrusion detection system. The proposed system is implemented and compared with K-means and classic FCM. The DARPA’s KDD cup dataset 1999 is used for simulation. From the detailed performance analysis, it is clear that the proposed system is able to detect the anomalies with high detection accuracy and low false alarm rate.

3713-3716

Authors: Saritha. D; Sathya Priya. B; Kalpana. M; Manonmani.V

Agriculture plays an important role in the economy of our country. Over 58 percent of the rural households depend on the agriculture sector as their means of livelihood. Agriculture is one of the major contributors to Gross Domestic Product(GDP). Seeds are the soul of agriculture. This application helps in reducing the time for the researchers as well as farmers to know the seedling parameters. The application helps the farmers to know about the percentage of seedlings that will grow and it is very essential in estimating the yield of that particular crop. Manual calculation may lead to some error, to minimize that error, the developed app is used. The scientist and farmers require the app to know about the physiological seed quality parameters and to take decisions regarding their farming activities. In this article a desktop app for seed germination percentage and vigour index calculation are developed in PHP scripting language.

3724-3727

Authors: Dr. Harsh Dev; Anjani Gupta; Himanshi Jain; Aditya Agarwal; Raghvendra Gupta; Kavleen Kaur

Due to the availability of complicated devices in industry, models for consumers at lower cost of resources are developed. Home Automation systems have been developed by several researchers. The limitations of home automation includes complexity in architecture, higher costs of the equipment, interface inflexibility. In this paper as we have proposed, the working protocol of PIC 16F72 technology is which is secure, cost efficient, flexible that leads to the development of efficient home automation systems. The system is operational to control various home appliances like fans, Bulbs, Tube light. The following paper describes about components used and working of all components connected. The home automation system makes use of Android app entitled “Home App” which gives flexibility and easy to use GUI.

3735-3740

Authors: Kokila Jamwal; Lalit Sen Sharma

The cyber attacks have become most prevalent in the past few years. During this time, attackers have discovered new vulnerabilities to carry out malicious activities on the internet. Both the clients and the servers have been victimized by the attackers. Clickjacking is one of the attacks that have been adopted by the attackers to deceive the innocuous internet users to initiate some action. Clickjacking attack exploits one of the vulnerabilities existing in the web applications. This attack uses a technique that allows cross domain attacks with the help of userinitiated clicks and performs unintended actions. This paper traces out the vulnerabilities that make a website vulnerable to clickjacking attack and proposes a solution for the same.

3411-3420

Authors: Patel Rinkuben N., Dr. Nirav V. Bhatt

Networking is a trending research area where the various research took place. Diversified filed of the Network is Sensor Network, which is a centrally adopted due to features and flexibility of sensors. Various disciplines like a military, medical, forest, Industries, Health monitoring and more, where WSN is established. Sensors have various pitfalls like limited lifetime and Storage, installed in misanthropic environments. Frequently power up or replace an energy source is a crucial task. Data communication in WSN is possible in the MAC layer. MAC is responsible for node schedule and sensing task. Collision and retransmission also lead to waste of energy. Variety of MAC protocols are developed for various qualities of service factors like energy, latency, reliability, delay, jitter, etc., however, none of them are given a satisfactory result for various QoS parameters. To overcome some of the pitfalls we need to achieve various QoS parameters. In this Research MAC is designed with a priority mechanism over clusters. Data with the highest priority are sent without or with a very negligible amount of delay. Higher priority packets are transmitted before a no prioritized packet. Using various priorities, the node energy, low delay and high throughput are achieved over standard MAC Protocols.

3428-3431

Authors: Atul Chaturvedi, Manoj Kumar Misra, Varun Shukla, Neelam Srivastava, S.P.Tripathi

The available key agreement schemes using number theoretic, elliptic curves etc are common for cryptanalysts and associated security is vulnerable. This vulnerability further increases when we talk about modern efficient computers. So there is a need of providing new mechanism for key agreement with different properties so intruders get surprised and communication scenarios becomes stronger than before. In this paper, we propose a key agreement protocol which works in a non commutative group. We prove that our protocol meets the desired security attributes under the assumption that Conjugacy Search Problem and Decomposition Problem are hard in non commutative groups.

3443-3450

Authors: M.Sithara, M.Chandran, G.Padmavathi

With trends and technologies, developments and deployments, network communication has become vital and in evitable with human beings. On the other side, a network communication without security is powerless. There are so many technologies and developments have been rooted to provide a secure and an efficient means of communication through network. Parallel to this, network threats and attacks are also trendy and much technologized. In order to detect such a kind of threats and attacks, this research work proposes honeypot technology. Honeypot is a supplemented active defense system for network security. It traps attacks, records intrusion information about tools and activities of the hacking process, and prevents attacks outbound from the compromised system. This research work implements a kind of honeypot called Secure Shell (SSH) honeypot. SSH honeypot is a secure communication channel which allows users to remotely control computer systems. With the implementation of SSH honeypot, this research work collects the incoming and outgoing traffic data in a network. The collected traffic data can be then analyzed to detect outliers in order to find the abnormal or malicious traffic. This research work detects outliers from the collected SSH honeypot data using Particle Swarm Optimization technique which belongs to the category of cluster-based outlier detection method. With experiments and results, Particle Swarm Optimization shows best results in detecting outliers and has best cost function when compared to other cluster-based algorithms like Genetic Algorithm and Differential Evolution algorithm.

3455-3460

Authors: Manas Kumar Yogi, L. Yamuna

This paper is intended to introduce an efficient as well as robust training mechanism for a neural network which can be used for testing the functionality of software. The traditional setup of neural network architecture is used constituting the two phases -training phase and evaluation phase. The input test cases are to be trained in first phase and consequently they behave like normal test cases to predict the output as untrained test cases. The test oracle measures the deviation between the outputs of untrained test cases with trained test cases and authorizes a final decision. Our framework can be applied to systems where number of test cases outnumbers the functionalities or the system under test is too complex. It can also be applied to the test case development when the modules of a system become tedious after modification.

3362-3375

Authors: Mohamed H. Farrag, Mona M. Nasr

The incredible rising of online networks show that these networks are complex and involving massive data.Giving a very strong interest to set of techniques developed for mining these networks. The clique problem is a well known NP-Hard problem in graph mining. One of the fundamental applications for it is the community detection. It helps to understand and model the network structure which has been a fundamental problem in several fields. In literature, the exponentially increasing computation time of this problem make the quality of these solutions is limited and infeasible for massive graphs. Furthermore, most of the proposed approaches are able to detect only disjoint communities. In this paper, we present a new clique based approach for fast and efficient overlapping community detection. The work overcomes the short falls of clique percolation method (CPM), one of most popular and commonly used methods in this area. The shortfalls occur due to brute force algorithm for enumerating maximal cliques and also the missing out many vertices that leads to poor node coverage. The proposed work overcome these shortfalls producing NMC method for enumerating maximal cliques then detects overlapping communities using three different community scales based on three different depth levels to assure high nodes coverage and detects the largest communities. The clustering coefficient and cluster density are used to measure the quality. The work also provide experimental results on benchmark real world network to demonstrate the efficiency and compare the new proposed algorithm with CPM method, The proposed algorithm is able to quickly discover the maximal cliques and detects overlapping community with interesting remarks and findings.

3382-3386

Authors: Mohamed H. Farrag, Mona M. Nasr

In recent years, cloud computing become mainstream technology in IT industry offering new trends to software, platform and infrastructure as a service over internet on a global scale by centralizing storage, memory and bandwidth. This new technology raises some new opportunities in producing different business operations which influence some new business benefits also some different risks issues are involved using cloud computing. This paper attempts to identify cloud computing approaches, highlights its business opportunities and help cloud computing user to analysis the cloud computing risks and to produce different solving approaches. This paper is targeted towards business and IT leaders considering a move to the cloud for some or all of their business applications.

3391-3395

Authors: Rahul Desai, Dr. B P Patil

In this paper, prioritized sweeping confidence based dual reinforcement learning based adaptive routing is studied. Routing is an emerging research area in wireless networks and needs more research due to emerging technologies such as wireless sensor network, ad hoc networks and network on chip. In addition, mobile ad hoc network suffers from various network issues such as dynamicity, mobility, data packets delay, high dropping ratio, large routing overhead, less throughput and so on. Conventional routing protocols based on distance vector or link state routing is not much suitable for mobile ad hoc network. All existing conventional routing protocols are based on shortest path routing, where the route having minimum number of hops is selected. Shortest path routing is non-adaptive routing algorithm that does not take care of traffic present on some popular routes of the network. In high traffic networks, route selection decision must be taken in real time and packets must be diverted on some alternate routes. In Prioritized sweeping method, optimization is carried out over confidence based dual reinforcement routing on mobile ad hoc network and path is selected based on the actual traffic present on the network at real time. Thus they guarantee the least delivery time to reach the packets to the destination. Analysis is done on 50 nodes MANET with random mobility and 50 nodes fixed grid network. Throughput is used to judge the performance of network. Analysis is done by varying the interval between the successive packets.

3300-3305

Authors: 1 Akinwol Agnes Kikelomo., 2 Yekini Nureni Asafe., 3 Adelokun Paul., 4 Lawal Olawale N

The shortest path problem is an approach towards finding the shortest and quickest path or route from a starting point to a final destination, four major algorithms are peculiar to solving the shortest path problem. The algorithms include Dijkstra’s Algorithm, Floyd-Warshall Algorithm, Bellman-Ford Algorithm and Alternative Path Algorithm. This research work is focused on the design of mobile map application for finding the shortest route from one location to another within Yaba College of Technology and its environ. The design was focused on Dijkstra’s algorithm that source node as a first permanent node, and assign it 0 cost and check all neighbor nodes from the previous permanent node and calculate the cumulative cost of each neighbor nodes and make them temporary, then chooses the node with the smallest cumulative cost, and make it as a permanent node. The different nodes that lead to a particular destination were identified, the distance and time from a source to a destination is calculated using the Google map. The application then recommends the shortest and quickest route to the destination.

3311-3315

Authors: Dr K. Prakash 1 , Dr P. Saravanamoorthi 2 , Mr R. Sathishkumar 3, Dr M. Parimala 4

Agriculture is the backbone of human sustenance on this world. Now a days with growing population we need the productivity of the agriculture to be increased a lot to meet the demands. In olden days they used natural methods to increase the productivity, such as using the cow dung as a fertilizer in the fields. That resulted increase in the productivity enough to meet the requirements of the population. But later people started thinking of earning more profits by getting more outcome. So, there came a revolution called “Green Revolution”. In this paper we implemented image processing using MATLAB to detect the weed areas in an image we took from the fields.

3321-3328

Authors: Rajkumar, Dr H G Chandrakanth, Dr D G Anand, Dr T John Peter

Wireless Sensor Networks have come to the forefront of the scientific community recently and it consists of small nodes with sensing, Communications and computing capabilities. The Wireless Sensor Network Systems can be applied to monitor different environments ranging from military to civil applications. It is observed that different protocols necessary for smooth functioning of the network system are highly application specific. Current WSNs typically communicate directly with a centralized controller or satellite. In this paper we survey the different research challenges in Wireless Sensor Networks and purpose of various research Challenges activities is the development of a framework, which is radically simplifies the development of software for sensor network applications and characteristic Features of Sensor Networks.

3335-3337

Authors: 1 Lawal Olawale Nasiru., 2 Yekini Nureni Asafe., 3 Oloyede Adetokunbo Olamide, 4 Akinsola Adeniyi Folusho

In recent time the use of communication gadgets (mobile phones, laptop, desktop etc.) and service for online communication between two parties over a long distance has become sine-qua-non. Some criminal minded people are using this online communication method to deceive their prey via proxy communication where individual claiming to be discussing is not really the one. In this paper, we focus on prevention of identity impersonation attacks in an Online Communication System. Peer-peer Audio Visual Communication System is design to enhance security through online communication system by revealing the identity of the communicators and records the communication if necessary. Embedded application system was design for mobile and desktop devices for audio visual charting using modern IT devices.

3242-3245

Authors: Madhusudan G, Kumar TNR

An ad-hoc wireless network is highly different considering dynamic stochastic process of its underlying links, leads to link breaks during data transaction. Hence, to provide free flow data transaction, many routing algorithms have the property of link recovery and maintenance procedures to minimize the loss of data during transmission. However these routing method do not guarantee reliable data transmission in some special application conditions with wide requirements on Packet delivery ratio and link quality of the network. Routing is a critical issue in MANET and hence the focus of this paper is the performance analysis of different routing protocols used in the wireless network. We evaluate the ability of a mobile ad hoc wireless network to distribute flows across robust routes by introducing the robust throughput measure as a performance metric. The utility gained by the delivery of flow messages is based on the level of interruption experienced by the underlying transaction. We describe the mathematical calculation of a network’s robust throughput measure, as well as its robust throughput capacity. We introduce the robust flow admission and routing algorithm (RFAR) to provide for the timely and robust transport of flow transactions across mobile ad hoc wireless systems.

3253-3256

Authors: Dr.I.Lakshmi

Appropriated figuring is an unquestionably predominant perspective for getting to preparing resources. A notable class of enrolling fogs is Infrastructure as a Service (IaaS) fogs, exemplified by Amazon's Elastic Computing Cloud (EC2). In these fogs, customers are offered access to virtual machines on which they can present and run self-confident programming, including database systems. Customers can moreover pass on database mechanical assemblies on these fogs, which are virtual machines with pre-presented pre-organized database structures. Sending database machines on IaaS fogs and execution tuning and streamlining in this condition introduce some captivating investigation challenges. In this paper, we present some of these challenges and we format the gadgets and techniques required to address them. We acquaint a conclusion with end respond in due order regarding one tuning issue in this condition, particularly separating the CPU furthest reaches of a physical machine among different database contraptions running on this machine. We moreover graph possible future research headings around there.

3266-3269

Authors: R.Revathi., MCA.,MPhil.,M.E.,(Ph.D)

A common goal of the engineering field of signal processing is to reconstruct a signal from a series of sampling measurements. In general, this task is impossible because there is no way to reconstruct a signal during the times that the signal is not measured. Nevertheless, with prior knowledge or assumptions about the signal, it turns out to be possible to perfectly reconstruct a signal from a series of measurements. Over time, engineers have improved their understanding of which assumptions are practical and how they can be generalized. An early breakthrough in signal processing was the Nyquist–Shannon sampling theorem. It states that if the signal's highest frequency is less than half of the sampling rate, then the signal can be reconstructed perfectly. The main idea is that with prior knowledge about constraints on the signal’s frequencies, fewer samples are needed to reconstruct the signal. Sparse sampling (also known as, compressive sampling, or compressed sampling) is a signal processing technique for efficiently acquiring and reconstructing a signal, by finding solutions to under determined linear systems. This is based on the principle that, through optimization, the sparsity of a signal can be exploited to recover it from far fewer samples than required by the Shannon-Nyquist sampling theorem. There are two conditions under which recovery is possible.[1] The first one is sparsity which requires the signal to be sparse in some domain. The second one is incoherence which is applied through the isometric property which is sufficient for sparse signals Possibility of compressed data acquisition protocols which directly acquire just the important information Sparse sampling (CS) is a fast growing area of research. It neglects the extravagant acquisition process by measuring lesser values to reconstruct the image or signal. Sparse sampling is adopted successfully in various fields of image processing and proved its efficiency. Some of the image processing applications like face recognition, video encoding, Image encryption and reconstruction are presented here.

3274-3282

Authors: Manas Kumar Yogi, Darapu Uma

This paper presents a survey on current applications which practice the pervasive mechanism of cyber foraging. The applications include the LOCUSTS framework, Slingshot, Pupetter. This applications advocated the operating principle of task sharing among resource deficient mobile devices. These applications face some design issues for providing efficient performance like task distribution and task migration apart from the security aspect. The general operating mechanism of the cyber foraging technique are also discussed upon and the design options to leverage the throughput of the inherent mechanism is also represented in a suitable way.

3290-3293

Authors: Dr. Ajeet A. Chikkamannur, Dr. Shivanand M. Handigund

The Information Systems, Databases are vital and critical in the arena of Business, Enterprise, Governance etc., for the decision making. Further, the Information Systems are designed to reach maximum number of people for interaction with system. This intent of system usage appears to be resourceful but the identification of reliable users of system has challenged the technocrats Most of the applications uses relational data base system (RDBMS) for the database support but with intelligent exploitation of vulnerability in Structured Query Language (SQL) of RDBMS, the dishonest people are interested in manipulation or processing of the data for business value reduction or damage This paper attempts to endow with security to a relational database system by the inclusion of newly designed semiotic to keyword SECURE into a lexicon of SQL. Then the semiotic is articulated in relational algebraic expression for current query engine execution.