Energy efficiency in data collection wireless sensor networks

This dissertation studies the problem of energy efficiency in resource constrained and heterogeneous wireless sensor networks (WSNs) for data collection applications in real-world scenarios. The problem is addressed from three different perspectives: network routing, node energy profiles, and network management. First, the energy efficiency in a WSN is formulated as a load balancing problem, where the routing layer can diagnose and exploit the WSN topology redundancy to reduce the data traffic processed in critical nodes, independent of their hardware platform, improving their energy consumption and extending the network lifetime. We propose a new routing strategy that extends traditional cost-based routing protocols and improves their energy efficiency, while maintaining high reliability. The evaluation of our approach shows a reduction in the energy consumption of the routing layer in the busiest nodes ranging from 11% to 59%, while maintaining over 99% reliability in WSN data collection applications. Second, a study of the effect of the MAC layer on the network energy efficiency is performed based on the nodes energy consumption profile. The resulting energy profiles reveal significant differences in the energy consumption of WSN nodes depending on their external sensors, as well as their sensitivity to changes in network traffic dynamics. Finally, the design of a general integrated framework and data management system for heterogeneous WSNs is presented. This framework not only allows external users to collect data, while monitoring the network performance and energy consumption, but also enables our proposed network redundancy diagnosis and energy profile calculations

Energy Management in Wireless Sensor Networks for Internet of Things Applications

Internet of things (IoT) aims to develop a smart world based on sensing environment. The energy management of wireless sensor networks (WSNs) is a big challenge in IoT since sensor nodes have limited energy and they need to have long life for collecting data and information. The aim of this paper is to propose an efficient energy routing algorithm in WSN and infrastructure based on construction an adaptive energy map of sensor nodes. The results show improvement in overall system performance and lifetime of WSN compared to traditional scenario

Clustered wireless sensor networks

The study of topology in randomly deployed wireless sensor networks (WSNs) is important in addressing the fundamental issue of stochastic coverage resulting from randomness in the deployment procedure and power management algorithms. This dissertation defines and studies clustered WSNs, WSNs whose topology due to the deployment procedure and the application requirements results in the phenomenon of clustering or clumping of nodes. The first part of this dissertation analyzes a range of topologies of clustered WSNs and their impact on the primary sensing objectives of coverage and connectivity. By exploiting the inherent advantages of clustered topologies of nodes, this dissertation presents techniques for optimizing the primary performance metrics of power consumption and network capacity. It analyzes clustering in the presence of obstacles, and studies varying levels of redundancy to determine the probability of coverage in the network. The proposed models for clustered WSNs embrace the domain of a wide range of topologies that are prevalent in actual real-world deployment scenarios, and call for clustering-specific protocols to enhance network performance. It has been shown that power management algorithms tailored to various clustering scenarios optimize the level of active coverage and maximize the network lifetime. The second part of this dissertation addresses the problem of edge effects and heavy traffic on queuing in clustered WSNs. In particular, an admission control model called directed ignoring model has been developed that aims to minimize the impact of edge effects in queuing by improving queuing metrics such as packet loss and wait time