Cluster based Energy-Efficient and Reliable Routing for Mobile Wireless Sensor Networks

The main problem of energy efficient reliable routing is that it doesn’t provide any back up mechanism for the failure of the nodes. The work of the paper major depends on the alternate path provided if the link got failure and to provide energy efficient path in between the network.it will reduce the time,cost and increase the efficiency and the data rate of the network. In wireless sensor networks, because of unreliable wireless media, host mobility and lack of infrastructure, providing secure communications is bit difficult in this type of network environment. In present work to ensure the security in unreliable wireless communication the cluster based topology technique is used, to obtain confidentiality and authentication of nodes hash function and MAC (Message Authentication Code) techniques are use

Energy Efficient System for Wireless Sensor Networks using Modified RECHS Protocol

The area of wireless sensor networks (WSNs) is one of the emerging and fast growing fields in the scientific world. This has brought about developing low cost, low-power and multi-function sensor nodes. Prolonged network lifetime, scalability, node mobility and load balancing are important requirements for many WSN applications. Clustering the sensor nodes is an effective technique to achieve these goals. Cluster-based routing protocol is currently a hot research in wireless sensor network. In this paper, we have added additional criteria for the selection of cluster heads in a Redundant and Energy-efficient Cluster head Selection Protocol(RECHS) and compared results with Energy Aware Low Energy Adaptive Clustering Hierarchy (EA-LEACH) protocol. This modified RECHS significantly increases the lifetime, reliability of the network. Simulation results show that comparison between two methods (Modified RECHS and EA- LEACH) for LEACH protocol on the basis of network lifetime (stability period), number of cluster heads are present per round, number of alive node are present per round and throughput of data transfer in the network. DOI: 10.17762/ijritcc2321-8169.15016

An Improvement in Congestion Control Using Multipath Routing in Manet

The ad hoc connections, which opens many opportunities for MANET applications. In ad hoc network nodes are movable and there is no centralised management. Routing is an important factor in mobile ad hoc network which not only works well with a small network, but also it can also work well if network get expanded dynamically. Routing in Manets is a main factor considered among all the issues. Mobile nodes in Manet have limited transmission capacity, they intercommunicate by multi hop relay. Multi hop routing have many challenges such as limited wireless bandwidth, low device power, dynamically changing network topology, and high vulnerability to Failure. To answer those challenges, many routing algorithms in Manets were proposed. But one of the problems in routing algorithm is congestion which decreases the overall performance of the network so in this paper we are trying to identify the best routing algorithm which will improve the congestion control mechanism among all the Multipath routing protocols

Node Disjoint Multipath Routing Approach for Controlling Congestion in MANETs

Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Nodedisjoint routing becomes inessential technique in communication of packets among various nodes in networks. Meanwhile AODV (Ad Hoc On-demand Multipath Distance Vector) creates single-path route between a pair of source and destination nodes. Some researches has done so far to make multipath node-disjoint routing based on AODV protocol. But however their overhead and end-to-end delay are relatively high, while the detail of their code is not available too. In an ad hoc network, identification of all node-disjoint paths between a given pair of nodes is a challenging task. The phenomena that a protocol is not able to identify all node-disjoint paths that exist between a given pair of nodes is called path diminution. In this paper, we discuss that path diminution is unavoidable when a protocol discovers multiple node-disjoint paths in a single route discovery and working of node disjoint multipath protocol

Voice Based Biometric System Feature Extraction Using MFCC and LPC Technique

Now a day, interest in using biometric technologies for person authentication in security systems has grown rapidly.Voice is one of the most promising and mature biometric modalities for secured access control this paper gives an experimental overview of techniques used for feature extraction in speaker recognition. The research in speaker recognition have been evolved starting from short time features reflecting spectral properties of speech low-level or physical traits to the high level features (behavioral traits) such as prosody, phonetic information, conversational patterns etc. first give a brief overview of Speech processing and voice biometric relation and then describe some feature extraction technique. We have performed experiment for feature extraction of MFCC, LPC techniques

Correlation between Project Management Processes

This paper explains the correlation between all Project Management Processes i.e. Project Initiating, Planning, Executing, Monitoring, Controlling & Closing. This paper gives the introduction to the key concept in the project management field; it summarizes the processes, inputs & outputs that are considered good practices on most of the projects most of the times. The project management is application of knowledge, skills, tools & techniques to project activities to meet the project requirements. The process is set of interrelated actions & activities performed to achieve a pre-specified product, result, or service. Project management processes are grouped in to five categories known as Project management Process Groups or Process Group. In this paper, live case studies taken for explaining the relation between all the project management processes. Successful completion of the project depends on the successful completion of all the project management processes, and all these project management processes are interrelated to each other. In this paper all the relationships and output of each process are discussed in details. “Everything becomes simple when it reduce to fundamentals” is basis of Project management Processes

Framework for Map Reducing Technique Using Correlation for Duplicate Image Identi?cation Process

The duplicate image identification is an image deduplication System which avoids duplicate copies of images from storing in the storage server and reduces Storage space. This technique is used to improve storage utilization by avoiding duplicate images to store in storage server and reduce the time complexity by using Map Reduce technique. With explosive growth of digitization bulk of digital data may uploaded on server every day, deduplication schemes are widely used in backup and recovery System to minimize network and storage overhead by detecting and avoiding redundancy among data. Traditional deduplication schemes work if and only if the second image having the same content as first, so this restricts the performance of many applications as exact images need to be there if want to succeed and these all schemes are suffering from huge time complexity problem to deal with huge amount of data. In this paper, we propose the duplicate image identification system using MapReduce technique which improves the scalability and efficiency of system. Our approach reduce the time required to identify the duplicate image in storage server using MapReducing technique that is been powered with correlation technique

Cassandra File System Over Hadoop Distributed File System

Cassandra is an open source distributed database management system is designed to handle large amounts of data across many commodity servers, provides a high availability with no single point of failure. Cassandra will be offering the robust support for clusters spanning multiple data centers with asynchronous masterless replica which allow low latency operations for all the clients. N oSQL data stores target the unstructured data, which nature has dynamic and a key focus area for "Big Data" research. New generation data can prove costly and also unpractical to administer with databases SQL, due to lack of structure, high scalability and needs for the elasticity. N oSQL data stores such as MongoDB and Cassandra provide a desirable platform for fast and efficient for data queries. The Hadoop Distributed File System is one of many different components and projects contained within the community Hadoop ecosystem. The Apache Hadoop project defines Had oop - DFS as "the primary storage system which is used by Hadoop applications" that enables "reliable, extremely rapid computations". This paper was providing high - level overview of how Hadoop - styled analytics (MapReduce, Pig, Mahout and Hive) can be run on data contained in Apache Cassandra wit hout the need for Hadoop - DFS

An Efficient Technique for mining Association rules using Enhanced Apriori Algorithm

There are Various mining algorithms of association rules. One of the most popular algorithm is Apriori that extracts frequent itemset from large database and getting the association rule for discovering the knowledge. this paper pitfalls the limitation of the original Apriori algorithm for wasting time for scanning the whole database searching on to the frequent itemsets, and presents an technique on Apriori by reducing that wasted time depending on scanning only some transactions whose support value is bigger than 25% of minimum Support is taken as frequent item set and is added to the frequent item sets and then rules are formed. An enhanced Apriori algorithm may find the tendency of a customer on the basis of frequently purchased item-sets The proposed algorithm is useful as a frequent item sets predictor with lower number of scans. DOI: 10.17762/ijritcc2321-8169.15063