Soumya J Bhat

Dr. Soumya J Bhat

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
7 March 2022 in Peer-to-Peer Networking and Applications
Verified
Journal Article
Open access
PDF file
SBSoumya J Bhat
Soumya J Bhat
SVSanthosh Krishnan Venkata
Santhosh Krishnan Venkata
With the advancement of sensor technologies, Wireless Sensor Networks (WSN) are envisioning a rich variety of promising services in many fields. WSN is formed by the deployment of sensor nodes in the regions of interest using a deterministic or random deployment strategy. The random deployment strategy is more suitable in large monitoring areas and harsh environments. But, in this type of deployment, coverage holes and disconnected networks can exist. Important events may get unnoticed reducing the reliability of the networks. Since the locations of nodes are unknown in a randomly deployed WSN, it is difficult to locate the holes. For this, we are proposing a localization and deployment model. The localization algorithm uses Arithmetic Optimization Algorithm (AOA) and the results of this algorithm are further used to develop a deployment model to achieve a completely connected network. This algorithm is tested in various fields. The algorithm is able to localize nodes accurately and identify the coverage holes with an error rate of less than 0.27% when the Average Localization Error (ALE) is within 5m.


23 May 2020 in Wireless Personal Communications
Verified
Journal Article
Open access
PDF file
SBSoumya J Bhat
Soumya J Bhat
SVSanthosh Krishnan Venkata
Santhosh Krishnan Venkata
Wireless sensor networks have been considered as an emerging technology for numerous applications of cyber-physical systems. These applications often require the deployment of sensor nodes in various anisotropic fields. Localization in anisotropic fields is a challenge because of the factors such as non-line of sight communications, irregularities of terrains, and network holes. Traditional localization techniques, when applied to anisotropic or irregular fields, result in colossal location estimation errors. To improve location estimations, this paper presents a comparative analysis of available localization techniques based on taxonomy framework. A detailed discussion on the importance of localization of sensor nodes in irregular fields from the reported real-life applications is presented along with challenges faced by existing localization techniques. Further, taxonomy based on techniques adopted by localization methods to address the effects of irregular fields on location estimations is reported. Finally, using the designed taxonomy framework, a comparative analysis of different localization techniques addressing irregularities and the directions towards the development of an optimal localization technique is addressed.

6 December 2021 in Telecommunication Systems
Verified
Journal Article
Open access
PDF file
SBSoumya J Bhat
Soumya J Bhat
SVSanthosh Krishnan Venkata
Santhosh Krishnan Venkata
Internet of Things (IoT) has changed the way people live by transforming everything into smart systems. Wireless Sensor Network (WSN) forms an important part of IoT. This is a network of sensor nodes that is used in a vast range of applications. WSN is formed by the random deployment of sensor nodes in various fields of interest. The practical fields of deployment can be 2D or 3D, isotropic or anisotropic depending on the application. The localization algorithms must provide accurate localization irrespective of the type of field. In this paper, we have reported a localization algorithm called Range Reduction Based Localization (RRBL). This algorithm utilizes the properties of hop-based and centroid methods to improve the localization accuracy in various types of fields. In this algorithm, the location unknown nodes identify the close-by neighboring nodes within a predefined threshold and localize themselves by identifying and reducing the probable range of existence from these neighboring nodes. The nodes which do not have enough neighbors are localized using the least squares method. The algorithm is tested in various irregular and heterogeneous conditions. The results are compared with a few state-of-the-art hop-based and centroid-based localization techniques. RRBL has shown an improvement in localization accuracy of 28% at 10% reference node ratio and 26% at 20% reference node ratio when compared with other localization algorithms.

2 March 2021 in IEEE Access
Verified
Journal Article
Open access
SBSoumya J Bhat
Soumya J Bhat
SVSanthosh Krishnan Venkata
Santhosh Krishnan Venkata
Location information of nodes in Wireless Sensor Networks (WSN) is essential to identify the origins of events and to act on them. Several localization algorithms are developed for this purpose. In this work, we have considered hop based localization algorithms, which are popularly used in WSN applications. These algorithms use a few reference nodes with location information and localize other nodes with reference to these nodes. But, in practical scenarios, some reference nodes may turn faulty and report incorrect location information to other nodes. This reduces the localization accuracy of the entire network. Therefore, it is essential to identify and filter out faulty reference nodes from the localization process. But, in Heterogeneous Wireless Sensor Networks (HWSN), since both faulty nodes and heterogeneous nodes modify hop distances, it becomes even more challenging to identify only faulty nodes among a set of heterogeneous nodes. In this work, we have reported a fault filtering method that can be used with any of the existing hop based localization algorithms for fault-tolerant localization. This method first normalizes the distance estimations using the communication radius of nodes and then uses the Jenks Natural Breaks algorithm for filtering out the nodes producing inconsistent distance estimations. The reported method is incorporated into existing localization algorithms and tested in 2D/3D, isotropic/anisotropic environments. The results show an improvement of 14%, 52%, and 51% in localization accuracy when tested with DV-Hop, Weighted DV-Hop, and HHO-AM algorithms, respectively.

18 August 2025 in Automation
Verified
Journal Article
Open access
PDF file
SBSoumya J Bhat
Soumya J Bhat
SVSanthosh Krishnan Venkata
Santhosh Krishnan Venkata
Wireless sensor networks (WSNs) have gained significant attention across various industries and scientific fields. Localization, a crucial aspect of WSNs, involves accurately determining node positions to track events and execute actions. Despite the development of numerous localization algorithms, real-world environments pose challenges such as anisotropy, noise, and faults. To improve accuracy amidst these complexities, researchers are increasingly adopting advanced methodologies, including soft computing, software-defined networking, maximum likelihood estimation, and optimization techniques. Our comprehensive review from 2020 to 2024 reveals that approximately 29% of localization solutions employ optimization techniques, 48% of which utilize nature-inspired swarm-based algorithms. These algorithms have proven effective for node localization in a variety of applications, including smart cities, seismic exploration, oil and gas reservoir monitoring, assisted living environments, forest monitoring, and battlefield surveillance. This underscores the importance of swarm intelligence algorithms in sensor node localization, prompting a detailed investigation in our study. Additionally, we provide a comparative analysis to elucidate the applicability of these algorithms to various localization challenges. This examination not only helps researchers understand current localization issues within WSNs but also paves the way for enhanced localization precision in the future.