{"id":38,"date":"2015-04-30T20:54:34","date_gmt":"2015-05-01T01:54:34","guid":{"rendered":"https:\/\/www.jsums.edu\/nmeghanathan\/?page_id=38"},"modified":"2023-06-09T16:09:15","modified_gmt":"2023-06-09T21:09:15","slug":"research","status":"publish","type":"page","link":"https:\/\/www.jsums.edu\/nmeghanathan\/research\/","title":{"rendered":"Research"},"content":{"rendered":"

Areas of Research Interests<\/u><\/p>\n

Wireless Ad hoc Networks<\/span>I<\/sup>, \u00a0 Sensor Networks<\/span>II<\/sup>, \u00a0 Network Science and Graph Theory<\/span>III<\/sup>, \u00a0\u00a0 Other Areas (incl. Bioinformatics, Cyber Security)<\/span>IV<\/sup><\/p>\n

Peer-reviewed Journal Papers<\/a>
\nPeer-reviewed Conference Papers<\/a>
\nBooks\/Videos<\/a>
\nBook Chapters<\/a><\/span>
\nAbstracts and Poster Presentations<\/a>
\nPublication Profile<\/a><\/span><\/p>\n

<\/a>Peer-reviewed Journals<\/u><\/h3>\n

[107]III<\/sup> N. Meghanathan<\/strong>, \u201cA Comprehensive Analysis of the Correlation between Maximal Clique Size and Centrality Metrics for Complex Network Graphs,\u201d Egyptian Informatics Journal<\/em>, vol. 22, no. 3, pp. 339-355, September 2021.<\/p>\n

[106]III<\/sup> N. Meghanathan<\/strong>, A. Essien and R. Lawrence, \u201cA two-hop neighbor preference-based random network graph model with high clustering coefficient for modeling real-world complex networks,\u201d Egyptian Informatics Journal<\/em>, vol. 22, no. 3, pp. 389-400, September 2021.<\/p>\n

[105]III<\/sup> N. Meghanathan<\/strong>, “Neighborhood-based Bridge Node Centrality Tuple for Complex Network Analysis,” Springer Applied Network Science<\/em>, vol. 6, no. 47, pp. 1-36, June 2021.<\/p>\n

[104]III<\/sup> N. Meghanathan<\/strong>, “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<\/em>, vol. 5, no. 97, pp. 1-33, December 2020. Published as part of Special issue on Epidemics Dynamics & Control on Networks\u00a0<\/em><\/p>\n

[103]I<\/sup> N. Meghanathan<\/strong>, “Binary Search Algorithm to Predict the Time of Next Link Change for Wireless Mobile Networks,” Inderscience International Journal of Mobile Network Design and Innovation<\/em>, vol. 10, no. 1, pp. 17-28, 2020.<\/p>\n

[102]I<\/sup> N. Meghanathan<\/strong>, “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<\/em>, vol. 9, no. 2, pp. 1-16, 2020.<\/p>\n

[101]III<\/sup> N. Meghanathan<\/b>, “Edge Similarity Index for Complex Network Analysis,” International Journal of Combinatorial Optimization Problems and Informatics<\/em>, vol. 11, no. 3, pp. 76-96, September-December 2020. Link<\/a><\/p>\n

[100]III<\/sup> N. Meghanathan<\/strong>, \u201cRelative Assortativity Index: A Quantitative Metric to Assess the Impact of Link Prediction Techniques on Assortativity of Complex Networks,\u201d The Computer Journal<\/em>, vol. 63, no. 9, pp. 1417-1437, September 2020. DOI: 10.1093\/comjnl\/bxz089.\u00a0 <\/span><\/p>\n

[99]II<\/sup> N. Meghanathan<\/strong>, “An Ensemble Approach to Analyze Mobile Sensor Networks,” Inderscience International Journal of Mobile Network Design and Innovation<\/em>, vol. 9, no. 3\/4, pp. 142-152, 2019.<\/p>\n

[98]III<\/sup> N. Meghanathan<\/b>, “Centrality and Partial Correlation Coefficient-based Assortativity Analysis of Real-World Networks,” The Computer Journal<\/em>, vol. 62, no. 9, pp. 1247-1264, September 2019. Link<\/a><\/p>\n

[97]III<\/sup> N. Meghanathan<\/b>, ” Unit Disk Graph-based Node Similarity Index for Complex Network Analysis,” Hindawi Complexity<\/em>, vol. 2019, Article ID: 6871874, 22 pages, March 2019. Link<\/a><\/p>\n

[96]III<\/sup> N. Meghanathan<\/b>, “\u03b4-Space for Real-World Networks: A Correlation Analysis of Decay Centrality vs. Degree Centrality and Closeness Centrality,” Elsevier <\/em> Journal of King Saud University – Computer and Information Sciences<\/em>, vol. 30, no. 3, pp. 391-403, July 2018. <\/span>Available Online<\/a><\/p>\n

[95]II<\/sup> N. Meghanathan<\/b>, “Complex Network Analysis-based Graph Theoretic Metrics to Determine Stable Data Gathering Trees for Mobile Sensor Networks,” The Computer Journal<\/em>, vol. 61, no. 2, pp. 199-222, February 2018.<\/span><\/p>\n

[94]II<\/sup>\u00a0N. Meghanathan<\/b>, “A Location and Mobility Independent Scheme to Quantify the Neighborhood Stability of a Node in Mobile Sensor Networks,” Int. J. of Mobile Network Design and Innovation<\/em> (IJMNDI<\/span><\/em>), vol. 8, no. 2, pp. 111-125, January 2018. <\/span>[Publication as part of the AFRL\/Clarkson Aerospace Grant]<\/b>.<\/span><\/p>\n

[93]III<\/sup> M. Akhter, Md. Rahman and N. Meghanathan<\/b>, ” A Spectral Analysis and Network Science Approach to Identify Influential Diseases based on Disease-Gene Associations,” International Journal of Network Science<\/em>, vol. 1, no. 4, pp. 325-343, 2017.<\/p>\n

[92]III<\/sup> N. Meghanathan <\/b>and F. Yang, “Correlation Analysis: Edge Betweenness Centrality vs. Neighborhood Overlap,” Inderscience International Journal of Network Science<\/em>, vol. 1, no. 4, pp. 299-324, 2017.<\/p>\n

[91]III<\/sup> N. Meghanathan<\/b>, “Randomness Index for Complex Network Analysis,” Springer Social Network Analysis and Mining<\/em>, vol. 7,\u00a0 no. 25, pp. 1-15, December 2017, DOI: 10.1007\/s13278-017-0444-3. Link<\/a><\/span>.<\/a><\/p>\n

[90]<\/span>I<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “On the Use of\u00a0<\/span>Centrality Measures to Determine Connected Dominating Sets for Mobile Ad hoc Netwoks<\/span>,” International Journal of Ad Hoc and Ubiquitous Computing (<\/em>IJAHUC), vol. 26, no. 4, pp. 205-221, October 2017.<\/span>[Publication as part of the NASA EPSCoR Sub Award]\u00a0<\/b>Link<\/a><\/span><\/p>\n

[89]II<\/sup>\u00a0N. Meghanathan<\/b>, “Bipartivity Index based Link Selection Strategy to Determine Stable and Energy-Efficient Data Gathering Trees for Mobile Sensor Networks,” Informatica<\/em>, vol. 41, no. 3, pp. 259-274, September 2017 <\/span>[Publication as part of the AFRL\/Clarkson Aerospace Grant]<\/b>.<\/span><\/p>\n

[88]III<\/sup> N. Meghanathan<\/b>, “An Analysis of the Fat-Tailedness of the Centrality Distributions of Real-World Networks,” International Journal of Computer Networks and Communications<\/em>, vol. 9, no. 5, pp. 1-15, September 2017.<\/span>DOI: 10.5121\/ijcnc.2017.9501. Link.<\/a><\/p>\n

[87]III<\/sup> N. Meghanathan<\/b>, “Evaluation of Correlation Measures for Computationally-Light vs. Computationally-Heavy Centrality Metrics on Real-World Graphs,” Journal of Computer and Information Technology<\/em>, vol. 25, no. 2, pp. 103-132, June 2017. <\/span><\/p>\n

[86]II<\/sup> N. Meghanathan<\/b>, “Link Selection Strategies based on Network Analysis to Determine Stable and Energy-Efficient Data Gathering Trees for Mobile Sensor Networks,” Elsevier\u00a0<\/em>Ad Hoc Networks<\/em>, vol. 62, pp. 50-75, July 2017. <\/span>Abstract Link<\/a><\/span>.<\/p>\n

[85]III<\/sup> N. Meghanathan<\/b>, “A Binary Search Algorithm for Correlation Study of Decay Centrality vs. Degree Centrality and Closeness Centrality,” Computer and Information Science<\/em>, vol. 10, no. 2, pp. 52-75, June 2017. <\/span>Available Online<\/a><\/span>.<\/span><\/p>\n

[84]III<\/sup>\u00a0N. Meghanathan<\/b>, “Curriculum Network Graph: Relative Contribution of Courses,” Inderscience <\/em>International Journal of Network Science<\/em>, vol. 1, no. 3, pp. 223-247, 2017.<\/span><\/span><\/p>\n

[83]III<\/sup>\u00a0N. Meghanathan<\/b>, “Local Clustering Coefficient-based Assortativity Analysis of Real-World Network Graphs,” Inderscience International Journal of Network Science<\/em>, vol. 1, no. 3, pp. 187-208, 2017.<\/span><\/p>\n

[82]III<\/sup>\u00a0N. Meghanathan<\/b>, ” Complex Network Analysis of the Contiguous United States Graph,” Computer and Information Science<\/em>, vol. 10, no. 1, pp. 54-76, February 2017. DOI: <\/span> 10.5539\/cis.v10n1p54, Link<\/a>.<\/p>\n

[81]III<\/sup>\u00a0N. Meghanathan<\/b>, “A Computationally-Lightweight and Localized Centrality Metric in lieu of Betweenness Centrality for Complex Network Analysis,” Springer Vietnam Journal of Computer Science<\/i>, vol. 4, no. 1, pp. 23-38, February 2017.\u00a0DOI: 10.1007\/s40595-016-0073-1.\u00a0Link<\/a><\/p>\n

[80]<\/span>II<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “<\/span>An Eigenvector Centrality-based Mobile Target Tracking Algorithm for Wireless Sensor Networks,”\u00a0 <\/span>International Journal of Mobile Network Design and Innovation<\/em>, vol. 6, no. 4, pp. 202-211, December 2016.<\/span><\/span><\/p>\n

[79]III<\/sup>\u00a0N. Meghanathan <\/b>and X. He, “Correlation and Regression Analysis for Node Betweenness Centrality,” International Journal of Foundations in Computer Science and Technology<\/em>, vol. 6, no. 6, pp. 1-20, November 2016.<\/span><\/p>\n

[78]III<\/sup>\u00a0N. Meghanathan<\/b>, 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,” Elsevier Egyptian Informatics J<\/em>ournal<\/em>, In Press, Available Online, September 2016. <\/span>Link<\/a>\u00a0 <\/span><\/p>\n

[77]<\/span>III<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “<\/span>Maximal Assortative Matching for Real-World Network Graphs, Random Network Graphs and Scale-Free Network Graphs,”\u00a0Springer Vietnam Journal of Computer Science<\/i>, vol. 3, no. 3, pp. 151-179, August 2016.\u00a0DOI:\u00a0<\/span><\/span>10.1007\/s40595-016-0066-0<\/a><\/span>.<\/span><\/p>\n

[76]<\/span>III<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “<\/span>Assortativity Analysis of Real-World Network Graphs based on Centrality Metrics,” Computer and Information Science<\/i><\/span>, vol. 9, no. 3, pp. 7-25, August 2016<\/span>.\u00a0<\/span>Link<\/a>\u00a0\u00a0DOI<\/a><\/span><\/p>\n

[75]<\/span>III<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “On the Sufficiency of using the Degree Sequence of the Vertices to Generate Random Networks Corresponding to Real-World Networks<\/span>,” Polibits: Research Journal on Computer Science and Computer Engineering with Applications<\/em><\/span>, vol. 53, pp. 5-21, July 2016.\u00a0<\/span>Link<\/a>\u00a0\u00a0<\/span>DOI<\/a><\/p>\n

[74]<\/span>II<\/sup> N. Meghanathan<\/b>, “Neighborhood Overlap-based Stable Data Gathering Trees for Mobile Sensor Networks,” <\/span>International Journal of Wireless Networks and Broadband Technologies<\/i>, vol. 5, no. 1, pp. 1-23, January-June 2016.\u00a0<\/span>Link<\/a><\/span><\/span><\/p>\n

[73]<\/span>II<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “Eigenvector Centrality-based Stable Path Routing for Cognitive Radio <\/span> Ad hoc Networks,”\u00a0International Journal of Network Science<\/i>, vol. 1, no. 2, pp. 117-133, June\u00a02016.\u00a0<\/span>Link<\/a><\/span><\/span><\/p>\n

[72]<\/span>III<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “<\/span>Maximal Assortative Matching and Maximal Dissortative Matching for Complex Network Graphs<\/span>,” The Computer Journal<\/i>, vol. 59, no. 5, pp. 667-684, May\u00a02016. DOI:\u00a0<\/span>10.1093\/comjnl\/bxv102.\u00a0<\/span>Link<\/a><\/p>\n

[71<\/span>]<\/span>III<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “<\/span>Correlation Analysis between Maximal Clique Size and Centrality Metrics for Random Networks and Scale-Free Networks,” Computer and Information Science<\/i>, vol. 9, no. 2, pp. 41-57, May\u00a02016. DOI:\u00a0<\/span>http:\/\/dx.doi.org\/10.5539\/cis.v9n2p1<\/span><\/p>\n

[70]<\/span>III<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “Maximal Assortative Matching for Complex Network Graphs,”\u00a0Elsevier Journal of King Saud University – Computer and Information Sciences<\/em>, vol. 28, no. 2, pp. 230-246, April 2016. DOI:\u00a0<\/span><\/span>10.1016\/j.jksuci.2015.10.004<\/a>.<\/span><\/p>\n

[69]<\/span>III<\/sup><\/span>\u00a0<\/span>N. Meghanathan<\/b>, “<\/span>On the Conduciveness of Random Network Graphs for Maximal Assortative or Maximal Dissortative Matching,” Computer and Information Science<\/em><\/span>, vol. 9, no. 1, pp. 21-30, February 2016.\u00a0<\/span>Link<\/a>\u00a0<\/span>[Publication as part of the Massie Chair Grant]<\/b><\/p>\n

[68]<\/span>III<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “Correlation Coefficient Analysis: Centrality vs. Maximal Clique Size for Complex Real-World Network Graphs,”\u00a0<\/span>International Journal of Network Science<\/i>, vol. 1, no. 1, pp. 3-27, January 2016.\u00a0<\/span>Link<\/a><\/span><\/p>\n

[67]<\/span>III<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “<\/span><\/span>A Greedy Algorithm for Neighborhood Overlap-based Community Detection,” Algorithms<\/em>, vol. 9, no. 1, p. 8: 1-26,\u00a02016. DOI:\u00a0<\/span><\/span>10.3390\/a9010008.\u00a0<\/span>Link<\/a><\/p>\n

[66]<\/span>III<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “<\/span><\/span>A Model for Generating Random Networks with Clustering Coefficient Corresponding to Real-World Network Graphs,” <\/span>International Journal of Control and Automation<\/i>, vol. 9, no. 1, pp. 163-176, January 2016. DOI:\u00a0<\/span><\/span>http:\/\/dx.doi.org\/10.14257\/ijca.2016.9.1.15,\u00a0Link<\/a><\/span><\/p>\n

[65]<\/span>III<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “<\/span>A Comprehensive Analysis of the Correlation between Maximal Clique Size and Centrality Metrics for Complex Network Graphs,” accepted for publication in Elsevier Egyptian Informatics Journal<\/em>,\u00a02016. <\/span>Link<\/a><\/span><\/p>\n

[64]<\/span>II<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “<\/span>A Generic Algorithm to Determine\u00a0Maximum Bottleneck Node Weight-based Data Gathering Trees for Wireless\u00a0Sensor Networks<\/span>,” Network Protocols and Algorithms\u00a0<\/em>(NPA), vol. 7, no. 3, pp. 18-51, November\u00a02015. <\/span>Link<\/a>. <\/span>DOI: http:\/\/dx.doi.org\/10.5296\/npa.v7i3.7961.\u00a0<\/span>[Publication as part of the NASA EPSCoR Sub Award]<\/b><\/p>\n

[63]<\/span>III<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “<\/span>Exploiting the Discriminating Power of the Eigenvector Centrality Measure to Detect Graph Isomorphism<\/span>,” <\/span>International Journal in Foundations of Computer Science and Technology<\/em>\u00a0(IJFCST), vol. 5, no. 6, pp. 1-13, November 2015.\u00a0<\/span>Link<\/a><\/span><\/p>\n

[62]<\/span>II<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “<\/span>A Benchmarking Algorithm for Maximum Bottleneck Node Trust Score-based Data Gathering Trees in Wireless Sensor Networks<\/span>,”\u00a0International Journal of Interdisciplinary Telecommunications and Networking\u00a0<\/em>(IJITN), vol. 7, no. 3, pp. 13-35, July-September\u00a02015.\u00a0<\/span>Link<\/a><\/span>\u00a0[Publication as part of the NASA EPSCoR Sub Award]<\/b><\/span><\/p>\n

[61]<\/span>III\u00a0<\/sup>N. Meghanathan<\/b>, “Probabilistic Diffusion in Random Network Graphs,<\/span>”\u00a0International Journal in Foundations of Computer Science and Technology<\/em>\u00a0(IJFCST), vol. 5, no. 5, pp. 1-7, September\u00a02015.\u00a0<\/span><\/span>[Publication as part of the NASA EPSCoR Sub Award]\u00a0<\/b>PDF<\/a><\/p>\n

[60]<\/span>I<\/sup> N. Meghanathan<\/b>, “Maximum Lifetime Communication Topologies of Secondary User Nodes in Cognitive Radio Ad hoc Networks,” <\/span>Computer and Information Science<\/i>, vol. 8, no. 3, pp. 1-12, August 2015. <\/span>[Publication as part of the NASA EPSCoR Sub Award]<\/b> Link<\/a><\/span><\/p>\n

[59]<\/span>I<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “Impact of Static Nodes and Pause Time on the Stability of Connected Dominating Sets in a Mobile Ad hoc Network,”\u00a0<\/span>International Journal of Wireless and Mobile Networks<\/i><\/span>, vol. 7, no. 4, pp. 1-18, August 2015<\/span>.\u00a0<\/span>Link<\/a><\/p>\n

[58]<\/span>III<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “<\/span>Time-Dependent Variation of the Centrality Measures of the Nodes during the Evolution of a Scale-Free Network,”\u00a0<\/span>Journal of Networks<\/i><\/span>, vol. 10, no. 7, pp. 431-442, July 2015<\/span>.<\/span>\u00a0<\/span><\/span>Link<\/a>\u00a0<\/span>[Publication as part of the NASA EPSCoR Sub Award]<\/b><\/span><\/p>\n

[57]<\/span>II<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “A Benchmarking Algorithm to Determine Minimum Aggregation Delay for Data Gathering Trees and an Analysis of the Diameter-Aggregation Delay Tradeoff,” Algorithms<\/em>, vol. 8, no. 3, pp. 435-458, July\u00a02015. <\/span>Link<\/a>\u00a0\u00a0<\/span>DOI: 10.3390\/a8030435<\/a>.<\/span>\u00a0<\/span>[Publication as part of the NASA EPSCoR Sub Award]<\/b><\/p>\n

[56]<\/span>III<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “<\/span>Distribution of Maximal Clique Size of the Vertices for Theoretical Small-World Networks and Real-World Networks<\/span>,”\u00a0<\/span>International Journal of Computer Networks and Communications<\/i>, vol. 7, no. 4, pp. 21-41, July 2015.<\/span><\/span><\/p>\n

[55]<\/span>III<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “<\/span>Centrality-based Connected Dominating Sets for Mobile Ad hoc Networks<\/span>,”\u00a0Network Protocols and Algorithms<\/em>, vol. 7, no. 2, pp. 16-41, July 2015. <\/span>Link<\/a>.\u00a0<\/span><\/span>DOI<\/a>:\u00a010.5296\/npa.v7i2.7414\u00a0[Publication as part of the NASA EPSCoR Sub Award]<\/b><\/span><\/p>\n

[54]<\/span>I<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “Stability of Connected Dominating Sets in the Presence of Static Nodes in a Mobile Ad hoc Network<\/span>,”\u00a0<\/span>International Journal of Combinatorical Optimization Problems and Informatics<\/i><\/span>, vol. 6, no. 2, pp. 43-53, May-August\u00a02015.<\/span>\u00a0<\/span>Link<\/a><\/span><\/p>\n

[53]II<\/sup> N. Meghanathan<\/b>, 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<\/i>, vol. 8, no. 2, pp. 15-23, May 2015. [Publication as part of the Massie Chair Grant]<\/b>\u00a0Link<\/a><\/p>\n

[52]<\/span>III<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “Using Spectral Radius Ratio for Node Degree to Analyze the Evolution of Complex Networks,” <\/span>International Journal of Computer Networks and Communications<\/i>, vol. 7, no. 3, pp. 1-12, May 2015, <\/span>DOI : 10.5121\/ijcnc.2015.7301.\u00a0<\/span>Link<\/a><\/p>\n

[51]<\/span>III<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “Distribution of Maximal Clique Size under the Watts-Strogatz Model of Evolution of Complex Networks,”\u00a0International Journal in Foundations of Computer Science and Technology<\/em>, vol. 5, no. 3, pp. 1-12, May 2015. DOI: 10.5121\/ijfcst.2015.5301.<\/span>\u00a0<\/span>Link<\/a><\/span><\/p>\n

[50]<\/span>III<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “<\/span>Correlations between Centrality Measures for Mobile Ad hoc Networks<\/span>,” IGI\u00a0<\/em><\/span>International Journal of Wireless Networks and Broadband Technologies\u00a0<\/em>(IJWNBT<\/em>)<\/span>, vol. 4, no. 2, pp. 15-28, April-June 2015. <\/span>Link<\/a><\/span><\/p>\n

[49]I<\/sup> N. Meghanathan<\/b>, “A Stable Path Routing Protocol for Cognitive Radio Ad hoc Networks based on the Maximum Number of Common Primary User Channels,” Journal of Networks<\/i>, vol. 10, no. 2, pp. 117-124, March 2015. [Publication as part of the Massie Chair Grant]<\/b> Link<\/a><\/p>\n

[48]II<\/sup> N. Meghanathan<\/b>, “Stability-based and Energy-Efficient Distributed Data Gathering Algorithms for Mobile Sensor Networks,” Elsevier Ad hoc Networks<\/i>, vol. 19, pp. 111-131, August 2014. Link<\/a><\/p>\n

[47]II<\/sup> N. Meghanathan<\/b>, “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<\/i>, vol. 5, no. 2, pp. 29-46, May-August 2014. Link<\/a><\/p>\n

[46]III<\/sup> N. Meghanathan<\/b>, “Centrality-based Connected Dominating Sets for Complex Network Graphs,” IGI International Journal of Interdisciplinary Telecommunications and Networking<\/i> (IJITN), vol. 6, no. 2, pp. 1-19, April-June 2014.<\/p>\n

[45]II<\/sup> N. Meghanathan<\/b> and P. Mumford, “Centralized and Distributed Algorithms for Stability-based Data Gathering in Mobile Sensor Networks,” Macrothink: Network Protocols and Algorithms (NPA)<\/i>, vol. 5, no. 3, pp. 84-116, December 2013. DOI: http:\/\/dx.doi.org\/10.5296\/npa.v5i4.4208. Link<\/a><\/p>\n

[44]II<\/sup> N. Meghanathan<\/b> 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<\/i>, vol. 37, no. 3, pp. 315-338, October 2013. Link<\/a><\/span><\/p>\n

[43]II<\/sup> N. Meghanathan<\/b> 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<\/i> (IJCNC), vol. 5, no. 4, pp. 15-30, July 2013. DOI: 10.5121\/ijcnc.2013.5402. PDF<\/a><\/p>\n

[42]I<\/sup> N. Meghanathan<\/b> 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<\/i>, vol. 4, no. 2, pp. 12-30, May-August 2013. PDF<\/a><\/p>\n

[41]I<\/sup> N. Meghanathan<\/b>, “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<\/i>, (IJOAT), vol. 4, no. 1, pp. 1-27, April 2013. Link<\/a><\/p>\n

[40]I<\/sup> N. Meghanathan<\/b>, “A Survey on the Communication Protocols and Security in Cognitive Radio Networks,” International Journal of Communication Networks and Information Security<\/i>, (IJCNIS), vol. 5, no. 1, pp. 19-37, April 2013.<\/p>\n

[39]I<\/sup> N. Meghanathan<\/b> 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<\/i> (IJCOPI), vol. 4, no. 1, pp. 3-11, January-April 2013. PDF<\/a> [Publication as part of the NSF REU Grant]<\/b><\/p>\n

[38]II<\/sup> N. Meghanathan<\/b>, “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 <\/i> (IJCNIS), vol. 4, no. 3, pp. 196-206, December 2012. Link<\/a><\/p>\n

[37]I<\/sup> N. Meghanathan<\/b> 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 <\/i> (IJCNC), vol. 4, no. 4, pp. 1-19, July 2012. PDF<\/a> [Publication as part of the NSF REU Grant]<\/b><\/p>\n

[36]I<\/sup> N. Meghanathan<\/b>, “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<\/i>, (IJMNDI), Inderscience Publishers, vol. 4, no. 4, pp. 214-234, June 2012. Link<\/a><\/p>\n

[35]III<\/sup> N. Meghanathan<\/b>, “Graph Theory Algorithms for Mobile Ad hoc Networks,” Informatica – An International Journal of Computing and Informatics<\/i>, vol. 36, no. 2, pp. 185-200, June 2012. PDF<\/a> [Publication as part of the NSF REU Grant]<\/b><\/p>\n

[34]I<\/sup> N. Meghanathan<\/b> 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<\/i> (IJCOPI), vol. 3, no. 2, pp. 79-92, May – August 2012. PDF<\/a> [Publication as part of the NSF REU Grant]<\/b><\/p>\n

[33]II<\/sup> N. Meghanathan<\/b>, “A Comprehensive Review and Performance Analysis of Data Gathering Algorithms for Wireless Sensor Networks,” International Journal of Interdisciplinary Telecommunications and Networking<\/i> (IJITN), vol. 4, no. 2, pp. 1-29, April-June 2012. Journal Link<\/a><\/p>\n

[32]I<\/sup> N. Meghanathan<\/b>, “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<\/i> (IJCNC), vol. 4, no. 2, pp. 169-184, March 2012. DOI:10.5121\/ijcnc.2012.4211 PDF<\/a><\/p>\n

[31]II<\/sup> N. Meghanathan<\/b> and P. D. Mumford, “Maximum Stability Data Gathering Trees for Mobile Sensor Networks,” International Journal of Mobile Network Design and Innovation<\/i>, Inderscience Publishers, vol. 4, no. 3, pp. 164-178, February 2012. DOI: 10.1504\/IJMNDI.2012.051972 [Publication as part of the AFOSR\/AFRL\/SFFP 2012 Research]<\/b><\/p>\n

[30]I<\/sup> N. Meghanathan<\/b>, “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<\/i> (IJITN), vol. 4, no. 1, pp. 31-46, January-March 2012. Journal Link<\/a><\/p>\n

[29]I<\/sup> N. Meghanathan<\/b>, “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 <\/i> (NPA), vol. 3, no. 3, pp. 17-37, December 2011.<\/p>\n

[28]I<\/sup> N. Meghanathan<\/b>, “A Location Prediction Based Routing Protocol and its Extensions for Multicast and Multi-path Routing in Mobile Ad hoc Networks,” Elsevier Ad hoc Networks<\/i>, vol. 9, no. 7, pp. 1104-1126, September 2011. Link<\/a> [Publication as part of the ARL Grant]<\/b><\/p>\n

[27]I<\/sup> N. Meghanathan<\/b>, “Survey of Topology-based Multicast Routing Protocols for Mobile Ad hoc Networks,” International Journal of Communication Networks and Information Security (IJCNIS)<\/i>, vol. 3, no. 2, pp. 124-137, August 2011.<\/p>\n

[26]I<\/sup> N. Meghanathan<\/b>, “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<\/i>, vol. 35, no. 2, pp. 165-184, June 2011. [Publication as part of the ARL Grant]<\/b> PDF<\/a><\/p>\n

[25]I<\/sup> N. Meghanathan<\/b>, “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<\/i>, vol. 3, no. 3, pp. 1-14, June 2011. PDF<\/a><\/p>\n

[24]IV<\/sup> N. Kostyuk, P. Cole, N. Meghanathan<\/b>, R. Isokpehi, and H. Cohly, “Gas Discharge Visualization: An Imaging and Modeling Tool for Medical Biometrics,” International Journal of Biomedical Imaging<\/i>, vol. 2011, Article ID 196460, 7 pages, May 2011. doi:10.1155\/2011\/196460. [Publication as part of the NSF MS EPSCoR Grant] <\/b> PDF<\/a><\/p>\n

[23]I<\/sup> N. Meghanathan<\/b>, “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<\/i>, vol. 3, no. 2, pp. 196-212, April 2011. PDF<\/a><\/p>\n

[22]II<\/sup> N. Meghanathan<\/b>, “Grid Block Energy based Data Gathering Algorithms for Wireless Sensor Networks,” International Journal of Communication Networks and Information Security<\/i>, vol. 2, no. 3, pp. 151-161, December 2010. Link<\/a><\/p>\n

[21]I<\/sup> N. Meghanathan<\/b>, “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<\/i>, vol. 2, no. 4, pp. 13-29, November 2010. PDF<\/a><\/p>\n

[20]I<\/sup> N. Meghanathan<\/b>, “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<\/i>, vol. 2, no. 3, pp. 18-36, November 2010. Link<\/a><\/p>\n

[19]II<\/sup> N. Meghanathan<\/b>, “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<\/i>, vol. 2, no. 3, pp. 1-17, July-September 2010. Link<\/a><\/p>\n

[18]I<\/sup> N. Meghanathan<\/b> 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<\/i>, vol. 1, no. 1, pp. 50-72, June 2010. PDF<\/a><\/p>\n

[17]IV<\/sup> N. Meghanathan<\/b>, R. Isokpehi and H. H. P. Cohly, “Experimental Design and Predictive Computational Modeling for the Toxicity of Nanomaterials on the Human Epidermal Cells,” International Journal of Biometrics and Bioinformatics<\/i>, vol. 4, no. 2, pp. 34-41, May 2010. [Publication as part of the NSF MS EPSCoR Grant]<\/b> PDF<\/a><\/p>\n

[16]I<\/sup> N. Meghanathan<\/b>, “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<\/i>, vol. 34, no. 2, pp. 207-221, May 2010. PDF<\/a><\/p>\n

[15]I<\/sup> N. Meghanathan<\/b>, “Impact of the Gauss-Markov Mobility Model on Network Connectivity, Lifetime and Hop Count of Routes for Mobile Ad hoc Networks,” Journal of Networks<\/i>, vol. 5, no. 5, pp. 509 – 516, May 2010. PDF<\/a><\/p>\n

[14]I<\/sup> N. Meghanathan<\/b> 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<\/i> (IJITN), vol. 2, no. 1, pp. 12 – 26, March 2010.<\/p>\n

[13]I<\/sup> N. Meghanathan<\/b> and G. W. Skelton, “Risk Notification Message Dissemination Protocol for Energy Efficient Broadcast in Vehicular Ad hoc Networks,” IAENG International Journal of Computer Science<\/i>, vol. 37, no. 1, pp. 1 – 10, March 2010. PDF<\/a><\/p>\n

[12]I<\/sup> N. Meghanathan<\/b> 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<\/i>, Canadian Center for Science and Education, vol. 3, no. 1, pp. 3 – 11, February 2010. PDF<\/a><\/p>\n

[11]IV<\/sup> N. Meghanathan<\/b> 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<\/i>, vol. 2, no. 1, pp. 43 – 55, January 2010. PDF<\/a><\/p>\n

[10]I<\/sup> N. Cooper and N. Meghanathan<\/b>, “Impact of Mobility Models on Multi-path Routing in Mobile Ad hoc Networks,” International Journal of Computer Networks and Communications<\/i>, vol. 2, no. 1, pp. 185 – 194, January 2010. [Publication as part of the NSF REU Grant] <\/b> PDF<\/a><\/p>\n

[9]II<\/sup> N. Meghanathan<\/b>, “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<\/i>, vol. 3, no. 6, pp. 612 – 627, December 2009. PDF<\/a><\/p>\n

[8]I<\/sup> N. Meghanathan<\/b>, “Survey and Taxonomy of Unicast Routing Protocols for Mobile Ad hoc Networks,” The International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks<\/i>, vol. 1, no. 1, pp. 1 – 21, December 2009. PDF<\/a><\/p>\n

[7]II<\/sup> L. King and N. Meghanathan<\/b>, “A Weighted-Density Connected Dominating Set Data Gathering Algorithm for Wireless Sensor Networks,” Journal of Computer and Information Science<\/i>, Canadian Center for Science and Education, vol. 2, no. 4, pp. 3-13, November 2009. [Publication as part of the NSF REU Grant] <\/b> PDF<\/a><\/p>\n

[6]I<\/sup> N. Meghanathan<\/b>, “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<\/i>, vol. 52, no. 4, pp. 461-482, Oxford Press, British Computer Society, July 2009. Link<\/a><\/p>\n

[5]IV<\/sup> N. Meghanathan<\/b>, S. R. Allam and L. A. Moore, “Tools and Techniques for Network Forensics,” International Journal of Network Security and its Applications<\/i>, vol. 1, no. 1, pp. 14-25, April 2009. PDF<\/a><\/p>\n

[4]I<\/sup> N. Meghanathan<\/b> and A. Farago, “On the Stability of Paths, Steiner Trees and Connected Dominating Sets in Mobile Ad Hoc Networks,” Elsevier Ad Hoc Networks<\/i>, vol. 6, no. 5, pp. 744 – 769, July 2008. Available Online<\/a><\/p>\n

[3]I<\/sup> N. Meghanathan<\/b>, “Exploring the Stability-Energy Consumption-Delay-Network Lifetime Tradeoff of Mobile Ad Hoc Network Routing Protocols,” Academy Publisher Journal of Networks<\/i>, vol. 3, no. 2, pp. 17 – 28, February 2008. PDF<\/a><\/p>\n

[2]IV<\/sup> S. Baskiyar and N. Meghanathan<\/b>, “A Survey of Contemporary Real-time Operating Systems,” Informatica – An International Journal of Computing and Informatics<\/i>, vol. 29, no. 2, pp. 233-240, June 2005. PDF<\/a><\/p>\n

[1]III<\/sup> S. Baskiyar and N. Meghanathan<\/b>, “Binary Codes for Fast Determination of Ancestor-Descendant Relationship in Trees and Directed A-cyclic Graphs,” International Journal of Computers and Applications<\/i> , vol. 10, no. 1, pp. 67 – 71, March 2003.<\/p>\n

<\/a>Peer-reviewed Conferences<\/u><\/h3>\n

[93]III<\/sup> Y. Wu N<\/strong>.<\/strong>\u00a0Meghanathan<\/b>, “A Network Science Approach to Quantify the Extent of Co-occurrence of an Offense with other Offenses in a Crime Event<\/span>,” accepted for the <\/span>Proceedings of the 11th Computer Science Online Conference, to be published by Springer, April 2022.\u00a0<\/span><\/p>\n

[92]III<\/sup> N. Ahmed, R. Alo, C. Amelink, Y. Y. Baek, A. Choudhary, K. Collins, A. Esterline, E. Fox, G. Fox, A. Hagberg, R. Kenyon, C. J. Kuhlman, J. Leskovec, D. Machi, M. V. Marathe, N. Meghanathan<\/strong>, Y. Miyasaki, J. Qiu, N. Ramakrishnan, S. S. Ravi, R. Rossil, R. Sosic and G. von Laszewski, “net.science: A Cyberinfrastructure for Sustained
\nInnovation in Network Science and Engineering,” accepted for Presentation at the Gateways 2020 Online Conference, Week of October 19, 2020.<\/p>\n

[91]II<\/sup> N.<\/strong><\/span>\u00a0Meghanathan<\/b>, “<\/span><\/span>Multi-variable Linear Regression-based Prediction of a Computationally-Heavy Link Stability Metric for Mobile Sensor Networks,” <\/span><\/span>Proceedings of the 8th International Conference on Control, Modeling, Computing and Applications, pp. 29-38, Vienna, Austria, August 24-25, 2019. <\/span>Link<\/a><\/p>\n

[90]III<\/sup> Md. Rahman and N.<\/strong><\/span>\u00a0Meghanathan<\/b>, “<\/span><\/span>Logical Clustering of Similar Vertices in Complex Real-World Networks,” <\/span><\/span>Proceedings of the International Conference on Inventive Communication and Computational Technologies, Namakkal, India, April 29-30, 2019; published in Springer Lecture Notes in Networks and Systems, Vol. 89: Inventive Communication and Computational Technologies, pp. 891-899, 2020. <\/span>Link<\/a><\/p>\n

[89]II<\/sup> N.<\/strong><\/span>\u00a0Meghanathan<\/b>, “<\/span><\/span>Computationally-Light Metrics to Quantify Link Stability in Mobile Sensor Networks,” <\/span><\/span>Proceedings of the International Conference on Inventive Communication and Computational Technologies, Namakkal, India, April 29-30, 2019; published in Springer Lecture Notes in Networks and Systems, Vol. 89: Inventive Communication and Computational Technologies, pp. 227-235, 2020. <\/span>Link<\/a><\/p>\n

[88]III<\/sup> Md. Rahman and N.<\/strong><\/span>\u00a0Meghanathan<\/b>, “<\/span><\/span>Analyzing the Similarity-Based Clusterability of the Vertices in a Complex Network,” <\/span><\/span>Proceedings of the 16th International Conference on Information Technology-New Generations: published in Springer AISC vol. 800, pp. 237-243, Las Vegas, USA, April 1-3, 2019. <\/span>Link<\/a><\/p>\n

[87]III<\/sup> Md. Rahman,\u00a0M. Akhter and N.<\/strong><\/span>\u00a0Meghanathan<\/b>, “<\/span><\/span> Use of Eigenvector Centrality to Rank the Vertices in a DiseaseDisease Network ,” <\/span><\/span>Proceedings of the 16th International Conference on Information Technology-New Generations: published in Springer AISC vol. 800, pp. 429-434, Las Vegas, USA, April 1-3, 2019. <\/span>Link<\/a><\/p>\n

[86]III<\/sup> N.<\/strong><\/span>\u00a0Meghanathan<\/b>, “<\/span><\/span><\/span>Kurtosis: Is it an Appropriate Measure to Compare the Extent of Fat- Tailedness of the Degree Distribution for any Two Real-World Networks?,” <\/span><\/span>Proceedings of the <\/span>Fifth International Conference on Foundations of Computer Science & Technology (FCST-2017), Sydney, Australia, June 24-25, 2017.<\/span><\/span><\/p>\n

[85]III<\/sup> N.<\/strong><\/span>\u00a0Meghanathan<\/b>, “Correlation Analysis of Decay Centrality,” <\/span><\/span>Proceedings of the 6th Computer Science Online Conference<\/i>, (CSOC-2017), Advances in Intelligent Systems and Computing, vol. 574, pp. 407-418, April 26-29, 2017, DOI: 10.1007\/978-3-319-57264-2_41. <\/span>Link<\/a><\/span><\/p>\n

[84]II<\/sup> N.<\/strong><\/span>\u00a0Meghanathan<\/b> and Q. Hart, “Jaccard Similarity-based Quantification of the Neighborhood Stability of a Node in\u00a0 Mobile Sensor Networks,” Proceedings of<\/span> the SPIE Cyber Sensing Conference<\/span>, Anaheim, CA, April 9-13, 2017. <\/span><\/span>[Publication as part of the AFRL\/Clarkson Aerospace Grant]\u00a0 <\/b>DOI<\/a><\/p>\n

[83]II<\/sup> N.<\/strong><\/span>\u00a0Meghanathan<\/b>, “Algebraic Connectivity based Stable Data Gathering Trees for Mobile Sensor Networks,” <\/span>Proceedings of the\u00a0<\/em><\/span>International Conference on Computational Science and Computational Intelligence<\/em> (CSCI’16), pp. 947-952, Las Vegas, USA, Dec 15-17, 2016. <\/span>Link<\/a><\/span> [Publication as part of the AFRL\/Clarkson Aerospace Grant]\u00a0<\/b><\/p>\n

[82]III<\/sup>\u00a0X. He and\u00a0N.<\/strong><\/span>\u00a0Meghanathan<\/b>, “Alternatives to Betweenness Centrality: A Measure of Correlation Coefficient,” <\/span>Proceedings of the<\/em>\u00a0Fifth International Conference on Advanced Information Technologies and Applications (ICAITA), pp. 1-10, Dubai, UAE, November 12-13, 2016. <\/span>Link<\/a><\/span><\/p>\n

[81]III<\/sup>\u00a0X. He and\u00a0N.<\/strong><\/span>\u00a0Meghanathan<\/b>, “Correlation of Eigenvector Centrality to other Centrality Measures: Random, Small-World and Real-World Networks,” <\/span>Proceedings of the<\/em>\u00a08th International Conference on Networks and Communications<\/em>\u00a0(NeCoM), pp. 9-18, Chennai, India, October 22-23, 2016.<\/span> Link<\/a><\/span><\/p>\n

[80]<\/span>III<\/sup>\u00a0N.<\/strong><\/span>\u00a0Meghanathan\u00a0<\/b>and R. Lawrence, “Centrality Analysis of the United States Network Graph,”\u00a0<\/span>Proceedings of the 3rd International Conference on Electrical, Electronics, Engineering Trends, Communication, Optimization and Sciences<\/em> (EEECOS), pp. 23-28, Tadepalligudem, India, June 1-2, 2016 (proceedings to be published in IEEE Xplore). <\/span>[Publication as part of the Massie Chair Grant]\u00a0<\/b>Link<\/a><\/span><\/p>\n

[79]<\/span>III<\/sup>\u00a0Y. Zhou, F. Wang and\u00a0<\/span>N. Meghanathan\u00a0<\/b>and Y. Huang, “<\/span>Seed Based Approach for Automated Crack Detection from Pavement Images,” Proceedings of the 95th Annual Meeting of the\u00a0<\/em>Transportation Research Board <\/em>(TRB<\/em>), 17 pages (<\/span>#16-4415), Washington DC, USA, January 10-14, 2016. <\/span>Link<\/a>\u00a0<\/span><\/span><\/p>\n

[78]<\/span>III<\/sup>\u00a0<\/span>N. Meghanathan<\/b>,<\/span>\u00a0“<\/span>A Random Network Model with High Clustering Coefficient and Variation in Node Degree,<\/span>”\u00a0Proceedings of the<\/em><\/span>\u00a0<\/span><\/em>8th International Conference on Control and Automation, published by IEEE CPS, pp. 54-57, Jeju Island, Korea, November 25-28, 2015. \u00a0<\/span><\/span><\/span><\/p>\n

[77]<\/span>III<\/sup>\u00a0<\/span>N. Meghanathan<\/b>,<\/span> “Use of Eigenvector Centrality to Detect Graph Isomorphism<\/span>,<\/span>”\u00a0Proceedings of the<\/em><\/span>\u00a0<\/span><\/em>Fourth International Conference on Advanced Information Technologies and Applications<\/em> (ICAITA), pp. 1-9, Dubai, UAE, November 6-7, 2015.\u00a0<\/span>Link<\/a><\/span><\/p>\n

[76]<\/span>II<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “<\/span>Node Lifetime – Network Lifetime Tradeoff for Data\u00a0Gathering Trees in Wireless Sensor Networks,” ACM P<\/em>roceedings of the<\/em><\/span>\u00a0<\/i>International conference on Intelligent Information Processing, Security and Advanced Communication<\/em> (IPAC’ 2015), Algeria, Batna,\u00a0November 23-25, 2015. DOI:\u00a0<\/span>10.1145\/2816839.2816905.\u00a0Link<\/a><\/span><\/p>\n

[75]<\/span>III<\/sup> N. Meghanathan<\/b>, “Maximal Clique Size vs. Centrality: A Correlation Analysis for Complex Real-World Network Graphs,” Proceedings of the<\/em><\/span> 3rd International Conference on Advanced Computing, Networking, and Informatics<\/i>, (ICACNI-2015), Springer Smart Innovation, Systems and Technologies Series<\/em>, vol. 44,\u00a0pp. 95-101, June 23-25, 2015, Orissa, India.\u00a0<\/span><\/span>Springer Link<\/a><\/span><\/p>\n

[74]I<\/sup> N. Meghanathan<\/b>, “Performance of the Maximum Stable Connected Dominating Sets in the Presence of Static Nodes in a Mobile Ad hoc Network,”\u00a0Proceedings of the Fourth International Conference on Mobile and Wireless Networks<\/em> (MoWiN’ 2015), pp. 37-48,\u00a0Vienna, Austria, May 23-24, 2015.\u00a0Link<\/a><\/span><\/p>\n

[73]III<\/sup> N. Meghanathan<\/b>, “Correlation Coefficient Analysis of Centrality Metrics for Complex Network Graphs,” Proceedings of the 4th Computer Science Online Conference<\/i>, (CSOC-2015), Intelligent Systems in Cybernetics and Automation Theory: Advances in Intelligent Systems and Computing, Vol. 348, pp. 11-20, April 27-30, 2015, DOI:\u00a010.1007\/978-3-319-18503-3_2,\u00a0Link<\/a>.<\/span><\/p>\n

[72]III<\/sup> N. Meghanathan<\/b>, “On the Distribution of the Maximal Clique Size for the Vertices in Real-World Network Graphs and Correlation Studies,” Proceedings of the International Conference on Computer Science and Information Technology<\/i>, (CSTY-2015), pp. 1-12, Bangalore, India, April 25-26, 2015. DOI: 10.5121\/csit.2015.50901 PDF<\/a>.<\/span><\/p>\n

[71]III<\/sup> N. Meghanathan<\/b>, “Use of Centrality Metrics to Determine Connected Dominating Sets for Real-World Network Graphs,” Proceedings of the 12th International Conference on Information Technology: New Generations<\/i>, (ITNG-2015), pp. 243-248, Las Vegas, USA, April 13-15, 2015. [Publication as part of the Massie Chair Grant]<\/b><\/span><\/p>\n

[70]I<\/sup> N. Meghanathan<\/b> and M. Fanuel, “A Minimum Channel Switch Routing Protocol for Cognitive Radio Ad hoc Networks,” Proceedings of the 12th International Conference on Information Technology: New Generations<\/i>, (ITNG-2015), pp. 280-285, Las Vegas, USA, April 13-15, 2015. [Publication as part of the JSU 2014 Creative Awards for Faculty and Staff Program]<\/b><\/span><\/p>\n

[69]III<\/sup> N. Meghanathan<\/b>, “Using Spectral Radius Ratio for Node Degree to Analyze the Evolution of Scale-Free Networks and Small-World Networks,” Proceedings of the Second International Conference on Computer Science and Information Technology<\/i>, (COSIT-2015), pp. 21-28, Geneva, Switzerland, March 21-22, 2015. PDF<\/a><\/span><\/p>\n

[68]I<\/sup> N. Meghanathan<\/b>, “A Benchmarking Algorithm to Determine Maximum Lifetime Communication Topologies in Cognitive Radio Ad hoc Networks,” ACM\u00a0Proceedings of the International Conference on Advanced Research in Computer Science Engineering & Technology <\/i>, (ICARCSET 2015), Eluru, Andhra Pradesh, India, March 6-7, 2015, DOI: 10.1145\/2743065.2743069.\u00a0Link<\/a><\/span><\/p>\n

[67]III<\/sup> N. Meghanathan<\/b>, “Use of Eigenvalues and Eigenvectors to Analyze Bipartivity of Network Graphs,” Proceedings of the International conference on Computer Science, Engineering and Information Technology <\/i>, (CSEIT-2014), pp.221-230, Sydney, Australia, December 27-28, 2014. PDF<\/a><\/span><\/p>\n

[66]III<\/sup> N. Meghanathan<\/b>, “Spectral Radius as a Measure of Variation in Node Degree for Complex Network Graphs,” Proceedings of the 3rd International Conference on Digital Contents and Applications<\/i>, (DCA 2014), pp. 30-33, Hainan, China, December 20-23, 2014. Link<\/a><\/span><\/p>\n

[65]<\/span>III<\/sup>\u00a0<\/span>S. Abdelhamid, M. Alam, R. Alo, S. Arifuzzaman, P. Beckman, T. Bhattacharjee, H. Bhuiyan, K. Bisset, S. Eubank, A. C. Esterline, E. A. Fox, G. C. Fox, S. M. Shamimul Hasan, H. Hayatnagarkar, M. Khan, C. J. Kuhlman, M. V. Marathe, \u00a0N. Meghanathan<\/strong>, H. S. Mortveit, J. Qiu, S. S. Ravi, Z. Shams, O. Sirisaengtaksin, S. Swarup, A. K. S. Vullikanti and \u00a0Tak-Lon Wu, “CINET 2.0: A CyberInfrastructure for Network Science,” Proceedings of the IEEE 10th International Conference on e-Science<\/em>, vol. 1, pp. 324-331, Sao Paulo, Brazil, October 20-24, 2014.\u00a0Link<\/a><\/span><\/p>\n

[64]<\/span>II<\/sup> N. Meghanathan<\/b>, “A Distributed Trust Evaluation Model for Wireless Mobile Sensor Networks,” Proceedings of the<\/span> 11th International Conference on Information Technology: New Generations<\/i>, ITNG, pp. 186-191, Las Vegas, NV, USA, April 2014. <\/span>Link<\/a> [Publication as part of the Clarkson Aerospace\/AFRL Subcontract]<\/b><\/p>\n

[63]II<\/sup> N. Meghanathan<\/b> and P. Mumford, “Node Failure Time Analysis for Maximum Stability Vs Minimum Distance Spanning Tree based Data Gathering in Mobile Sensor Networks,” Proceedings of The Fifth International Conference on Networks & Communications<\/i>, NETCOM-2013, Chennai, India, December 27-29, 2013, published in Springer Lecture Notes in Electrical Engineering, LNEE 284, pp. 55-68, DOI: 10.1007\/978-3-319-03692-2_5.<\/span><\/p>\n

[62]II<\/sup> N. Meghanathan<\/b>, “Design of a Secure Data Aggregation Framework for Wireless Mobile Sensor Networks,” Proceedings of the ISCA 26th International Conference on Computer Applications in Industry and Engineering<\/i>, CAINE-2013, September 25-27, 2013, Los Angeles, USA. ISBN: 978-1-880843-93-2. [Publication as part of the Clarkson Aerospace\/AFRL Subcontract]<\/b><\/span><\/p>\n

[61]IV<\/sup> N. Meghanathan<\/b> and M. Terrell, “Design of a Secure Framework for Session Mobility as a Service in Cloud Computing Environment,” Proceedings of the ISCA 3rd International Conference on Advanced Computing and Communications<\/i>, ACC-2013, September 25-27, 2013, Los Angeles, USA. ISBN: 978-1-880843-91-8. [Publication as part of the Clarkson Aerospace\/AFRL Subcontract]<\/b><\/span><\/p>\n

[60]I<\/sup> N. Meghanathan<\/b> and I. Dasari, “A Generic Algorithm to Determine Connected Dominating Sets for Mobile Ad hoc Networks and Performance Evaluation under Different Mobility Models,” Fifth International workshop on Networks & Communications<\/i>, NeCoM, Proceedings of the Computer Science and Information Technology Series, vol. 3, no.4, pp. 239-248, July 27, 2013, Chennai, India. DOI: 10.5121\/csit.2013.3425. PDF<\/a><\/span><\/p>\n

[59]IV<\/sup> H. Kim, N.Meghanathan<\/b> and L. Moore, “Enhancement of an Undergraduate Software Engineering Course by Infusing Security Lecture Modules,” Proceedings of the 7th International Multi-Conference on Society, Cybernetics and Informatics: IMSCI 2013<\/i>, July 9-12, 2013, Orlando, FL, USA. [Publication as part of the NSF CCLI\/TUES Grant]<\/b> PDF<\/a><\/span><\/p>\n

[58]I<\/sup> N. Meghanathan<\/b>, “A Critical Review of the Routing Protocols for Cognitive Radio Networks and a Proposal for Load Balancing Local Spectrum Knowledge-based Routing,” Fifth International Conference on Wireless and Mobile Networks<\/i>, WiMoN, Istanbul, Turkey, June 1-2, 2013.<\/span><\/p>\n

[57]IV<\/sup> N. Meghanathan<\/b>, “Review of Access Control Models for Cloud Computing,” Proceedings of the Third International Conference on Computer Science, Engineering & Applications <\/i>, ICCSEA, Chennai, India, pp. 77-85, May 24-26, 2013. DOI : 10.5121\/csit.2013.3508. PDF<\/a><\/span><\/p>\n

[56]II<\/sup> N. Meghanathan<\/b> and P. D. Mumford, “A Benchmarking Algorithm to Determine Maximum Stability Data Gathering Trees for Wireless Mobile Sensor Networks,” Proceedings of the 10th International Conference on Information Technology: New Generations <\/i>, ITNG, pp. 492-497, Las Vegas, NV, USA, April 15-17, 2013. Link<\/a> [Publication as part of the AFOSR\/AFRL\/SFFP 2012 Research]<\/b><\/span><\/p>\n

[55]IV<\/sup> M. Terrell and N. Meghanathan<\/b>, “Setting up of a Cloud Cyber Infrastructure using Xen Hypervisor,” Proceedings of the 10th International Conference on Information Technology: New Generations <\/i>, ITNG, pp. 648-652, Las Vegas, NV, USA, April 15-17, 2013. [Publication as part of the NSF CCLI\/TUES Grant]<\/b> Link<\/a><\/span><\/p>\n

[54]IV<\/sup> N. Meghanathan<\/b>, “Source Code Analysis of a Connection-Oriented File Reader Server Socket Program in Java and Removal of the Security Vulnerabilities,” The Fourth International Workshop on Network & Communications Security <\/i> (NCS-2012), Chennai, India, December 2012; published in Springer Lecture Notes in Electrical Engineering, vol. 131, pp. 621-629, 2013. [Publication as part of the NSF CCLI\/TUES Grant]<\/b><\/span><\/p>\n

[53]II<\/sup> N. Meghanathan<\/b>, “Data Gathering Algorithms to Optimize Stability-Delay and Node-Network Lifetime for Wireless Mobile Sensor Networks,” Proceedings of the Fourth International Conference on Sensor Networks and Applications <\/i> (SNA-2012), pp. 237-242, New Orleans, LA, USA, November 14-16, 2012. ISBN: 978-1-880843-88-8\/ISCA.<\/span><\/p>\n

[52]IV<\/sup> N. Meghanathan<\/b>, “Virtualization of Virtual Memory Address Space,” ACM Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology<\/i> (CCSEIT 2012), pp. 732-737, Coimbatore, India, October 26-28, 2012. DOI: 10.1145\/2393216.2393338. ISBN: 978-1-4503-1310-0. Acceptance Rate: 23%. [Publication as part of the NSF CCLI\/TUES Grant]<\/b> Link<\/a><\/span><\/p>\n

[51]IV<\/sup> F. C. Dancer, D. A. Dampier, J. M. Jackson and N. Meghanathan<\/b>, “A Theoretical Process Model for Smartphones,” Proceedings of the 2nd International Conference on Advances in Computing and Information Technology<\/i> (ACITY-2012), Delhi, India, Springer Advances in Intelligent Systems and Computing<\/i>, vol. 3, pp. 279-290, July 2012.<\/span><\/p>\n

[50]IV<\/sup> N. Meghanathan<\/b> and A. R. Geoghegan, “Testing for Software Security: A Case Study on Static Code Analysis of a File Reader Java Program,” Proceedings of the Springer LNICST 2nd International Conference on Computer Science, Engineering and Applications<\/i>, ICCSEA, Delhi, India, pp. 529-538, May 25-27, 2012. DOI: 10.1007\/978-3-642-30157-5_53. [Publication as part of the NSF CCLI\/TUES Grant]<\/b><\/span><\/p>\n

[49]I<\/sup> N. Meghanathan<\/b> and M. Terrell, “Strong Neighborhood based Stable Connected Dominating Sets for Mobile Ad hoc Networks,” Proceedings of the 4th International Conference on Wireless, Mobile Network and Applications<\/i>, WiMoA, Delhi, India, pp. 415-424, May 25-27, 2012. DOI: 10.1007\/978-3-642-30111-7_39. ISBN: 978-3-642-30110-0. [Publication as part of the NSF REU Grant]<\/b><\/span><\/p>\n

[48]I<\/sup> N. Meghanathan<\/b>, “A Unicast MANET Routing Protocol to Simultaneously Minimize the Stability-Hop Count Tradeoff and End-to-End Delay,” Proceedings of the 9th International Conference on Information Technology : New Generations<\/i>, ITNG, pp. 60-64, Las Vegas, NV, USA, April 16-18, 2012. DOI: http:\/\/doi.ieeecomputersociety.org\/10.1109\/ITNG.2012.17. ISBN: 978-0-7695-4654-4.<\/span><\/p>\n

[47]IV<\/sup> N. Meghanathan<\/b>, H. Kim and L. A. Moore, “Incorporation of Aspects of Systems Security and Software Security in Senior Capstone Projects,” Proceedings of the 9th International Conference on Information Technology : New Generations<\/i>, ITNG, Las Vegas, NV, USA, pp. 319-324, April 16-18, 2012. DOI: http:\/\/doi.ieeecomputersociety.org\/10.1109\/ITNG.2012.54. ISBN: 978-0-7695-4654-4. [Publication as part of the NSF CCLI\/TUES Grant]<\/b><\/span><\/p>\n

[46]IV<\/sup> N. Meghanathan<\/b> and B. Chituri, “A Secure Session Transfer Protocol for Downloading a Large File across a Cluster of Servers in the Presence of Network Congestion,” The 3rd International Conference on Networks and Communication Security<\/i>, Bangalore, India, Springer-Verlag Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering Series<\/i>, LNICST 84, pp. 552-562, January 2012. [Publication as part of the NSF CCLI\/TUES Grant]<\/b><\/span><\/p>\n

[45]I<\/sup> N. Meghanathan<\/b>, “A Link Distance Ratio based Stable Multicast Routing Protocol for Mobile Ad hoc Networks,” The 3rd International Conference on Wireless & Mobile Networks <\/i>, Bangalore, India, Springer-Verlag Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering Series<\/i>, LNICST 84, pp. 253-262, January 2012.<\/span><\/p>\n

[44]I<\/sup> N. Meghanathan<\/b>, “A Node Stability Index-based Connected Dominating Set Algorithm for Mobile Ad hoc Networks,” The 3rd International Conference on Networks and Communications<\/i>, Bangalore, India, Springer-Verlag Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering Series<\/i>, LNICST 84, pp. 31-40, January 2012.<\/span><\/p>\n

[43]I<\/sup> N. Meghanathan<\/b>, “A MANET Multicast Routing Protocol for Stable Trees based on the Inverse of Link Expiration Times,” Proceedings of the 9th IEEE International Consumer Communications and Networking Conference<\/i>, Las Vegas, USA, pp. 947-951, January 2012, DOI: 10.1109\/CCNC.2012.6180965.<\/span><\/p>\n

[42]I<\/sup> N. Meghanathan<\/b>, “Minimum Hop vs. Minimum Edge Based Multicast Routing for Mobile Ad hoc Networks,” The Third International Conference on Wireless, Mobile Networks and Applications<\/i>, Dubai, UAE, Springer-Verlag Communications in Computer and Information Science Series<\/i>, CCIS 154, pp. 1-10, May 2011.<\/span><\/p>\n

[41]IV<\/sup> N. Meghanathan<\/b> and L. A. Moore, “Experiences in Running a NSF-CISE REU Site at a HBCU,” Proceedings of The 2011 Annual Symposium on Computing at Minority Institutions (ADMI)<\/i>, Clemson, SC, USA, April 14-16, 2011.[Publication as part of the NSF REU Grant] <\/b><\/span><\/p>\n

[40]I<\/sup> N. Meghanathan<\/b>, “A Performance Comparison Study of Two Position-based Routing Protocols and their Improved Versions for Mobile Ad hoc Networks,” The First International Conference on Computer Science and Information Technology<\/i>, Bangalore, India, Springer-Verlag Communications in Computer and Information Science Series<\/i>, CCIS 131, Part I, pp. 14-23, January 2011.<\/span><\/p>\n

[39]I<\/sup> N. Meghanathan<\/b>, “Optimum Routing Approach vs. Least Overhead Routing Approach for Minimum Hop Routing in Mobile Ad hoc Networks,” The First International Conference on Computer Science and Information Technology<\/i>, Bangalore, India, Springer-Verlag Communications in Computer and Information Science Series<\/i>, CCIS 131, Part II, pp. 606-616, January 2011.<\/span><\/p>\n

[38]I<\/sup> N. Meghanathan<\/b>, “An Algorithm to Determine Minimum Velocity-based Stable Connected Dominating Sets for Ad hoc Networks,” The 3rd International Conference on Contemporary Computing, Noida, India, Springer-Verlag Communications in Computer and Information Science Series <\/i>, CCIS 94, pp. 206-217, August 2010.<\/span><\/p>\n

[37]I<\/sup> N. Meghanathan<\/b> and S. R. Vavilala, “An Algorithm to Determine Multicast Meshes with Maximum Lifetime for Mobile Ad hoc Networks,” The Second International Conference on Wireless and Mobile Networks (WiMoN-2010), Chennai, India, Springer-Verlag Communications in Computer and Information Science Series<\/i>, CCIS 90, pp. 250-259, July 2010.<\/span><\/p>\n

[36]I<\/sup> N. Meghanathan<\/b>, “Design of a Reliability-based Source Routing Protocol for Wireless Mobile Ad hoc Networks,” The First International Workshop on Trust Management in P2P Systems (IWTMP2PS), Chennai, India, Springer-Verlag Communications in Computer and Information Science Series<\/i>, CCIS 89, pp. 463-472, July 2010.<\/span><\/p>\n

[35]I<\/sup> N. Meghanathan<\/b>, “On the Time between Successive Multi-Path Discoveries and Hop Count per Multi-Path for Zone-Disjoint Routing in Mobile Ad hoc Networks,” The Second International Conference on Wireless and Mobile Networks (WiMo 2010), Ankara, Turkey, Springer-Verlag Communications in Computer and Information Science Series<\/i>, CCIS 84, pp. 254-265, June 2010.<\/span><\/p>\n

[34]IV<\/sup> N. Meghanathan<\/b>, N. Kostyuk, R. Isokpehi and H. H. P. Cohly, “Clustering Model to Identify Biological Signatures for English Language Anxiety,” Proceedings of The Second Annual ORNL Biomedical Science and Engineering Conference (BSEC)<\/i>, Oakridge, TN, USA, May 2010. [Publication as part of the NSF MS EPSCoR Grant]<\/b><\/span><\/p>\n

[33]IV<\/sup> N. Meghanathan<\/b> and L. Nayak, “A Review of the Audio and Video Steganalysis Algorithms,” Proceedings of the 48th ACM Southeast Conference<\/i>, Oxford, MS, April 15-17, 2010.<\/span><\/p>\n

[32]II<\/sup> N. Meghanathan<\/b>, “Grid Block Energy based Data Gathering Algorithm for Lower Energy*Delay and Longer Lifetime in Wireless Sensor Networks,” Proceedings of the 1st ISCA International Conference on Sensor Networks and Applications<\/i> (SNA 2009), pp.79-84, San Francisco, USA, November 4 – 6, 2009.<\/span><\/p>\n

[31]I<\/sup> N. Meghanathan<\/b>, D. Thomas and E. S. Addison, “Multicast Extensions to the Flow-Oriented Routing Protocol and Node Velocity-based Stable Path Routing Protocol for Mobile Ad hoc Networks,” Proceedings of the 1st IEEE Workshop on Mobile Computing and Networking Technologies<\/i>, held in Conjunction with the 1st IEEE International Conference on Ultra Modern Telecommunications<\/i>, St. Petersburg, Russia, October 12-14, 2009. (Acceptance Rate: 39%) [Publication as part of the NSF REU Grant] <\/b><\/span><\/p>\n

[30]I<\/sup> N. Meghanathan<\/b>, “A Node-Disjoint Multi-path Extension of the Location Prediction Based Routing Protocol for Mobile Ad hoc Networks,” Proceedings of the 3rd International Conference on Signal Processing and Communication Systems<\/i>, Omaha, Nebraska, USA, September 28-30, 2009. (Acceptance Rate: 37.6%) [Publication as part of the ARL Grant]<\/b><\/span><\/p>\n

[29]I<\/sup> N. Meghanathan<\/b>, “Multicast Extensions to the Location-Prediction Based Routing Protocol for Mobile Ad hoc Networks,” International Conference on Wireless Algorithms, Systems and Applications, Lecture Notes of Computer Science Series<\/i>, LNCS 5682, B. Liu et al. (Eds.), pp. 190-199, August 2009. Extended Version of the paper published in the ISAST Transactions on Computers and Intelligent Systems. [Publication as part of the ARL Grant] <\/b><\/span><\/p>\n

[28]I<\/sup> N. Meghanathan<\/b>, “On the Connectivity, Lifetime and Hop Count of Routes Determined using the City Section and Manhattan Mobility Models for Vehicular Ad hoc Networks,” 2nd International Conference on Contemporary Computing, Springer-Verlag Communications in Computer and Information Science Series<\/i>, CCIS 40, pp. 170-181, August 2009. (Acceptance Rate: 31%)<\/span><\/p>\n

[27]I<\/sup> N. Meghanathan<\/b>and M. Sugumar, “A Beaconless Minimum Interference Based Routing Protocol for Mobile Ad hoc Networks,” 2nd International Conference on Contemporary Computing, Springer-Verlag Communications in Computer and Information Science Series<\/i>, CCIS 40, pp. 58-69, August 2009. (Acceptance Rate: 31%)<\/span><\/p>\n

[26]I<\/sup> N. Meghanathan<\/b>, “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<\/i>, ICWN 09, pp. 167 – 173, Las Vegas, July 13-16, 2009. (Acceptance Rate: 25%) [Publication as part of the ARL Grant] <\/b><\/span><\/p>\n

[25]II<\/sup> N. Meghanathan<\/b>, “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<\/i>, ICWN 09, pp. 608 – 614, Las Vegas, July 13-16, 2009. (Acceptance Rate: 25%)<\/span><\/p>\n

[24]I<\/sup> N. Meghanathan<\/b> and G. W. Skelton, “An Energy Efficient Risk Notification Message Dissemination Protocol for Vehicular Ad hoc Networks,” Proceedings of the International Conference on High Performance Computing, Networking and Communications Systems<\/i>, HPCNCS-09, Orlando, July 13-16, 2009.<\/span><\/p>\n

[23]I<\/sup> N. Meghanathan<\/b>, “A Beaconless Node Velocity-based Stable Path Routing Protocol for Mobile Ad hoc Networks,” Proceedings of the IEEE Sarnoff Symposium<\/i>, pp. 9-13, Princeton, NJ, March 30-April 1, 2009. (Acceptance rate: 45%)<\/span><\/p>\n

[22]I<\/sup> N. Meghanathan<\/b>, “Impact of Range of Simulation Time and Network Shape on the Hop Count and Stability of Routes for Mobile Ad hoc Networks,” Proceedings of the 47th ACM Southeast Conference<\/i>, Clemson, March 19-21, 2009.<\/span><\/p>\n

[21]I<\/sup> N. Meghanathan<\/b> and L. C. Milton, “A Simulation-Based Performance Comparison Study of Stability-Based Routing, Power-Aware Routing and Load-Balancing Routing Protocols for Mobile Ad hoc Networks,” Proceedings of the 6th International Conference on Wireless On-demand Network Systems and Services<\/i>, Snowbird, Utah, Feb 2 – 4, 2009.<\/span><\/p>\n

[20]I<\/sup> N. Meghanathan<\/b>, “Location Prediction Based Routing Protocol for Mobile Ad hoc Networks,” Proceedings of the IEEE Global Communications (GLOBECOM) Conference<\/i> , New Orleans, Nov-Dec 2008. (Acceptance Rate: 36.8%, ECI: 0.75)<\/span><\/p>\n

[19]I<\/sup> N. Meghanathan<\/b>, “Stability and Link Efficiency of On-Demand Source Tree-Based Routing Protocols for Mobile Ad Hoc Networks,” Proceedings of the International Conference on High Performance Computing, Networking and Communication Systems<\/i>, pp. 159-166, Orlando, USA, July 2008.<\/span><\/p>\n

[18]II<\/sup> N. Meghanathan<\/b> and G. W. Skelton, “A Two Layer Architecture of Mobile Sinks and Static Sensors,” Proceedings of the 15th International Conference on Advanced Computing and Communication<\/i>, pp. 249-254, Guwahathi, India, December 2007.<\/span><\/p>\n

[17]I<\/sup> N. Meghanathan<\/b>, “Stability and Hop Count of Node-Disjoint and Link-Disjoint Multi-Path Routes in Ad Hoc Networks,” Proceedings of the 3rd IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)<\/i>, New York, October 2007 (Acceptance Rate: 44%).<\/span><\/p>\n

[16]I<\/sup> N. Meghanathan<\/b>, “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, Networking and Communication Systems<\/i>, pp. 144 – 151, Orlando, USA, July 2007 (Acceptance Rate: 30%).<\/span><\/p>\n

[15]IV S. Knight, H. Kim, N. Meghanathan<\/b> and C. Bland, “Fast Determination of Ancestor-Descendant Relationships using Bit Patterns,” Proceedings of the International Conference on Knowledge and Engineering<\/i>, pp. 178 – 182, Las Vegas, June 2007 (Acceptance Rate: 22%).<\/span><\/p>\n

[14]I N. Meghanathan<\/b>, “Stability-Energy Consumption Tradeoff among Mobile Ad Hoc Network Routing Protocols,” Proceedings of 3rd IARIA International Conference on Wireless and Mobile Communications, March 2007 (Acceptance Rate: 31%).<\/span><\/p>\n

[13]I<\/sup> N. Meghanathan<\/b>, “A Simulation Study on the Stability-Oriented Routing Protocols for Mobile Ad Hoc Networks,” Proceedings of 3rd IEEE and IFIP International Conference on Wireless and Optical Communication Networks<\/i>, Bangalore, India, April 2006.<\/span><\/p>\n

[12]I<\/sup> N. Meghanathan<\/b>, “Comparison of Stable Path Selection Strategies for Mobile Ad Hoc Networks,” Proceedings of 5th IFIP International Conference on Networking<\/i>, Mauritius, April 2006. (Acceptance Rate: 39%).<\/span><\/p>\n

[11]I<\/sup> N. Meghanathan<\/b>, “On-demand Maximum Battery Lifetime Routing with Power Sensitive Power Control,” Proceedings of 5th IFIP International Conference on Networking<\/i>, Mauritius, April 2006. (Acceptance Rate: 39%).<\/span><\/p>\n

[10]I<\/sup> N. Meghanathan<\/b>, “Determining a Sequence of Stable Multicast Steiner Trees in Mobile Ad Hoc Networks,” Proceedings of 44th ACM-Southeast Conference, pp. 102-106, Melbourne, FL, USA, March 2006. [Best Paper Award] <\/b><\/span><\/p>\n

[9]I<\/sup> N. Meghanathan<\/b>, “An Algorithm to Determine the Sequence of Stable Connected Dominating Sets in Mobile Ad Hoc Networks,” Proceedings of 2nd Advanced International Conference on Telecommunications<\/i>, Guadeloupe, French Caribbean, February 2006. (Acceptance Rate: 37%).<\/span><\/p>\n

[8]I<\/sup> N. Meghanathan<\/b> and A. Farago, “Comparison of Routing Strategies for Minimizing Energy Consumption in Mobile Ad Hoc Networks,” Proceedings of the 4th Asian International Mobile Computing Conference<\/i>, Kolkatta, India, January 2006.<\/span><\/p>\n

[7]I<\/sup> N. Meghanathan<\/b> and A. Farago, “An Efficient Algorithm for the Optimal Number of Route Transitions in Mobile Ad Hoc Networks,” Proceedings of the 1st IEEE – International Conference on Wireless and Mobile Computing, Networking and Communications<\/i>, Canada, August 2005.<\/span><\/p>\n

[6]I<\/sup> N. Meghanathan<\/b> and A. Farago, “On the Route Refresh Frequency for On-demand Maximum Battery Life Routing in Ad Hoc Networks,” Proceedings of the 1st IEEE – International Conference on Wireless and Mobile Computing, Networking and Communications<\/i>, Canada, August 2005.<\/span><\/p>\n

[5]I<\/sup> N. Meghanathan<\/b> and A. Farago, “Maximizing Network Lifetime under Fixed Energy Budget in Ad Hoc Networks,” Proceedings of the 6th IEEE- Southeast Conference<\/i>, Fort. Lauderdale, FL, USA, April 2005.<\/span><\/p>\n

[4]I<\/sup> N. Meghanathan<\/b> and A. Farago, “Power Sensitive Power Control in Ad Hoc Networks,” Proceedings of 43rd ACM-Southeast Conference<\/i>, Kennesaw, GA, USA, March 2005.<\/span><\/p>\n

[3]I<\/sup> N. Meghanathan<\/b> and A. Farago, “Looking at Protocol Efficiency from a New Angle: Stability – Delay Analysis,” Proceedings of 2nd ACM International Workshop on Mobility Management and Wireless Access (MobiWAC)<\/i>, in conjunction with Mobicom ’04, Philadephia, PA, USA, October 2004.<\/span><\/p>\n

[2]I<\/sup> S. Baskiyar and N. Meghanathan<\/b>, “Scheduling and Load Sharing in Mobile Computing Environments using Tickets,” Proceedings of 39th ACM- Southeast Conference<\/i>, Athens, GA, USA, March 2001.<\/span><\/p>\n

[1]IV<\/sup> N. Meghanathan<\/b>, V. M. Saucedo and G. A. Krishnagopalan, “Modeling of Kraft Pulping Process Based on On-line Data from Near Infrared Analyzer,” AIChE Symposium Series 324, Volume 96, Fundamentals and Numerical Modeling of Unit Operations in the Forest Products Industries, pp. 36 – 41, 2001.<\/span><\/p>\n

<\/a>Books\/Videos<\/u><\/h3>\n

[9]<\/span>III<\/sup> N. Meghanathan<\/b>\u00a0(author and editor), <\/span>Strategic Innovations and Interdisciplinary Perspectives in Telecommunications and Networking<\/a>, 15 chapters (348 pages), IG<\/span>I Global Publishers, Hershey, PA, USA, February 2019, ISBN: 9781522581888.<\/span><\/span><\/p>\n

[8]<\/span>III<\/sup> N. Meghanathan<\/b>\u00a0(author and editor), <\/span>Centrality Metrics for Complex Network Analysis: Emerging Research and Opportunities<\/a>, 7 chapters (183 pages), IG<\/span>I Global Publishers, Hershey, PA, USA, April 2018, ISBN: 9781522538028.<\/span><\/span><\/p>\n

[7]<\/span>III<\/sup> N. Meghanathan<\/b>\u00a0(editor), <\/span>Graph Theoretic Approaches for Analyzing Large-Scale Social Networks<\/a>, 17 chapters (355 pages), IG<\/span>I Global Publishers, Hershey, PA, USA, July 2017, ISBN: 9781522528142.<\/span><\/span><\/p>\n

[6]<\/span>I<\/sup>\u00a0<\/span>N. Meghanathan<\/b>\u00a0(author), <\/span>Routing Protocols and Graph Theory Algorithms for Mobile Ad Hoc Networks<\/a>, video series: 18 lessons, 3 hours and 8 minutes, DOI: <\/span> 10.4018\/978-1-5225-2227-0, EISBN: <\/span> 9781522522270, IGI Global Publishers, Hershey, PA, USA, January 2017.<\/span><\/span><\/p>\n

[5]<\/span>III<\/sup> N. Meghanathan<\/b>\u00a0(editor),\u00a0<\/span>Advanced Methods for Complex Network Analysis<\/a>, 17\u00a0chapters, 427\u00a0pages, DOI: <\/span>10.4018\/978-1-4666-9964-9<\/span>, ISBN: <\/span>9781466699649<\/span>, IGI Global Publishers, Hershey, PA, USA, April 2016.<\/span><\/span><\/p>\n

[4]I<\/sup> N. Meghanathan<\/b> (author and editor), Recent Advances in Ad Hoc Networks Research<\/a>, 10 chapters, 234 pages, ISBN: 978-1-63321-337-1, Nova Publishers, New York, USA, August 2014.<\/span><\/p>\n

[3]I<\/sup> N. Meghanathan<\/b> and Y. B. Reddy (authors and editors), Cognitive Radio Technology Applications for Wireless and Mobile Ad hoc Networks<\/a>, 16 chapters, 370 pages, DOI: 10.4018\/978-1-4666-4221-8, ISBN: 978-1-46664-221-8, IGI Global Publishers, Hershey, PA, USA, June 2013.<\/span><\/p>\n

[2]IV<\/sup> N. Meghanathan\u00a0<\/b>(author),\u00a0A Tutorial on Java Socket Programming and Source Code Analysis, LAP LAMBERT Academic Publishing <\/i>, ISBN-13: 978-3-659-31445-2, 80 pages, 2013. Cover Page<\/a> \u00a0\u00a0 Amazon Link<\/a>
\n[Publication as part of the NSF CCLI\/TUES Grant]<\/b><\/span><\/p>\n

[1]IV<\/sup> N. Meghanathan<\/b>, D. C. Johnson and A. R. Geoghegan (authors), An Analysis of Software Security Attacks and Mitigation Controls, LAP LAMBERT Academic Publishing <\/i>, ISBN-13: 978-3-659-30944-1, 76 pages, 2013. Cover Page<\/a> \u00a0\u00a0 Amazon Link<\/a>
\n[Publication as part of the NSF CCLI\/TUES Grant]<\/b><\/span><\/p>\n

<\/h3>\n

<\/a>Book Chapters<\/u><\/h3>\n
[27<\/span>III<\/sup>\u00a0N. Meghanathan<\/b>, “Binary Search Approach for Largest Cascade Capacity of Complex Network<\/span>,” <\/span>Encyclopedia of Data Science and Machine Learning<\/em>,\u00a0<\/i>Editor: John Wang, IGI, 2022.<\/span>\u00a0\u00a0<\/span><\/h5>\n

[26]<\/span>IV<\/sup> N. Meghanathan <\/b>and M. Terrell, “<\/span>Design of a Secure Framework for Session Mobility as a Service in Cloud Computing Environment,” (Chapter 27, pp. 475-490), <\/span>Computer and Network Security Essentials<\/em>,\u00a0<\/i>Editor: <\/span>Kevin Daimi, Springer, 2018.\u00a0 <\/span><\/p>\n

[25]<\/span>IV<\/sup> N. Meghanathan<\/b>, “<\/span>Biometrics for User Authentication,” (Chapter 18, pp. 317-335), <\/span>Computer and Network Security Essentials<\/em>,\u00a0<\/i>Editor: <\/span>Kevin Daimi, Springer, 2018.\u00a0\u00a0 <\/span><\/p>\n

[24]<\/span>III<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “<\/span>Leverage Centrality-Based Assortativity Analysis of Real-World Network Graphs,” chapter accepted for publication in <\/span> Complex Networks: Advances in Research and Applications<\/em>, NOVA Publishers, 2017.<\/p>\n

[23]<\/span>I<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “<\/span>A Graph Intersection-based Algorithm to Determine Maximum Lifetime Communication Topologies for Cognitive Radio Ad hoc Networks,” Chapter 567, <\/span>Encyclopedia of Information Science and Technology<\/em>,\u00a0<\/i>Editor:\u00a0<\/span>Mehdi Khosrow-Pour<\/span>, IGI Global, 2017.\u00a0<\/span><\/p>\n

[22]<\/span>III<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “<\/span>Clique Size and Centrality Metrics for Analysis of Real-World Network Graphs,” Chapter 565, <\/span>Encyclopedia of Information Science and Technology<\/em>,\u00a0<\/i>Editor:\u00a0<\/span>Mehdi Khosrow-Pour<\/span>, IGI Global, 2017<\/span>.<\/p>\n

[21]<\/span>I<\/sup> N. Meghanathan<\/b>, “<\/span>Centralized and Distributed Algorithms for Stable Communication Topologies in Cognitive Radio Ad hoc Networks,” Chapter 6, pp. 153-182, Spectrum Access and Management for Cognitive Radio Networks<\/em>,\u00a0<\/i>Editor: <\/span>Mohammad A. Matin, Springer, 2017, DOI: <\/span>10.1007\/978-981-10-2254-8: <\/span>Link<\/a><\/p>\n

[20]<\/span>II<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “<\/span>Diameter-Aggregation Delay Tradeoff for Data Gathering Trees in Wireless Sensor Networks<\/span>,” Chapter 10, pp. 237-253,\u00a0<\/span>Handbook of Research on Wireless Sensor Network Trends, Technologies, and Applications<\/em>,\u00a0<\/i>Editor: Narendra Kumar Kamila,\u00a0IGI Global, July\u00a02016.\u00a0<\/span>Link<\/a><\/span><\/p>\n

[19]<\/span>II<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “<\/span>Eigenvector Centrality-Based Mobile Target Tracking in Wireless Sensor Networks,” Chapter 16, pp. 394-411, <\/span>Handbook of Research on Wireless Sensor Network Trends, Technologies, and Applications<\/em>,\u00a0<\/i>Editor: Narendra Kumar Kamila,\u00a0IGI Global, July\u00a02016.\u00a0<\/span>Link<\/a><\/span><\/p>\n

[18]<\/span>II<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “<\/span>Impact of the Structure of the Data Gathering Trees on Node Lifetime and Network Lifetime in Wireless Sensor Networks,” Chapter 7, pp. 192-204,\u00a0<\/span>Handbook of Research on Advanced Wireless Sensor Network Applications, Protocols, and Architectures<\/em>,\u00a0<\/i>Editors: Niranjan Ray and Ashok Turuk, IGI Global, July\u00a02016.\u00a0<\/span>Link<\/a><\/span><\/p>\n

[17]<\/span>II<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “<\/span>Distributed Data Gathering Algorithms for Mobile Sensor Networks,” Chapter 13, pp. 329-359, <\/span>Emerging Communication Technologies Based on Wireless Sensor Networks: Current Research and Future Applications<\/em>, <\/i>Editors: <\/span>Mubashir Husain Rehmani and Al-Sakib Khan Pathan, CRC Press, April 2016.\u00a0<\/span>Link<\/a><\/p>\n

[16]<\/span>II<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “A Pairwise Key Distribution Mechanism and Distributed Trust Evaluation Model for Secure Data Aggregation in Mobile Sensor Networks,” Chapter 12, pp. 299-328,\u00a0<\/span>Emerging Communication Technologies Based on Wireless Sensor Networks: Current Research and Future Applications<\/em>,\u00a0<\/i>Editors:\u00a0<\/span>Mubashir Husain Rehmani and Al-Sakib Khan Pathan, CRC Press, April 2016.\u00a0<\/span>Link<\/a><\/span><\/p>\n

[15]<\/span>IV<\/sup> N. Meghanathan<\/b>, “Virtualization as The Catalyst for Cloud Computing,” Chapter 105, pp. 304-320, <\/span>Encyclopedia of Information Science and Technology, Third Edition<\/i>, Editor: Mehdi Khosrow-Pour, ISBN: 1466658886, DOI: 10.4018\/978-1-4666-5888-2, IGI Global Publishers, Hershey, PA, USA, July 2014.<\/span><\/p>\n

[14]I<\/sup> N. Meghanathan<\/b>, “A Simulation-Based Comparison Study of Connected Dominating Sets for Mobile Ad hoc Networks under Different Mobility Models,” Chapter 1, Recent Advances in Ad Hoc Networks Research<\/i>, Editor: N. Meghanathan, ISBN: 978-1-63321-337-1, Nova Publishers, USA, 3rd Quarter 2014. Book Link<\/a><\/p>\n

[13]I<\/sup> N. Meghanathan<\/b>, “A Performance Comparison of Zone-Disjoint and Node-Disjoint Multi-Path Routing with Single-Path Routing for Mobile Ad hoc Networks,” Chapter 2, Recent Advances in Ad Hoc Networks Research<\/i>, Editor: N. Meghanathan, ISBN: 978-1-63321-337-1, Nova Publishers, USA, 3rd Quarter 2014. Book Link<\/a><\/p>\n

[12]IV<\/sup> N. Meghanathan<\/b>, “A Secure Data Aggregation Framework for Wireless Mobile Sensor Networks,” Chapter 5, Recent Advances in Ad Hoc Networks Research<\/i>, Editor: N. Meghanathan, ISBN: 978-1-63321-337-1, Nova Publishers, USA, 3rd Quarter 2014. Book Link<\/a><\/p>\n

[11]II<\/sup> N. Meghanathan<\/b>, “Data Gathering Algorithms and Sink Mobility Models for Wireless Sensor Networks,” Chapter 8, pp. 123-151, Multidisciplinary Perspectives on Telecommunications, Wireless Systems, and Mobile Computing<\/i>, Editor: W. Hu, ISBN: 1466647159, DOI: 10.4018\/978-1-4666-4715-2.ch008, IGI Global Publishers, Hershey, PA, USA, 2014. Book Link<\/a><\/p>\n

[10]I<\/sup> N. Meghanathan<\/b>, “Algorithms to Determine Stable Connected Dominating Sets for Mobile Ad hoc Networks,” Chapter 9, pp. 249-274, Wireless Communications and Networking: Theory and Practice<\/i>, Editor: M. Matin, ISBN: 1466651709, DOI: 10.4018\/978-1-4666-5170-8.ch009, IGI Global Publishers, Hershey, PA, USA, February 2014. Book Chapter Link<\/a><\/p>\n

[9]III<\/sup> N. Meghanathan<\/b> and P. Mumford, “Graph Intersection-based Benchmarking Algorithm for Maximum Stability Data Gathering Trees in Wireless Mobile Sensor Networks,” Chapter 17, pp. 433-458, Wireless Communications and Networking: Theory and Practice<\/i>, Editor: M. Matin, ISBN: 1466651709, DOI: 10.4018\/978-1-4666-5170-8.ch017, IGI Global Publishers, Hershey, PA, USA, February 2014. Book Chapter Link<\/a><\/p>\n

[8]IV<\/sup> N. Meghanathan<\/b>, “Network Security: Attacks and Controls,” Chapter 11, pp. 174-203, Network Security Technologies: Design and Applications<\/i>, Editors: A. Amine, O. Ait Mohamed and B. Benatallah, ISBN: 1466647892, IGI Global Publishers, Hershey, PA, USA, November 2013. Book Chapter Link<\/a><\/p>\n

[7]I<\/sup> N. Meghanathan<\/b>, “Introduction to Cognitive Radio Networks: Communication Protocols and Security Issues,” Chapter 1, pp. 1-30, Cognitive Radio Technology Applications for Wireless and Mobile Ad hoc Networks<\/i>, Editors: N. Meghanathan and Y. B. Reddy, ISBN: TBA, IGI Global Publishers, Hershey, PA, USA, June 2013. Book Chapter Link<\/a><\/p>\n

[6]II<\/sup> N. Meghanathan<\/b>, “Data Gathering Algorithms for Wireless Sensor Networks,” Chapter 13: pp. 353-376, Wireless Sensor Networks: Current Status and Future Trends<\/i>, Editors: S. Khan, A-S. Khan Pathan and N. A. Alrajeh, ISBN: 978-1-4665-0606-0, CRC Press, Taylor & Francis Group, USA, 2012. Book Link<\/a><\/p>\n

[5]I<\/sup> N. Meghanathan<\/b>, “Topology-based Classification of Multicast Routing Protocols for Mobile Ad hoc Networks,” Chapter 7: pp. 116-143, Technological Advancements and Applications in Mobile Ad hoc Networks: Research Trends <\/i>, Editor: Kamaljit Lakhtaria, ISBN: 978-1-4666-0321-9, IGI Global Publishers, Hershey, PA, USA, 2012. Book Chapter Link<\/a><\/p>\n

[4]IV<\/sup> N. Meghanathan<\/b> and A. R. Geoghegan, “A Case Study on Testing for Software Security: Static Code Analysis of a File Reader Program Developed in Java,” Chapter 5: pp. 89-112, Advanced Automated Software Testing: Frameworks for Refined Practice, Editor: Izzat Alsmadi, ISBN: 978-1-4666-0089-8, 270 pages, IGI Global Publishers, Hershey, PA, USA, 2011. [Publication as part of the NSF CCLI\/TUES Grant] <\/b> Book Chapter Link<\/a><\/p>\n

[3]III<\/sup> N. Meghanathan<\/b>, “Applications of Graph Theory Algorithms in Mobile Ad hoc Networks,” Chapter 4: pp. 98-125, Mobile Computing Techniques in Emerging Markets: Systems, Applications and Services, Editors: A. V. Senthil Kumar and Hakikur Rehman, ISBN: 978-1-4666-0080-5, IGI Global Publishers, Hershey, PA, USA, 2011. [Publication as part of the NSF REU Grant] <\/b> Book Chapter Link<\/a><\/p>\n

[2]I<\/sup> N. Meghanathan<\/b>, “A Location Prediction Based Routing Protocol and its Extensions for Multicast and Multi-path Routing in Mobile Ad hoc Networks,” Chapter 12: pp. 217-242, Mobile Ad-Hoc Networks: Protocol Design<\/i>, Editor: Xin Wang, ISBN: 978-953-307-402-3, 656 pages, In-Tech Education and Publishing, Vienna, Austria, November 2010. Book Link<\/a><\/p>\n

[1]I<\/sup> N. Meghanathan<\/b>, “Greedy Algorithms to Determine Stable Paths and Trees in Mobile Ad hoc Networks,” Chapter 14: pp. 253 – 272, Advances in Greedy Algorithms<\/i>, Editor: Witold Bednorz, ISBN: 978-953-7619-27-5, 586 pages, In-Tech Education and Publishing, Vienna, Austria, November 2008. Book Link<\/a><\/p>\n

<\/a>Peer-reviewed Abstract\/Poster Publications and Presentations<\/u><\/h3>\n

[37]<\/span>III<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “Breadth First Search-based Efficient Algorithm for Betweenness Centrality,”\u00a0<\/span>Proceedings of the ACM-Mid Southeast Conference<\/i>, p. 68, Gatlinburg, TN, November\u00a02015.<\/span><\/p>\n

[36]<\/span>III<\/sup>\u00a0<\/span>N. Meghanathan<\/b>, “Community Detection using Betweenness Centrality and Eigenvector Centrality,”\u00a0<\/span>Proceedings of the ACM-Mid Southeast Conference<\/i>, p. 70, Gatlinburg, TN, November\u00a02015.<\/span><\/p>\n

[35]IV<\/sup> N. Meghanathan<\/b>, “Design of an Algorithms for Bioinformatics Course for Computer Science Majors,” Proceedings of the 79th Annual Meeting of the Mississippi Academy of Sciences<\/i>, vol. 60, no. 1, p. 131, Hattiesburg, MS, February 2015. <\/p>\n

[34]I<\/sup> N. Meghanathan<\/b>, “A Local Spectrum Knowledge-based Routing Protocol for Cognitive Radio Ad hoc Networks,” Proceedings of the ACM-Mid Southeast Conference<\/i>, p. 75, Gatlinburg, TN, November 2014. PDF<\/a><\/p>\n

[33]IV<\/sup> N. Meghanathan<\/b>, “A Greedy Algorithm to Determine the Longest Suffix Prefix Overlap of two DNA Strings,” Proceedings of the ACM-Mid Southeast Conference<\/i>, p.74, Gatlinburg, TN, November 2014. PDF<\/a><\/p>\n

[32]IV<\/sup> N. Meghanathan<\/b>, “Dynamic Access Control Models for Cross-domain Authentication in Cloud Computing Environments,” Proceedings of the ACM-Mid Southeast Conference<\/i>, p. 74, Gatlinburg, TN, November 2013. PDF<\/a><\/p>\n

[31]IV<\/sup> N. Meghanathan<\/b>, “Attack Trees for Threat\/Risk Analysis of Software Security,” Journal of the Mississippi Academy of Sciences<\/i>, vol. 64, no. 1, p. 112, January 2013. PDF<\/a> [Publication as part of the NSF CCLI\/TUES Grant]<\/b><\/p>\n

[30]IV<\/sup> N. Meghanathan<\/b>, “Workshop: Incorporating Aspects of Systems and Software Security in Software Engineering Projects,” Journal of the Mississippi Academy of Sciences<\/i>, vol. 64, no. 1, p. 113, January 2013. PDF<\/a> [Publication as part of the NSF CCLI\/TUES Grant]<\/b><\/p>\n

[29]IV<\/sup> A. Overton, N. Meghanathan<\/b> and R. Isokpehi, “A Binary Code-based Finite State Machine Model to Determine Ancestor-Descendant Relationships in Directed Acyclic Graphs,” Proceedings of the ACM-Mid Southeast Conference<\/i>, p. 49, Gatlinburg, TN, November 2012. PDF<\/a> [Publication as part of the NSF REU and MS EPSCoR Grants]<\/b><\/p>\n

[28]IV<\/sup> S. Thumma and N. Meghanathan<\/b>, “Secure Software Design and Development Incorporating Role-based Access Control, Cryptographic Storage and Validation, and Parameterized SQL Statements,” Proceedings of the ACM-Mid Southeast Conference<\/i>, p. 57, Gatlinburg, TN, November 2012. PDF<\/a> [Publication as part of the NSF CCLI\/TUES Grant]<\/b><\/p>\n

[27]IV<\/sup> M. Bailey and N. Meghanathan<\/b>, “Implementation of a Virtual Network for Cloud Computing,” Proceedings of the ACM-Mid Southeast Conference<\/i>, p. 63, Gatlinburg, TN, November 2012. PDF<\/a>[Publication as part of the NSF REU Grant]<\/b><\/p>\n

[26]IV<\/sup> N. Meghanathan<\/b>, “Information Hiding through Cover Generation using Context-Free Grammar,” Journal of the Mississippi Academy of Sciences<\/i>, vol. 63, no. 1, p. 127, January 2012. PDF<\/a> [Publication as part of the NSF CCLI\/TUES Grant]<\/b><\/p>\n

[25]IV<\/sup> B. Chess, P. Fly, A. Moncrief, J. White, H. Kim and N. Meghanathan<\/b>, “A Secure Online Student-Advisor Appointment Management and Registration System,” Journal of the Mississippi Academy of Sciences<\/i>, vol. 57, no. 1, p. 127, January 2012. PDF<\/a> [Publication as part of the NSF CCLI\/TUES Grant]<\/b><\/p>\n

[24]IV<\/sup> J. Bouldin, J. Etheredge, J. Harris, H. Kim and N. Meghanathan<\/b>, “Simulation of a Secure Touch-Screen Kiosk System for Amusement Park Planning,” Journal of the Mississippi Academy of Sciences<\/i>, vol. 57, no. 1, p. 127, January 2012. PDF<\/a> [Publication as part of the NSF CCLI\/TUES Grant]<\/b><\/p>\n

[23]IV<\/sup> A. Komilov and N. Meghanathan<\/b>, “Development of a Web-based Application to Remotely Access the Computer Network Systems and Security Research and Education Modules at Jackson State University,” Proceedings of the ACM-Mid Southeast Conference<\/i>, Gatlinburg, TN, November 2011. [Publication as part of the NSF CCLI\/TUES Grant]<\/b><\/p>\n

[22]IV<\/sup> N. Meghanathan<\/b> and R. Isokpehi, “A Cross-Reference Data Mining Study of the Universal Stress Protein Datasets of Viridiplantae,” presented at The 8th Annual Conference of the Mid-South Computational Biology and Bioinformatics Society (MCBIOS 2011)<\/i>, College Station, TX, USA, April 1-2, 2011. PDF<\/a> [Publication as part of the NSF MS EPSCoR Grant]<\/b><\/p>\n

[21]IV<\/sup> N. Meghanathan<\/b> and R. Isokpehi, “On the Variations in the Cytotoxicity of Gold Nanoparticles of Different Shapes,” presented at The 8th Annual Conference of the Mid-South Computational Biology and Bioinformatics Society (MCBIOS 2011)<\/i>, College Station, TX, USA, April 1-2, 2011. PDF<\/a> [Publication as part of the NSF MS EPSCoR Grant]<\/b><\/p>\n

[20]IV<\/sup> P. Fly, N. Meghanathan<\/b> and R. Isokpehi, “Implementation of the Binary Coding Scheme to Test for Ancestor-Descendant Relationships in K-ary Trees,” The 8th Annual Conference of the Mid-South Computational Biology and Bioinformatics Society (MCBIOS 2011)<\/i>, College Station, TX, USA, April 1-2, 2011. [Publication as part of the NSF MS EPSCoR Grant]<\/b><\/p>\n

[19]IV<\/sup> J. Bouldin, S. Thumma, A. R. Geoghegan, M. Challagundla and N. Meghanathan<\/b>, “A Preliminary Design of a Virtual Security Laboratory for Information Systems and Software Engineering Projects,” Journal of the Mississippi Academy of Sciences<\/i>, vol. 56, no. 1, p. 100, February 2011.[Publication as part of the NSF CCLI\/TUES Grant] <\/b><\/p>\n

[18]III<\/sup> P. Fly, N. Meghanathan<\/b> and R. Isokpehi, “Use of Binary Codes to Determine Ancestor-Descendant Relationships in K-ary Trees,” Journal of the Mississippi Academy of Sciences<\/i>, vol. 56, no. 1, p. 102, February 2011. [Publication as part of the NSF MS EPSCoR Grant]<\/b><\/p>\n

[17]IV<\/sup> M. Challagundla, J. Bouldin, A. R. Geoghegan, N. Meghanathan<\/b> and H. Kim, “Role of Misuse Case Diagrams in Analyzing the Security Requirements of a Software Engineering Project,” Journal of the Mississippi Academy of Sciences<\/i>, vol. 56, no. 1, p. 103, February 2011. [Publication as part of the NSF CCLI\/TUES Grant] <\/b><\/p>\n

[16]II<\/sup> B. Torres, Q. Pang, G. Skelton, S. Bridges and N. Meghanathan <\/b>, “Integration of an RFID Reader to a Wireless Sensor Network and the Use of it to Identify an Individual Carrying RFID Tags,” abstract presented at the SACNAS (Society for Advancement of Chicanos and Native Americans in Science) National Conference<\/i>, September 30 – October 3, 2010; poster presented at the 2010 AGMUS Research Symposium <\/i>, September 10-11, 2010. [Publication as part of the NSF REU Grant]<\/b><\/p>\n

[15]IV<\/sup> N. Kostyuk, N. Meghanathan<\/b>, R. Isokpehi and H. H. P. Cohly, “Functional Status of Organ Systems in Mitral Valve Prolapse,” poster presented at the Jackson Heart Study 2010 Scientific Conference<\/i>, September 23-24, 2010.<\/p>\n

[14]IV<\/sup> N. Meghanathan<\/b>, N. Kostyuk, H. H. P. Cohly and R. D. Isokpehi, “A Clustering Model for English Language Anxiety in Non-Native Speakers,” Proceedings of The 7th Annual Conference of the Mid-South Computational Biology and Bioinformatics Society (MCBIOS 2010)<\/i>, p. 34, Jonesboro, AR, USA, February 2010. [Publication as part of the NSF MS EPSCoR Grant]<\/b><\/p>\n

[13]IV<\/sup> N. Meghanathan<\/b>, N. Kostyuk, H. H. P. Cohly and R. D. Isokpehi, “Quadrant-Based Modeling for Assessing Functional State of Human Organ Systems,” Proceedings of The 7th Annual Conference of the Mid-South Computational Biology and Bioinformatics Society (MCBIOS 2010)<\/i>, p. 98, Jonesboro, AR, USA, February 2010. [Publication as part of the NSF MS EPSCoR Grant]<\/b><\/p>\n

[12]I<\/sup> N. Meghanathan<\/b> and S. Gorla, “On the Probability of k-Connectivity in Mobile Ad hoc Networks,” Journal of the Mississippi Academy of Sciences<\/i>, vol. 55, no. 1, p. 112, February 2010.<\/p>\n

[11]IV<\/sup> N. Kostyuk, R. Rajnarayanan, R. Isokpehi, N. Meghanathan <\/b>, T. Bell and H. H. P. Cohly, “Non-invasive, Real-Time, Mobile Biometrics Device: Pilot Evaluation Studies,” Proceedings of The 7th Annual Conference of the Mid-South Computational Biology and Bioinformatics Society (MCBIOS 2010)<\/i>, p. 87, Jonesboro, AR, USA, February 2010.<\/p>\n

[10]I<\/sup> J. Miller and N. Meghanathan<\/b>, “Determining Maximum Vehicular Flow for City Evacuation Planning,” abstract poster presented at the Winter Simulation Conference, Austin, TX, December 2009. [Publication as part of the NSF REU Grant]<\/b><\/p>\n

[9]I<\/sup> D. Thomas, E. S. Addison and N. Meghanathan<\/b>, “Development of the Multicast Flow Oriented Routing Protocol for Mobile Ad hoc Networks,” Proceedings of the ACM-Mid Southeast Conference<\/i>, p. 30, Gatlinburg, TN, November 2009. [Publication as part of the NSF REU Grant]<\/b><\/p>\n

[8]II<\/sup> J. Henderson and N. Meghanathan<\/b>, “An Energy-aware Grid-Cluster Based Data Gathering Protocol for Wireless Sensor Networks,” Proceedings of the ACM-Mid Southeast Conference<\/i>, p. 36, Gatlinburg, TN, November 2009. [Publication as part of the NSF REU Grant]<\/b><\/p>\n

[7]IV<\/sup> P. Fly and N. Meghanathan<\/b>, “Implementation of Binary Tree Structures using Binary Codes,” Proceedings of the ACM-Mid Southeast Conference<\/i>, p. 50, Gatlinburg, TN, November 2009.<\/p>\n

[6]I<\/sup> M. C. Matthews and N. Meghanathan<\/b>, “Probability of Connectivity in a Grid Network of Wireless Nodes,” Proceedings of the HBCU-UP 2009 Conference<\/i>, p. A76, # 112, Washington DC, USA, October-November 2009.<\/p>\n

[5]IV<\/sup> T.\u00a0Oyeleye, R. D. Isokpehi, N. Meghanathan, H.\u00a0H. P. Cohly and T. Pei, “Bioinformatics Tools Categorizer,”\u00a0<\/span>Proceedings of the <\/i>Sixth International Symposium on Recent Advances in Environmental Health Research<\/em>, PA-48, Jackson, MS,\u00a0USA, September 2<\/span><\/span>009.\u00a0<\/span>Link<\/a> <\/span><\/p>\n

[4]IV<\/sup> S. Allam and N. Meghanathan<\/b>, “Development of an Automated Web-based Faculty Performance Evaluation Instrument,” Journal of the Mississippi Academy of Sciences<\/i>, vol. 54, no. 1, p. 88, February 2009.<\/p>\n

[3]III<\/sup> N. Meghanathan<\/b>, “Digital Medical Image Indexing using Attributed Relational Graph and Rectangular Tree,” Proceedings of the ACM Mid-Southeast Conference<\/i>, p. 70, Gatlinburg, TN, November 20 – 21, 2008.<\/p>\n

[2]I<\/sup> N. Meghanathan<\/b> and K. Mudunuri, “Simulation-based Analysis of the Bandwidth Usage and Number of Hops per Receiver for Mobile Ad Hoc Network Multicast Routing Protocols,” Journal of the Mississippi Academy of Sciences<\/i>, vol. 53, no. 1, p. 98, January 2008.<\/p>\n

[1]I<\/sup> N. Meghanathan<\/b>, “An Algorithm to Determine the Sequence of Stable Multicast Trees in Mobile Ad Hoc Networks,” Journal of the Mississippi Academy of Sciences<\/i>, vol. 51, no. 1, p. 92, February 2006.<\/p>\n

<\/a>Peer-reviewed Publication Profile of Natarajan Meghanathan<\/u><\/h3>\n\n\n\n\n\n\n\n\n
No.<\/span><\/th>\nResearch Area<\/span><\/th>\nJournal Papers<\/span><\/th>\nConference Papers<\/span><\/th>\nAbstracts<\/span><\/th>\n\u00a0\u00a0Book Chapters<\/span><\/th>\nBooks\/Videos<\/span><\/th>\n<\/tr>\n
I<\/span><\/td>\nWireless Ad hoc Networks<\/span><\/td>\n36<\/span><\/td>\n44<\/span><\/td>\n7<\/span><\/td>\n8<\/span><\/td>\n3<\/span><\/td>\n<\/tr>\n
II<\/span><\/td>\nWireless Sensor Networks<\/span><\/td>\n23<\/span><\/td>\n13<\/span><\/td>\n2<\/span><\/td>\n7<\/span><\/td>\n0<\/span><\/td>\n<\/tr>\n
III<\/span><\/td>\nNetwork Science and Graph Theory<\/span><\/td>\n44<\/span><\/td>\n21<\/span><\/td>\n2<\/span><\/td>\n6<\/span><\/td>\n4<\/span><\/td>\n<\/tr>\n
IV<\/span><\/td>\nOther Areas: Binformatics, Cyber Security<\/span><\/td>\n4<\/span><\/td>\n15<\/span><\/td>\n26<\/span><\/td>\n6<\/span><\/td>\n2<\/span><\/td>\n<\/tr>\n
<\/td>\nTotal Publications <\/span><\/td>\n107<\/span><\/td>\n93<\/span><\/td>\n37<\/span><\/td>\n27<\/span><\/td>\n9<\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

 <\/p>\n","protected":false},"excerpt":{"rendered":"

Areas of Research Interests Wireless Ad hoc NetworksI, \u00a0 Sensor NetworksII, \u00a0 Network Science and Graph TheoryIII, \u00a0\u00a0 Other Areas (incl. Bioinformatics, Cyber Security)IV Peer-reviewed Journal Papers Peer-reviewed Conference Papers Books\/Videos Book Chapters Abstracts and Poster Presentations Publication Profile Peer-reviewed Journals [107]III N. Meghanathan, \u201cA Comprehensive Analysis of the Correlation between Maximal Clique Size and […]<\/p>\n","protected":false},"author":168,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0},"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages\/38"}],"collection":[{"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/users\/168"}],"replies":[{"embeddable":true,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/comments?post=38"}],"version-history":[{"count":5,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages\/38\/revisions"}],"predecessor-version":[{"id":3494,"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/pages\/38\/revisions\/3494"}],"wp:attachment":[{"href":"https:\/\/www.jsums.edu\/nmeghanathan\/wp-json\/wp\/v2\/media?parent=38"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}