An Efficient Mobile Data Gathering Method with Tree Clustering Algorithm in Wireless Sensor Networks Balanced and Unbalanced Topologies

Meriem Meddah,Tahar Ezzedine,Rim Haddad

doi:10.1007/s11277-021-09309-y

Abstract

Mobile Data Collector device (MDC) is adopted to reduce the energy consumption in Wireless Sensor Networks. This device travels the network in order to gather the collected data from sensor nodes. This paper presents a new Tree Clustering algorithm with Mobile Data Collector in Wireless Sensor Networks, which establishes the shortest travelling path passing throw a subset of Cluster Heads (CH). To select CHs, we adopt a competitive scheme, and the best sensor nodes are elected according to the number of packets forwarded between sensor nodes, the number of hops to the tree’s root, the residual energy, and the distance between the node and the closest CH. In simulation results, we adopt the balanced and unbalanced topologies and prove the efficiently of our proposed algorithm considering the network lifetime, the fairness index and the energy consumption in comparison with the existing mobile data collection algorithms.

Highlights

In the recent years, several studies have considered Wireless Sensor Networks (WSN) as growing technologies
We focus on the problem of selecting the suitable Cluster Head (CH) considering the residual energy of sensor nodes to guarantee the local data aggregation
Our objective is to select the best sensor nodes to be elected as CHs, and to determine the shortest path tour that will be traversed by the Mobile Data Collector (MDC), visiting each CH to collect sensed data

Summary

Introduction

Several studies have considered Wireless Sensor Networks (WSN) as growing technologies. A MDC is equipped with a rechargeable battery and a powerful transceiver It achieves energy and time efficient collection starting from the BS and traveling over the network. In this paper a new Tree Clustering Algorithm with Mobile Data Collector is proposed (TCAMDC). It is an energy efficient and distributed data gathering algorithm itemized with the following phases: the Initialization phase, and the CH election and the path construction phase. The MDC starts the data gathering phase beginning from the BS, and traveling through the elected CHs. The rest of the paper is organized as follows: section 2 reviews related works.

Objectives

Methods

Results

Conclusion