scholarly journals An Efficient Path Generation Algorithm Using Principle Component Analysis for Mobile Sinks in Wireless Sensor Networks

2021 ◽  
Vol 10 (4) ◽  
pp. 69
Author(s):  
Omar Banimelhem ◽  
Eyad Taqieddin ◽  
Ibrahim Shatnawi

Recently, the data collection problem in wireless sensor networks (WSNs) using mobile sinks has received much attention. The main challenge in such problems is constructing the path that the mobile sink (MS) will use to collect the data. In this paper, an efficient path generation algorithm for the mobile sink based on principal component analysis (PCA) is proposed. The proposed approach was evaluated using two data collection modes—direct and multihop—and it was compared with another approach called the mobile-sink-based energy-efficient clustering algorithm for wireless sensor networks (MECA). When compared with MECA, simulation results have shown that the proposed approach improves the performance of WSN in terms of the number of live nodes and average remaining energy.

Author(s):  
Jau-Yang Chang ◽  
Jin-Tsong Jeng ◽  
Yung-Hoh Sheu ◽  
Z.-Jie Jian ◽  
Wei-Yeh Chang

AbstractWireless sensor networks with mobile sinks enable a mobile device to move into the sensing area for the purpose of collecting the sensing data. Mobile sinks increase the flexibility and convenience of data gathering in such systems. Taking the energy consumption of the mobile sink into account, the moving distance of the mobile sink must be reduced efficiently. Hence, it is important and necessary to develop an efficient path planning scheme for mobile sinks in large-scale wireless sensor network systems. According to several greedy-based algorithms, we adopt an angle bisector concept to create the moving path for the mobile sink. In this paper, a novel and efficient data collection path planning scheme is proposed to reduce the moving distances and to prolong the lifetimes of mobile sinks in wireless sensor networks. Considering the communication range limitations of sensor nodes and the obstacles within sensing areas, we design an inner center path planning algorithm to reduce the moving distance for the mobile sink. A back-routing avoidance method is included to address the moving path backpropagation problem. We account for the obstacles in sensing area. The reference point of obstacle avoidance is employed to address the obstacle problem. The proposed scheme makes an adaptive decision for creating the moving path of the mobile sink. A suitable moving path planning scheme can be achieved, and the moving distance of the mobile sink can be reduced. The proposed scheme is promising in large-scale wireless sensor networks. When the number of sensor nodes in the sensing area is increased by 50, the proposed scheme yields an average moving distance that is 1.1 km shorter than that of the heuristic tour-planning algorithm, where the sensing area is 5 km × 5 km. Simulation results demonstrate that the proposed data collection path planning scheme outperforms the previously developed greedy-based scheme in terms of the moving paths and moving distances of mobile sinks in wireless sensor networks.


2020 ◽  
Author(s):  
Jau-Yang Chang ◽  
Jin-Tsong Jeng ◽  
Yung-Hoh Sheu ◽  
Z-Jie Jian ◽  
Wei-Yeh Chang

Abstract Wireless sensor networks with mobile sinks enable a mobile device to move into the sensing area for the purpose of collecting the sensing data. Mobile sinks increase the flexibility and convenience of data gathering in such systems. Taking the energy consumption of the mobile sink into account, the moving distance of the mobile sink must be reduced efficiently. Hence, it is important and necessary to develop an efficient path planning scheme for mobile sinks in large-scale wireless sensor network systems. According to several greedy-based algorithms, we adopt an angle bisector concept to create the moving path for the mobile sink. In this paper, a novel and efficient data collection path planning scheme is proposed to reduce the moving distances and to prolong the lifetimes of mobile sinks in wireless sensor networks. Considering the communication range limitations of sensor nodes and the obstacles within sensing areas, we design an inner center path planning algorithm to reduce the moving distance for the mobile sink. A back-routing avoidance method is included to address the moving path backpropagation problem. We account for the obstacles in sensing area. The reference point of obstacle avoidance is employed to address the obstacle problem. The proposed scheme makes an adaptive decision for creating the moving path of the mobile sink. A suitable moving path planning scheme can be achieved, and the moving distance of the mobile sink can be reduced. The proposed scheme is promising in large-scale wireless sensor networks. When the number of sensor nodes in the sensing area is increased by 50, the proposed scheme yields an average moving distance that is 1.1 km shorter than that of the heuristic tour-planning algorithm, where the sensing area is 5 km × 5 km. Simulation results demonstrate that the proposed data collection path planning scheme outperforms the previously developed greedy-based scheme in terms of the moving paths and moving distances of mobile sinks in wireless sensor networks.


Sensors ◽  
2018 ◽  
Vol 18 (8) ◽  
pp. 2627 ◽  
Author(s):  
Weimin Wen ◽  
Chih-Yung Chang ◽  
Shenghui Zhao ◽  
Cuijuan Shang

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.


Sensors ◽  
2016 ◽  
Vol 16 (9) ◽  
pp. 1432 ◽  
Author(s):  
Chuan Zhu ◽  
Sai Zhang ◽  
Guangjie Han ◽  
Jinfang Jiang ◽  
Joel Rodrigues

Sign in / Sign up

Export Citation Format

Share Document