Natarajan Meghanathan

We define the aggregation delay as the minimum number of time slots it takes for the data to be aggregated in a Data Gathering tree (DG tree) spanning all the nodes of the sensor...

We propose an eigenvector centrality-based tracking algorithm to trace the trajectory of a mobile Radioactive Dispersal Device (RDD) in a wireless sensor network. The sink...

The set of nodes constituting a minimum connected dominating set (MCDS) in a wireless ad hoc network (WANET) could be considered as the minimum number of nodes that are required...

The authors model the contiguous states (48 states and the District of Columbia) of the United States (US) as an undirected network graph with each state represented as a node...

The authors present correlation analysis between the centrality values observed for nodes (a computationally lightweight metric) and the maximal clique size (a computationally...

The authors propose a generic graph intersection-based benchmarking algorithm to arrive at upper bounds for the lifetimes of any communication topology that spans the entire...

The lack of clear communication, especially internationally, plagues the modern world in a variety of fields. Researchers and practitioners within the modern networking and...

The authors investigate the use of centrality metrics as node weights to determine connected dominating sets (CDS) for a suite of 60 real-world network graphs of diverse degree...

Social network analysis has created novel opportunities within the field of data science. The complexity of these networks requires new techniques to optimize the extraction of...

As network science and technology continues to gain popularity, it becomes imperative to develop procedures to examine emergent network domains, as well as classical networks, to...

We model the contiguous states (48 states and the District of Columbia) of the United States (US) as an undirected network graph with each state represented as a node and there...

We present correlation analysis between the centrality values observed for nodes (a computationally lightweight metric) and the maximal clique size (a computationally hard...

We propose a generic graph intersection-based benchmarking algorithm to arrive at upper bounds for the lifetimes of any communication topology that spans the entire network of...

We analyze the impact of the structure of the Data Gathering (DG) trees on node lifetime (round of first node failure) and network lifetime (minimum number of rounds by which the...

We define the aggregation delay as the minimum number of time slots it takes for the data to be aggregated in a Data Gathering tree (DG tree) spanning all the nodes of the sensor...

We propose an eigenvector centrality-based tracking algorithm to trace the trajectory of a mobile Radioactive Dispersal Device (RDD) in a wireless sensor network. The sink...

This Preface is included in the book Advanced Methods for Complex Network Analysis.

This chapter presents three algorithms to determine stable connected dominating sets (CDS) for wireless mobile ad hoc networks (MANETs) whose topology changes dynamically with...

The authors propose a graph intersection-based benchmarking algorithm to determine the sequence of longest-living stable data gathering trees for wireless mobile sensor networks...

In the first half of the chapter, the authors provide a comprehensive description of two broad categories of data gathering algorithms for wireless sensor networks: the classical...

The focus of this chapter is two-fold: It first presents the classical network attacks (such as Session Hijacking, Man-in-the-Middle attack, DNS attacks, Distributed Denial of...

Radio interference is a problem that has plagued air communication since its inception. Advances in cognitive radio science help to mitigate these concerns. Cognitive Radio...

A cognitive radio (CR) is a radio that can change its transmission parameters based on the perceived availability of the spectrum bands in its operating environment. CRs support...

The high-level contribution of this book chapter is to illustrate how to conduct static code analysis of a software program and mitigate the vulnerabilities associated with the...

Various simulators (e.g., ns-2 and GloMoSim) are available to implement and study the behavior of the routing protocols for Mobile Ad hoc Networks (MANETs). However, students and...

The authors propose a beaconless, on-demand, mobile ad hoc network routing protocol called minimum interference based routing protocol (MIF) that minimizes the end-to-end delay...

This paper develops an energy-aware connected dominating set based data gathering (ECDS-DG) algorithm for wireless sensor networks. The algorithm includes only nodes that have a...

In this paper, the author proposes an algorithm to determine a stable Connected Dominating Set (CDS) for Mobile Ad hoc Networks (MANETs) based on the notion of a metric called...

This chapter presents an exhaustive survey on the different categories of topology-based multicast routing protocols that have been proposed for mobile ad hoc networks (MANETs)....

Wireless sensor networks comprise of vast numbers of sensor nodes deployed to monitor a particular event (fire, intrusion, etc.) or measure a parameter (like temperature...

The authors propose a beaconless, on-demand, mobile ad hoc network routing protocol called minimum interference based routing protocol (MIF) that minimizes the end-to-end delay...