The low-energy characteristics of Wireless Sensor Networks (WSNs) pose a great design challenge for MAC protocol design. The cluster-based scheme is a promising solution. Recent studies have proposed different cluster-based MAC protocols. We propose an intra-cluster communication bit-map-assisted (BMA) MAC protocol. BMA is intended for event-driven applications. The scheduling of BMA can change dynamically according to the unpredictable variations of sensor networks. In terms of energy efficiency, BMA reduces energy consumption due to idle listening and collisions. In this study, we develop two different analytic energy models for BMA, conventional TDMA and energy efficient TDMA (E-TDMA) when used as intra-cluster MAC schemes. Simulation experiments are constructed to validate the analytic models. Both analytic and simulation results show that in terms of energy efficiency, BMA performance heavily depends on the sensor node traffic offer load, the number of sensor nodes within a cluster, the data packet size and, in some cases, the number of sessions per round. BMA is superior for the cases of low and medium traffic loads, relatively few sensor nodes per cluster, and relatively large data packet sizes. In addition, BMA outperforms the TDMA-based MAC schemes in terms of average packet latency.

No description available.

No description available.

No description available.

No description available.

No description available.

Today’s data centers (DCs) consume up to 3% of the energy produced worldwide, much of which is wasted due to over-cooling and underutilization of IT equipment. This wastage in part stems from the lack of real-time visibility of fine-grained thermal distribution in DCs. Wireless sensing is an ideal candidate for DC monitoring as it is cost-effective, facility-friendly, and can be easily re-purposed. In this thesis, we develop LEMoNet, a novel low-energy wireless sensor network design for monitoring co-location DCs. It employs a two-tier network architecture and a multi-mode data exchange protocol to balance the trade-offs between low power consumption and high data reliability. We have evaluated the performance of LEMoNet by deploying custom-designed sensor and gateway nodes in a SHARCNET DC at A.N. Bourns Science Building. We show experimentally that LEMoNet achieves an average data yield of over 98%. Under normal operations with one temperature and one humidity reading every thirty seconds, the battery lifetime of LEMoNet sensor nodes is projected to be 14.9 years on a single lithium coin battery. / Thesis / Master of Science (MSc)

No / Recently there has been an exponential rise in the use of Wireless Sensor Networks (WSNs) in various applications. While WSNs have been primarily used as independent networks, researchers are now looking into ways of integrating them with other existing networks. One such network is the satellite network which provides a reliable communication backbone to remote areas that lack appropriate terrestrial infrastructure. However, due to the integration of the two networks with different transmission and operational characteristics interoperability and security become major concerns. This paper presents an ns-2 based simulation framework of a WSN-satellite integrated network that is used to evaluate the effects of data aggregation and security mechanisms on overall network performance. The average end-to-end packet delay, overall energy consumption and aggregation efficiency are considered for this analysis. This paper also looks into the effects of implementing hop-by-hop security and end-to-end security and justifies the need for end-to-end security in the WSN-satellite integrated networks.

Over the past fifteen years, advances in Micro-Electro-Mechanical Systems (MEMS) technology have enabled rapid development of wireless sensor networks (WSNs). A WSN consists of a large number of sensor nodes that are typically powered by batteries. Each sensor node collects useful information from its environment, and forwards this data to a base station through wireless communications. Applications of WSNs include environmental monitoring, industrial monitoring, agriculture, smart home monitoring, military surveillance, to name a few. Due to battery constraint at each sensor node, a fundamental challenge for a WSN is its limited operational lifetime -- the amount of time that the network can remain operational before some or all of the sensor nodes run out of battery. To conserve energy and prolong the lifetime of a WSN, there have been active research efforts across all network layers. Although these efforts help conserve energy usage and prolong network lifetime to some extent, energy and lifetime remain fundamental bottlenecks and are the key factors that hinder the wide-scale deployment of WSNs. This dissertation addresses the energy problem of a WSN by exploiting a recent breakthrough in wireless energy transfer (WET) technology. This breakthrough WET technology is based on the so-called magnetic resonant coupling (MRC), which allows electric energy to be transferred from a source coil to a receive coil without any plugs or wires. The advantages of MRC are high energy transfer efficiency even under omni-direction, not requiring line-of-sight (LOS), and being robust against environmental conditions. Inspired by this enabling WET technology, this dissertation focuses on applying MRC to a WSN and on studying how to optimally use this technology to address lifetime problem for a WSN. The goal is to fundamentally remove lifetime bottleneck for a WSN. The main contributions of this dissertation are summarized as follows: 1. Single-node Charging for a Sparse WSN. We first investigate how MRC can be applied to a WSN so as to remove the lifetime performance bottleneck in a WSN, i.e., allowing a WSN to remain operational forever. We consider the scenario of a mobile wireless charging vehicle (WCV) periodically traveling inside the sensor network and charging each sensor node's battery wirelessly. We introduce the concept of renewable energy cycle and offer both necessary and sufficient conditions for a sensor node to maintain its renewable energy cycle. We study an optimization problem, with the objective of maximizing the ratio of the WCV's vacation time over the cycle time. For this problem, we prove that the optimal traveling path for the WCV is the shortest Hamiltonian cycle and uncover a number of important properties. Subsequently, we develop a near-optimal solution by a piecewise linear approximation technique and prove its performance guarantee. This first study shows that network lifetime bottleneck can be fundamentally resolved by WET. 2. Multi-node Charging for a Dense WSN. We next exploit recent advances in MRC that allows multiple sensor nodes to be charged at the same time, and show how MRC with multi-node charging capability can address the scalability problem associated with the single-node charging technology. We consider a WCV that periodically travels inside a WSN and can charge multiple sensor nodes simultaneously. Based on the charging range of the WCV, we propose a cellular structure that partitions the two-dimensional plane into adjacent hexagonal cells. We pursue a formal optimization framework by jointly optimizing the traveling path of the WCV, flow routing among the sensor nodes, and the charging time with each hexagonal cell. By employing discretization and a novel Reformulation-Linearization Technique (RLT), we develop a provably near-optimal solution for any desired level of accuracy. Through numerical results, we demonstrate that our solution can indeed address the scalability problem for WET in a dense WSN. 3. Bundling Mobile Base Station and Wireless Energy Transfer: The Pre-planned Path Case. Our aforementioned work is based on the assumption that the location of base station is fixed and known in the WSN. On the other hand, it has been recognized that a mobile base station (MBS) can offer significant advantages over a fixed one. But employing two separate vehicles, one for WET and one for MBS, could be expensive and hard to manage. So a natural question to ask is: can we bundle WET and MBS on the same vehicle? This is the focus of this study. Here, our goal is to minimize energy consumption of the entire system while ensuring that none of the sensor nodes runs out of energy. To simplify the problem, we assume that the path for the vehicle is given a priori. We develop a mathematical model for this problem. Instead of studying the general problem formulation (called CoP-t), which is time-dependent, we show that it is sufficient to study a special subproblem (called CoP-s), which only involves space-dependent variables. Subsequently, we develop a provable near-optimal solution to CoP-s with the development of several novel techniques including discretizing a continuous path into a finite number of segments and representing each segment with worst-case energy bounds. 4. Bundling Mobile Base Station and Wireless Energy Transfer: The Unconstrained Path Case. Based on our experience for the pre-planned path case, we further study the problem where the traveling path of the WCV (also carrying the MBS) can be unconstrained. That is, we study an optimization problem that jointly optimizes the traveling path, stopping points, charging schedule, and flow routing. For this problem, we propose a two-step solution. First, we study an idealized problem that assumes zero traveling time, and develop a provably near-optimal solution to this idealized problem. In the second step, we show how to develop a practical solution with non-zero traveling time and quantify the performance gap between this solution and the unknown optimal solution to the original problem. This dissertation offers the first systematic investigation on how WET (in particular, the MRC technology) can be exploited to address lifetime bottleneck of a WSN. It lays the foundation of exploring WET for WSNs and other energy-constrained wireless networks. On the mathematical side, we have developed or applied a number of powerful techniques such as piecewise linear approximation, RLT, time-space transformation, discretization, and logical point representation that may be applicable to address a broad class of optimization problems in wireless networks. We expect that this dissertation will open up new research directions on many interesting networking problems that can take advantage of the WET technology. / Ph. D.

Large-scale wireless sensor networks (WSNs) are highly vulnerable to attacks because they consist of numerous resource-constrained devices and communicate via wireless links. These vulnerabilities are exacerbated when WSNs have to operate unattended in a hostile environment, such as battlefields. In such an environment, an adversary poses a physical threat to all the sensor nodes. An adversary may capture any node, compromising critical security data including keys used for encryption and authentication. Consequently, it is necessary to provide security services to these networks to ensure their survival. We propose a novel, self-organizing key management scheme for large-scale and long-lived WSNs, called Survivable and Efficient Clustered Keying (SECK). SECK provides administrative services that ensures the survivability of the network. SECK is suitable for managing keys in a hierarchical WSN consisting of low-end sensor nodes clustered around more capable gateway nodes. Using cluster-based administrative keys, SECK provides five efficient security administration mechanisms: 1) clustering and key setup, 2) node addition, 3) key renewal, 4) recovery from multiple node captures, and 5) re-clustering. All of these mechanisms have been shown to localize the impact of attacks and considerably improve the efficiency of maintaining fresh session keys. Using simulation and analysis, we show that SECK is highly robust against node capture and key compromise while incurring low communication and storage overhead. / Master of Science