DFTBC: Data fusion and tree-based clustering routing protocol for energy-efficient in wireless sensor networks

Abstract

Energy efficiency is a unique challenge for designing routing protocols in wireless sensor network (WSN) to extend the lifetime of the entire network because sensor nodes are power constrained devices. To solve this problem, in this paper, we propose a data fusion and tree-based clustering routing algorithm (DFTBC). DFTBC designing consists of two main works. In the first work, tree-based clustering routing technique is used to connect the nodes in a cluster to form a minimum spanning tree, where each node communicates only with its nearest neighbor using distance and remaining energy of nodes to decide which node will be the cluster head (CH). In the second work, we fuse one or more packets to generate a packet with a smaller size based on the Dempster-Shafer and Slepian-Wolf theory. Our simulation results show that the network lifetime with using of our proposed protocol can be improved about 350% and 35% compared to low-energy adaptive clustering hierarchy (LEACH) and power-efficient gathering in sensor information system (PEGASIS), respectively.