Informatics Publishing Limited

B. N. Raju ¹, Chandrakant Naikodi ², L. Suresh ³

Affiliations
1 Department of CSE, Cambridge Institute of Technology, Bengaluru-560036, IN
2 Dept. of CSE, Cambridge Institute of Technology, Bengaluru-560036, IN
3 Cambridge Institute of Technology, Bengaluru-560036, IN

Abstract

In the digitized world today internet is tone of the main sources of the information. There are several e-commerce websites where people/customers discuss different aspects/issues of the product. All such website provides a platform for the consumers to discuss and provide their opinion about the product, its features and their services. These opinions and reviews of the consumers provide very rich information both for other users as well as firms. But the issue with this information is that the information is mostly unorganized and therefore it is difficult to create a knowledge base out of it. What we propose is a product facet ranking framework which automatically determines the important facets of the product from the online comments/reviews, aiming to improve the usability of the consumer reviews. The facets are identified by the following observations; 1) The important facets of a product are usually given by several consumers in the review. 2) The review/opinion of the consumer on important facet of the product influences the overall opinion or view of the consumer on the product. But identifying the most important facets will increase the usefulness of the innumerable reviews/opinions and is useful to both users and the firms itself. It is practically difficult for the people to manually identify the important facets of the products from the consumer reviews/opinions. Consumer can easily make purchasing decision by focusing more on the important features, while the firms can concentrate on improving the quality of the features or facets of the product.

Full Text

   

M. Ajith Kumar ¹, Chandrakant Naikodi ¹, L. Suresh ²

Affiliations
1 Department of Computer Science and Engineering, Cambridge Institute of Technology, Bangalore, IN
2 Cambridge Institute of Technology, Bangalore, IN

Abstract

Water scarcity is one of the major problems facing major cities of the world and wastage during transmission has been identified as a major culprit; this is one of the motivations for this research, to deploy computing techniques in creating a barrier to wastage in order to not only provide more financial gains and energy saving, but also help the environment and water cycle which in turn ensures that we save water for our future. We presented our research in embedding a control system into an automatic water pump controller through the use of different technologies in its design, development, and implementation. The system used microcontroller to automate the process of water pumping in an over-head tank storage system and has the ability to detect the level of water in a tank, switch On/off the pump accordingly and display the status on an android mobile phone. In this anticipate we have planned the sensor to quantify water up to four levels by making use of serial connector Rs 232 and Bluetooth uart attempting to work on new project.

Keywords

Microcontroller, Conductivity, Water Pump, Assembly Language, Computer Simulation, Waste.

Full Text

   

Asfa Sadaf Albadri ¹, Chandrakant Naikodi ¹, L. Suresh ²

Affiliations
1 Dept. of CSE, Cambridge Institute of Technology, Bangalore, IN
2 Cambridge Institute of Technology, Bangalore, IN

Abstract

Variations from the norm in detected information streams demonstrate the spread of malicious attacks, hardware failure and software corruption among the diverse nodes in a remote sensor system. These variables of node infection can influence generated and approaching information streams bringing about high odds of off base information, deluding packet interpretation, wrong choice making and serious correspondence interruption. This issue is unfavorable to constant applications having stringent quality of service (QoS) prerequisites. The detected information from other uninfected regions may likewise get stuck in a infected area ought to no earlier option game plans are made. Albeit a few existing techniques (BOUNDHOLE and GAR) can be utilized to relieve these issues, their execution is limited by a few confinements, predominantly the high danger of falling into steering circles and association in pointless transmissions. This paper gives an answer for by-pass the infected nodes progressively utilizing a twin moving balls procedure furthermore redirect the packets that are caught inside the recognized region. The recognizable proof of infected nodes is finished by adjusting a Fuzzy data clustering approach which categorizes the nodes in light of the portion of peculiar information that is recognized in individual information streams. This data is then utilized as a part of the proposed by-passed Routing(BPR) which pivots two balls in two headings at the same time: clockwise and counter-clockwise. The primary node that hits any ball in any heading and is uninfected, is chosen as the next hop. We are likewise worried with the approaching packets or the packets on-the-fly that might be influenced when this issue happens. Other than taking care of both of the issues in the current techniques, the proposed BPR strategy has significantly enhanced the considered QoS parameters as appeared by very nearly 40 percent expansion in the general execution. We can also effectively detect the malicious nodes that attempt to launch gray hole attacks and malicious nodes are detected using a reverse tracing technique. Any detected malicious node is kept in a black list so that all other nodes that participate to the routing of the message are alarmed to quit speaking with any node in that list and we can implement cooperative load balancing.

Keywords

BOUNDHOLE, GAR, BPR, Fuzzy Data Clustering, Gray Hole Attacks, Reverse Tracing Technique, Wireless Sensor Networks.

Full Text

   

Ashwini ¹, Chandrakant Naikodi ², L. Suresh ³

Affiliations
1 Department of Computer Science and Engineering, Cambridge Institute of Technology, Bangalore, IN
2 Dept. of Computer Science and Engineering, Cambridge Institute of Technology, Bangalore, IN
3 Cambridge Institute of Technology, Bangalore, IN

Abstract

Data dissemination is the process by which queries of data are routed in the sensor network. The data collection by sensor nodes has to be communicated to the base station or to any other node interested in the data. Data discovery and dissemination protocol for WSNs is responsible for updating configuration parameters of and distributing management commands, to, the sensor nodes. All existing data discovery and dissemination protocol suffer from two drawbacks.
First, they are based on the centralized approach; in centralized approach only the base station can distribute data items, such an approach is not suitable for emergent multi-owner--multi-user wireless sensor networks. Second, those protocols were not designed with security in mind and hence adversaries can easily launch attacks to harm the network. This paper proposes the first secure and distributed data discovery and dissemination protocol called DiDrip. It allows the network owners to authorize multiple network users with different privileges to simultaneously and directly disseminate data items in to the sensor nodes based on the design objective we propose DiDrip. This is the first distributed data discovery and dissemination protocol, which allows network owners and authorized users to disseminate data items into WSNs without relying on the base station. Moreover our extensive analysis demonstrates the DiDrip satisfies the security requirements of the protocol. Here implements the multi hop data transmission in the network while transmitting data prioritization given to the data. There are three types of data packets low, medium and high by using dynamic scheduling algorithm and improves the quality of service.

Full Text

   

T. N. Chaitra ¹, Chandrakant Naikodi ¹, L. Suresh ²

Affiliations
1 Dept. of CSE, Cambridge Institute of Technology, Bangalore, IN
2 Cambridge Institute of Technology, Bangalore, IN

Abstract

A photograph obtaining or receiving system is a computer system for scanning, searching and obtaining photograph from a large database of digital images. Several established and common methods of image retrieval make use of some method of adding metadata such as legends, keywords, or descriptions to the pictures so that retrieval can be accomplished over the notation words. Manual picture notation is delayed, heavy and expensive; to address this, there has been a huge amount of research done on automatic image notation. In the existing system various algorithm is used such as Image Compression Algorithm, Image Hiding Algorithm for Watermarking, Block Truncation Coding, Clifford Algebra which is used to define colour alteration, Digital Image Processing, Block Optimization and Arithmetic Coding based on Histogram, BTC with Assorted colour space, VQ codeword search Technique. An image retrieval system provides a well organised way to entrance or retrieve a set of homogeneous images by directly computing the image features from an image as reported by using different kinds of techniques as well as algorithms. In case of proposed system, image retrieval is available by utilizing the ODBTC encoded data stream to create the image features, namely Colour Co-occurrence and Bit Pattern features. As recorded in the experimental results, the offered scheme can produce the greatest average accuracy rate compared to various former schemes in the literature. As a result, the proposed scheme can be considered as a very aggressive applicant in the coloured image retrieval application.

Keywords

Image Retrieval, Digital Halftoning, Image Compression Algorithm, EBTC, Adaptive Block Truncation Algorithm, Image Hiding Algorithm for Watermarking.

Full Text

   

K. M. Chethan Kumar ¹, Chandrakant Naikodi ¹, L. Suresh ²

Affiliations
1 Dept. of CSE, Cambridge Institute of Technology, Bangalore, IN
2 Cambridge Institute of Technology, Bangalore, IN

Abstract

Every hostin mobile adhoc network (MANET), not simply acts as a hostother thanit can also act as a router. Cooperation is much needed between every node in order to forward and to receive the data packets, hence it forms a local area network.From the security point of view the above features also adds up some great disadvantages to the network. It's a challenging task to detect malevolent nodes causing wormhole, blackhole and grayhole attacks in this condition. Our main aim in this paper is to detect wormhole, blackhole and grayhole attacks by cooperative dynamic source routing basescheme that is called as cooperative bait discovery scheme (CBDS), it has both proactive and reactive protection configurations.In order to achieve the goal, a reverse tracing technique is implemented in the CBDS scheme. In this scheme, by using address of a nearby host as bait end address to attract malevolenthosts to throw a respondnote (RREP), also reverse tracing technique ensures safety and prevents malicious hosts by detecting them.

Keywords

MANET, CBDS, Worm Hole, Black Hole, Gray Hole, DSR.

Full Text

   

C. H. Nandini ¹, Chandrakant Naikodi ¹, L. Suresh ²

Affiliations
1 Dept. of CSE, Cambridge Institute of Technology, Bangalore, IN
2 Cambridge Institute of Technology, Bangalore, IN

Abstract

As new cost effective technology that is Wireless Mesh Network has gained a lot of popularity and it has conspicuous kind of network architecture as wireless multi-hop. In this paper, the proposed secure multipath SEAOMDV_ELB routing protocol used with an efficient load balancing and also congestion aware mechanism in wireless mesh networks. The proposed routing protocol called SEAOMDV_ELB defines the several paths and also decides the best path from source to its destination using secure airtime congestion aware metric (SACA) for balancing the load across the congested network area. We likewise make use of an proficient scheme known as load balancing that upholds the communication of the node on best possible path and next is the computation of the queue utilization at every single node to know whether the specific node is qualified for sending the data packets over the network or not. In this paper, the main proposed work is to provide security over the network using RSA (Rivest-Shamir-Adleman) algorithm to accomplish secured data packets on optimal path and reach its destination securely. Most of the existing protocols that are not anticipated get adapted to congestion, the quality of link, and security over the network. The simulation outcomes using Network Simulator-2 (NS-2) shows that protocol SEAOMDV_ELB of proposed paper is better when contrasted with AOMDV regarding throughput, end-to-end delay and security over the network.

Keywords

Wireless Mesh Network, Congestion, Secure ACA, Queue Utilization, Round Trip Time, Security, Multiple Interfaces and Multiple Channels, Load Balancing.

Full Text

   

Nagaraj M. Lutimath ¹, L. Suresh ², Chandrakant Naikodi ²

Affiliations
1 Department of CSE, Sri Venkateshwara College of Engineering, Bangalore, IN
2 Department of CSE, Cambridge Institute of Technology, Bangalore, IN

Abstract

Energy is an important characteristic of Mobile Ad hoc Network (MANET). We propose an Energy Aware Multipath AODV protocol (EAMAODV) based on AODV. EAMAODV obtains nodes energy by upgrading the route discovery and route maintenance process of AODV. It calculates drop rate derived by routes total hops. Drop threshold is used in deciding the route. Simulation is done using NS-2.35. The results show that EAMAODV has higher packet delivery ratio and throughput than classical AODV protocol.

Keywords

AODV, Nodes Energy, Multi-Path Routing, Residual Energy.

Full Text