当前位置: X-MOL 学术EURASIP J. Wirel. Commun. Netw. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
An efficient data collection path planning scheme for wireless sensor networks with mobile sinks
EURASIP Journal on Wireless Communications and Networking ( IF 2.6 ) Pub Date : 2020-12-14 , DOI: 10.1186/s13638-020-01873-4
Jau-Yang Chang , Jin-Tsong Jeng , Yung-Hoh Sheu , Z.-Jie Jian , Wei-Yeh Chang

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.



中文翻译:

具有移动接收器的无线传感器网络的有效数据收集路径规划方案

具有移动接收器的无线传感器网络使移动设备可以移入传感区域,以收集传感数据。移动接收器增加了此类系统中数据收集的灵活性和便利性。考虑到移动水槽的能耗,必须有效减少移动水槽的移动距离。因此,为大规模无线传感器网络系统中的移动宿开发有效的路径规划方案是重要且必要的。根据几种基于贪婪的算法,我们采用角平分线概念来创建移动接收器的移动路径。本文提出了一种新颖有效的数据收集路径规划方案,以减少移动距离并延长无线传感器网络中移动宿的寿命。考虑到传感器节点的通信范围限制和传感区域内的障碍物,我们设计了一个内部中心路径规划算法来减少移动水槽的移动距离。包括反向路由避免方法以解决移动路径反向传播问题。我们考虑了传感领域的障碍。避障参考点用于解决障碍问题。所提出的方案做出了用于创建移动宿的移动路径的自适应决策。可以实现合适的移动路径规划方案,并且可以减小移动水槽的移动距离。所提出的方案在大规模无线传感器网络中是有希望的。当传感区域中的传感器节点数量增加50个时,建议的方案将产生平均移动距离为1。比启发式游览计划算法的感应距离为5 km×5 km的启发式算法短1 km。仿真结果表明,所提出的数据收集路径规划方案在无线传感器网络中移动宿的移动路径和移动距离方面优于先前开发的基于贪婪的方案。

更新日期:2020-12-14
down
wechat
bug