Dr. Seetha M.

Dr. Seetha M.


Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2019 in Applied Computing and Informatics
Verified
Journal Article
Open access
NPN. Papanna
N. Papanna
ARA. Rama Mohan Reddy
A. Rama Mohan Reddy
DMDr. Seetha M.
Dr. Seetha M.
MANET (Mobile Ad hoc Network) consists the nodes that are self-energized and shall be able to accommodate limited energy levels, and usually the nodes transmit the data using the intermediate nodes to the ones that are not in hop levels. In such conditions, the lifetime of the intermediary nodes turn out to be a critical factor, and hence only when the routes are having maximum residual energy and the ones that have high, spend minimal energy for transmitting the data is very important. In terms of route selection, the emphasis is much on multicast routing and the route discovery, and the efficient nodes selection has to take place with emphasis on QoS. Hence, the energy efficient multicast route discovery process has gained significant importance, and there are many potential solutions depicted in the process. Energy Efficient Lifetime Aware Multicast (EELAM) Route Selection strategy for MANETs is the proposed multicast route discovery approach that is developed using the adaptive genetic algorithm. EELAM works based on tree topology that differentiates to other tree based on multicast routing topologies by adapting evolutionary computation strategy defined as genetic algorithm, which shall play a critical role in terms of selecting optimal intermediate nodes with maximal residual energy and minimal energy usage. The fitness function that devised for the adaptive genetic algorithm targeted for improving the energy consumption ratio, improving the residual batter life and towards improving the multicasting scope. The process and the methods that are adapted are contemporary and is different to the traditional genetic algorithms, and still the outcome as depicted in the experimental results reflect the fact that the EELAM is the best of in its class that can support in addressing the limitations in the current solutions and towards managing improved route discovery.


24 October 2016
Verified
Conference Paper
Closed access
VBV. Sesha Bhargavi
V. Sesha Bhargavi
DMDr. Seetha M.
Dr. Seetha M.
SVS. Viswanadharaju
S. Viswanadharaju
In recent years, mobile ad hoc networks have become a main focus in the industry. A mobile ad hoc network is open and dynamic in nature, inviting the major scope for false activities, malicious attacks and other acts, so its trust and security issues have emerged. Our ultimate aim is to improve the security of files shared across a mobile ad hoc network with reduced file searching cost and delay, improving the packet delivery ratio. In the recent years, devices such as laptops and mobile phones have become more popular. MANETs consists of such mobile devices, in which nodes are independent to move and hence changes their location very frequently, making a way for disconnected MANETs. In this paper, we propose a trust-based secured file sharing system, namely S-DSR protocol, for disconnected MANETs. The system uses this S-DSR protocol to derive a node's authenticity and find a secure path for file sharing without involving any malicious nodes in the path. This protocol has been implemented on network simulator and results show that this protocol provides better packet delivery ratio and less overhead than several existing protocols.

1 November 2014
Verified
Conference Paper
Closed access
K.K PRASANNA .
K PRASANNA .
DMDr. Seetha M.
Dr. Seetha M.
AKA. P. Siva Kumar
A. P. Siva Kumar
At present, due to the developments in Database Technology, large volumes of data are produced by everyday operations and they have introduced the necessity of representing the data in High Dimensional Datasets. Discovering Frequent Determinant Patterns and Association Rules from these High Dimensional Datasets has become very tedious since these databases contain large number of different attributes. For the reason that, it generates extremely large number of redundant rules which makes the algorithms inefficient and it does not fit in main memory. In this paper, a new Association Rule Mining approach is presented, and it efficiently discovers Frequent Determinant Patterns and Association Rules from High Dimensional Datasets. The proposed approach adopts the conventional Apriori algorithm and device anew CApriori algorithm to prune the generated Frequent Determinant Sets effectively. A Frequent Determinant set is selected if its value is first compared with Conviction threshold value and then compared with Support threshold. This double comparison will eliminate the redundancy and generate strong Association Rules. To improve the mining process, this algorithm also makes use of a compressed data structure f_list constructed from feature attributes selected using Heuristic Fitness Function (HFF) and a Heuristic Discretization algorithm. It also makes use of Count Array (CA) devised as One Dimensional Triple Array pair set to minimize main memory utilization. This comprehensive study shows that the approach outperforms with traditional Apriori and obtains more rapid computing speed and at the same time generates Sententious Rules. Further the mining methodology is ascertained to be better in generating strong Association Rules from High Dimensional Databases.

1 January 2011
Verified
Book Chapter
Closed access
PDF file
SDSrinivasa Rao Dammavalam
Srinivasa Rao Dammavalam
DMDr. Seetha M.
Dr. Seetha M.
MPM. H. M. Krishna Prasad
M. H. M. Krishna Prasad

15 November 2005
Verified
Conference Paper
Closed access
DMDr. Seetha M.
Dr. Seetha M.
IMI.V. MuraliKrishna
I.V. MuraliKrishna
BDB.L. Deekshatulu
B.L. Deekshatulu