Constructing Maximum-Lifetime Data-Gathering Tree in WSNs Based on Compressed Sensing

Zhengyu Chen,Jian Xu,Lei Chen,Geng Yang

doi:10.1155/2016/2313064

Abstract

Data gathering is one of the most important operations in many wireless sensor networks (WSNs) applications. In order to implement data gathering, a tree structure rooted at the sink is usually defined. In most wireless sensor networks, nodes are powered by batteries with limited energy. Prolonging network lifetime is a critical issue for WSNs. As a technique for signal processing, compressed sensing (CS) is being increasingly applied to wireless sensor networks for saving energy. Compressive sensing can reduce the number of data transmissions and balance the traffic load throughout networks. In this paper, we investigate data gathering in wireless sensor networks using CS and aim at constructing a maximum-lifetime data-gathering tree. The lifetime of the network is defined as the number of data-gathering rounds until the first node depletes its energy. Based on the hybrid-CS data-gathering model, we first construct an arbitrary data-gathering tree and then use the random switching decision and optimal parent node selecting strategy to adjust the load of the bottleneck node and prolong the network lifetime. Simulation results show that the proposed algorithm outperforms several existing approaches in terms of network lifetime.

Highlights

Wireless sensor networks (WSNs) consist of a great number of nodes that sense the environment and collaboratively work to process and route the sensory data
We propose a method of constructing maximum-lifetime data-gathering tree (MLDGT) in WSNs based on the hybrid-compressed sensing (CS) data-gathering model
We first compare our algorithm with the MITT [18], RaSMaLai [19], and Minimum Energy Compressed Data Aggregation (MECDA) [14] data-gathering schemes for Scenario 2

Summary

Introduction

Wireless sensor networks (WSNs) consist of a great number of nodes that sense the environment and collaboratively work to process and route the sensory data. Data-gathering methods based on cluster and tree are proposed in many literatures [3, 4] The goal of such methods is to construct a network topology in order to use energy resources of sensor node effectively. Xiang et al in [14] introduced a Minimum Energy Compressed Data Aggregation (MECDA) algorithm to implement the data gathering in WSNs based on hybrid-CS technique. We propose a method of constructing maximum-lifetime data-gathering tree (MLDGT) in WSNs based on the hybrid-CS data-gathering model. (1) We first define the problem of maximum-lifetime data-gathering tree in WSNs based on compressed sensing, prove that it is NP-complete, and analyze the characterizations of the optimal solutions.

Preliminaries

System Model and Problem Formulation

Solution Techniques

Performance Evaluation

Conclusion