Abstract

Data collection problems have received much attention in recent years. Many data collection algorithms that constructed a path and adopted one or more mobile sinks to collect data along the paths have been proposed in wireless sensor networks (WSNs). However, the efficiency of the established paths still can be improved. This paper proposes a cooperative data collection algorithm (CDCA), which aims to prolong the network lifetime of the given WSNs. The CDCA initially partitions the n sensor nodes into k groups and assigns each mobile sink acting as the local mobile sink to collect data generated by the sensors of each group. Then the CDCA selects an appropriate set of data collection points in each group and establishes a separate path passing through all the data collection points in each group. Finally, a global path is constructed and the rendezvous time points and the speed of each mobile sink are arranged for collecting data from k local mobile sinks to the global mobile sink. Performance evaluations reveal that the proposed CDCA outperforms the related works in terms of rendezvous time, network lifetime, fairness index as well as efficiency index.

Highlights

  • Wireless sensor networks (WSNs) have been used in many applications, including healthcare, trajectory tracking, environmental monitoring, smart home, military surveillance, coverage, rechargeable and data collection [1,2,3,4,5,6,7,8,9]

  • Given k + 1 mobile sinks and a set of n sensor nodes, this study presents a cooperative data collection algorithm, called CDCA, which initially partitions the n sensor nodes into k subsets

  • The proposed CDCA aims to select k i collection points (CPs) from the sensors in Ti and establishes a route πi which passes through the k i CPs for data collection

Read more

Summary

Introduction

Wireless sensor networks (WSNs) have been used in many applications, including healthcare, trajectory tracking, environmental monitoring, smart home, military surveillance, coverage, rechargeable and data collection [1,2,3,4,5,6,7,8,9]. Tk and assigns one local mobile sink mi to collect the data generated by sensors in Ti. the proposed CDCA aims to select k i CPs from the sensors in Ti and establishes a route πi which passes through the k i CPs for data collection. To further collect all data from the k mobile sinks, the (k + 1)-th mobile sink, called global mobile sink, will construct a path where the k local mobile sinks can rendezvous with the global sink on the path and transmit the collected data to the global sink This can improve the energy consumption of sensor nodes and can maximize the network lifetime of the WSNs. The contributions of this paper are itemized as follows. The proposed mechanism considers the length cost between any two consecutive CPs. the established route allows the mobile sink to visit more collection points.

Related Work
Network
Problem
Objective
The Proposed CDCA Algorithm
Network Partition Phase
CP Selection and Path Construction Phase
Speed Control Phase
Performance Evaluations
Findings
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call