Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Kannan Govindan is active.

Publication


Featured researches published by Kannan Govindan.


IEEE Communications Surveys and Tutorials | 2012

Trust Computations and Trust Dynamics in Mobile Adhoc Networks: A Survey

Kannan Govindan; Prasant Mohapatra

Trust is an important aspect of mobile adhoc networks (MANETs). It enables entities to cope with uncertainty and uncontrollability caused by the free will of others. Trust computations and management are highly challenging issues in MANETs due to computational complexity constraints, and the independent movement of component nodes. This prevents the direct application of techniques suited for other networks. In MANETs, an untrustworthy node can wreak considerable damage and adversely affect the quality and reliability of data. Therefore, analyzing the trust level of a node has a positive influence on the confidence with which an entity conducts transactions with that node. In this work we present a detailed survey on various trust computing approaches that are geared towards MANETs. We highlight the summary and comparisons of these approaches. In addition, we analyze various works on trust dynamics including trust propagation, prediction and aggregation algorithms, the influence of network dynamics on trust dynamics and the impact of trust on security services.


IEEE Wireless Communications | 2010

Non-cryptographic authentication and identification in wireless networks [Security and Privacy in Emerging Wireless Networks]

Kai Zeng; Kannan Govindan; Prasant Mohapatra

Lower/physical layer characteristics have been considered as potential alternatives/complements to provide security services in wireless networks. This article provides an overview of various noncryptographic mechanisms for user authentication and device identification in wireless networks using lower/physical layer properties or information. We discuss merits and demerits of these authentication/identification schemes and the practical implementation issues. Future research on cross-layer security design concludes this article.


world of wireless mobile and multimedia networks | 2012

Edge-prioritized channel- and traffic-aware uplink Carrier Aggregation in LTE-advanced systems

Rajarajan Sivaraj; Amit Pande; Kai Zeng; Kannan Govindan; Prasant Mohapatra

LTE-Advanced (LTE-A) systems support wider transmission bandwidths and hence, higher data rates for bulk traffic, as a result of Carrier Aggregation (CA). However, existing literature lacks efforts on channel-aware CA, especially in the uplink. The cell-edge users particularly suffer from exhaustion of resources, higher fading losses, lower SINR values (hence, requiring a higher power consumption) due to lossy channels that their traffic requirements are least-satisfied by channel-blind CA. This paper addresses the above concern by proposing an edge-prioritized channel- and traffic-aware uplink CA comprising Component Carrier (CC) assignment and resource scheduling. The LTE-A UEs are spatially-grouped and the under-represented edge UE groups, having the least assignable resources (good CCs), are prioritized for CA. This results in assigning the best channels to the edge groups. The frequency resources are scheduled to the groups based on inter-group and intra-group Proportional Fair Packet Scheduling (PFPS) in the time and frequency domains respectively, to resolve resource contention. The proposed approach outperforms the existing channel-blind Round-Robin and channel-aware Opportunistic CA, in terms of overall uplink throughput, by 33% in CC assignment and 21% in PFPS, in addition to significant throughput improvements for the edge UEs.


international conference on computer communications | 2011

Identity-based attack detection in mobile wireless networks

Kai Zeng; Kannan Govindan; Daniel Wu; Prasant Mohapatra

Identity-based attacks (IBAs) are one of the most serious threats to wireless networks. Recently, received signal strength (RSS) based detection mechanisms were proposed to detect IBAs in static networks. Although mobility is an inherent property of wireless networks, limited work has addressed IBA detection in mobile scenarios. In this paper, we propose a novel RSS based technique, Reciprocal Channel Variation-based Identification (RCVI), to detect IBAs in mobile wireless networks. RCVI takes advantage of the location decorrelation, randomness, and reciprocity of the wireless fading channel to decide if all packets come from a single sender or more. If the packets are only coming from the genuine sender, the RSS variations reported by the sender should be correlated with the receivers observations. Otherwise, the correlation should be degraded, then an attack can be flagged. We evaluate RCVI through theoretical analysis, and validate it through experiments using off-the-shelf 802.11 devices under different attacking patterns in real indoor and outdoor mobile scenarios. We show that RCVI can detect IBAs with a high probability even when the attacker is half a meter away from the genuine user.


global communications conference | 2010

Provenance-Based Information Trustworthiness Evaluation in Multi-Hop Networks

Xinlei Wang; Kannan Govindan; Prasant Mohapatra

In this paper, we present a trust model to evaluate the trustworthiness of information as well as the information publishing nodes based on the information provenance. We consider two factors in evaluating the provenance-based information trust: Path Similarity and Information Similarity. In multihop networks, information can flow through multiple hops from multiple paths. We model the similarity between different paths which deliver information about the same event and the similarity between two information items about the same event which are delivered through different paths. Both path and information similarity factors are considered in determining the trust of the information. This information trust is indeed used as a feedback factor to adaptively adjust trust of the nodes in the network. Detailed analysis of the proposed approach is presented along with simulation results for validation.


sensor mesh and ad hoc communications and networks | 2011

Collusion-resilient quality of information evaluation based on information provenance

Xinlei Wang; Kannan Govindan; Prasant Mohapatra

The quality of information is crucial for decision making in many dynamic information sharing environments such as sensor and tactical networks. Information trustworthiness is an essential parameter in assessing the information quality. In this paper, we present a trust model to evaluate the trustworthiness of information as well as information publishing entities based on information provenance. In our trust model, decision makers can give an evaluation on the information they receive and further adjust the evaluation result to a more accurate value by considering two factors: information similarity and path difference. We introduce Collusion Attacks that may bias the computation and present a mechanism to detect and reduce the effect of Collusion Attacks. Based on the final adjusted information trust, feedback is given to the information publishing nodes to adaptively update their trust scores. Therefore, our collusion-resistant scheme can dynamically assess the trustworthiness of information as well as participating entities in a network and thus effectively enhance the network security. Detailed analysis of the proposed approach is presented along with simulation results.


IEEE Transactions on Wireless Communications | 2011

Probability Density of the Received Power in Mobile Networks

Kannan Govindan; Kai Zeng; Prasant Mohapatra

Probability density of the received power is well analyzed for wireless networks with static nodes. However, most of the present days networks are mobile and not much exploration has been done on statistical analysis of the received power for mobile networks in particular, for the network with random moving patterns. In this paper, we derive probability density of the received power for mobile networks with random mobility models. We consider the power received at an access point from a particular mobile node. Two mobility models are considered: Random Direction (RD) model and Random way-point (RWP) model. Wireless channel is assumed to have a small scale fading of Rayleigh distribution and path loss exponent of 4. 3D, 2D and 1D deployment of nodes are considered. Our findings show that the probability density of the received power for RD mobility models for all the three deployment topologies are weighted confluent hypergeometric functions. In case of RWP mobility models, the received power probability density for all the three deployment topologies are linear combinations of confluent hypergeometric functions. The analytical results are validated through NS2 simulations and a reasonably good match is found between analytical and simulation results.


military communications conference | 2012

Chaining for securing data provenance in distributed information networks

Xinlei Wang; Kai Zeng; Kannan Govindan; Prasant Mohapatra

Entities in an information communication network may use various types of collaborative networking for sharing information such as documents, sensing reports, datasets, etc. The derivation history (i.e., the provenance) of the information plays a very important role in such a networking environment. For example, provenance can be used for information trustworthiness assessment, copyright clearance, data reconciliation, and data replication. While substantial research efforts have focused on these usages of provenance, very limited work has focused on the security issues of the provenance, which is the prerequisite of any provenance-based information analysis systems. In this paper, we explore the security properties of provenance meta-data compared to other general user data in a distributed network environment. We introduce a “chain-structure” provenance scheme to provide security assurance for the provenance meta-data in three dimensions - confidentiality, integrity and availability. Our scheme outperforms the previously proposed “onion-structure” provenance security scheme in terms of the flexibility, protection capability as well as computational overhead.


military communications conference | 2011

PRONET: Network trust assessment based on incomplete provenance

Kannan Govindan; Xinlei Wang; Mohammad Maifi Hasan Khan; Gulustan Dogan; Kai Zeng; Gerald M. Powell; Ted Brown; Tarek F. Abdelzaher; Prasant Mohapatra

This paper presents a tool ProNet, that is used to obtain the network trust based on incomplete provenance. We consider a multihop scenario where a set of source nodes observe an event and disseminate their observations as an information item through a multihop path to the command center. Nodes are assumed to embed their provenance details on the information content. Received provenance may not be complete at the command center due to attackers dropping provenance or the unavailability of provenance. We design ProNet, a tool which is at the command center that acts on the received information item to determine the information trust, node-level trust and sequence-level trust. ProNet contains three steps. In the first step it reconstructs the complete provenance details of received information from the available provenance. In the second step it employs a data classification scheme to classify the data into a good and bad pool. In the third step it employs pattern mining on the reconstructed provenance of bad data pools to determine the frequently appearing node and node sequence. This frequent appearance will quantify the trust level of nodes and node sequence. Now an information quality/trust level of newly received information can be determined based on the occurrences of these node/sequence patterns on the provenance data. We provide a detailed analysis on false positive and false negatives.


military communications conference | 2011

Evaluation of network trust using provenance based on distributed local intelligence

Gulustan Dogan; Theodore Brown; Kannan Govindan; Hasan Khan Mohammad Maifi; Tarek F. Abdelzaher; Prasant Mohapatra; Jin Hee Cho

Provenance can play a significant role in a military information system for supporting the calculation of information trust. A nodes trust can change over time after its initial deployment due to various reasons such as energy loss, environmental conditions or exhausting sources. We introduce a node-level trust-enhancing mechanism for information networks using provenance. A unique characteristic of the proposed trust architecture presented here is the use of provenance through the path of the information from source to destination in determining the information trust. In this proposed architecture each node in the system has a trust and provenance vector. Each information item transmitted over the network has a trust value associated with it. Nodes reexamine and update the trust value associated with the information, creating a distributed system that is more flexible and more responsive. As our system allows reconfigurations, initiatives taken by the intermediate nodes such as replacement of untrusted nodes will enhance the network trust in mission critical situations faster than a centralized approach.

Collaboration


Dive into the Kannan Govindan's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar

Kai Zeng

George Mason University

View shared research outputs
Top Co-Authors

Avatar

Xinlei Wang

University of California

View shared research outputs
Top Co-Authors

Avatar

Gulustan Dogan

City University of New York

View shared research outputs
Top Co-Authors

Avatar

Amit Pande

University of California

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Ningning Cheng

University of California

View shared research outputs
Top Co-Authors

Avatar

Theodore Brown

City University of New York

View shared research outputs
Top Co-Authors

Avatar

Daniel Wu

University of California

View shared research outputs
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge