HAHelen Sharmila Anbarasan

Helen Sharmila Anbarasan

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Helen Sharmila Anbarasan has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    GraphINR-IDS: Graph-Topology-Aware implicit neural reconstruction for zero-day intrusion detection in encrypted network traffic

    by Deepanramkumar P, Helen Sharmila A

    Payload encryption has shifted network intrusion detection towards flow-metadata analysis, yet most metadata-based detectors represent traffic through fixed feature windows, token sequences or periodic graph snapshots, discretising traffic before learning and binding the detector to a granularity selected in advance. GraphINR-IDS instead models benign flow behaviour as a continuous reconstruction function over source–destination topology, capture time and observable metadata. Spectral coordinates of the graph Laplacian encode communication position, multi-frequency sinusoids encode capture time, and a SIREN network reconstructs each flow from its own coordinate, with anomaly decisions following from standardised feature-wise residuals. Fitting, standardisation and calibration use benign flows exclusively, so the attack families met at test time are absent from fitting by construction. Twelve one-class detectors were compared on UNSW-NB15 and CIC-IDS2017 under one random and two chronological protocols. GraphINR-IDS reached 99.06 ± 0.12 % F1 at a 5.13 % false-positive rate, with the strongest threshold-free ranking of the twelve (AUROC 99.66 %, AUPRC 99.88 %). A fixed-capacity LSTM comparator lost roughly 55 to 67 percentage points of F1 as its window grew from 8 to 64 flows, whereas the continuous formulation requires no equivalent selection. Separate ablations attributed 1.15 percentage points of F1 to the spectral coordinate and 0.31 to hierarchical frequency decomposition, with no measurable contribution from graph-conditioned modulation on the static graphs evaluated. Chronological transfer raised realised false-positive rates for every detector, and re-estimating feature-wise residual statistics alongside the threshold recovered substantially more performance than threshold-only recalibration. The evidence supports continuous graph-temporal reconstruction as a competitive benign-only formulation and identifies calibration drift as a principal limitation under the evaluated protocols. Direct validation on operational encrypted traffic and evolving topologies remains necessary.

  • Enhancing Connectivity in Rural Areas: Secure Spectrum Access in 6G Networks Using Advanced Encryption and Spectrum Sensing Techniques

    by P Deepanramkumar, A Helen Sharmila, Niranchana Radhakrishnan, Devulapalli Sudheer, Jeethu V. Devasia, Ch. Pradeep Reddy, Gokul Yenduri, N. Jaisankar

    The advancement of 6G cognitive radio networks aims to reduce latency in rural and remote areas. Very few studies have been conducted on this technology. Therefore, this study utilizes massive multiple-input, multiple-output (MIMO) technology for secure data transmission at 6G base stations. Blockchain technology authenticates IDs and maintains secure records for network users, with decentralization achieved through the chimp optimization algorithm. The availability of the spectrum is monitored using the Q-learning hidden sparse variate logistic regression model, and the channel-state information is predicted using the quasi-Newton iterative unscented Kalman filter algorithm. Additionally, beamforming is enhanced through cooperative strategies. Secure routing is facilitated by the golden eagle optimization-hyper elliptic curve cryptography algorithm, where data are routed according to paths determined by the Dijkstra algorithm. The MIMO-6G-cognitive radio-based Internet-of-Things framework performs better compared to existing methods.


  • Open Access

    Blockchain Based Delay and Energy Harvest Aware Healthcare Monitoring System in WBAN Environment

    by Helen Sharmila Anbarasan, Jaisankar Natarajan

    Wireless body area networks (WBANs) are a research area that supports patients with healthcare monitoring. In WBAN, the Internet of Things (IoT) is connected with WBAN for a smart/remote healthcare monitoring system in which various medical diseases are diagnosed. Quality of service (QoS), security and energy efficiency achievements are the major issues in the WBAN-IoT environment. Existing schemes for these three issues fail to achieve them since nodes are resource constrained and hence delay and the energy consumption is minimized. In this paper, a blockchain-assisted delay and energy aware healthcare monitoring (B-DEAH) system is presented in the WBAN-IoT environment. Both body sensors and environment sensors are deployed with dual sinks for emergency and periodical packet transmission. Various processes are involved in this paper, and each process is described as follows: Key registration for patients using an extended version of the PRESENT algorithm is proposed. Cluster formation and cluster head selection are implemented using spotted hyena optimizer. Then, cluster-based routing is established using the MOORA algorithm. For data transmission, the patient block agent (PBA) is deployed and authenticated using the four Q curve asymmetric algorithm. In PBA, three entities are used: classifier and queue manager, channel selector and security manager. Each entity is run by a special function, as packets are classified using two stream deep reinforcement learning (TS-DRL) into three classes: emergency, non-emergency and faulty data. Individual packets are put into a separate queue, which is called emergency, periodical and faulty. Each queue is handled using Reyni entropy. Periodical packets are forwarded by a separate channel without any interference using a multi objective based channel selection algorithm. Then, all packets are encrypted and forwarded to the sink nodes. Simulation is conducted using the OMNeT++ network simulator, in which diverse parameters are evaluated and compared with several existing works in terms of network throughput for periodic (41.75 Kbps) and emergency packets (42.5 Kbps); end-to-end delay for periodic (0.036 s) and emergency packets (0.028 s); packet loss rate (1.1%); residual energy in terms of simulation rounds based on periodic (0.039 J) and emergency packets (0.044 J) and in terms of simulation time based on periodic (8.35 J) and emergency packets (8.53 J); success rate for periodic (87.83%) and emergency packets (87.5%); authentication time (3.25 s); and reliability (87.83%).