Data acquisition in large-scale wireless sensor networks using multiple mobile sinks: a hierarchical clustering approach

2022 ◽  
Author(s):  
Madana Srinivas ◽  
Tarachand Amgoth
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Acquisition ◽  
Hierarchical Clustering ◽  
Large Scale ◽  
Wireless Sensor ◽  
Mobile Sinks ◽  
Clustering Approach

scholarly journals Use of multiple mobile sinks in wireless sensor networks for large-scale areas

2020 ◽  
Vol 10 (4) ◽  
pp. 175-180
Author(s):  
Hasanain A.H. Al-Behadili ◽  
Saddam K.A. AlWane ◽  
Yasir I.A. Al-Yasir ◽  
Naser Ojaroudi Parchin ◽  
Peter Olley ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Large Scale ◽  
Wireless Sensor ◽  
Mobile Sinks

scholarly journals An efficient data collection path planning scheme for wireless sensor networks with mobile sinks

2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Jau-Yang Chang ◽  
Jin-Tsong Jeng ◽  
Yung-Hoh Sheu ◽  
Z.-Jie Jian ◽  
Wei-Yeh Chang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Collection ◽  
Path Planning ◽  
Large Scale ◽  
Mobile Sink ◽  
Wireless Sensor ◽  
Mobile Sinks ◽  
Planning Scheme ◽  
Moving Path

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.

Sign in / Sign up

Export Citation Format

Share Document