简介概要

Energy-constrained ferry route design for sparse wireless sensor networks

来源期刊:中南大学学报(英文版)2013年第11期

论文作者:WANG Yong(王勇) PENG Wei(彭伟) DOU Qiang(窦强) GONG Zheng-hu(龚正虎)

文章页码:3142 - 3149

Key words:message ferry; energy-constrained route design; integer linear programming; wireless sensor networks

Abstract: In recent years, using message ferries as mechanical carriers of data has been shown to be an effective way to collect information in sparse wireless sensor networks. As the sensors are far away from each other in such highly partitioned scenario, a message ferry needs to travel a long route to access all the sensors and carry the data collected from the sensors to the sink. Typically, practical constraints (e.g., the energy) preclude a ferry from visiting all sensors in a single tour. In such case, the ferry can only access part of the sensors in each tour and move back to the sink to get the energy refilled. So, the energy-constrained ferry route design (ECFRD) problem is discussed, which leads to the optimization problem of minimizing the total route length of the ferry, while keeping the route length of each tour below a given constraint. The ECFRD problem is proved to be NP-hard problem, and the integer linear programming (ILP) formulation is given. After that, efficient heuristic algorithms are proposed to solve this problem. The experimental results show that the performances of the proposed algorithms are effective in practice compared to the optimal solution.

详情信息展示

Energy-constrained ferry route design for sparse wireless sensor networks

WANG Yong(王勇), PENG Wei(彭伟), DOU Qiang(窦强), GONG Zheng-hu(龚正虎)

(College of Computer, National University of Defense Technology, Changsha 410073, China)

Abstract:In recent years, using message ferries as mechanical carriers of data has been shown to be an effective way to collect information in sparse wireless sensor networks. As the sensors are far away from each other in such highly partitioned scenario, a message ferry needs to travel a long route to access all the sensors and carry the data collected from the sensors to the sink. Typically, practical constraints (e.g., the energy) preclude a ferry from visiting all sensors in a single tour. In such case, the ferry can only access part of the sensors in each tour and move back to the sink to get the energy refilled. So, the energy-constrained ferry route design (ECFRD) problem is discussed, which leads to the optimization problem of minimizing the total route length of the ferry, while keeping the route length of each tour below a given constraint. The ECFRD problem is proved to be NP-hard problem, and the integer linear programming (ILP) formulation is given. After that, efficient heuristic algorithms are proposed to solve this problem. The experimental results show that the performances of the proposed algorithms are effective in practice compared to the optimal solution.

Key words:message ferry; energy-constrained route design; integer linear programming; wireless sensor networks

<上一页 1 下一页 >

相关论文

  • 暂无!

相关知识点

  • 暂无!

有色金属在线官网  |   会议  |   在线投稿  |   购买纸书  |   科技图书馆

中南大学出版社 技术支持 版权声明   电话:0731-88830515 88830516   传真:0731-88710482   Email:administrator@cnnmol.com

互联网出版许可证:(署)网出证(京)字第342号   京ICP备17050991号-6      京公网安备11010802042557号