Natarajan Meghanathan

Natarajan MeghanathanDr. Natarajan Meghanathan is a tenured Associate Professor of Computer Science at Jackson State University, Jackson, MS. He graduated with a Ph.D. in Computer Science from The University of Texas at Dallas in May 2005. Dr. Meghanathan has published more than 140 peer-reviewed articles (more than half of them being journal publications). He has also received federal education and research grants from the U. S. National Science Foundation, Army Research Lab and Air Force Research Lab. Dr. Meghanathan has been serving in the editorial board of several international journals and in the Technical Program Committees and Organization Committees of several international conferences. His research interests are Wireless Ad hoc Networks and Sensor Networks, Graph Theory, Network and Software Security, Bioinformatics and Computational Biology. For more information, visit http://www.jsums.edu/cms/nmeghanathan

Publications

Diameter-Aggregation Delay Tradeoff for Data Gathering Trees in Wireless Sensor Networks
Natarajan Meghanathan. © 2020. 16 pages.
We define the aggregation delay as the minimum number of time slots it takes for the data to be aggregated in a Data Gathering tree (DG tree) spanning all the nodes of the sensor...
Eigenvector Centrality-Based Mobile Target Tracking in Wireless Sensor Networks
Natarajan Meghanathan. © 2020. 18 pages.
We propose an eigenvector centrality-based tracking algorithm to trace the trajectory of a mobile Radioactive Dispersal Device (RDD) in a wireless sensor network. The sink...
A Binary Search Algorithm to Determine the Minimum Transmission Range for Minimum Connected Dominating Set of a Threshold Size in Ad Hoc Networks
Natarajan Meghanathan. © 2020. 16 pages.
The set of nodes constituting a minimum connected dominating set (MCDS) in a wireless ad hoc network (WANET) could be considered as the minimum number of nodes that are required...
Centrality Analysis of the United States Network Graph
Natarajan Meghanathan. © 2019. 12 pages.
The authors model the contiguous states (48 states and the District of Columbia) of the United States (US) as an undirected network graph with each state represented as a node...
Clique Size and Centrality Metrics for Analysis of Real-World Network Graphs
Natarajan Meghanathan. © 2019. 16 pages.
The authors present correlation analysis between the centrality values observed for nodes (a computationally lightweight metric) and the maximal clique size (a computationally...
A Graph-Intersection-Based Algorithm to Determine Maximum Lifetime Communication Topologies for Cognitive Radio Ad Hoc Networks
Natarajan Meghanathan. © 2019. 11 pages.
The authors propose a generic graph intersection-based benchmarking algorithm to arrive at upper bounds for the lifetimes of any communication topology that spans the entire...
Strategic Innovations and Interdisciplinary Perspectives in Telecommunications and Networking
Natarajan Meghanathan. © 2019. 348 pages.
The lack of clear communication, especially internationally, plagues the modern world in a variety of fields. Researchers and practitioners within the modern networking and...
Centrality Metrics-Based Connected Dominating Sets for Real-World Network Graphs
Natarajan Meghanathan, Md Atiqur Rahman, Mahzabin Akhter. © 2019. 29 pages.
The authors investigate the use of centrality metrics as node weights to determine connected dominating sets (CDS) for a suite of 60 real-world network graphs of diverse degree...
Graph Theoretic Approaches for Analyzing Large-Scale Social Networks
Natarajan Meghanathan. © 2018. 355 pages.
Social network analysis has created novel opportunities within the field of data science. The complexity of these networks requires new techniques to optimize the extraction of...
Centrality Metrics for Complex Network Analysis: Emerging Research and Opportunities
Natarajan Meghanathan. © 2018. 183 pages.
As network science and technology continues to gain popularity, it becomes imperative to develop procedures to examine emergent network domains, as well as classical networks, to...
Centrality Analysis of the United States Network Graph
Natarajan Meghanathan. © 2018. 11 pages.
We model the contiguous states (48 states and the District of Columbia) of the United States (US) as an undirected network graph with each state represented as a node and there...
Clique Size and Centrality Metrics for Analysis of Real-World Network Graphs
Natarajan Meghanathan. © 2018. 15 pages.
We present correlation analysis between the centrality values observed for nodes (a computationally lightweight metric) and the maximal clique size (a computationally hard...
A Graph-Intersection-Based Algorithm to Determine Maximum Lifetime Communication Topologies for Cognitive Radio Ad Hoc Networks
Natarajan Meghanathan. © 2018. 10 pages.
We propose a generic graph intersection-based benchmarking algorithm to arrive at upper bounds for the lifetimes of any communication topology that spans the entire network of...
Impact of the Structure of the Data Gathering Trees on Node Lifetime and Network Lifetime in Wireless Sensor Networks
Natarajan Meghanathan. © 2017. 13 pages.
We analyze the impact of the structure of the Data Gathering (DG) trees on node lifetime (round of first node failure) and network lifetime (minimum number of rounds by which the...
Diameter-Aggregation Delay Tradeoff for Data Gathering Trees in Wireless Sensor Networks
Natarajan Meghanathan. © 2017. 17 pages.
We define the aggregation delay as the minimum number of time slots it takes for the data to be aggregated in a Data Gathering tree (DG tree) spanning all the nodes of the sensor...
Eigenvector Centrality-Based Mobile Target Tracking in Wireless Sensor Networks
Natarajan Meghanathan. © 2017. 18 pages.
We propose an eigenvector centrality-based tracking algorithm to trace the trajectory of a mobile Radioactive Dispersal Device (RDD) in a wireless sensor network. The sink...
Preface
Natarajan Meghanathan. © 2016. 5 pages.
This Preface is included in the book Advanced Methods for Complex Network Analysis.
Algorithms to Determine Stable Connected Dominating Sets for Mobile Ad Hoc Networks
Natarajan Meghanathan. © 2014. 26 pages.
This chapter presents three algorithms to determine stable connected dominating sets (CDS) for wireless mobile ad hoc networks (MANETs) whose topology changes dynamically with...
Graph Intersection-Based Benchmarking Algorithm for Maximum Stability Data Gathering Trees in Wireless Mobile Sensor Networks
Natarajan Meghanathan, Philip Mumford. © 2014. 26 pages.
The authors propose a graph intersection-based benchmarking algorithm to determine the sequence of longest-living stable data gathering trees for wireless mobile sensor networks...
Data Gathering Algorithms and Sink Mobility Models for Wireless Sensor Networks
Natarajan Meghanathan. © 2014. 29 pages.
In the first half of the chapter, the authors provide a comprehensive description of two broad categories of data gathering algorithms for wireless sensor networks: the classical...
Network Security: Attacks and Controls
Natarajan Meghanathan. © 2014. 30 pages.
The focus of this chapter is two-fold: It first presents the classical network attacks (such as Session Hijacking, Man-in-the-Middle attack, DNS attacks, Distributed Denial of...
Cognitive Radio Technology Applications for Wireless and Mobile Ad Hoc Networks
Natarajan Meghanathan, Yenumula B. Reddy. © 2013. 370 pages.
Radio interference is a problem that has plagued air communication since its inception. Advances in cognitive radio science help to mitigate these concerns. Cognitive Radio...
Introduction to Cognitive Radio Networks: Communication Protocols and Security Issues
Natarajan Meghanathan. © 2013. 30 pages.
A cognitive radio (CR) is a radio that can change its transmission parameters based on the perceived availability of the spectrum bands in its operating environment. CRs support...
A Case Study on Testing for Software Security: Static Code Analysis of a File Reader Program Developed in Java
Natarajan Meghanathan, Alexander Roy Geoghegan. © 2012. 24 pages.
The high-level contribution of this book chapter is to illustrate how to conduct static code analysis of a software program and mitigate the vulnerabilities associated with the...
Applications of Graph Theory Algorithms in Mobile Ad hoc Networks
Natarajan Meghanathan. © 2012. 28 pages.
Various simulators (e.g., ns-2 and GloMoSim) are available to implement and study the behavior of the routing protocols for Mobile Ad hoc Networks (MANETs). However, students and...
A Beaconless Minimum Interference Based Routing Protocol to Minimize End-to-End Delay per Packet for Mobile Ad hoc Networks
Natarajan Meghanathan, Meena Sugumar. © 2012. 16 pages.
The authors propose a beaconless, on-demand, mobile ad hoc network routing protocol called minimum interference based routing protocol (MIF) that minimizes the end-to-end delay...
A Data Gathering Algorithm Based on Energy-Aware Connected Dominating Sets to Minimize Energy Consumption and Maximize Node Lifetime in Wireless Sensor Networks
Natarajan Meghanathan. © 2012. 17 pages.
This paper develops an energy-aware connected dominating set based data gathering (ECDS-DG) algorithm for wireless sensor networks. The algorithm includes only nodes that have a...
Node Stability Index: A Stability Metric and an Algorithm to Determine Long-Living Connected Dominating Sets for Mobile Ad hoc Networks
Natarajan Meghanathan. © 2012. 16 pages.
In this paper, the author proposes an algorithm to determine a stable Connected Dominating Set (CDS) for Mobile Ad hoc Networks (MANETs) based on the notion of a metric called...
Topology-based Classification of Multicast Routing Protocols for Mobile Ad hoc Networks
Natarajan Meghanathan. © 2012. 28 pages.
This chapter presents an exhaustive survey on the different categories of topology-based multicast routing protocols that have been proposed for mobile ad hoc networks (MANETs)....
A Comprehensive Review and Performance Analysis of Data Gathering Algorithms for Wireless Sensor Networks
Natarajan Meghanathan. © 2012. 29 pages.
Wireless sensor networks comprise of vast numbers of sensor nodes deployed to monitor a particular event (fire, intrusion, etc.) or measure a parameter (like temperature...
A Beaconless Minimum Interference Based Routing Protocol to Minimize End-to-End Delay per Packet for Mobile Ad hoc Networks
Natarajan Meghanathan, Meena Sugumar. © 2010. 15 pages.
The authors propose a beaconless, on-demand, mobile ad hoc network routing protocol called minimum interference based routing protocol (MIF) that minimizes the end-to-end delay...