EDAL: An Energy-Efficient, Delay-Aware, and Lifetime-Balancing Data Collection Protocol for Heterogeneous Wireless Sensor Networks

被引:279
作者
Yao, Yanjun [1 ]
Cao, Qing [1 ]
Vasilakos, Athanasios V. [2 ]
机构
[1] Univ Tennessee, Dept Elect Engn & Comp Sci, Knoxville, TN 37996 USA
[2] Natl Tech Univ Athens, Dept Elect & Comp Engn, GR-10682 Athens, Greece
基金
美国国家科学基金会;
关键词
Data collection; energy efficiency; heuristic algorithms; routing protocols; wireless sensor networks; VEHICLE-ROUTING PROBLEM;
D O I
10.1109/TNET.2014.2306592
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Our work in this paper stems from our insight that recent research efforts on open vehicle routing (OVR) problems, an active area in operations research, are based on similar assumptions and constraints compared to sensor networks. Therefore, it may be feasible that we could adapt these techniques in such a way that they will provide valuable solutions to certain tricky problems in the wireless sensor network (WSN) domain. To demonstrate that this approach is feasible, we develop one data collection protocol called EDAL, which stands for Energy-efficient Delay-aware Lifetime-balancing data collection. The algorithm design of EDAL leverages one result from OVR to prove that the problem formulation is inherently NP-hard. Therefore, we proposed both a centralized heuristic to reduce its computational overhead and a distributed heuristic to make the algorithm scalable for large-scale network operations. We also develop EDAL to be closely integrated with compressive sensing, an emerging technique that promises considerable reduction in total traffic cost for collecting sensor readings under loose delay bounds. Finally, we systematically evaluate EDAL to compare its performance to related protocols in both simulations and a hardware testbed.
引用
收藏
页码:810 / 823
页数:14
相关论文
共 34 条
[1]  
[Anonymous], FAST SOLUTION 11 NOR
[2]  
[Anonymous], P SENSYS 2004 2 INT
[3]  
[Anonymous], OPERATIONS RES P
[4]  
[Anonymous], TECH REP
[5]  
[Anonymous], IRIS SENS NOD
[6]   Vehicle routing problem with time windows, part 1:: Route construction and local search algorithms [J].
Bräysy, I ;
Gendreau, M .
TRANSPORTATION SCIENCE, 2005, 39 (01) :104-118
[7]   Distributed Compressive Sampling for Lifetime Optimization in Dense Wireless Sensor Networks [J].
Caione, Carlo ;
Brunelli, Davide ;
Benini, Luca .
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2012, 8 (01) :30-40
[8]   An improved ant-based routing protocol in wireless sensor networks [J].
Chen, Ge ;
Guo, Tian-De ;
Yang, Wen-Guo ;
Zhao, Tong .
2006 INTERNATIONAL CONFERENCE ON COLLABORATIVE COMPUTING: NETWORKING, APPLICATIONS AND WORKSHARING, 2006, :442-+
[9]   Solving a vehicle routing problem with time windows by a decomposition technique and a genetic algorithm [J].
Cheng, Chi-Bin ;
Wang, Keng-Pin .
EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (04) :7758-7763
[10]   Simulated annealing metaheuristics for the vehicle routing problem with time windows [J].
Chiang, WC ;
Russell, RA .
ANNALS OF OPERATIONS RESEARCH, 1996, 63 :3-27