Informatics Publishing Limited

K. K. S. Harika ¹, P. Harini ², M. Kiran Kumar ³, K. Kondaiah ⁴

Affiliations
1 Computer Science and Engineering, Jawaharlal Nehru Technological University-JNTU University, Kakinada, IN
2 Electronics and Communications Engineering, University of Madras, Chennai, IN
3 Information Technology, Acharya Nagarjuna University, Guntur, IN
4 Computer Science and Engineering, University of Pune, IN

Abstract

In multihop wireless networks, designing distributed scheduling algorithms to achieve the maximal throughput is a challenging problem because of the complex interference constraints among different links. Traditional maximal-weight scheduling (MWS), although throughput-optimal, is difficult to implement in distributed networks. On the other hand, a distributed greedy protocol similar to IEEE 802.11 does not guarantee the maximal throughput. In this paper, we introduce an adaptive carrier sense multiple access (CSMA) scheduling algorithm that can achieve the maximal throughput distributively. Some of the major advantages of the algorithm are that it applies to a very general interference model and that it is simple, distributed, and asynchronous. Furthermore, the algorithm is combined with congestion control to achieve the optimal utility and fairness of competing flows. Simulations verify the effectiveness of the algorithm. Also, the adaptive CSMA scheduling is a modular MAC-layer algorithm that can be combined with various protocols in the transport layer and network layer. Finally, the paper explores some implementation issues in the setting of 802.11 networks.

Full Text

     

Nagalatha Yannam ¹, S. Anil Kumar ², P. Harini ³

Affiliations
1 Information Technology from St. Ann's College of Engineering and Technology, Chirala, IN
2 Computer Science & Engineering from Siddhartha Engineering College, IN
3 Electronics and Communications Engineering from University of Madras, Chennai, IN

Abstract

Multiple-path source routing protocols allow a data source node to distribute the total traffic among available paths. In this article, we consider the problem of jamming-aware source routing in which the source node performs traffic allocation based on empirical jamming statistics at individual network nodes. We formulate this traffic allocation as a lossy network flown optimization problem using portfolio selection theory from financial statistics. We show that in multi-source networks, this centralized optimization problem can be solved using a distributed algorithm based on decomposition in network utility maximization (NUM). We demonstrate the network's ability to estimate the impact of jamming and incorporate these estimates into the traffic allocation problem. Finally, we simulate the achievable throughput using our proposed traffic allocation method in several scenarios.

Keywords

Jamming, Multiple Path Routing, Portfolio Selection Theory, Optimization, Network Utility Maximization.

Full Text

     

M. Kasi Viswanadh ¹, P. Harini ²

Affiliations
1 JNTUK, St.Ann‘sCollege of Engineering & Technology Chirala, Andhra Pradesh, IN
2 JNTUK, St.Ann‘s College of Engineering & Technology Chirala, Andhra Pradesh, IN

Abstract

World is running on internet in real sense since all the important and major tasks of life are carried out through internet. All the major and huge businesses depend on internet but at the same time internet is a big threat for these conglomerates. Because hackers and scams can ruin the online businesses and they could face great deal of data loss. In order to avoid such sort of internet corruption, firewalls are designed as to protect the networks from hackers and scams. Firewall is basically a blockade which restricts the outside forces from accessing your network and attacking your data. By filtering packets the firewalls can improve security and performance. However, as the size of the rule list increases, it becomes difficult to maintain and validate the rules. Ordered binary decision diagrams (BDDs) – a compact method of representing and manipulating Boolean expressions – are a potential method of representing the rules. Geometric Efficient Matching Algorithm (GEM) uses near-linear space, and only needs approximately 13 MB of space for rule-bases of 5,000 rules. Moreover, with use of additional space improving heuristics, the space requirement can be reduced to 2-3 MB for 5,000 rules. This paper presents a new approach not only to analyze and to validate rule sets and also resultant rule sets are passed as an input for Geometric Efficient Matching Algorithm for improving the efficiency of firewalls.

Keywords

Firewall, BDDs, Internet Corruption, GEM.

Full Text

     

S. K. Hameeda ¹, Y. Chitti Babu ², P. Harini ², Syed Azahad ³

Affiliations
1 St. Anns College of Engg & Technology, JNTU Kakinada, IN
2 St. Anns College of Engineering & Technology, JNTU Kakinada, IN
3 NIMRA College of Engineering & Technology, IN

Abstract

Data replication drastically improves data availability in a mobile ad hoc network. However, since mobile hosts’ mobility causes frequent network partitioning, consistency management of data operations on replicas becomes a crucial issue. In such an environment, the global consistency of data operations on replicas is not desirable by many applications. Thus, new consistency maintenance based on local conditions such as location and time need to be investigated. This paper attempts to classify different consistency levels according to requirements from applications and provides protocols to realize them.

Keywords

Mobile Ad Hoc Networks, Consistency Management, Data Replication, Mobile Computing.

Full Text

     

M. Raghavendra Rao ¹, K. Eswar ², P. Harini ³, Syed. Azhad ⁴

Affiliations
1 St. Anns College of Engineering & Technology, IN
2 St. Anns College of Engg. & Technology, IN
3 St. Anns College of Engineering. & Technology, IN
4 NIMRA College of Engineering & Technology, IN

Abstract

The proposal of this paper presents a measurement-based routing algorithm to load balance intra domain traffic along multiple paths for multiple multicast sources. Multiple paths are established using application - layer overlaying. The proposed algorithm is able to converge under different network models, where each model reflects a different set of assumptions about the multicasting capabilities of the network. The algorithm is derived from simultaneous perturbation stochastic approximation and relies only on noisy estimates from measurements. Simulation results are presented to demonstrate the additional benefits obtained by incrementally increasing the multicasting capabilities. The main application of mobile ad hoc network is in emergency rescue operations and battlefields. This paper addresses the problem of power awareness routing to increase lifetime of overall network. Since nodes in mobile ad hoc network can move randomly, the topology may change arbitrarily and frequently at unpredictable times. Transmission and reception parameters may also impact the topology. Therefore it is very difficult to find and maintain an optimal power a ware route. In this work a scheme has been pro posed to maximize the network lifetime and minimizes the power consumption during the source to destination route establishment. The proposed work is aimed to provide efficient power aware routing considering real and non real time data transfer.

Keywords

Consumption, Lifetime, Perturbation, Stochastic.

Full Text

     

Jayavarapu Karthik ¹, P. Harini ²

Affiliations
1 Department of Computer Science & Engineering, St. Ann's College of Engineering & Technology, Affiliated to JNTU Kakinada, IN
2 Department of CSE, St. Ann's College of Engineering & Technology, Affiliated to JNTU Kakinada, IN

Abstract

A data distributor has given sensitive data to a set of supposedly trusted agents (third parties). Some of the data are leaked and found in an unauthorized place (e.g., on the web or somebody’s laptop). The distributor must assess the likelihood that the leaked data came from one or more agents, as opposed to having been independently gathered by other means. We propose data allocation strategies (across the agents) that improve the probability of identifying leakages. These methods do not rely on alterations of the released data (e.g., watermarks). In some cases, we can also inject “realistic but fake” data records to further improve our chances of detecting leakage and identifying the guilty party.

Keywords

Allocation Strategies, Data Leakage, Perturbation, Fake Records, Leakage Model.

Full Text

     

R. Madhumathi ¹, R. Dharshana ², P. Harini ¹

Affiliations
1 Department of Computer Science and Engineering, Coimbatore, IN
2 Department of Computer Science and Engineering, Coimbatore, IN

Abstract

The Hydroponics is defined as the cultivation of plants in water without soil. This system enables the cultivator to grow plants. It is the simplest technique to grow plants commercially over large scale. By creating a web interface, gardener can view the different statistics and state of the current growth process. Hydroponic system can be processed inside our home which is void of land resources. This project focuses on analyzing the alkalinity of the nutrient solution through sensors and also helps to predict the growth rate. The sensors get connected to the core controller which transmits and receives the data. The plant system is inserted inside the bottle which is filled with nutrient solution in diluted form. The water culture technique involved helps to detect the alkalinity using temperature and pH sensor along with arduino embedding procedure. The pH sensor denotes the level of water in which the plants are grown and the temperature sensor detect the circumstances around. The parameters such as temperature and pH sensor of the water are measured. The measured values are transferred to the core controller and data can be viewed using web application. The nutrient level is maintained based on the Nutrient Film Technique (NFT) which is a hydroponic technique and also an alert is created when the alkaline level does not fall in the specified range.

Keywords

Hydroponics, Nuclear Film Technology, Agriculture.

Full Text

     

P. N. Balaji ¹, K. Prathusha ¹, T. J. Chandu ¹, M. Sai Sreevani ¹, P. Johnsi Rani ¹, P. Harini ¹

Affiliations
1 Department of Pharmaceutical Chemistry, Sri Padmavathi School of Pharmacy, Tiruchanoor, Tirupati 517503, Andhra Pradesh, IN

Abstract

In the development of organic therapeutic agents, pharmaceutical scientists have explored numerous approaches in finding and developing organic compounds that is now available to us in dosage forms for the treat diseases and often for the maintenance of good health. The present work deals with synthesis of some new isoxazole and Pyrazole derivatives which obtained by reaction takes place between the chemicals hydroxyl amine hydrochloride and hydrazine hydrate with synthesized Chalcones (by Claisen-Schmidt condensation) in a refluxing ethanolic medium in alkali condition. The structures for the synthesized compounds are established by FT-IR, ¹H NMR and elemental analysis later all compounds were evaluated for antimicrobial activity by zone of inhibition. Significant to moderate results are obtained from the compounds.

Keywords

Isoxazole, Pyrazole, Chalcones and Antimicrobial Activity.

Full Text