Recently, many researches focus on Wireless Sensor Networks (WSN) which consist of low-cost, low power, and short RF range sensor devices. Energy efficiency and traffic load balancing is a key challenge in design of WSN. Clustering techniques can be an efficient solution to solve energy and load balancing issues in WSN. Furthermore, several applications requires specific delay parameters to satisfy the requirements. In order to satisfy these requirements, the network designer have to consider the guaranteed delay for these applications. In this thesis, we introduce entropy based network clustering algorithm to solve energy and delay issues in WSN. Our algorithm uses an entropy based Cluster Cost function which considers traffic load and traffic variation.
Traditionally, industrial networks are constructed through wired communications. Wired networks require expensive electronic cable and maintenance costs. With recent advances in wireless sensor networks (WSNs), the realization of low-cost Industrial Wireless Sensor Network (IWSN) has become feasible. Compare to wired networks, IWSN has several constraints like resource, reliability, redundancy and so on. These constraints impose many challenges for designing routing protocols of ISWN. Energy efficiency and reliability are important issues, in most case there is a trade-off between energy efficiency and reliability. Existing IWSN standards like ISA100.11a and WirelessHART propose simple and reliable graph routing, while the details of graph generation scheme are not specified in the standard. We hope that routing protocols decrease energy consumption while the link reliability can be guaranteed. In this paper, we propose a novel graph generation scheme which can enhance communication reliability with low energy consumption. The proposed scheme provides entropy-based clustering and multi-path graph generation algorithms to satisfy the industrial application’s reliability requirement.