Muruganantham Dinakaran
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Muruganantham Dinakaran has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
R. Vijay Anand
5 shared publications- Palanisamy Balasubramanie
Department of Computer Science and Engineering, Kongu Engineering College, Perundurai, Erode, India
4 shared publications - E. Ezhilarasan
Research Scholar, School of Information Technology, VIT University Vellore, 632014, Tamilnadu, India
3 shared publications - Senthil Kumar Narayanasamy
Vel Tech RangarajanDr.Sagunthala R&D Institute of Science and Technology (Deemed to be University)
3 shared publications - Vijayarajan Vijayan
School of Computer Science and Engineering, Vellore Institute of Technology (VIT), India
3 shared publications - D. Geraldine Bessie Amali
Vellore Institute of Technology
2 shared publications
Latest Publications
- Open Access
- 8 May 2026
- Published by Frontiers Media SA in Frontiers in Computer Science
- Vol. 8, 1818011
A DBSAHO scheme for smooth movement in heterogeneous network-based distributed mobility systems
Next-generation communication systems demand uninterrupted mobility across heterogeneous access networks, where users regularly switch among technologies (e.g., Wi-Fi, 5G, and future 6G networks). Network-Based Distributed Mobility Management (NB-DMM) scales and routes better than centralized mobility solutions, but vertical handovers across heterogeneous access domains may still cause handover latency, packet loss, signaling overhead, and out-of-order packet delivery. The Dual Buffer Signaling Aggregation (DB-SAHO) was an earlier mechanism proposed to improve handover performance in NB-DMM homogeneous environments. The paper further extends the DBSA concept to heterogeneous networks and proposes a heterogeneous H-DBSA scheme that facilitates vertical handovers across access technologies. The proposed method uses a dual buffer service and aggregates signaling across diverse access areas. During transition, a forward buffer preserves incoming messages from the previous access network while the new buffer ensures a continuous, ordered transfer of data from the target network. At the same time, signaling aggregation reduces the number of control messages transmitted during handover. The proposed scheme is tested for performance using OMNeT++ simulations at different mobility speeds, and for sensitivity analysis with different buffer sizes and signaling delays. Simulation results show that the heterogeneous H-DBSA scheme significantly decreases latency during handover, minimizes packet losses and out-of-order rearrangements, and enhances throughput more than it increases signaling costs compared to the existing NB-DMM. The sensitivity results also reveal that performance is stable throughout various operating scenarios, showing the capability of the proposed mechanism in heterogeneous distributed mobility contexts.
- 8 May 2026
- Published by Frontiers Media SA in Frontiers in Computer Science
- Vol. 8, 1818011
Open AccessA DBSAHO scheme for smooth movement in heterogeneous network-based distributed mobility systems
Next-generation communication systems demand uninterrupted mobility across heterogeneous access networks, where users regularly switch among technologies (e.g., Wi-Fi, 5G, and future 6G networks). Network-Based Distributed Mobility Management (NB-DMM) scales and routes better than centralized mobility solutions, but vertical handovers across heterogeneous access domains may still cause handover latency, packet loss, signaling overhead, and out-of-order packet delivery. The Dual Buffer Signaling Aggregation (DB-SAHO) was an earlier mechanism proposed to improve handover performance in NB-DMM homogeneous environments. The paper further extends the DBSA concept to heterogeneous networks and proposes a heterogeneous H-DBSA scheme that facilitates vertical handovers across access technologies. The proposed method uses a dual buffer service and aggregates signaling across diverse access areas. During transition, a forward buffer preserves incoming messages from the previous access network while the new buffer ensures a continuous, ordered transfer of data from the target network. At the same time, signaling aggregation reduces the number of control messages transmitted during handover. The proposed scheme is tested for performance using OMNeT++ simulations at different mobility speeds, and for sensitivity analysis with different buffer sizes and signaling delays. Simulation results show that the heterogeneous H-DBSA scheme significantly decreases latency during handover, minimizes packet losses and out-of-order rearrangements, and enhances throughput more than it increases signaling costs compared to the existing NB-DMM. The sensitivity results also reveal that performance is stable throughout various operating scenarios, showing the capability of the proposed mechanism in heterogeneous distributed mobility contexts.
- Open Access
- 1 May 2026
- Published by Frontiers Media SA in Frontiers in Communications and Networks
- Vol. 7, 1771623
DB-SAHO network-based distributed mobility management: enhancing handover performance in mobile networks
Although the mobility protocols have improved, Proxy Mobile IPv6 (PMIPv6)-Based Distributed Mobility Management (DMM) networks still have significant challenges to ensure a seamless user mobility. These problems include long handover process, high chance of information loss after information is transferred, high signaling overhead and the overload of network resources, and the loss of packet order. This results to poor quality real-time applications. To remove these limitations, we propose Dual Buffering and Signaling Aggregation of Handover Optimization (DB-SAHO) process. DB-SAHO bundles several signaling messages in one coherent message, allowing to save signaling costs and facilitate handovers in a better way. Mobile Access and Anchor Routers have new and forward data buffers. These provide temporary storage capability of in-transit packets. This ensures that data delivery has no loss or data reordering for mobility events. This type of buffer manages ensures that packets reduce the loss, and prevents the out-of-order delivery. As a result, it makes the user experience better. DB-SAHO also employs a smart selection system in order to select the optimal next network point for the mobile-user. This facilitates easy transit between MAARs. The proposed method does not present additional structures or control-plane procedures. It instead aligns data buffering with joint signalling in such a way that data forwarding and signalling completion are not coupled during handover. We used the Omnet++ network simulation software to test this strategy and compare it with existing NBDMM schemes. Simulation result shows that DB-SAHO saves handover time and signaling cost, maintains packet order and greatly improves handover reliability in DMM networks.
- 1 May 2026
- Published by Frontiers Media SA in Frontiers in Communications and Networks
- Vol. 7, 1771623
Open AccessDB-SAHO network-based distributed mobility management: enhancing handover performance in mobile networks
Although the mobility protocols have improved, Proxy Mobile IPv6 (PMIPv6)-Based Distributed Mobility Management (DMM) networks still have significant challenges to ensure a seamless user mobility. These problems include long handover process, high chance of information loss after information is transferred, high signaling overhead and the overload of network resources, and the loss of packet order. This results to poor quality real-time applications. To remove these limitations, we propose Dual Buffering and Signaling Aggregation of Handover Optimization (DB-SAHO) process. DB-SAHO bundles several signaling messages in one coherent message, allowing to save signaling costs and facilitate handovers in a better way. Mobile Access and Anchor Routers have new and forward data buffers. These provide temporary storage capability of in-transit packets. This ensures that data delivery has no loss or data reordering for mobility events. This type of buffer manages ensures that packets reduce the loss, and prevents the out-of-order delivery. As a result, it makes the user experience better. DB-SAHO also employs a smart selection system in order to select the optimal next network point for the mobile-user. This facilitates easy transit between MAARs. The proposed method does not present additional structures or control-plane procedures. It instead aligns data buffering with joint signalling in such a way that data forwarding and signalling completion are not coupled during handover. We used the Omnet++ network simulation software to test this strategy and compare it with existing NBDMM schemes. Simulation result shows that DB-SAHO saves handover time and signaling cost, maintains packet order and greatly improves handover reliability in DMM networks.
- Top Cited PapersOpen Access
- 8 November 2024
- Published by Frontiers Media SA in Frontiers in Immunology
- Vol. 15, 1357217
Personalized cancer vaccine design using AI-powered technologies
Immunotherapy has ushered in a new era of cancer treatment, yet cancer remains a leading cause of global mortality. Among various therapeutic strategies, cancer vaccines have shown promise by activating the immune system to specifically target cancer cells. While current cancer vaccines are primarily prophylactic, advancements in targeting tumor-associated antigens (TAAs) and neoantigens have paved the way for therapeutic vaccines. The integration of artificial intelligence (AI) into cancer vaccine development is revolutionizing the field by enhancing various aspect of design and delivery. This review explores how AI facilitates precise epitope design, optimizes mRNA and DNA vaccine instructions, and enables personalized vaccine strategies by predicting patient responses. By utilizing AI technologies, researchers can navigate complex biological datasets and uncover novel therapeutic targets, thereby improving the precision and efficacy of cancer vaccines. Despite the promise of AI-powered cancer vaccines, significant challenges remain, such as tumor heterogeneity and genetic variability, which can limit the effectiveness of neoantigen prediction. Moreover, ethical and regulatory concerns surrounding data privacy and algorithmic bias must be addressed to ensure responsible AI deployment. The future of cancer vaccine development lies in the seamless integration of AI to create personalized immunotherapies that offer targeted and effective cancer treatments. This review underscores the importance of interdisciplinary collaboration and innovation in overcoming these challenges and advancing cancer vaccine development.
- 8 November 2024
- Published by Frontiers Media SA in Frontiers in Immunology
- Vol. 15, 1357217
Top Cited PapersOpen AccessPersonalized cancer vaccine design using AI-powered technologies
Immunotherapy has ushered in a new era of cancer treatment, yet cancer remains a leading cause of global mortality. Among various therapeutic strategies, cancer vaccines have shown promise by activating the immune system to specifically target cancer cells. While current cancer vaccines are primarily prophylactic, advancements in targeting tumor-associated antigens (TAAs) and neoantigens have paved the way for therapeutic vaccines. The integration of artificial intelligence (AI) into cancer vaccine development is revolutionizing the field by enhancing various aspect of design and delivery. This review explores how AI facilitates precise epitope design, optimizes mRNA and DNA vaccine instructions, and enables personalized vaccine strategies by predicting patient responses. By utilizing AI technologies, researchers can navigate complex biological datasets and uncover novel therapeutic targets, thereby improving the precision and efficacy of cancer vaccines. Despite the promise of AI-powered cancer vaccines, significant challenges remain, such as tumor heterogeneity and genetic variability, which can limit the effectiveness of neoantigen prediction. Moreover, ethical and regulatory concerns surrounding data privacy and algorithmic bias must be addressed to ensure responsible AI deployment. The future of cancer vaccine development lies in the seamless integration of AI to create personalized immunotherapies that offer targeted and effective cancer treatments. This review underscores the importance of interdisciplinary collaboration and innovation in overcoming these challenges and advancing cancer vaccine development.
- Open Access
- 1 August 2024
- Published by Institute of Advanced Engineering and Science in Bulletin of Electrical Engineering and Informatics
- Vol. 13 (4) , 2659-2667
Secure and efficient data storage with Rivest Shamir Adleman algorithm in cloud environment
Cloud computing rapidly is a prerequisite and releases resources with minimal management effort. The surfacing of the cloud has significantly distorted the general insight into infrastructure, software services, and development models. In contrast to single-key encryption models based on public or private keys (PKs), hybrid encryption systems combine encryption methods using symmetric or asymmetric methods. Various hybrid algorithms fail to meet users’ expectations regarding data security and cannot prevent all security risks. The secure and efficient data storage and retrieval (SEDSR) algorithm was developed for scalable key management between the content owner, cloud user, and service providers in an un-trusted cloud environment. In the implementation, the SEDSR combines the Rivest Shamir Adleman (RSA) algorithm 4096 key length with a primary symmetric key method to provide adequate and compact security with optimal retrieval systems in the cloud. Based on the experimental evaluation, the SEDSR minimizes 1.7 seconds of encryption times (ET) and 1.5 seconds of decryption time (DT) and improves by 34% throughput (TRP) compared to existing parameters.
- 1 August 2024
- Published by Institute of Advanced Engineering and Science in Bulletin of Electrical Engineering and Informatics
- Vol. 13 (4) , 2659-2667
Open AccessSecure and efficient data storage with Rivest Shamir Adleman algorithm in cloud environment
Cloud computing rapidly is a prerequisite and releases resources with minimal management effort. The surfacing of the cloud has significantly distorted the general insight into infrastructure, software services, and development models. In contrast to single-key encryption models based on public or private keys (PKs), hybrid encryption systems combine encryption methods using symmetric or asymmetric methods. Various hybrid algorithms fail to meet users’ expectations regarding data security and cannot prevent all security risks. The secure and efficient data storage and retrieval (SEDSR) algorithm was developed for scalable key management between the content owner, cloud user, and service providers in an un-trusted cloud environment. In the implementation, the SEDSR combines the Rivest Shamir Adleman (RSA) algorithm 4096 key length with a primary symmetric key method to provide adequate and compact security with optimal retrieval systems in the cloud. Based on the experimental evaluation, the SEDSR minimizes 1.7 seconds of encryption times (ET) and 1.5 seconds of decryption time (DT) and improves by 34% throughput (TRP) compared to existing parameters.
- Open Access
- 1 May 2023
- Published by Institute of Advanced Engineering and Science in Indonesian Journal of Electrical Engineering and Computer Science
- Vol. 30 (2) , 1192-1200
Flexible and secure continues data transmission among multiple users in cloud environment
Cloud computing is an internet based computing where the sharable information, software and resources are provided based on demand devices. Where, the rapid development and pervasive growth of unavoidable sending of message advances, there are expanding requests of adaptable cryptographic natives to protected group data transactions and computing platforms in cloud. Group key agreement (GKA) protocol enables a group to share a standard encryption key across an open network so that only members of the group may decode the ciphertexts encoded using the secret encryption key that has been released. However, a sender cannot deny any specific member from decryptions the ciphertexts in cloud. However, before sending a message to a group, a user must join the group and follow the GKA protocol to provide the intended members access to a secret key. To find a better solution for the above-mentioned issues, flexible and secure continues data transmission (FSCDT) algorithm is proposed to offer dynamic and secure data transfer broadcasting without full trust of key authority in unreliable cloud environment. It provides compete security proof, outlines the requirements of the aggregatability of the secret attribute based FSCDT building block. Based on experimental evaluations, FSCDT algorithm minimizes encryption time, decryption time and communication cost.
- 1 May 2023
- Published by Institute of Advanced Engineering and Science in Indonesian Journal of Electrical Engineering and Computer Science
- Vol. 30 (2) , 1192-1200
Open AccessFlexible and secure continues data transmission among multiple users in cloud environment
Cloud computing is an internet based computing where the sharable information, software and resources are provided based on demand devices. Where, the rapid development and pervasive growth of unavoidable sending of message advances, there are expanding requests of adaptable cryptographic natives to protected group data transactions and computing platforms in cloud. Group key agreement (GKA) protocol enables a group to share a standard encryption key across an open network so that only members of the group may decode the ciphertexts encoded using the secret encryption key that has been released. However, a sender cannot deny any specific member from decryptions the ciphertexts in cloud. However, before sending a message to a group, a user must join the group and follow the GKA protocol to provide the intended members access to a secret key. To find a better solution for the above-mentioned issues, flexible and secure continues data transmission (FSCDT) algorithm is proposed to offer dynamic and secure data transfer broadcasting without full trust of key authority in unreliable cloud environment. It provides compete security proof, outlines the requirements of the aggregatability of the secret attribute based FSCDT building block. Based on experimental evaluations, FSCDT algorithm minimizes encryption time, decryption time and communication cost.
- 30 April 2023
- Published by International Information and Engineering Technology Association in International Journal of Safety and Security Engineering
- Vol. 13 (2) , 205-211
A Review of Deep Learning Algorithms for Anomaly Detection in Videos
- 30 April 2023
- Published by International Information and Engineering Technology Association in International Journal of Safety and Security Engineering
- Vol. 13 (2) , 205-211
A Review of Deep Learning Algorithms for Anomaly Detection in Videos
- Open Access
- 1 December 2022
- Published by Institute of Advanced Engineering and Science in International Journal of Electrical and Computer Engineering (IJECE)
- Vol. 12 (6) , 6559-6573
An overview of internet engineering task force mobility management protocols: approaches and its challenges
In recent years, internet protocol mobility management has become one of the most popular research areas in networking. Mobility management protocols are in charge of preserving continuing communications as a user roam between different networks. All existing internet protocols (IP), like MIPv6, and PMIPv6, rely on a centralized mobility anchor to control mobile node traffic and signaling. The disadvantages of centralized mobility management (CMM) include ineffectiveness in handling massive volumes of traffic, poor scalability, wasteful use of network resources, and packet delay. When CMM is required to handle mobile media, which demands a huge amount of information and frequently needs quality of services (QoS) such as session continuance and reduced latency, these difficulties become apparent. It drives the need for distributed mobility management protocol (DMM) systems to manage the growing amount of mobile data, the overwhelming of this is video communication. DMM approaches could be regarded as an innovative and effective method to deal with mobility. An overview of the CMM protocol and its drawbacks are analyzed. This study examines the various DMM protocol techniques and their performance metrics are compared to highlight similarities and differences. The study reveals the network-based DMM protocol improves overall handoff time and packet loss.
- 1 December 2022
- Published by Institute of Advanced Engineering and Science in International Journal of Electrical and Computer Engineering (IJECE)
- Vol. 12 (6) , 6559-6573
Open AccessAn overview of internet engineering task force mobility management protocols: approaches and its challenges
In recent years, internet protocol mobility management has become one of the most popular research areas in networking. Mobility management protocols are in charge of preserving continuing communications as a user roam between different networks. All existing internet protocols (IP), like MIPv6, and PMIPv6, rely on a centralized mobility anchor to control mobile node traffic and signaling. The disadvantages of centralized mobility management (CMM) include ineffectiveness in handling massive volumes of traffic, poor scalability, wasteful use of network resources, and packet delay. When CMM is required to handle mobile media, which demands a huge amount of information and frequently needs quality of services (QoS) such as session continuance and reduced latency, these difficulties become apparent. It drives the need for distributed mobility management protocol (DMM) systems to manage the growing amount of mobile data, the overwhelming of this is video communication. DMM approaches could be regarded as an innovative and effective method to deal with mobility. An overview of the CMM protocol and its drawbacks are analyzed. This study examines the various DMM protocol techniques and their performance metrics are compared to highlight similarities and differences. The study reveals the network-based DMM protocol improves overall handoff time and packet loss.
- 24 January 2020
- Published by Springer Nature in Sādhanā
- Vol. 45 (1) , 29
An algorithmic approach to rank the disambiguous entities in Twitter streams for effective semantic search operations
- 24 January 2020
- Published by Springer Nature in Sādhanā
- Vol. 45 (1) , 29
An algorithmic approach to rank the disambiguous entities in Twitter streams for effective semantic search operations
- Open Access
- 28 June 2019
- Published by Laboratory for Knowledge Management and E-Learning - The University of Hong Kong in Knowledge Management & E-Learning: An International Journal
- Vol. 11 (2) , 262-280
Semantic based entity retrieval and disambiguation system for Twitter streams
Social media networks have evolved as a large repository of short documents and gives the greater challenges to effectively retrieve the content out of it. Many factors were involved in this process such as restricted length of a content, informal use of language (i.e., slangs, abbreviations, styles, etc.) and low contextualization of the user generated content. To meet out the above stated problems, latest studies on context-based information searching have been developed and built on adding semantics to the user generated content into the existing knowledge base. And also, earlier, bag-of-concepts has been used to link the potential noun phrases into existing knowledge sources. Thus, in this paper, we have effectively utilized the relationships among the concepts and equivalence prevailing in the related concepts of the selected named entities by deriving the potential meaning of entities and find the semantic similarity between the named entities with three other potential sources of references (DBpedia, Anchor Texts and Twitter Trends).
- 28 June 2019
- Published by Laboratory for Knowledge Management and E-Learning - The University of Hong Kong in Knowledge Management & E-Learning: An International Journal
- Vol. 11 (2) , 262-280
Open AccessSemantic based entity retrieval and disambiguation system for Twitter streams
Social media networks have evolved as a large repository of short documents and gives the greater challenges to effectively retrieve the content out of it. Many factors were involved in this process such as restricted length of a content, informal use of language (i.e., slangs, abbreviations, styles, etc.) and low contextualization of the user generated content. To meet out the above stated problems, latest studies on context-based information searching have been developed and built on adding semantics to the user generated content into the existing knowledge base. And also, earlier, bag-of-concepts has been used to link the potential noun phrases into existing knowledge sources. Thus, in this paper, we have effectively utilized the relationships among the concepts and equivalence prevailing in the related concepts of the selected named entities by deriving the potential meaning of entities and find the semantic similarity between the named entities with three other potential sources of references (DBpedia, Anchor Texts and Twitter Trends).