Natarajan Meghanathan
Orcid: 0000-0001-8565-4086
According to our database1,
Natarajan Meghanathan
authored at least 139 papers
between 2003 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Local clustering coefficient-based iterative peeling strategy to extract the core and peripheral layers of a network.
Appl. Netw. Sci., December, 2024
Exploratory Factory Analysis of the Centrality Metrics for Complex Real-World Networks.
CoRR, 2024
2023
Core-Intermediate-Peripheral Index: Factor Analysis of Neighborhood and Shortest Paths-based Centrality Metrics.
CoRR, 2023
Neighborhood-based Bridge Node Centrality Tuple for Preferential Vaccination of Nodes.
CoRR, 2023
2021
Appl. Netw. Sci., 2021
2020
A Binary Search Algorithm to Determine the Minimum Transmission Range for Minimum Connected Dominating Set of a Threshold Size in Ad Hoc Networks.
Int. J. Wirel. Networks Broadband Technol., 2020
Int. J. Comb. Optim. Probl. Informatics, 2020
Relative Assortativity Index: A Quantitative Metric to Assess the Impact of Link Prediction Techniques on Assortativity of Complex Networks.
Comput. J., 2020
Exploring the step function distribution of the threshold fraction of adopted neighbors versus minimum fraction of nodes as initial adopters to assess the cascade blocking intra-cluster density of complex real-world networks.
Appl. Netw. Sci., 2020
2019
Complex., 2019
Centrality and Partial Correlation Coefficient-Based Assortativity Analysis of Real-World Networks.
Comput. J., 2019
2018
δ-Space for real-world networks: A correlation analysis of decay centrality vs. degree centrality and closeness centrality.
J. King Saud Univ. Comput. Inf. Sci., 2018
Complex Network Analysis-Based Graph Theoretic Metrics to Determine Stable Data Gathering Trees for Mobile Sensor Networks.
Comput. J., 2018
Design of a Secure Framework for Session Mobility as a Service in Cloud Computing Environment.
Proceedings of the Computer and Network Security Essentials., 2018
Proceedings of the Computer and Network Security Essentials., 2018
2017
A computationally lightweight and localized centrality metric in lieu of betweenness centrality for complex network analysis.
Vietnam. J. Comput. Sci., 2017
Bipartivity Index based Link Selection Strategy to Determine Stable and Energy-Efficient Data Gathering Trees for Mobile Sensor Networks.
Informatica (Slovenia), 2017
On the use of centrality measures to determine connected dominating sets for mobile ad hoc networks.
Int. J. Ad Hoc Ubiquitous Comput., 2017
Concordance-based Kendall's Correlation for Computationally-Light vs. Computationally-Heavy Centrality Metrics: Lower Bound for Correlation.
J. Comput. Inf. Technol., 2017
A Binary Search Algorithm for Correlation Study of Decay Centrality vs. Degree Centrality and Closeness Centrality.
Comput. Inf. Sci., 2017
Comput. Inf. Sci., 2017
Link selection strategies based on network analysis to determine stable and energy-efficient data gathering trees for mobile sensor networks.
Ad Hoc Networks, 2017
Proceedings of the Cybernetics and Mathematics Applications in Intelligent Systems, 2017
2016
Maximal assortative matching for real-world network graphs, random network graphs and scale-free network graphs.
Vietnam. J. Comput. Sci., 2016
On the Sufficiency of Using Degree Sequence of the Vertices to Generate Random Networks Corresponding to Real-World Networks.
Polibits, 2016
J. King Saud Univ. Comput. Inf. Sci., 2016
Int. J. Wirel. Networks Broadband Technol., 2016
Maximal Assortative Matching and Maximal Dissortative Matching for Complex Network Graphs.
Comput. J., 2016
Comput. Inf. Sci., 2016
Correlation Analysis between Maximal Clique Size and Centrality Metrics for Random Networks and Scale-Free Networks.
Comput. Inf. Sci., 2016
On the Conduciveness of Random Network Graphs for Maximal Assortative or Maximal Dissortative Matching.
Comput. Inf. Sci., 2016
Algorithms, 2016
2015
A Generic Algorithm to Determine Maximum Bottleneck Node Weight-based Data Gathering Trees for Wireless Sensor Networks.
Netw. Protoc. Algorithms, 2015
Netw. Protoc. Algorithms, 2015
Time-Dependent Variation of the Centrality Measures of the Nodes during the Evolution of a Scale-Free Network.
J. Networks, 2015
A Stable Path Routing Protocol for Cognitive Radio Ad hoc Networks based on the Maximum Number of Common Primary User Channels.
J. Networks, 2015
Int. J. Wirel. Networks Broadband Technol., 2015
A Benchmarking Algorithm for Maximum Bottleneck Node Trust Score-based Data Gathering Trees in Wireless Sensor Networks.
Int. J. Interdiscip. Telecommun. Netw., 2015
Stability of Connected Dominating Sets in the Presence of Static Nodes in a Mobile Ad hoc Network.
Int. J. Comb. Optim. Probl. Informatics, 2015
Distribution of maximal clique size of the vertices for theoretical small-world networks and real-world networks.
CoRR, 2015
Using Spectral Radius Ratio for Node Degree to Analyze the Evolution of Scale Free Networks and Small World Networks.
CoRR, 2015
An Energy-Efficient Tracking Algorithm to Trace a Radioactive Mobile Target in a Wireless Sensor Network.
Comput. Inf. Sci., 2015
Maximum Lifetime Communication Topologies of Secondary User Nodes in Cognitive Radio Ad hoc Networks.
Comput. Inf. Sci., 2015
A Benchmarking Algorithm to Determine Minimum Aggregation Delay for Data Gathering Trees and an Analysis of the Diameter-Aggregation Delay Tradeoff.
Algorithms, 2015
Proceedings of the 12th International Conference on Information Technology, 2015
Use of Centrality Metrics to Determine Connected Dominating Sets for Real-World Network Graphs.
Proceedings of the 12th International Conference on Information Technology, 2015
Node Lifetime - Network Lifetime Tradeoff for Data Gathering Trees in Wireless Sensor Networks.
Proceedings of the IPAC '15: International Conference on Intelligent Information Processing, 2015
Proceedings of the Intelligent Systems in Cybernetics and Automation Theory, 2015
2014
Int. J. Interdiscip. Telecommun. Netw., 2014
A Pair-wise Key Distribution Mechanism and Distributed Trust Evaluation Model for Secure Data Aggregation in Mobile Sensor Networks.
Int. J. Comb. Optim. Probl. Informatics, 2014
An Energy Efficient Risk Notification Message Dissemination Protocol for Vehicular Ad hoc Networks.
CoRR, 2014
A Simulation Based Performance Comparison Study of Stability-Based Routing, Power-Aware Routing and Load-Balancing On-Demand Routing Protocols for Mobile Ad hoc Networks.
CoRR, 2014
Node Failure Time and Coverage Loss Time Analysis for Maximum Stability Vs Minimum Distance Spanning Tree based Data Gathering in Mobile Sensor Networks.
CoRR, 2014
Performance Comparison of Minimum Hop vs. Minimum Edge Based Multicast Routing under Different Mobility Models for Mobile Ad hoc Networks.
CoRR, 2014
An Algorithm to Determine Energy-aware Maximal Leaf Nodes Data Gathering Tree for Wireless Sensor Networks.
CoRR, 2014
Stability-based and energy-efficient distributed data gathering algorithms for wireless mobile sensor networks.
Ad Hoc Networks, 2014
Proceedings of the 11th International Conference on Information Technology: New Generations, 2014
Proceedings of the 10th IEEE International Conference on e-Science, 2014
2013
Centralized and Distributed Algorithms for Stability-based Data Gathering in Mobile Sensor Networks.
Netw. Protoc. Algorithms, 2013
Identification and Removal of Software Security Vulnerabilities using Source Code Analysis: A Case Study on a Java File Writer Program with Password Validation Features.
J. Softw., 2013
A Benchmarking Algorithm to Determine the Sequence of Stable Data Gathering Trees for Wireless Mobile Sensor Networks.
Informatica (Slovenia), 2013
On the Different Forms of Spanning Tree-based Broadcast Topologies for Mobile Ad hoc Networks.
Int. J. Comb. Optim. Probl. Informatics, 2013
Performance Comparison Study of Connected Dominating Set Algorithms for Mobile Ad hoc Networks under Different Mobility Models.
Int. J. Comb. Optim. Probl. Informatics, 2013
Int. J. Commun. Networks Inf. Secur., 2013
Source Code Analysis to Remove Security Vulnerabilities in Java Socket Programs: A Case Study
CoRR, 2013
Proceedings of the Tenth International Conference on Information Technology: New Generations, 2013
A Benchmarking Algorithm to Determine Maximum Stability Data Gathering Trees for Wireless Mobile Sensor Networks.
Proceedings of the Tenth International Conference on Information Technology: New Generations, 2013
2012
A Comprehensive Review and Performance Analysis of Data Gathering Algorithms for Wireless Sensor Networks.
Int. J. Interdiscip. Telecommun. Netw., 2012
Node Stability Index: A Stability Metric and an Algorithm to Determine Long-Living Connected Dominating Sets for Mobile Ad hoc Networks.
Int. J. Interdiscip. Telecommun. Netw., 2012
An Algorithm to Determine Stable Connected Dominating Sets for Mobile Ad hoc Networks using Strong Neighborhoods.
Int. J. Comb. Optim. Probl. Informatics, 2012
Link Expiration Time and Minimum Distance Spanning Trees based Distributed Data Gathering Algorithms for Wireless Mobile Sensor Networks.
Int. J. Commun. Networks Inf. Secur., 2012
Incorporation of Aspects of Systems Security and Software Security in Senior Capstone Projects.
Proceedings of the Ninth International Conference on Information Technology: New Generations, 2012
A Unicast MANET Routing Protocol to Simultaneously Minimize the Stability-Hop Count Tradeoff and End-to-End Delay.
Proceedings of the Ninth International Conference on Information Technology: New Generations, 2012
Proceedings of the Second International Conference on Computational Science, 2012
A MANET multicast routing protocol for stable trees based on the inverse of Link Expiration Times.
Proceedings of the 2012 IEEE Consumer Communications and Networking Conference (CCNC), 2012
Proceedings of the Advances in Computing and Information Technology - Proceedings of the Second International Conference on Advances in Computing and Information Technology (ACITY) July 13-15, 2012, Chennai, India, 2012
2011
A Unicast Stable Path Routing Protocol for Mobile Ad hoc Networks based on the Inverse of Link Expiration Time.
Netw. Protoc. Algorithms, 2011
Performance Comparison Study of Multicast Routing Protocols for Mobile Ad hoc Networks under Default Flooding and Density and Mobility Aware Energy-Efficient (DMEF) Broadcast Strategies.
Informatica (Slovenia), 2011
Int. J. Commun. Networks Inf. Secur., 2011
Int. J. Biomed. Imaging, 2011
Integration of an RFID Reader to a Wireless Sensor Network and using it to Identify an Individual Carrying RFID Tags
CoRR, 2011
Virtual Machines and Networks - Installation, Performance Study, Advantages and Virtualization Options
CoRR, 2011
A location prediction based routing protocol and its extensions for multicast and multi-path routing in mobile ad hoc networks.
Ad Hoc Networks, 2011
2010
Exploring the Performance Tradeoffs among Stability-Oriented Routing Protocols for Mobile Ad hoc Networks.
Netw. Protoc. Algorithms, 2010
Impact of the Gauss-Markov Mobility Model on Network Connectivity, Lifetime and Hop Count of Routes for Mobile Ad hoc Networks.
J. Networks, 2010
A Simulation Study on the Impact of Mobility Models on the Network Connectivity, Hop Count and Lifetime of Routes for Ad hoc Networks.
Informatica (Slovenia), 2010
A Beaconless Minimum Interference Based Routing Protocol to Minimize End-to-End Delay per Packet for Mobile Ad hoc Networks.
Int. J. Interdiscip. Telecommun. Netw., 2010
A Data Gathering Algorithm Based on Energy-Aware Connected Dominating Sets to Minimize Energy Consumption and Maximize Node Lifetime in Wireless Sensor Networks.
Int. J. Interdiscip. Telecommun. Netw., 2010
A Simulation-based Performance Analysis of Multicast Routing in Mobile Ad hoc Networks.
Int. J. Inf. Process. Manag., 2010
Int. J. Commun. Networks Inf. Secur., 2010
Performance Comparison of Link, Node and Zone Disjoint Multi-path Routing Strategies and Minimum Hop Single Path Routing for Mobile Ad Hoc Networks
CoRR, 2010
A Performance Comparison of Stability, Load-Balancing and Power-Aware Routing Protocols for Mobile Ad Hoc Networks
CoRR, 2010
A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad hoc Networks
CoRR, 2010
An Algorithm to Self-Extract Secondary Keywords and Their Combinations Based on Abstracts Collected using Primary Keywords from Online Digital Libraries
CoRR, 2010
Impact of Route Selection Metrics on the Performance of On-Demand Mesh-based Multicast Ad hoc Routing.
Comput. Inf. Sci., 2010
Improvement in Network Lifetime for On-Demand Routing in Mobile Ad hoc Networks using either On-Demand Recharging or Transmission Power Control or Both.
Comput. Inf. Sci., 2010
On the Time between Successive Multi-path Discoveries and Hop Count Per Multi-path for Zone-Disjoint Routing in Mobile Ad Hoc Networks.
Proceedings of the Recent Trends in Wireless and Mobile Networks, 2010
An Algorithm to Determine Minimum Velocity-Based Stable Connected Dominating Sets for Ad Hoc Networks.
Proceedings of the Contemporary Computing - Third International Conference, 2010
Design of a Reliability-based Source Routing Protocol for Wireless Mobile Ad Hoc Networks.
Proceedings of the Recent Trends in Network Security and Applications, 2010
Proceedings of the 48th Annual Southeast Regional Conference, 2010
Development of the multicast flow oriented routing protocol for mobile ad hoc networks.
Proceedings of the 48th Annual Southeast Regional Conference, 2010
2009
Use of Tree Traversal Algorithms for Chain Formation in the PEGASIS Data Gathering Protocol for Wireless Sensor Networks.
KSII Trans. Internet Inf. Syst., 2009
A Location Prediction-Based Reactive Routing Protocol to Minimize the Number of Route Discoveries and Hop Count per Path in Mobile Ad Hoc Networks.
Comput. J., 2009
A Weighted-Density Connected Dominating Set Data Gathering Algorithm for Wireless Sensor Networks.
Comput. Inf. Sci., 2009
Multicast Extensions to the Location-Prediction Based Routing Protocol for Mobile Ad Hoc Networks.
Proceedings of the Wireless Algorithms, 2009
Grid Block Energy Based Data Gathering Algorithm for Lower Energy Delay and Longer Lifetime in Wireless Sensor Networks.
Proceedings of the ISCA First International Conference on Sensor Networks and Applications (SNA-2009), 2009
An Algorithm to Determine Energy-aware Connected Dominating Set and Data Gathering Tree for Wireless Sensor Networks.
Proceedings of the 2009 International Conference on Wireless Networks, 2009
A Density and Mobility Aware Energy-Efficient Broadcast Strategy to Minimize the Number of Route Discoveries in Mobile Ad hoc Networks.
Proceedings of the 2009 International Conference on Wireless Networks, 2009
Multicast extensions to the Flow-Oriented Routing Protocol and Node Velocity-based Stable Path Routing Protocol for Mobile Ad hoc Networks.
Proceedings of the International Conference on Ultra Modern Telecommunications, 2009
Proceedings of the Contemporary Computing - Second International Conference, 2009
On the Connectivity, Lifetime and Hop Count of Routes Determined Using the City Section and Manhattan Mobility Models for Vehicular Ad Hoc Networks.
Proceedings of the Contemporary Computing - Second International Conference, 2009
Impact of simulation time and network shape on the hop count and stability of routes for mobile ad hoc networks.
Proceedings of the 47th Annual Southeast Regional Conference, 2009
2008
Exploring the Stability-Energy Consumption-Delay-Network Lifetime Tradeoff of Mobile Ad Hoc Network Routing Protocols.
J. Networks, 2008
On the stability of paths, Steiner trees and connected dominating sets in mobile ad hoc networks.
Ad Hoc Networks, 2008
Stability and Link Efficiency of On-Demand Source Tree-Based Multicast Routing Protocols for Mobile Ad Hoc Networks.
Proceedings of the International Conference on High Performance Computing, 2008
Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008
2007
Stability and Hop Count of Node-Disjoint and Link-Disjoint Multi-path Routes in Ad Hoc Networks.
Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, 2007
Fast Determination of Ancestor-Descendant Relationships using Bit Patterns.
Proceedings of the 2007 International Conference on Information & Knowledge Engineering, 2007
Impact of Broadcast Route Discovery Strategies on the Performance of Mobile Ad Hoc Network Routing Protocols.
Proceedings of the International Conference on High Performance Computing, 2007
2006
On-Demand Maximum Battery Life Routing with Power Sensitive Power Control in Ad Hoc Networks.
Proceedings of the Fifth International Conference on Networking and the International Conference on Systems (ICN / ICONS / MCL 2006), 2006
Proceedings of the Fifth International Conference on Networking and the International Conference on Systems (ICN / ICONS / MCL 2006), 2006
An Algorithm to Determine the Sequence of Stable Connected Dominating Sets in Mobile Ad Hoc Networks.
Proceedings of the Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services (AICT/ICIW 2006), 2006
Proceedings of the 44st Annual Southeast Regional Conference, 2006
2005
On the route refresh frequency for on-demand battery life routing in ad hoc networks.
Proceedings of the 2005 IEEE International Conference on Wireless And Mobile Computing, 2005
An efficient algorithm for the optimal number of route transitions in mobile ad hoc networks.
Proceedings of the 2005 IEEE International Conference on Wireless And Mobile Computing, 2005
Proceedings of the 43nd Annual Southeast Regional Conference, 2005
2004
Proceedings of the Second International Workshop on Mobility Management & Wireless Access Protocols, 2004
2003
Binary Codes for Fast Determination of Ancestor-Descendant Relationship in Trees and Directed A-cyclic Graphs.
Int. J. Comput. Their Appl., 2003