Anant Ram

Anant Ram

Auto-generated profile, based on publicly available information

Anant Ram

Institute of Engineering and Technology, GLA University, Mathura 281406, Uttar Pradesh, 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 March 2009
Verified
Conference Paper
Closed access
ARAnant Ram
Anant Ram
ASAshish Sharma
Ashish Sharma
AJAnand S. Jalal
Anand S. Jalal
AAAnkur Agrawal
Ankur Agrawal
RSRaghuraj Singh
Raghuraj Singh
DBSCAN is a pioneer density based clustering algorithm. It can find out the clusters of different shapes and sizes from the large amount of data which is containing noise and outliers. But the clusters detected by it contain large amount of density variation within them. It can not handle the local density variation that exists within the cluster. For good clustering a significant density variation may be allowed within the cluster because if we go for homogeneous clustering, a large number of smaller unimportant clusters may be generated. In this paper we propose an Enhanced DBSCAN algorithm which keeps track of local density variation within the cluster. It calculates the density variance for any core object with respect to its e -neighborhood. If density variance of a core object is less than or equal to a threshold value and also satisfying the homogeneity index with respect to its e -neighborhood then it will allow the core object for expansion. The experimental results show that the proposed clustering algorithm gives optimized results.

9 July 2020 in Annals of Telecommunications
Verified
Journal Article
Closed access
PDF file
ARAnant Ram
Anant Ram
MMManas Kumar Mishra
Manas Kumar Mishra

1 December 2016
Verified
Conference Paper
Closed access
ARAnant Ram
Anant Ram
MMManas Kumar Mishra
Manas Kumar Mishra
Vehicular ad hoc networks (VANETs) have become a practical and valuable alternative for wide variety of novel applications in road safety, content sharing, payment at different commercial places, etc. Due to high mobility of vehicles resulting in frequent disconnections, geographic routing protocols are commonly preferred in VANETs as they do not require, route formation prior to forward as well as route maintenance. Most of the position based routing protocols adopt the greedy mode to establish the route and switch to some recovery mechanism like perimeter routing, in case of failure. However, if the probability of occurrence of perimeter mode is higher than the greedy mode, then the throughput as well as the end to end delay will be severely affected. This probability is highly influenced by many factors where in density being the major among these. In this paper, we propose a routing strategy that uses the restricted greedy forwarding by considering neighborhood vehicles having a sufficiently dense neighborhood and the least velocity variance with its own neighboring vehicles, as the next forwarder. The objective is to increase the longevity of the route and thus increasing the throughput without greatly affecting the end to end delay. The performance of the proposed approach is compared with GPSR and the simulation results are presented.

1 January 2011
Verified
Book Chapter
Closed access
PDF file
KSKrishna Gopal Sharma
Krishna Gopal Sharma
ARAnant Ram
Anant Ram
YSYashpal Singh
Yashpal Singh

24 September 2019 in Lecture Notes in Electrical Engineering
Verified
Book Chapter
Closed access
PDF file
ASAshish Sharma
Ashish Sharma
ARAnant Ram
Anant Ram
ABArchit Bansal
Archit Bansal

17 November 2021 in Journal of Discrete Mathematical Sciences and Cryptography
Verified
Journal Article
Closed access
SASaurabh Anand
Saurabh Anand
ARAnant Ram
Anant Ram
MMManas Kumar Mishra
Manas Kumar Mishra
Data integration is very important in real-time data-driven applications, crowdsensing is used all over the world. At a cheap cost, crowdsensing may collect sensing data from smart devices (such as smart phones, smart watches, etc.). There are certain fundamental concerns to consider, such as data security and protection, data privacy, and data cost-effectiveness or incentive. Because some existing platform-based systems fail to regulate the concerns, data leakage in crowdsensing applications. For crowdsensing data integration, some approaches include cost-effectiveness and data quality challenges. This study proposes a unique crowdsensing architecture that combines blockchain technology with a decentralized crowdsensing framework. This framework aids in the security of data, the resolution of data privacy issues, and the protection of data from unwanted attacks in crowdsensing. The study also includes a hybrid system that ensures data quality and cost-effectiveness variables by combining monetary and reputation-based approaches. This framework is appropriate since the crowdsensing user will encourage data detection while discouraging malicious behaviors. The proposed innovative framework’s efficacy was confirmed by the combined effect of the framework design theory. The simulation results suggest that the proposed framework is reliable, and it would be effective to use it for crowdsensing data integration.