Journal Publications

[J112] N. Meghanathan, "Node Betweenness based Principal Component Model for Core-Periphery Structural Analysis of Complex Networks," accepted for publication in Springer International Journal of Data Science and Analytics, 2025. 

[J111] N. Meghanathan, "Principal Component Analysis of Link Prediction Scores to Propose a Binary Classification Model for the Betweenness of Edges in Complex Networks," Social Network Analysis and Mining, vol. 15, article no. 8, 2025. 

[J110] N. Meghanathan, "Core-Periphery Analysis using Principal Components of the Neighborhood-based Bridge Node Centrality Tuple," Computer and Information Science, vol. 18, no. 1, pp. 62-77, May 2025. 

[J109] N. Meghanathan, "A Hybrid Principal Components-based Classification for Enhanced  Prediction Accuracy," accepted for publication in International Journal of Multivariate Data Analysis, 2025.

[J108] N. Meghanathan, "Betweenness-based Ranking of Edges using the Principal Components of the Complements of Local Clustering Coefficient and Neighborhood Overlap," Computer and Information Science, vol. 18, no. 1, pp. 1-16, May 2025.

[J107] N. Meghanathan, "Local Clustering Coefficient-based Iterative Peeling Strategy to Extract the Core and Peripheral Layers of a Network," Applied Network Science, vol. 9, article # 49, pp. 1-26, August 2024.

[J106] N. Meghanathan, "Principal Components-based Quantification of Hierarchical K-Core Assortativity," Social Network Analysis and Mining, vol. 14, no. 132, pp. 1-13, July 2024.

[J105] N. Meghanathan, "Principal Components and Assortativity-based Assessment of the Similarity of Crime Metrics across Coterminous Wards in the City of Chicago," Computer and Information Science, vol. 17, no. 1, pp. 36-48, April 2024.

[J104] N. Meghanathan, "Assortativity Analysis of Complex Real-World Networks using the Principal Components of the Centrality Metrics," International Journal of Data Science, vol. 9, no, 1, pp. 79-97, 2024.

[J103] N. Meghanathan, “Quantifying the Theory vs. Programming Disparity using Spectral Bipartivity Analysis and Principal Component Analysis,” International Journal of Computer Science and Information Technology, vol. 14, no. 5, pp. 1-15, October 2022.

[J102] N. Meghanathan, “A Comprehensive Analysis of the Correlation between Maximal Clique Size and Centrality Metrics for Complex Network Graphs,” Egyptian Informatics Journal, vol. 22, no. 3, pp. 339-355, September 2021.

[J101] N. Meghanathan, A. Essien* and R. Lawrence*, “A two-hop neighbor preference-based random network graph model with high clustering coefficient for modeling real-world complex networks,” Egyptian Informatics Journal, vol. 22, no. 3, pp. 389-400, September 2021.

[J100] N. Meghanathan, “Neighborhood-based Bridge Node Centrality Tuple for Complex Network Analysis,” Springer Applied Network Science, vol. 6, no. 47, pp. 1-36, June 2021.

[J99] N. Meghanathan, “Exploring the Step Function Distribution of the Threshold Fraction of Adopted Neighbors vs. Minimum Fraction of Nodes as Initial Adopters to Assess the Cascade Blocking Intra-Cluster Density of Complex Real-World Networks,” Springer Applied Network Science, vol. 5, no. 97, pp. 1-33, December 2020.

[J98] N. Meghanathan, “A Binary Search Algorithm to Determine the Minimum Transmission Range for Minimum Connected Dominating Set of a Threshold Size in Ad hoc Networks,” International Journal of Wireless Networks and Broadband Technologies, vol. 9, no. 2, pp. 1-16, 2020.

[J97] N. Meghanathan, “Relative Assortativity Index: A Quantitative Metric to Assess the Impact of Link Prediction Techniques on Assortativity of Complex Networks,” The Computer Journal, vol. 63, no. 9, pp. 1417-1437, September 2020.

[J96] N. Meghanathan, “Edge Similarity Index for Complex Network Analysis,” International Journal of Combinatorial Optimization Problems and Informatics, vol. 11, no. 3, pp. 76-96, September-December 2020.

[J95] N. Meghanathan, “An Ensemble Approach to Analyze Mobile Sensor Networks,” International Journal of Mobile Network Design and Innovation, vol. 9, no. 3/4, pp. 142-152, 2019.

[J94] N. Meghanathan, "Centrality and Partial Correlation Coefficient-based Assortativity Analysis of Real-World Networks," The Computer Journal, vol. 62, no. 9, pp. 1247-1264, September 2019.

[J93] N. Meghanathan, "Unit Disk Graph-based Node Similarity Index for Complex Network Analysis," Hindawi Complexity, vol. 2019, Article ID: 6871874, 22 pages, March 2019.

[J92] N. Meghanathan, "δ-Space for Real-World Networks: A Correlation Analysis of Decay Centrality vs. Degree Centrality and Closeness Centrality," Elsevier Journal of King Saud University - Computer and Information Sciences, vol. 30, no. 3, pp. 391-403, July 2018.

[J91] N. Meghanathan, "Complex Network Analysis-based Graph Theoretic Metrics to Determine Stable Data Gathering Trees for Mobile Sensor Networks," The Computer Journal, vol. 61, no. 2, pp. 199-222, February 2018.

[J90] N. Meghanathan, "A Location and Mobility Independent Scheme to Quantify the Neighborhood Stability of a Node in Mobile Sensor Networks," International Journal of Mobile Network Design and Innovation, vol. 8, no. 2, pp. 111-125, January 2018. [Publication as part of the AFRL/Clarkson Aerospace Grant].

[J89] M. Akhter^, Md. Rahman^ and N. Meghanathan, ” A Spectral Analysis and Network Science Approach to Identify Influential Diseases based on Disease-Gene Associations,” International Journal of Network Science, vol. 1, no. 4, pp. 325-343, 2017.

[J88] N. Meghanathan, "Randomness Index for Complex Network Analysis," Springer Social Network Analysis and Mining, vol. 7,  no. 25, pp. 1-15, December 2017.

[J87] N. Meghanathan, "On the Use of Centrality Measures to Determine Connected Dominating Sets for Mobile Ad hoc Netwoks," International Journal of Ad Hoc and Ubiquitous Computing, vol. 26, no. 4, pp. 205-221, October 2017. [Publication as part of the NASA EPSCoR Sub Award]

[J86] N. Meghanathan, "An Analysis of the Fat-Tailedness of the Centrality Distributions of Real-World Networks," International Journal of Computer Networks and Communications, vol. 9, no. 5, pp. 1-15, September 2017.

[J85] N. Meghanathan, "Link Selection Strategies based on Network Analysis to Determine Stable and Energy-Efficient Data Gathering Trees for Mobile Sensor Networks," Elsevier Ad Hoc Networks, vol. 62, pp. 50-75, July 2017. [Publication as part of the AFRL/Clarkson Aerospace Grant]

[J84] N. Meghanathan, "Evaluation of Correlation Measures for Computationally-Light vs. Computationally-Heavy Centrality Metrics on Real-World Graphs," Journal of Computer and Information Technology, vol. 25, no. 2, pp. 103-132, June 2017.

[J83] N. Meghanathan, "A Binary Search Algorithm for Correlation Study of Decay Centrality vs. Degree Centrality and Closeness Centrality," Computer and Information Science, vol. 10, no. 2, pp. 52-75, June 2017.

[J82] N. Meghanathan, "Curriculum Network Graph: Relative Contribution of Courses," Inderscience International Journal of Network Science, vol. 1, no. 3, pp. 223-247, 2017.

[J81] N. Meghanathan, "Local Clustering Coefficient-based Assortativity Analysis of Real-World Network Graphs," Inderscience International Journal of Network Science, vol. 1, no. 3, pp. 187-208, 2017.

[J80]  N. Meghanathan, " Complex Network Analysis of the Contiguous United States Graph," Computer and Information Science, vol. 10, no. 1, pp. 54-76, February 2017.

[J79] N. Meghanathan, "A Computationally-Lightweight and Localized Centrality Metric in lieu of Betweenness Centrality for Complex Network Analysis," Springer Vietnam Journal of Computer Science, vol. 4, no. 1, pp. 23-38, February 2017.

[J78] N. Meghanathan, "An Eigenvector Centrality-based Mobile Target Tracking Algorithm for Wireless Sensor Networks,"  International Journal of Mobile Network Design and Innovation, vol. 6, no. 4, pp. 202-211, December 2016.

[J77] N. Meghanathan and X. He^, "Correlation and Regression Analysis for Node Betweenness Centrality," International Journal of Foundations in Computer Science and Technology, vol. 6, no. 6, pp. 1-20, November 2016.

[J76] N. Meghanathan, "Maximal Assortative Matching for Real-World Network Graphs, Random Network Graphs and Scale-Free Network Graphs," Springer Vietnam Journal of Computer Science, vol. 3, no. 3, pp. 151-179, August 2016.

[J75] N. Meghanathan, "Assortativity Analysis of Real-World Network Graphs based on Centrality Metrics," Computer and Information Science, vol. 9, no. 3, pp. 7-25, August 2016. Link  DOI

[J74]  N. Meghanathan, "On the Sufficiency of using the Degree Sequence of the Vertices to Generate Random Networks Corresponding to Real-World Networks," Polibits: Research Journal on Computer Science and Computer Engineering with Applications, vol. 53, pp. 5-21, July 2016.

[J73] N. Meghanathan, "Eigenvector Centrality-based Stable Path Routing for Cognitive Radio Ad hoc Networks," International Journal of Network Science, vol. 1, no. 2, pp. 117-133, June 2016.

[J72] N. Meghanathan, "Maximal Assortative Matching and Maximal Dissortative Matching for Complex Network Graphs," The Computer Journal, vol. 59, no. 5, pp. 667-684, May 2016.

[J71] N. Meghanathan, "Correlation Analysis between Maximal Clique Size and Centrality Metrics for Random Networks and Scale-Free Networks," Computer and Information Science, vol. 9, no. 2, pp. 41-57, May 2016.

[J70] N. Meghanathan, "Maximal Assortative Matching for Complex Network Graphs," Journal of King Saud University – Computer and Information Sciences, vol. 28, no. 2, pp. 230-246, April 2016.

[J69] N. Meghanathan, "On the Conduciveness of Random Network Graphs for Maximal Assortative or Maximal Dissortative Matching," Computer and Information Science, vol. 9, no. 1, pp. 21-30, February 2016. Link [Publication as part of the Massie Chair Grant]

[J68] N. Meghanathan, "Correlation Coefficient Analysis: Centrality vs. Maximal Clique Size for Complex Real-World Network Graphs," International Journal of Network Science, vol. 1, no. 1, pp. 3-27, January 2016.

[J67] N. Meghanathan, "A Greedy Algorithm for Neighborhood Overlap-based Community Detection," Algorithms, vol. 9, no. 1, p. 8: 1-26, 2016.

[J66] N. Meghanathan, "A Model for Generating Random Networks with Clustering Coefficient Corresponding to Real-World Network Graphs," International Journal of Control and Automation, vol. 9, no. 1, pp. 163-176, January 2016.

[J65] N. Meghanathan, "A Generic Algorithm to Determine Maximum Bottleneck Node Weight-based Data Gathering Trees for Wireless Sensor Networks," Network Protocols and Algorithms, vol. 7, no. 3, pp. 18-51, November 2015. [Publication as part of the NASA EPSCoR Sub Award]

[J64] N. Meghanathan, "Exploiting the Discriminating Power of the Eigenvector Centrality Measure to Detect Graph Isomorphism," International Journal in Foundations of Computer Science and Technology, vol. 5, no. 6, pp. 1-13, November 2015.

[J63] N. Meghanathan, "A Benchmarking Algorithm for Maximum Bottleneck Node Trust Score-based Data Gathering Trees in Wireless Sensor Networks," International Journal of Interdisciplinary Telecommunications and Networking (IJITN), vol. 7, no. 3, pp. 13-35, July-September 2015. [Publication as part of the NASA EPSCoR Sub Award]

[J62] N. Meghanathan, "Probabilistic Diffusion in Random Network Graphs," International Journal in Foundations of Computer Science and Technology (IJFCST), vol. 5, no. 5, pp. 1-7, September 2015.

[J61] N. Meghanathan, “Maximum Lifetime Communication Topologies of Secondary User Nodes in Cognitive Radio Ad hoc Networks,” Computer and Information Science, vol. 8, no. 3, pp. 1-12, August 2015. [Publication as part of the NASA EPSCoR Sub award]

[J60]  N. Meghanathan, "Impact of Static Nodes and Pause Time on the Stability of Connected Dominating Sets in a Mobile Ad hoc Network," International Journal of Wireless and Mobile Networks, vol. 7, no. 4, pp. 1-18, August 2015.

[J59] N. Meghanathan, "Time-Dependent Variation of the Centrality Measures of the Nodes during the Evolution of a Scale-Free Network," Journal of Networks, vol. 10, no. 7, pp. 431-442, July 2015. [Publication as part of the NASA EPSCoR Sub award]

[J58] N. Meghanathan, "Distribution of Maximal Clique Size of the Vertices for Theoretical Small-World Networks and Real-World Networks," International Journal of Computer Networks and Communications, vol. 7, no. 4, pp. 21-41, July 2015.

[J57]  N. Meghanathan, "Centrality-based Connected Dominating Sets for Mobile Ad hoc Networks," Network Protocols and Algorithms, vol. 7, no. 2, pp. 16-41, July 2015. [Publication as part of the NASA EPSCoR Sub award]

[J56] N. Meghanathan, “A Benchmarking Algorithm to Determine Minimum Aggregation Delay for Data Gathering Trees and an Analysis of the Diameter-Aggregation Delay Tradeoff,” Algorithms, vol. 8, no. 3, pp. 435-458, July 2015. [Publication as part of the NASA EPSCoR Sub award].

[J55] N. Meghanathan, T. Gardner* and J. Lewis*, “An Energy-Efficient Tracking Algorithm to Trace a Radioactive Mobile Target in a Wireless Sensor Network,” Computer and Information Science, vol. 8, no. 2, pp. 15-23, May 2015. [Publication as part of the Massie Chair Grant]

[J54] N. Meghanathan, “Using Spectral Radius Ratio for Node Degree to Analyze the Evolution of Complex Networks,” International Journal of Computer Networks and Communications, vol. 7, no. 3, pp. 1-12, May 2015.

[J53]  N. Meghanathan, “Distribution of Maximal Clique Size under the Watts-Strogatz Model of Evolution of Complex Networks,” International Journal in Foundations of Computer Science and Technology, vol. 5, no. 3, pp. 1-12, May 2015.

[J52] N. Meghanathan, “Correlations between Centrality Measures for Mobile Ad hoc Networks,” IGI International Journal of Wireless Networks and Broadband Technologies, vol. 4, no. 2, pp. 15-28, April-June 2015.

[J51] N. Meghanathan, “A Stable Path Routing Protocol for Cognitive Radio Ad hoc Networks based on the Maximum Number of Common Primary User Channels,” Journal of Networks, vol. 10, no. 2, pp. 117-124, March 2015. [Publication as part of the Massie Chair Grant]

[J50] N. Meghanathan, "Stability-based and Energy-Efficient Distributed Data Gathering Algorithms for Mobile Sensor Networks," Elsevier Ad hoc Networks, vol. 19, pp. 111-131, August 2014.

[J49] N. Meghanathan, “A Pair-wise Key Distribution Mechanism and Distributed Trust Evaluation Model for Secure Data Aggregation in Mobile Sensor Networks,” International Journal of Combinatorial Optimization Problems and Informatics, vol. 5, no. 2, pp. 29-46, May-August 2014.

[J48] N. Meghanathan, “Centrality-based Connected Dominating Sets for Complex Network Graphs,” IGI International Journal of Interdisciplinary Telecommunications and Networking, vol. 6, no. 2, pp. 1-19, April-June 2014.  

[J47] N. Meghanathan and P. Mumford+, "Centralized and Distributed Algorithms for Stability-based Data Gathering in Mobile Sensor Networks," Macrothink: Network Protocols and Algorithms (NPA), vol. 5, no. 3, pp. 84-116, December 2013.

[J46] N. Meghanathan and P. Mumford+, "A Benchmarking Algorithm to Determine the Sequence of Stable Data Gathering Trees for Wireless Mobile Sensor Networks," Informatica - An International Journal of Computing and Informatics, vol. 37, no. 3, pp. 315-338, October 2013.

[J45] N. Meghanathan and P. Mumford+, "Node Failure Time and Coverage Loss Time Analysis for Maximum Stability Vs Minimum Distance Spanning Tree based Data Gathering in Mobile Sensor Networks," International Journal of Computer Networks and Communications(IJCNC), vol. 5, no. 4, pp. 15-30, July 2013.

[J44] N. Meghanathan and I. Dasari^, "Performance Comparison Study of Connected Dominating Set Algorithms for Mobile Ad hoc Networks under Different Mobility Models," International Journal of Combinatorial Optimization Problems and Informatics, vol. 4, no. 2, pp. 12-30, May-August 2013.

[J43] N. Meghanathan, "A Comprehensive Review and Analysis of Solutions for Different Layers of the TCP/IP Layer Stack and Security Issues for Cognitive Radio Networks," International Journal of Advancements in Technology, (IJOAT), vol. 4, no. 1, pp. 1-27, April 2013.

[J42] N. Meghanathan, "A Survey on the Communication Protocols and Security in Cognitive Radio Networks," International Journal of Communication Networks and Information Security, (IJCNIS), vol. 5, no. 1, pp. 19-37, April 2013.

[J41] N. Meghanathan and J. A. Thompson*, “On the Different Forms of Spanning Tree-based Broadcast Topologies for Mobile Ad hoc Networks,” International Journal of Combinatorial Optimization Problems and Informatics (IJCOPI), vol. 4, no. 1, pp. 3-11, January-April 2013. [Publication as part of the NSF REU Grant]

[J40]  N. Meghanathan, “Link Expiration Time and Minimum Distance Spanning Trees based Distributed Data Gathering Algorithms for Wireless Mobile Sensor Networks,” International Journal of Communication Networks and Information Security (IJCNIS), vol. 4, no. 3, pp. 196-206, December 2012

[J39] N. Meghanathan and M. Terrell*, “A Simulation Study on the Strong Neighborhood-based Stable Connected Dominating Sets for Mobile Ad hoc Networks,” International Journal of Computer Networks & Communications (IJCNC), vol. 4, no. 4, July 2012. [Publication as part of the NSF REU Grant]

[J38]  N. Meghanathan, "Routing Protocols to Determine Stable Paths and Trees using the Inverse of Predicted Link Expiration times for Mobile Ad hoc Networks," International Journal of Mobile Network Design and Innovation, (IJMNDI), Inderscience Publishers, vol. 4, no. 4, pp. 214-234, June 2012.

[J37] N. Meghanathan, “Graph Theory Algorithms for Mobile Ad hoc Networks,” Informatica - An International Journal of Computing and Informatics, vol. 36, no. 2, pp. 185-200, June 2012.

[J36]  N. Meghanathan and M. Terrell*, “An Algorithm to Determine Stable Connected Dominating Sets for Mobile Ad hoc Networks using Strong Neighborhoods,” International Journal of Combinatorial Optimization Problems and Informatics (IJCOPI), vol. 3, no. 2, pp. 79-92, May-August 2012.

[J35]  N. Meghanathan, “A Comprehensive Review and Performance Analysis of Data Gathering Algorithms for Wireless Sensor Networks,” International Journal of Interdisciplinary Telecommunications and Networking (IJITN), vol. 4, no. 2, pp. 1-29, April-June 2012.

[J34] N. Meghanathan, “A Simulation-based Performance Comparison of the Minimum Node Size and Stability-based Connected Dominating Sets for Mobile Ad hoc Networks,” International Journal of Computers and Network Communications (IJCNC), vol. 4, no. 2, pp. 169-184, March 2012.

[J33] N. Meghanathan and P. D. Mumford+, “Maximum Stability Data Gathering Trees for Mobile Sensor Networks,” International Journal of Mobile Network Design and Innovation, Inderscience Publishers, vol. 4, no. 3, pp. 164-178, 2012. [Publication as part of the AFOSR/AFRL/SFFP 2012 Research]

[J32]  N. Meghanathan, “Node Stability Index: A Stability Metric and an Algorithm to Determine Long-Living Connected Dominating Sets for Mobile Ad hoc Networks,” International Journal of Interdisciplinary Telecommunications and Networking (IJITN), vol. 4, no. 1, pp. 31-46, January-March 2012.

[J31]  N. Meghanathan, “A Unicast Stable Path Routing Protocol for Mobile Ad hoc Networks based on the Inverse of Link Expiration Time,” International Journal of Network Protocols and Algorithms (NPA), vol. 3, no. 3, pp. 17-37, December 2011.

[J30]  N. Meghanathan, “A Location Prediction Based Routing Protocol and its Extensions for Multicast and Multi-path Routing in Mobile Ad hoc Networks,” Elsevier Ad hoc Networks, vol. 9, no. 7, pp. 1104-1126, September 2011. [Publication as part of the ARL Grant]

[J29] N. Meghanathan, “Survey of Topology-based Multicast Routing Protocols for Mobile Ad hoc Networks,” International Journal of Communication Networks and Information Security (IJCNIS), vol. 3, no. 2, pp. 124-137, August 2011.

[J28]  N. Meghanathan, “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 - An International Journal of Computing and Informatics, vol. 35, no. 2, pp. 165-184, June 2011. [Publication as part of the ARL Grant]

[J27] N. Meghanathan, “Performance Comparison of Minimum Hop and Minimum Edge Based Multicast Routing Under Different Mobility Models for Mobile Ad Hoc Networks,” International Journal of Wireless and Mobile Networks, vol. 3, no. 3, pp. 1-14, June 2011.

[J26] N. Kostyuk+, P. Cole*, N. Meghanathan, R. Isokpehi+, and H. Cohly+, "Gas Discharge Visualization: An Imaging and Modeling Tool for Medical Biometrics," International Journal of Biomedical Imaging, vol. 2011, Article ID 196460, 7 pages, May 2011. [Publication as part of the NSF MS EPSCoR Grant]

[J25] N. Meghanathan, “Impact of the Optimum Routing and Least Overhead Routing Approaches on Minimum Hop Routes and Connected Dominating Sets in Mobile Ad hoc Networks,” International Journal of Wireless and Mobile Networks, vol. 3, no. 2, pp. 196-212, April 2011.

[J24]  N. Meghanathan, “Grid Block Energy based Data Gathering Algorithms for Wireless Sensor Networks,” International Journal of Communication Networks and Information Security, vol. 2, no. 3, pp. 151-161, December 2010.

[J23] N. Meghanathan, “Performance Comparison of Link, Node and Zone Disjoint Multi-path Routing Strategies and Minimum Hop Single Path Routing for Mobile Ad Hoc Networks,” International Journal of Wireless and Mobile Networks, vol. 2, no. 4, pp. 13-29, November 2010.

[J22]  N. Meghanathan, “Exploring the Performance Tradeoffs among Stability-Oriented Routing Protocols for Mobile Ad hoc Networks,” Network Protocols and Algorithms - Special Issue on Data Dissemination for Large scale Complex Critical Infrastructures, vol. 2, no. 3, pp. 18-36, November 2010.

[J21] N. Meghanathan, “Benchmarks and Tradeoffs for Minimum Hop, Minimum Edge and Maximum Lifetime per Multicast Tree in Mobile Ad hoc Networks,” International Journal of Advancements in Technology, vol. 1, no. 2, pp. 234-251, October 2010.

[J20]  N. Meghanathan, “A Data Gathering Algorithm based on Energy-aware Connected Dominating Sets to Minimize Energy Consumption and Maximize Node Lifetime in Wireless Sensor Networks,” International Journal of Interdisciplinary Telecommunications and Networking, vol. 2, no. 3, pp. 1-17, July-September 2010.

[J19]  N. Meghanathan and L. C. Milton^, “A Performance Comparison of stability, Load-Balancing and Power-Aware Routing Protocols for Mobile Ad hoc Networks,” International Journal of Advancements in Technology, vol. 1, no. 1, pp. 50-72, June 2010.

[J18]  N. Meghanathan, R. Isokpehi+ and H. Cohly+, “Experimental Design and Predictive Computational Modeling for the Toxicity of Nanomaterials on the Human Epidermal Cells,” International Journal of Biometrics and Bioinformatics, vol. 4, no. 2, pp. 34-41, May 2010. [Publication as part of the NSF MS EPSCoR Grant]

[J17]  N. Meghanathan, “A Simulation Study on the Impact of Mobility Models on the Network Connectivity, Hop Count and Lifetime of Routes for Ad hoc Networks,” Informatica – An International Journal of Computing and Informatics, vol. 34, no. 2, pp. 207-221, May 2010.

[J16] N. Meghanathan and S. R. Vavilala^, "Impact of Route Selection Metrics on the Performance of On-Demand Mesh-based Multicast Ad hoc Routing Protocols," Journal of Computer and Information Science, vol. 3, no. 2, pp. 3-18, May 2010.

[J15]  N. Meghanathan, “Impact of the Gauss-Markov Mobility Model on Network Connectivity, Lifetime and Hop Count of Routes for Mobile Ad hoc Networks,” Journal of Networks, vol. 5, no. 5, pp. 509-516, May 2010.

[J14] N. Meghanathan and M. Sugumar^, “A Beaconless Minimum Interference Based Routing Protocol to Minimize End-to-End Delay per Packet for Mobile Adhoc Networks,” International Journal of Interdisciplinary Telecommunications and Networking (IJITN), vol. 2, no. 1, pp. 12-26, March 2010.

[J13] N. Meghanathan and G. W. Skelton+, “Risk Notification Message Dissemination Protocol for Energy Efficient Broadcast in Vehicular Ad hoc Networks,” IAENG International Journal of Computer Science, vol. 37, no. 1, pp. 1 - 10, March 2010.

[J12] N. Meghanathan and L. P. Judon^, “Improvement in Network Lifetime for On-Demand Routing in Mobile Ad hoc Networks using either On-Demand Recharging or Transmission Power Control or Both,” Journal of Computer and Information Science, Canadian Center for Science and Education, vol. 3, no. 1, pp. 3-11, February 2010.

[J11] N. Meghanathan and L. Nayak^, “Steganalysis Algorithms for Detecting the Hidden Information in Image, Audio and Video Cover Media,” International Journal of Network Security and its Applications, vol. 2, no. 1, pp. 43-55, January 2010.

[J10]  N. Cooper* and N. Meghanathan, “Impact of Mobility Models on Multi-path Routing in Mobile Ad hoc Networks,” International Journal of Computer Networks and Communications, vol. 2, no. 1, pp. 185-194, January 2010. [Publication as part of the NSF REU Grant]

[J9] N. Meghanathan, “Use of Tree Traversal Algorithms for Chain Formation in the PEGASIS Data Gathering Protocol for Wireless Sensor Networks,” KSII Transactions on Internet and Information Systems, vol. 3, no. 6, pp. 612-627, December 2009.

[J8]  N. Meghanathan, “Survey and Taxonomy of Unicast Routing Protocols for Mobile Ad hoc Networks,” AIRCCSE International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks, vol. 1, no. 1, pp. 1-21, December 2009.

[J7]  L. King* and N. Meghanathan, “A Weighted-Density Connected Dominating Set Data Gathering Algorithm for Wireless Sensor Networks,” CCSE Journal of Computer and Information Science, vol. 2, no. 4, pp. 3-13, November 2009. [Publication as part of the NSF REU Grant]

[J6]   N. Meghanathan, “A Location Prediction Based Reactive Routing Protocol to Minimize the Number of Route Discoveries and Hop Count per Path in Mobile Ad hoc Networks,” The Computer Journal, vol. 52, no. 4, pp. 461-482, Oxford Press, British Computer Society, July 2009.

[J5]  N. Meghanathan, S. R. Allam^ and L. A. Moore+, “Tools and Techniques for Network Forensics,” International Journal of Network Security and its Applications, vol. 1, no. 1, pp. 14-25, April 2009.

[J4]    N. Meghanathan and A. Farago+, “On the Stability of Paths, Steiner Trees and Connected   Dominating Sets in Mobile Ad Hoc Networks,” Elsevier Ad Hoc Networks, vol. 6, no. 5, pp. 744-769, July 2008.

[J3]   N. Meghanathan, “Exploring the Stability-Energy Consumption-Delay-Network Lifetime Tradeoff of Mobile Ad Hoc Network Routing Protocols,” Academy Publisher Journal of Networks, vol. 3, no. 2, pp. 17-28, February 2008

[J2]  S. Baskiyar+ and N. Meghanathan, “A Survey of Contemporary Real-time Operating Systems,” Informatica, vol. 29, no. 2, pp. 233-240, June 2005.

[J1]   S. Baskiyar+ and N. Meghanathan, “Binary Codes for Fast Determination of Ancestor-Descendant Relationship in Trees and Directed A-cyclic Graphs,” International Journal of Computers and Applications, vol. 10, no. 1, pp. 67-71, March 2003.

   *undergraduate student co-authors, ^graduate student co-authors, +faculty/other collaborators as co-authors