Aitha Nagaraju

Aitha Nagaraju

Auto-generated profile, based on publicly available information

Aitha Nagaraju

Department of Computer Science, Central University of Rajasthan, Ajmer, India

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
1 January 2021 in Journal of Computational Science
Verified
Journal Article
Closed access
SSSophiya Sheikh
Sophiya Sheikh
ANA. Nagaraju
A. Nagaraju
MSMohammad Shahid
Mohammad Shahid

1 January 2018 in International Journal of Wireless and Mobile Computing
Verified
Journal Article
Closed access
VMVinod Kumar Menaria
Vinod Kumar Menaria
SJS.C. Jain
S.C. Jain
ANA. Nagaraju
A. Nagaraju
In the on-demand usage of wireless sensor networks over the internet, fault tolerance is an exigent task to improve the overall performance of service computing. In the proposed research work, an attempt has been made to make use of an artificial bee colony approach to find data aggregation for providing fault tolerance in wireless sensor networks (WSNs) and to make effective utilisation of the existing resources over the internet. In this paper, it is tried to apply quadratic minimum spanning tree (Q-MST) which is an artificial intelligence technique to provide fault tolerance along with data aggregation in WSN. Q-MST is used to improve the fault tolerance in WSN to transmit data packets from the source node to sink node. Ant colony, PRIMS and Particle Swarm Optimisation (PSO) algorithms are used for generating minimum spanning tree (MST) which can be used for data aggregation. The Q-MST is an improved version of minimum spanning tree where an ordered pair of distinct edges would be considered for implementing an alternative edge for the existing edge failure in MST.

6 November 2013 in Security and Communication Networks
Verified
Journal Article
Closed access
DMDevendra Kumar Mahawer
Devendra Kumar Mahawer
ANA. Nagaraju
A. Nagaraju

1 March 2014
Verified
Conference Paper
Closed access
DSD. Sunitha
D. Sunitha
ANA. Nagaraju
A. Nagaraju
GNG. Narsimha
G. Narsimha
A cross-layer based approach for improving TCP performance in Multihop Mobile Adhoc Networks (MANETs) is proposed in this paper. The proposed congestion triggering mechanism triggers congestion whenever the channel occupied ratio (COR) reaches a maximum threshold value and the received signal strength is less than a minimum threshold value. Following it, the congestion control scheme controls the data sending rate of the sender by determining available bandwidth, delay of its link and COR. Further, a fair resource allocation scheme is put forwarded. The proposed approach is simulated in network simulator-2 (NS-2). Simulation results illustrate the efficiency of our technique in terms of throughput, delivery ratio and delay.

1 December 2012
Verified
Conference Paper
Closed access
MMMehul Mahrishi
Mehul Mahrishi
ANA. Nagaraju
A. Nagaraju
The applications submitted to cloud middle ware have been distributed to the CSPs based on the available CSPs in the cloud environment to categorize the service CSP providers with this work we are trying to introduce a concept to find the optimal csp based on rough set based approach. IaaS provides a large amount of computational capacities to users in a flexible and efficient way. In the market various CSPs are available example Amazons elastic computing cloud offers virtual machine with 0.1 us dollars per hour similarly another cloud Google compute cloud offers virtual machine with 0.5 us dollars per hour then the cloud users need rating among the various Csps. In this research work we have been proposing an approach to provide the rating of CSPs based on the internal performance of Datacenters and virtual machines. In present situation day-by- day number of cloud service providers have been increasing drastically. In this scenario existing service providers scheduling need a mechanism to find the optimal service providers information to Service request scheduling using this information SRS can allocate the service to the respective optimal service providers. In this paper we studied the problem of dynamic request allocation and scheduling for context aware application deployed in geographically distributed data centers forming a cloud.

9 January 2009
Verified
Conference Paper
Open access
PDF file
ANA Nagaraju
A Nagaraju
SRS Ramachandram
S Ramachandram
The existing reactive routing algorithms in Mobile Ad-hoc Networks (MANETs) generally send route request packet to all the neighbor nodes when it needs to find the destination. This greatly reduces the performance of network and consumes much of the bandwidth. The existing routing algorithms such as Ad-hoc On-demand Routing Algorithm (AODV) and Dynamic Source Routing (DSR) are suitable for networks with frequent changing topology. In this paper we propose a technique to reduce broadcasting by finding equivalence classes based on rough set concept among the neighbors of a source node. This protocol tries to establish a long term valid path from source node to destination node. This means the protocol is of more use full in several applications such as multimedia and video conferences.