No description available.

No description available.

No description available.

No description available.

No description available.

No description available.

Wireless sensor networks are an indispensable tool in this highly connected world. WSNs have been the focus of research efforts in areas of communication, electronics and control for many years. Advancements in the fields of MEMS, RF and digital circuit technology has led to the development of low cost and extremely power efficient smart sensors. This has led to the need of a fast, reliable and inexpensive method of consensus building for these sensor networks. Basic concepts of graph theory and consensus building are explained in this thesis. This thesis reviews the models and strategies for consensus building present in the literature. The shortcomings of these models are explained through examples and a leader-follower model based consensus building strategy is presented. Algorithm to convert any graph into a bipartite graph by edge removal and a strategy to select effective leaders based on a weighted combination of node centrality, ratio of leaders to the total number of nodes and presence of leaf nodes in the group is presented in this thesis. Proposed leader-follower model is compared against classic models for consensus building are compared and proven to be better. Mobility is studied using deterministic and random mobility models to show the improvement in convergence rate of the network. It is shown that mobility can turn any disconnected network into a connected network, which is able to reach consensus.

Energy efficiency is a critical feature of wireless sensor networks (WSNs), because sensor nodes run on batteries that are generally difficult to recharge once deployed. For target tracking---one of the most important WSN application types---energy efficiency needs to be considered in various forms and shapes, such as idle listening, trajectory estimation, and data propagation. In this dissertation, we study three correlated problems on energy efficient target tracking in WSNs: sleep scheduling, particle filtering, and constrained flooding. We develop a Target Prediction and Sleep Scheduling protocol (TPSS) to improve energy efficiency for idle listening. We start with designing a target prediction method based on both kinematics and probability. Based on target prediction and proactive wake-up, TPSS precisely selects the nodes to awaken and reduces their active time, so as to enhance energy efficiency with limited tracking performance loss. In addition, we expand Sleep Scheduling to Multiple Target Tracking (SSMTT), and further reduce the energy consumption by leveraging the redundant alarm messages of interfering targets. Our simulation-based experimental studies show that compared to existing protocols such as Circle scheme and MCTA, TPSS and SSMTT introduce an improvement of 25% ~ 45% on energy efficiency, at the expense of only 5% ~ 15% increase on the detection delay. Particle Filtering is one of the most widely used Bayesian estimation methods, when target tracking is considered as a dynamic state estimation problem for trajectory estimation. However, the significant computational and communication complexity prohibits its application in WSNs. We design two particle filters (PFs)---Vector space based Particle Filter (VPF) and Completely Distributed Particle Filter (CDPF)---to improve energy efficiency of PFs by reducing the number of particles and the communication cost. Our experimental evaluations show that even though VPF incurs 34% more estimation error than RPF, and CDPF incurs a similar estimation error to SDPF, they significantly improve the energy efficiency by as much as 68% and 90% respectively. For data propagation, we present a Constrained Flooding protocol (CFlood) to enhance energy efficiency by increasing the deadline satisfaction ratio per unit energy consumption of time-sensitive packets. CFlood improves real-time performance by flooding, but effectively constrains energy consumption by controlling the scale of flooding---i.e., flooding only when necessary. If unicasting meets the distributed sub-deadline at a hop, CFlood aborts further flooding even after flooding has occurred in the current hop. Our simulation-based experimental studies show that CFlood achieves higher deadline satisfaction ratio per unit energy consumption by as much as 197%, 346%, and 20% than existing multipath forwarding protocols, namely, Mint Routing, MCMP and DFP respectively, especially in sparsely deployed or unreliable sensor network environments. To verify the performance and efficiency of the dissertation's solutions, we developed a prototype implementation based on TelosB motes and TinyOS version 2.1.1. In the field experiments, we compared TPSS, VPF, CDPF, and CFlood algorithms/protocols to their respective competing efforts. Our implementation measurements not only verified the rationality and feasibility of the proposed solutions for target tracking in WSNs, but also strengthened the observations on their efficiency from the simulation. / Ph. D.

Power consumption and battery life are of critical importance for medical implant devices. For this reason, devices for Wireless Body Area Network (WBAN) applications must consume very little power. To save power, it is desirable to turn off or put to sleep a device when not in use. However, a transceiver, which is the most power hungry block of a wireless sensor node, needs to listen for the incoming signal continuously. An alternative scheme, is to listen for the incoming signal at a predetermined internal, which saves power at the cost of increased latency. Another and more sophisticated scheme is to provide a wake-up receiver, which listens for the incoming signal continuously, and upon detection of an incoming signal, it wakes the primary transceiver up. A wake-up receiver is typically simple and dissipates little power to make the scheme useful. This thesis proposes a low-power wake-up receiver, which listens for a wake-up signal, identifies the target node, and wakes up the primary receiver only when that specific node is called upon. When a wake up signal is transmitted to all of the nodes on a network, our wake-up receiver allows all the nodes on a network except the targeted node to remain asleep to save power. Several wake-up receiver topologies have been proposed. This work uses a passive Cockcroft-Walton multiplier circuit as an RF envelope detector followed by a simple detector circuit. A novel serial code detector is then used to decode the pulse width modulated input signal to wake-up the designated node. A passive RF front end and simple decoding circuit reduce power consumption substantially at the cost of low sensitivity. The sensitivity of the wake-up receiver can be improved though the addition of an RF amplifier, but at the cost of increased power consumption. / Master of Science

There are many works related to wireless sensor networks (WSNs) where authors present new protocols with better or enhanced features, others just compare their performance or present an application, but this work tries to provide a different perspective. Why don¿t we see the network as a whole and split it into groups to give better network performance regardless of the routing protocol? For this reason, in this thesis we demonstrate through simulations that node¿s grouping feature in WSN improves the network¿s behavior. We propose the creation of a group-based architecture, where nodes have the same functionality within the network. Each group has a head node, which defines the area in which the nodes of such group are located. Each node has a unique node identifier (nodeID). First group¿s node makes a group identifier (groupID). New nodes will know their groupID and nodeID of their neighbors. End nodes are, physically, the nodes that define a group. When there is an event on a node, this event is sent to all nodes in its group in order to take an appropriate action. End nodes have connections to other end nodes of neighboring groups and they will be used to send data to other groups or to receive information from other groups and to distribute it within their group. Links between end nodes of different groups are established mainly depending on their position, but if there are multiple possibilities, neighbor nodes could be selected based on their ability ¿, being ¿ a choice parameter taking into account several network and nodes parameters. In order to set group¿s boundaries, we can consider two options, namely: i) limiting the group¿s diameter of a maximum number of hops, and ii) establishing boundaries of covered area. In order to improve the proposed group-based architecture, we add collaboration between groups. A collaborative group-based network gives better performance to the group and to the whole system, thereby avoiding unnecessary message forwarding and additional overheads while saving energy. Grouping nodes also diminishes the average network delay while allowing scaling the network considerably. In order to offer an optimized monitoring process, and in order to offer the best reply in particular environments, group-based collaborative systems are needed. They will simplify the monitoring needs while offering direct control. Finally, we propose a marine application where a variant of this groupbased architecture could be applied and deployed. / García Pineda, M. (2013). A group-based architecture and protocol for wireless sensor networks [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/27599 / Premios Extraordinarios de tesis doctorales