Clustering and Compressive Data Gathering for Transmission Efficient Wireless Sensor Networks

Clustering and Compressive Data Gathering for Transmission Efficient Wireless Sensor Networks

Utkarsha Sumedh Pacharaney (Datta Meghe College of Engineering, India), Ranjan Bala Jain (Vivekanand Education Society's Institute of Technology, India) and Rajiv Kumar Gupta (Terna Engineering College, University of Mumbai, India)
Copyright: © 2021 |Pages: 28
DOI: 10.4018/978-1-5225-9493-2.ch002
OnDemand PDF Download:
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

The chapter focuses on minimizing the amount of wireless transmission in sensory data gathering for correlated data field monitoring in wireless sensor networks (WSN), which is a major source of power consumption. Compressive sensing (CS) is a new in-node compression technique that is economically used for data gathering in an energy-constrained WSN. Among existing CS-based routing, cluster-based methods offer the most transmission-efficient architecture. Most CS-based clustering methods randomly choose nodes to form clusters, neglecting the topology structure. A novel base station (BS)-assisted cluster, spatially correlated cluster using compressive sensing (SCC_CS), is proposed to reduce number of transmissions in and form the cluster by exploiting spatial correlation based on geographical proximity. The proposed BS-assisted clustering scheme follows hexagonal deployment strategy. In SCC_CS, cluster heads are solely involved in data gathering and transmitting CS measurements to BS, saving intra-cluster communication cost, and thus, network life increases as proved by simulation.
Chapter Preview
Top

Introduction

Wireless Sensor Network (WSN) is an agglomeration of randomly scattered tiny sensor nodes, whose primary objective is to gather data for the specific application they have been deployed in an Adhoc fashion. This gathered data is wirelessly transmitted to the Base Station (BS)/Sink. Wireless Communication is the main contributor to a sensor’s energy consumption. Hence, even though sensory data gathering is the fundamental task in WSN, it is a major source of power consumption. To reduce the number of data packet transmission required for data gathering usually compression techniques are employed. However, conventional compression techniques introduce excessive in-node computations and control overheads. Compressive Sensing (CS) is a new in-node compression technique that compresses sensory data and accurately recovers it at the BS. It can be very economically used for data gathering in energy constrained WSN. A brief overview of CS is as follows:

Compressive sensing is a new framework developed for single-signal sensing and compression. It exploits the fact that many natural occurring signals are sparse or compressible if represented on a proper basis and represented concisely, then recovery from a small number of projections is guaranteed or traceable (Donoho David L.,2006). Compressive sensing data compression is accomplished in the following three steps.

  • 1.

    Sparse representation of the signal

  • 2.

    Sampling the signal

  • 3.

    Recovery of the original signal.

    • Sparse representation of the signal

Consider a signal fd to be a real-valued discrete-time signal with finite length N. Vectorally represented as

978-1-5225-9493-2.ch002.m01
(1.1)

It is defined as k-sparse if it has a sparse representation in a proper basis

978-1-5225-9493-2.ch002.m02
(1.2) Where fd=𝜓x and x has only k non-zero elements

  • Sampling the signal

The k -sparse signal can be under-sampled and be recovered from MN random measurements.

978-1-5225-9493-2.ch002.m03
(1.3)

The random measurements are generated by

978-1-5225-9493-2.ch002.m04
(1.4) Where 978-1-5225-9493-2.ch002.m05 is called the measurement matrix.

The measurement vector Y for N element is formed by

978-1-5225-9493-2.ch002.m06
(1.5)
  • Recovery of the original signal

It has been shown that reconstruction of a k-sparse signal with high probability from only 978-1-5225-9493-2.ch002.m07 CS measurements employing l1 Optimization problem is possible. l1-norm minimization is given by

978-1-5225-9493-2.ch002.m08
(1.6)

CS obeys the rule of Restricted Isometric Property (RIP) or Uncertainty Principle (UUP) i.e. sensing and measurement matrix be incoherent with each other. Fig. 1 shows the CS framework.

Figure 1.

Compressive Sensing Framework

978-1-5225-9493-2.ch002.f01

Complete Chapter List

Search this Book:
Reset