Abstract
In recent years, Wireless Sensor Networks with a Mobile Sink (WSN-MS) have been an active research topic due to the widespread use of mobile devices. However, how to get the balance between data delivery latency and energy consumption becomes a key issue of WSN-MS. In this paper, we study the clustering approach by jointly considering the Route planning for mobile sink and Clustering Problem (RCP) for static sensor nodes. We solve the RCP problem by using the minimum travel route clustering approach, which applies the minimum travel route of the mobile sink to guide the clustering process. We formulate the RCP problem as an Integer Non-Linear Programming (INLP) problem to shorten the travel route of the mobile sink under three constraints: the communication hops constraint, the travel route constraint and the loop avoidance constraint. We then propose an Imprecise Induction Algorithm (IIA) based on the property that the solution with a small hop count is more feasible than that with a large hop count. The IIA algorithm includes three processes: initializing travel route planning with a Traveling Salesman Problem (TSP) algorithm, transforming the cluster head to a cluster member and transforming the cluster member to a cluster head. Extensive experimental results show that the IIA algorithm could automatically adjust cluster heads according to the maximum hops parameter and plan a shorter travel route for the mobile sink. Compared with the Shortest Path Tree-based Data-Gathering Algorithm (SPT-DGA), the IIA algorithm has the characteristics of shorter route length, smaller cluster head count and faster convergence rate.
Highlights
Since it consists of static sensor nodes and mobile sink, the Wireless Sensor Network with a Mobile Sink (WSN-MS) is naturally a tried Wireless Sensor Network (WSN)
The experiments show that the Induction Algorithm (IIA) algorithm can automatically adjust cluster heads according to the parameter Hmax and plan a shorter travel route for the mobile sink
We conclude that the IIA algorithm has the characteristics of shorter route length, smaller cluster head count and faster convergence rate
Summary
Since it consists of static sensor nodes and mobile sink, the Wireless Sensor Network with a Mobile Sink (WSN-MS) is naturally a tried Wireless Sensor Network (WSN). The travel route of the mobile sink is usually very long, which leads to the significant data delivery latency problem To avoid these drawbacks, the literature [8,11,12,13] proposes the clustering approach, in which, the WSN is regarded as a kind of hierarchy network, sensor nodes are divided into clusters and mobile sinks move to cluster heads, collecting data. The cluster members send data to the cluster head by multi-hop, and the cluster head stores and forwards the received data to the mobile sink Based on these assumptions, the data-gathering scheme of WSN-MS could refer to data collection cycles.
Sign-in/Register to view highlights & summary 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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
