Abstract

Tradition wireless sensor networks (WSNs) transmit data by single or multiple hops. However, some sensor nodes (SNs) close to a static base station forward data more frequently than others, which results in the problem of energy holes and makes networks fragile. One promising solution is to use a mobile node as a mobile sink (MS), which is especially useful in energy-constrained networks. In these applications, the tour planning of MS is a key to guarantee the network performance. In this paper, a novel strategy is proposed to reduce the latency of mobile data gathering in a WSN while the routing strategies and tour planning of MS are jointly optimized. First, the issue of network coverage is discussed before the appropriate number of clusters being calculated. A dynamic clustering scheme is then developed where a virtual cluster center is defined as the MS sojourn for data collection. Afterwards, a tour planning of MS based on prediction is proposed subject to minimizing the traveling distance to collect data. The proposed method is simulated in a MATLAB platform to show the overall performance of the developed system. Furthermore, the physical tests on a test rig are also carried out where a small WSN based on an unmanned aerial vehicle (UAV) is developed in our laboratory. The test results validate the feasibility and effectiveness of the method proposed.

Highlights

  • In recent years, the prosperous development in the Internet of ings has been validated where wireless sensor networks (WSNs) become ubiquitous

  • WSNs are widely used in the fields, such as intelligent transportation, agriculture, medical treatment, aerospace exploration, and other emerging applications, whereas they can contain a large number of static and mobile nodes in a self-organizing way [1,2,3]

  • A sink node in a WSN is fixed where the other sensor nodes (SNs) transmit data to the sink through either singlehop or multihop communication. us, the SNs close to the sink tend to carry more data transmission or forwarding tasks which leads to unbalanced energy consumption and results in poor data delivery in networks. e issues of energy holes and data collision may occur in such applications [4,5,6,7]

Read more

Summary

Introduction

The prosperous development in the Internet of ings has been validated where wireless sensor networks (WSNs) become ubiquitous. To strike the balance between energy consumption and latency of data gathering, an algorithm to find the optimal number and position of cluster head nodes for data collection is proposed in [19]. A data gathering scheme by using multiple mobile sink nodes is proposed in [24]. (1) We investigate the data gathering mechanism by considering energy constraints in a WSN system where the path length is minimized. (3) A predicted trajectory is developed to assist the tour planning of a MS In this manner, the overall data gathering is divided into several stages. The MS reaches sensor node i; the amount of data is Ci; τi is staying time at each rendezvous point; G represents the transmission rate. erefore, there is a relationship as follows: τi

Member node in the cluster
Results and Analysis
Number of nodes
Average distance Minimum distance
Number of experimental rounds
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