Volume 07 Issue 03, May 2019


Shesnarayan Thakur, Deepak Gour, Ashok Kumar Mishra;

Page no:01-06


Energy saving is important and necessary in dy-namic network because of deplete the unnecessary energy consumption of mobile nodes in MANET. Therefore, it is vital that at any moment some specific number of nodes be a live (sufficient energy for communication) and the rest remain is in sleep mode. If maintain number of live nodes in desirable way, so network lifetime will be prolonging by far. If live nodes can cover desirable level of network then a smaller number of live nodes will be required for communication in between sender and receiver. Power failure of a mobile node not only affects the node itself but also its ability to forward packets on behalf of others and thus the overall network life-time. Energy depletion of nodes in MANET is one of the prime concerns for their sustained operation. In this research we proposed a new energy efficient approach to improve routing performance. In this scheme the proposed efficient routing is done with proposed scheme mechanism. The performance of proposed scheme is compared with pure AODV, DSDV and existing scheme but performance of proposed scheme is bet-ter. The nodes in network are lost their energy in each trans-mission in that case after some time most of the nodes in net-work are lost their energy by that that the link in network ate break then in that case the proposed energy efficient mecha-nism are not inform to sender for established the path but it renovate the new route in network from the same end were the link is break, it means proposed energy efficient drain rate minimization scheme are providing the route establishment capability to each node in network. If the link is repaired from that same end where it breaks then the energy consumption is reducing. The proposed mechanism is having a capability to renovate the link if it breaks due to lack of energy. The per-formance of proposed routing is better than normal energy-based multicast routing.

Improve performance of Dataset Classification Method Using K-Means Clustering: Review

Tejaswini Priya, Prof. Surendra Chadokar

Page no:07-10


Data mining has created an excellent progress in recent year however the problem of missing information has remained an excellent challenge for data processing algorithms. It’s an activity of extracting some helpful data from an oversized information base, by exploitation any of its techniques. Data processing is employed to find data out of information and presenting it during a type that's simply understood to humans. Data processing is that the notion of all ways and techniques which permit analyzing terribly giant information sets to extract and find out previously unknown structures and relations out of such large a lot of details. This paper studied the category speciation and cluster techniques on the idea of algorithms that is used to predict previously unknown class of objects. Various efforts are created to enhance the performance of the K-means cluster formula. During this paper we've been briefed within the type of a review the work administered by the various researchers using K-means cluster. They need mentioned the restrictions and applications of the K-means cluster formula in addition. Determination these problems is that the subject of the many recent analysis works. During this paper, they will be doing a review on k-means cluster algorithms.