International Journal of Advanced Networking and Applications

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.