Data in Transit Validation for Cloud Computing Using Cloud-Based Algorithm Detection of Injected Objects

The recent paradigm shift in the IT sector leading to cloud computing however innovative had brought along numerous data security concerns. One major such security laps is that referred to as the Man in the Middle (MITM) attack where external data are injected to either hijack a data in transit or to manipulate the files and object by posing as a floating cloud base. Fresh algorithms’ for cloud data protection do exist however, they are still prone to attack especially in real-time data transmissions due to employed mechanism. Hence, a validation protocol algorithm based on hash function labelling provides a one-time security header for transferable files that protects data in transit against any unauthorized injection. The labelling header technique allows for a two-way data binding; DOM based communication between local and cloud computing that triggers automated acknowledgment immediately after file modification. A two layer encryption functions in PHP was designed for detecting injected object; bcrypt methods in Laravel and MD5 that generate 32 random keys. A sum total of 1600 different file types were used during training then evaluation of the proposed algorithm, where 87% of the injected objects were correctly detected

Learning Based Route Management in Mobile Ad-Hoc Networks

Ad hoc networks are mobile wireless networks where each node is acting as a router. The existing routing protocols such as Destination sequences distance vector, Optimized list state routing protocols, Ad hoc on demand routing protocol, dynamic source routing are optimized versions of distance vector or link state routing protocols.  Reinforcement Learning is new method evolved recently which is learning from interaction with an environment. Q Learning which is based on Reinforcement learning that learns from the delayed reinforcements and becomes more popular in areas of networking. Q Learning is applied  to the routing algorithms where the routing tables in the distance vector algorithms are replaced by the estimation tables called as Q values. These Q values are based on the link delay. In this paper, various optimization techniques over Q routing are described in detail with their algorithms

An Enhanced Queue Management Scheme for Eradicating Congestion of TFRC over Wired Environment

To accomplish increasing real time requirements, user applications have to send different kinds of data with different speeds over the internet.  To effectuate the aims of the computer networks, several protocols have been added to TCP/IP protocol suite.  Transport layer has to implement emerging techniques to transfer huge amount of data like multimedia streaming. To transmit multimedia applications, one of the suitable congestion control mechanisms in transport layer is TCP Friendly Rate Control Protocol (TFRC).  It controls congestion based on its equation. To get more smoothed throughput, intermediate nodes (like Routers. etc.) have to use suitable procedures in all real time situations. To eradicate the level of congestion in the network, we introduce enhanced Holt-Winters equations to RED queue management algorithm and applied to TFRC. The simulation results have shown that this strategy reduces packet loss and increases throughput

Issues in Routing Mechanism for Packets Forwarding: A Survey

Nowadays internet has become more popular to each and every one. It is very sensitive to nodes or links failure due to many known or unknown issues in the network connectivity. Routing is the important concept in wired and wireless network for packet transmission. During the packet transmission many times some of the problems occur, due to this packets are being lost or nodes not able to transmit the packets to the specific destination. This paper discusses various issues and approaches related to the routing mechanism. In this paper, we present a review and comparison of different routing algorithms and protocols proposed recently in order to address various issues. The main purpose of this study is to address issues for packet forwarding like network control management, load balancing, congestion control, convergence time and instability. We also focus on the impact of these issues on packet forwarding

Online Crowds Opinion-Mining it to Analyze Current Trend: A Review

Online presence of the user has increased, there is a huge growth in the number of active users and thus the volume of data created on the online social networks is massive. Much are concentrating on the Internet Lingo. Notably most of the data on the social networking sites is made public which opens doors for companies, researchers and analyst to collect and analyze the data. We have huge volume of opinioned data available on the web we have to mine it so that we could get some interesting results out of it with could enhance the decision making process. In order to analyze the current scenario of what people are thinking focus is shifted towards opinion mining. This study presents a systematic literature review that contains a comprehensive overview of components of opinion mining, subjectivity of data, sources of opinion, the process and how does it let one analyze the current tendency of the online crowd in a particular context. Different perspectives from different authors regarding the above scenario have been presented. Research challenges and different applications that were developed with the motive opinion mining are also discussed

Schedulability analysis of Rate Monotonic Algorithm using Improved Time Demand Analysis for Multiprocessor Environment

Real -Time Monotonic algorithm (RMA) is a widely used static priority scheduling algo-rithm. For application of RMA at various systems, it is essential to determine it’s feasibil-ity first. Though there are a lot of feasibility analysis test present, most of them reduce the scheduling points in an attempt to decrease the complexity. In this paper we state and de-velop an exact schedulablity test algorithm named as improved time demand analysis, which reduces the number of tasks to be analyzed instead of reducing the scheduling points of a given task. This significantly reduces the number of iterations taken to compute feasibility. This algorithm can be used along with the previous tests to effectively reduce the high complexities encountered in processing large task sets. We also extend our algorithm to multiprocessor environment and compare number of iterations with different number of processors

New Classifier Design for Static Security Evaluation Using Artificial In-telligence Techniques

This paper proposes evaluation and classification classifier for static security evaluation (SSE) and classifica-tion. Data are generated on (30, 57, 118 and 300) bus IEEE test systems used to design the classifiers. The implementation decision tree methods on several IEEE test systems involved appropriateness SSE and classi-fication by using four algorithms of DT’s. Empirically, with the present of FSA, the implementation results indicate that these classifiers have the capability for system security evaluation and classification. Lastly, FSA is efficient and effective approach for real-time evaluation and classification classifier design

Processor Speed Control for Power Reduction of Real-Time Systems

Reducing energy consumption is a critical issue in the design of battery-powered real time systems to prolong battery life. With dynamic voltage scaling (DVS) processors, energy consumption can be reduced efficiently by making appropriate decisions on the processor speed/voltage during the scheduling of real time tasks. Scheduling decision is usually based on parameters which are assumed to be crisp. However, in many circumstances the values of these parameters are vague. The vagueness of parameters suggests that to develop a fuzzy logic approach to reduce energy consumption by determining the appropriate supply-voltage/speed of the processor provided that timing constraints are guaranteed. Intensive simulated experiments and qualitative comparisons with the most related literature have been conducted in the context of dependent real-time tasks. Experimental results have shown that the proposed fuzzy scheduler saves more energy and creates feasible schedules for real time tasks. It also considers tasks priorities which cause higher system utilization and lower deadline miss time

Ranking in Distributed Uncertain Database Environments

Distributed data processing is a major field in nowadays applications. Many applications collect and process data from distributed nodes to gain overall results. Large amount of data transfer and network delay made data processing in a centralized manner a hard operation representing an important problem. A very common way to solve this problem is ranking queries. Ranking or top-k queries concentrate only on the highest ranked tuples according to user's interest. Another issue in most nowadays applications is data uncertainty. Many techniques were introduced for modeling, managing, and processing uncertain databases. Although these techniques were efficient, they didn't deal with distributed data uncertainty. This paper deals with both data uncertainty and distribution based on ranking queries. A novel framework is proposed for ranking distributed uncertain data. The framework has a suite of novel algorithms for ranking data and monitoring updates. These algorithms help in reducing the communication rounds used and amount of data transmitted while achieving efficient and effective ranking. Experimental results show that the proposed framework has a great impact in reducing communication cost compared to other techniques.DOI:http://dx.doi.org/10.11591/ijece.v4i4.592

Data Transmission Analysis using MW-5000 at 5.8 GHz Frequency

In the recent years, the data communication system become the main type of communication in the world. The FSK modulator and FSK demodulator is one of the part that becomes the most important part and extremely advanced with the involvement of microwave active and passive circuits. This paper presents the data transmission analysis using MW-5000 at 5.8 GHz frequency. This experiment use the microwave communication module MW-5000 that is available in electronic laboratory. From this experiment the duration taken for the transmission of data is depend on the length of sentence and the value of baud rate