Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

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

View through CrossRef
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.
Title: An Efficient Data Collection Path Planning Scheme in Wireless Sensor Networks with Mobile Sinks
Description:
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.

Related Results

An Efficient Data Collection Path Planning Scheme in Wireless Sensor Networks with Mobile Sink
An Efficient Data Collection Path Planning Scheme in Wireless Sensor Networks with Mobile Sink
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 c...
Dynamic stochastic modeling for inertial sensors
Dynamic stochastic modeling for inertial sensors
Es ampliamente conocido que los modelos de error para sensores inerciales tienen dos componentes: El primero es un componente determinista que normalmente es calibrado por el fabri...
Design of multi-energy-space-based energy-efficient algorithm in novel software-defined wireless sensor networks
Design of multi-energy-space-based energy-efficient algorithm in novel software-defined wireless sensor networks
Energy efficiency has always been a hot issue in wireless sensor networks. A lot of energy-efficient algorithms have been proposed to reduce energy consumption in traditional wirel...
Toward All-IP networks : IP and wireless networks convergence
Toward All-IP networks : IP and wireless networks convergence
In this thesis the state of the art for IP networks and the two most predominant wireless access networks, UMTS and Wireless LANs, has been reviewed with respect to the enhancement...
Routing Security in Wireless Sensor Networks
Routing Security in Wireless Sensor Networks
Since routing is a fundamental operation in all types of networks, ensuring routing security is a necessary requirement to guarantee the success of routing operation. Securing rout...
Implementation of Faulty Sensor Detection Mechanism using Data Correlation of Multivariate Sensor Readings in Smart Agriculture
Implementation of Faulty Sensor Detection Mechanism using Data Correlation of Multivariate Sensor Readings in Smart Agriculture
Through sensor networks, agriculture can be connected to the IoT, which allows us to create connections among agronomists, farmers, and crops regardless of their geographical diffe...
Magnesium Heat Sink Evaluations
Magnesium Heat Sink Evaluations
<div class="htmlview paragraph">A system has been constructed to estimate heat dissipated from geometrically identical heat sinks and pinfins extruded from magnesium (M1A) an...

Back to Top