Sanjeev Setia

Bio: Sanjeev Setia is an academic researcher from George Mason University. The author has contributed to research in topics: Wireless sensor network & Key distribution in wireless sensor networks. The author has an hindex of 33, co-authored 66 publications receiving 5600 citations. Previous affiliations of Sanjeev Setia include University of Maryland, College Park.

Reliable bulk data dissemination in sensor networks

Abstract: A wireless sensor network consists of a large number of resource-constrained sensor nodes that are self-organized into a multi-hop network and cooperate on a single task. In many situations, sensor networks need to run for a long time once deployed. When the environment changes during their lifetime, updating the code image or application data at the node for a new task becomes necessary, thus making data dissemination a critical issue where a large data object needs to be reliably propagated to all of the nodes in a network. While most of the current sensor nodes are equipped with a multiple-channel radio, the existing data dissemination approaches such as Deluge [1] do not take advantage of multiple channels. Moreover, these approaches mostly focus on the object delivery latency, while energy efficiency is also very important due to the resource constraints of the sensor nodes. This dissertation proposes three novel protocols for reliable bulk data dissemination, named McTorrent, CORD and McCORD, that focus on both object delivery latency and energy efficiency. These protocols use multiple channels, or a core-based two-phase approach, or both techniques to reduce object delivery latency and energy consumption at each node. The results from experiments on both indoor and outdoor testbeds and extensive simulations in various scenarios show that these protocols significantly reduce the latency and/or energy consumption, compared to the existing approaches.

Scheduling on multiprogrammed, distributed memory parallel computers

Abstract: Multicomputers, consisting of a large number of processors interconnected by a high-speed network, are rapidly becoming an important platform for a large body of scientific computations. While the raison d'etre of multicomputers is to provide high performance to individual applications, cost and efficiency considerations make it necessary to share these systems among multiple applications. Multicomputers have traditionally space-shared the system processors among multiple programs using a static partitioning policy. In this dissertation, we present alternative strategies for scheduling multiple programs on multicomputers and show that they result in improved system throughput and utilization in comparison to existing policies. We first show that, for good performance, the system scheduling policy must modify its processor allocation decisions in response to changes in the system load. Further, the performance of an adaptive scheduling policy depends upon the ability of the system scheduler to distinguish between jobs with large differences in execution times when making processor allocation decisions. Based on these insights, we propose a simple (and practical) adaptive space-sharing policy, that is applicable to general-purpose systems, and show that the performance of the policy is superior to that of static policies. We also consider a dynamic space-sharing policy, under which a program's partition size can change during its execution. Our results indicate that, despite its relatively high cost, dynamic space-sharing results in improved performance for workloads with long-running programs. We describe an application-directed scheme for the dynamic reconfiguration entailed by dynamic space-sharing and present experimental results for the overhead of this scheme on the CM5. Next, we consider the performance of scheduling policies that time-share a partition of processors among multiple programs. We illustrate the conditions under which time-sharing results in improved system performance over space-sharing and examine performance tradeoffs between two different approaches to time-sharing--gang-scheduling and independent time-slicing. Our results show that while gang-scheduling is essential for programs that synchronize relatively frequently, independent time-slicing leads to improved performance for medium and coarse grained programs, particularly at moderate to heavy system loads.

Fundamentals of Queueing Theory

Abstract: Praise for the Third Edition: "This is one of the best books available. Its excellent organizational structure allows quick reference to specific models and its clear presentation . . . solidifies the understanding of the concepts being presented."IIE Transactions on Operations EngineeringThoroughly revised and expanded to reflect the latest developments in the field, Fundamentals of Queueing Theory, Fourth Edition continues to present the basic statistical principles that are necessary to analyze the probabilistic nature of queues. Rather than presenting a narrow focus on the subject, this update illustrates the wide-reaching, fundamental concepts in queueing theory and its applications to diverse areas such as computer science, engineering, business, and operations research.This update takes a numerical approach to understanding and making probable estimations relating to queues, with a comprehensive outline of simple and more advanced queueing models. Newly featured topics of the Fourth Edition include:Retrial queuesApproximations for queueing networksNumerical inversion of transformsDetermining the appropriate number of servers to balance quality and cost of serviceEach chapter provides a self-contained presentation of key concepts and formulae, allowing readers to work with each section independently, while a summary table at the end of the book outlines the types of queues that have been discussed and their results. In addition, two new appendices have been added, discussing transforms and generating functions as well as the fundamentals of differential and difference equations. New examples are now included along with problems that incorporate QtsPlus software, which is freely available via the book's related Web site.With its accessible style and wealth of real-world examples, Fundamentals of Queueing Theory, Fourth Edition is an ideal book for courses on queueing theory at the upper-undergraduate and graduate levels. It is also a valuable resource for researchers and practitioners who analyze congestion in the fields of telecommunications, transportation, aviation, and management science.

LEAP: efficient security mechanisms for large-scale distributed sensor networks

Abstract: In this paper, we describe LEAP (Localized Encryption and Authentication Protocol), a key management protocol for sensor networks that is designed to support in-network processing, while at the same time restricting the security impact of a node compromise to the immediate network neighborhood of the compromised node. The design of the protocol is motivated by the observation that different types of messages exchanged between sensor nodes have different security requirements, and that a single keying mechanism is not suitable for meeting these different security requirements. LEAP supports the establishment of four types of keys for each sensor node -- an individual key shared with the base station, a pairwise key shared with another sensor node, a cluster key shared with multiple neighboring nodes, and a group key that is shared by all the nodes in the network. The protocol used for establishing and updating these keys is communication- and energy-efficient, and minimizes the involvement of the base station. LEAP also includes an efficient protocol for inter-node traffic authentication based on the use of one-way key chains. A salient feature of the authentication protocol is that it supports source authentication without precluding in-network processing and passive participation. We analyze the performance and the security of our scheme under various attack models and show our schemes are very efficient in defending against many attacks.

Security of the Internet of Things: perspectives and challenges

Abstract: Internet of Things (IoT) is playing a more and more important role after its showing up, it covers from traditional equipment to general household objects such as WSNs and RFID. With the great potential of IoT, there come all kinds of challenges. This paper focuses on the security problems among all other challenges. As IoT is built on the basis of the Internet, security problems of the Internet will also show up in IoT. And as IoT contains three layers: perception layer, transportation layer and application layer, this paper will analyze the security problems of each layer separately and try to find new problems and solutions. This paper also analyzes the cross-layer heterogeneous integration issues and security issues in detail and discusses the security issues of IoT as a whole and tries to find solutions to them. In the end, this paper compares security issues between IoT and traditional network, and discusses opening security issues of IoT.