scholarly journals An Efficient Data Collection Path Planning Scheme in Wireless Sensor Networks with Mobile Sink

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

Abstract Wireless sensor networks with mobile sink provide a mobile device to move into the sensing area for collecting the sensing data. It increases the flexibility and convenience of data gathering in such systems. Taking into account the energy consumption of mobile sink, the moving distance of mobile sink must be reduced efficiently. Hence, it is important and necessary to develop an efficient path planning scheme for the mobile sink in large-scale wireless sensor networks systems. According to the greedy-based algorithms, we adopt an angle bisector concept to create the moving path for the mobile sink. In this paper, a novel efficient data collection path planning scheme with an inner center approach is proposed to reduce the moving distance and to prolong the lifetime of mobile sink in wireless sensor networks. The relationship among moving path, moving distance, and number of sensor nodes are analyzed and discussed. Considering the communication range limitation of sensor nodes and the sensing area with obstacles, the proposed scheme makes an adaptive decision for creating the moving path of mobile sink. Simulation results demonstrate that the reasonable moving path planning can be achieved and the moving distance can be reduced for a mobile sink in wireless sensor networks.

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.

scholarly journals An Efficient Data Collection Path Planning Scheme in Wireless Sensor Networks with Mobile Sinks

2020 ◽  
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

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.

scholarly journals Energy Efficient Data Aggregation in Wireless Sensor Networks using Mobile Sink Node

2019 ◽  
Vol 9 (2) ◽  
pp. 2750-2753
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Resource ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Efficient Data ◽  
Reduce Energy Consumption ◽  
Computational Resources

The wireless sensor networks consist of numerous small nodes which are also called as energy resource-constrained sensor nodes. The communication of these nodes can be done in a various way. There is also the processing of signal tasks which is done through the various computational resources provided by the networks. The energy of the sensor nodes gets consumed when transmit the data or receive data from the network. To reduce energy consumption of the network various techniques has been proposed which are known as clustering techniques. In the proposed work the mobile sink is deployed in the network which reduces overhead in the network. Experimental results shows that the proposed work outperforms the existing one in terms of reduced energy consumption of the network, increased throughput of the network, reduced delay in the network.

scholarly journals Time Efficient Data Collection With Mobile Sink and vMIMO Technique in Wireless Sensor Networks

2018 ◽  
Vol 12 (1) ◽  
pp. 639-647 ◽  
Author(s):  
Ye Miao ◽  
Zhili Sun ◽  
Ning Wang ◽  
Yue Cao ◽  
Haitham Cruickshank
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Collection ◽  
Mobile Sink ◽  
Wireless Sensor ◽  
Efficient Data ◽  
Efficient Data Collection

scholarly journals Implimentation of Novel Framework For Efficient Data Gathering With Multiple Mobile Sink Sensor Nodes In WSN

2021 ◽  
Author(s):  
Saim Abassi ◽  
Irfan Anis ◽  
Muhammad Kashif ◽  
Usman Bashir Tayab
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transmission ◽  
Data Gathering ◽  
Mobile Sink ◽  
Experimental Results ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Great Consideration ◽  
Efficient Data

Abstract In couple of years, the great research towards oceanographic data transmission and submerged impurity the Submerged Wireless Sensor Networks are getting great consideration. SWSN includes issues such as link sustainability, time to begin interaction, data loss due to real-time transmission attempts and transmission range. The aforementioned complications have been approached through different routing configurations, but none of these can handle transmission efficiently. In this paper we proposed a framework of network in depth based data acquisition system with simulation and experimental results. The system model has been efficiently transmit data (Turbidity, Temperature and PH) in a region (Indus River) using the smart cluster sensor nodes and acquires result of 6.5 to 31 N.T.U of turbidity. The experimental results proved that the projected work improves the performance of the data transmission in Submerged Wireless Sensor Networks.

Sign in / Sign up

Export Citation Format

Share Document