IEEE/ACM Transactions on Networking · 2014 · 350 citations · 27 references
ComputingComputer ScienceComputer SystemsComputer NetworksDistributed SystemsSchedulingDistributed ComputingRoutingRouting AlgorithmsRouting ProtocolsSensor NetworksWireless Sensor NetworksCompressive SensingEnergy-efficient ProtocolsEnergy-efficient Wireless Sensor NetworksHeuristic AlgorithmsHeuristic ApproachOverhead ReductionVehicle RoutingWireless Sensor Network Protocols
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.
27
Adhi Harmoko S, M.Komp, Joseph Marie Jacquard et al. · 2005 · 18.4K citations
Introduction to algorithms [2nd ed.]
Thomas H. Cormen · 2001 · 1.9K citations
A wireless sensor network For structural monitoring
Ning Xu, Sumit Rangwala, Krishna Chintalapudi et al. · 2004 · 1.1K citations