Hybrid Path Planning for Efficient Data Collection in UAV-Aided WSNs for Emergency Applications

In unmanned aerial vehicle (UAV)-aided wireless sensor networks (UWSNs), a UAV is employed as a mobile sink to gather data from sensor nodes. Incorporating UAV helps prolong the network lifetime and avoid the energy-hole problem faced by sensor networks. In emergency applications, timely data collection from sensor nodes and transferal of the data to the base station (BS) is a prime requisite. The timely and safe path of UAV is one of the fundamental premises for effective UWSN operations. It is essential and challenging to identify a suitable path in an environment comprising various obstacles and to ensure that the path can efficiently reach the target point. This paper proposes a hybrid path planning (HPP) algorithm for efficient data collection by assuring the shortest collision-free path for UAV in emergency environments. In the proposed HPP scheme, the probabilistic roadmap (PRM) algorithm is used to design the shortest trajectory map and the optimized artificial bee colony (ABC) algorithm to improve different path constraints in a three-dimensional environment. Our simulation results show that the proposed HPP outperforms the PRM and conventional ABC schemes significantly in terms of flight time, energy consumption, convergence time, and flight path.

Download Full-text

Secure Energy Efficient Data Collection Scheme Over Wireless Multimedia Sensor Networks

Journal of Computational and Theoretical Nanoscience ◽

10.1166/jctn.2016.5729 ◽

2016 ◽

Vol 13 (10) ◽

pp. 7375-7384

Author(s):

Hyunsung Kim ◽

Sung Woon Lee

Keyword(s):

Energy Efficiency ◽

Sensor Networks ◽

Data Collection ◽

Energy Efficient ◽

Wireless Multimedia Sensor Networks ◽

Sensor Nodes ◽

Wireless Multimedia ◽

Multimedia Sensor Networks ◽

Efficient Data ◽

Efficient Data Collection

A secure data collection in wireless multimedia sensor networks (WMSNs) has given attention to one of security issues. WMSNs pose unique security challenges due to their inherent limitations in communication and computing, which makes vulnerable to various attacks. For the energy efficiency, WMSNs adopt mobile sinks to collect data from sensor nodes. Thus, how to gather data securely and efficiently is an important issue WMSNs. In this paper, we propose a secure energy efficient data collection scheme over WMSNs, which are based on Bilinear pairing and symmetric key cryptosystem. First of all, we devise a security model based on a hierarchical key structure for the security mechanisms, authentication, key agreement, confidentiality, and integrity. Based on the model, we propose a secure energy efficient data collection scheme, which could establish secure session in one round. The proposed scheme could efficiently remedy security and efficiency problems in the previous data collection schemes over WMSNs. It has only about 18% of overhead for the security but also has energy efficiency compared with the other related schemes.

Download Full-text

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

10.21203/rs.3.rs-34784/v1 ◽

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.

Download Full-text