원문정보
초록
영어
Delivery delay, instead of energy efficiency is the most significant objective for low-duty-cycle sensor networks due to the introduction of sleep latency. In this work, we study the mobility scheduling problem of sink in low-duty-cycle sensor networks. In order to reduce the delivery delay, the sink mobility and the inherent duty-cycled operation of nodes are jointly considered. We propose EfficientMobility Scheduling scheme, which decomposes mobility schedule problem into three sub-optimal problems, the delay-bounded hierarchy, path planning for mobile sink and dynamic data forwarding. The main idea behind is to balance the moving time by reducing the number of rendezvous nodes and waiting time by switching the forwarding path dynamically. The proposed scheme is evaluated through extensive simulations and compared with the state of the art, which shows our design is more efficient on delivery delay and energy conservation.
목차
1. Introduction
2. Related Work
3. Preliminary
3.1 Network Model
3.2 The Impact of Communication Model on Delay
3.3 Problem Formulation
4. Efficient Mobility Scheduling
4.1. Design Overview
4.2. Delay Constrained Clustering, DCC
4.3 Duty-Cycle-Aware Path Planning
4.4. Data Dynamical Forwarding
5. Experimental Evaluation
5.1 Simulation Scenarios and Parameters
5.2 Simulation Results
6. Conclusions
Acknowledgments
References