V. Valli Kumari

Andhra University

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

K. V. S. V. N. Raju

Maharaj Vijayaram Gajapathi Raj College of Engineering

Hari Kishan Kondaveeti

Vellore Institute of Technology University

V. V. R. Maheswara Rao

SRKR Engineering College

P. Ravi Kiran Varma

SRKR Engineering College

Kvsvn Raju

Andhra University

S. Ram Prasad Reddy

Andhra University

K. F. Schertz

Kalasalingam Academy of Research and Education

Ravi Mukkamala

Old Dominion University

K. V. S. RAJU

Andhra University

K. Thammi Reddy

Conference Board

Cooperative Institutions

Andhra University

Indian Institute of Management Visakhapatnam

GITAM University

SRM University

VIT-AP University

Maharaj Vijayaram Gajapathi Raj College of Engineering

Vignan's Foundation for Science, Technology & Research

Jawaharlal Nehru Technological University, Kakinada

Vellore Institute of Technology University

Jawaharlal Nehru Technological University, Hyderabad

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

Multi-path selection based on fractional cuckoo search algorithm for QoS aware routing in MANET

Sensor Review (2018)

Robb Richard A.Satyananda Reddy V. Valli Kumari

Purpose Multimedia applications such as digital audio and video have stringent quality of service (QoS) requirement in mobile ad hoc network. To support wide range of QoS, complex routing protocols with multiple QoS constraints are necessary. In QoS routing, the basic problem is to find a path that satisfies multiple QoS constraints. Moreover, mobility, congestion and packet loss in dynamic topology of network also leads to QoS performance degradation of protocol. Design/methodology/approach In this paper, the authors proposed a multi-path selection scheme for QoS aware routing in mobile ad hoc network based on fractional cuckoo search algorithm (FCS-MQARP). Here, multiple QoS constraints energy, link life time, distance and delay are considered for path selection. Findings The experimentation of proposed FCS-MQARP is performed over existing QoS aware routing protocols AOMDV, MMQARP, CS-MQARP using measures such as normalized delay, energy and throughput. The extensive simulation study of the proposed FCS-based multipath selection shows that the proposed QoS aware routing protocol performs better than the existing routing protocol with maximal energy of 99.1501 and minimal delay of 0.0554. Originality/value This paper presents a hybrid optimization algorithm called the FCS algorithm for the multi-path selection. Also, a new fitness function is developed by considering the QoS constraints such as energy, link life time, distance and delay.

Multipath routing

Cuckoo search

Path vector protocol

10.1108/sr-08-2017-0170

Cite

Citations (17)

On the Fly n-wMVD Identification for Reducing Data Redundancy

International Journal of Database Management Systems (2014)

Sangeeta Viswanadham V. Valli Kumari

Data Cleaning helps in reducing redundancy by determining whether two or more records defined differently in database represent the same real world object.If they represent the same, then the values of the records are nested generating a new n-wMVD database.The limitation with this approach is that addition or deletion of data is not done dynamically.To overcome this limitation we propose a dynamic approach that helps in reducing the redundancy, by comparing every incoming record with existing data and allows the modifications to be done if necessary.The operations are performed on the fly on the existing n-wMVD databases.When a record to be inserted, the approach allows a decision on whether to insert or nest with the existing record.If a record needs to be updated it is verified to observe if a new nesting has to be done or existing record can be updated.If a record to be deleted is unique then it is deleted from the database otherwise it is deleted by removing it from nesting.The applicability of our approach was tested and it is found that the results are promising which are discussed in this paper.

Identification

On the fly

10.5121/ijdms.2014.6106

Cite

Citations (0)

Privacy Preserving in Dynamic Social Networks

Jyothi Vadisala V. Valli Kumari

In recent years, social networks are widely used for representing the relationship between individuals and published for various research purposes. As time changes the relationship between individuals also changes so there exist a privacy breach of individuals in dynamic networks. In this paper we discuss about identity disclosure in sequential published network data. To preserve the privacy of published dynamic network, we proposed the privacy model kw -Number of Mutual Friend Anonymization where k indicates the privacy level and w is the amount of time taken by the adversary can get the knowledge of victim by monitoring in w intervals. The kw -NMF algorithm anonymizes each release of network data so that the adversary can not re-identify the victim by knowing the knowledge of each release. The experimental results on both real and synthetic data sets demonstrate that the proposed approach can preserve much of the characteristics of the dynamic social networks.

10.1145/2980258.2980426

Cite

Citations (3)

Parallel and distributed frequent-regular patternmining using vertical format in large databases

G. Vijay Kumar V. Valli Kumari

A good number of parallel and distributed frequent pattern mining algorithms have been proposed so far for the large and/or distributed databases. Not only occurrence frequency of a pattern but also occurrence behavior (regularity) of a pattern may be treated as an emerging area in data mining research. So far some efforts have been made to mine regular patterns but there is no suitable algorithm exists to mine frequent-regular patterns in parallel and distributed environment. Therefore, in this paper we introduced a new method called PFRP-method (Parallel Frequent Regular Pattern-method) to discover frequent-regular patterns in large databases using vertical data format which requires only one database scan. Our method works in parallel at each local site in order to reduce I/O cost and inter-process communication, generates all frequent-regular patterns in the final phase. Our experiment results show that our PFRP-method is highly efficient in large databases.

Distributed database

10.1049/cp.2012.2506

Cite

Citations (11)

Expert Finding System using Latent Effort Ranking in Academic Social Networks

International Journal of Information Technology and Computer Science (2015)

Sobha K. Rani Kvsvn Raju V. Valli Kumari

The dynamic nature of social network and the influence it has on the provision of immediate solutions to a simple task made their usage prominent and dependable.Whether it is a task of getting a solution to a trivial problem or buying a gadget online or any other task that involves collaborative effort, interacting with people across the globe, the immediate elucidation that comes into anyone's mind is the social network.Question Answer systems, Feedback systems, Recommender systems, Reviewer Systems are some of the frequently needed applications that are used by people for taking a decision on performing a day to day task.Experts are needed to maintain such systems which will be helpful for the overall development of the web communities.Finding an expert who can do justice for a question involving multiple domain knowledge is a difficult task.This paper deal with an expert finding approach that involves extraction of expertise that is hidden in the profile documents and publications of a researcher who is a member of academic social network.Keywords extracted from an expert's profile are correlated against index terms of the domain of expertise and the experts are ranked in the respective domains.This approach emphasizes on text mining to retrieve prominent keywords from publications of a researcher to identify his expertise and visualizes the result after statistical analysis.

10.5815/ijitcs.2015.02.03

Cite

Citations (10)

Abridged Shape Matrix Representation for the Recognition of Aircraft Targets from 2D ISAR Imagery

Advances in Computational Sciences and Technology (2017)

Hari Kishan Kondaveeti V. Valli Kumari

Inverse Synthetic Aperture Radar (ISAR) images are used (i) for detecting the high scatter parts or areas in the target (hot-spots) and (ii) for the identification of targets.Automatic Target Recognition (ATR) systems reduce the burden of the human operators by identifying the targets in ISAR images automatically and aid the operators in executing accurate decisions with less effort.Even though target classification or recognition is the main objective these systems, they must possess the mechanisms to cope up with the noise as the clutter and noise degrade the overall performance of these systems significantly.In this paper a new classification method is proposed to identify the aircrafts in ISAR images automatically.A Homomorphic wavelet based step-by-step systematic noise removal procedure is developed, to segment out the target carefully from background noise.Rotation and scale normalization are performed on the segmented image using feature matching.Finally, the classification step depends on the abridged shape matrix generated from the segmented target to recognize the aircraft.Experiments were conducted on synISAR aircraft image dataset and results are presented.The experimental results show that the proposed method is fast and accurate to identify aircrafts in ISAR images.

Representation

Matrix (chemical analysis)

10.37622/acst/10.5.2017.1103-1122

Cite

Citations (11)

Integration of local chan vase along with optimization techniques for segmentation

Hari Jyothula S. Koteswara Rao V. Valli Kumari

Image is a two dimensional capacity f(x, y). The way toward dividing an image into numerous parts or questions is named as Segmentation. There are two noteworthy deterrents in sectioning an image i.e., Intensity Inhomogeneity and Noise. As a result of these challenges, precise division comes about can't be acquired. This paper presents Local Chan-Vese (LCV) alongside some enhancement methods for minimization of vitality capacities to defeat power inhomogeneity and commotion. By consolidating this implanted approach, the images with force inhomogeneity can be effectively divided.

Minification

10.1109/icecds.2017.8389961

Cite

Citations (2)

A Modified Ontology Based Personalized Search Engine Using Bond Energy Algorithm

Communications in computer and information science (2011)

Bhaskara Rao Boddu V. Valli Kumari

10.1007/978-3-642-22714-1_31

Cite

Citations (1)

A sliding window based Self-Learning and Adaptive Load Balancer

Journal of Network and Computer Applications (2015)

Veerabhadra Rao Chandakanna V. Valli Kumari

Turnaround time

Response time

Sliding window protocol

10.1016/j.jnca.2015.07.001

Cite

Citations (10)

Robust ISAR image classification using Abridged Shape Matrices

Hari Kishan Kondaveeti V. Valli Kumari

In this paper a new classification method is proposed to classify the ISAR images automatically based on Abridged Shape Matrices (ASMs). Initially, a considerate noise removal procedure is used to abate the noise present in the ISAR images and the target is segmented out from the background clutter. ASMs are obtained from the segmented targets by careful interpolation of the shape details of the target by the polar quantization. ASMs are concise and non redundant as the over sampling is avoided in interpolating the inner shape details of the target. The avoidance of superfluous interpolations in polar quantization reduces the generation time of the ASMs, which in turn curtails the over all execution time of the classifier. Experiments were conducted on synthesized ISAR aircraft image dataset and results are presented. The experimental results show that the proposed method is sturdy and more meticulous than existing methods.

Interpolation

10.1109/icetets.2016.7603025

Cite

Citations (9)