A Deadline-Aware Scheduling and Forwarding Scheme in Wireless Sensor Networks

Sensors

Thi-Nga Dao²  Seokhoon Yoon²  Jangyoung Kim¹ 

[1] Department of Computer Science, University of Suwon, Gyeonggi 445-743, Korea;Department of Electrical and Computer Engineering, University of Ulsan, Ulsan 680-749, Korea;

关键词: delay bound;    duty-cycled wireless sensor networks;    routing protocol;    geographic forwarding;   

DOI  :  10.3390/s16010059

来源: mdpi

【 摘 要 】

Many applications in wireless sensor networks (WSNs) require energy consumption to be minimized and the data delivered to the sink within a specific delay. A usual solution for reducing energy consumption is duty cycling, in which nodes periodically switch between sleep and active states. By increasing the duty cycle interval, consumed energy can be reduced more. However, a large duty cycle interval causes a long end-to-end (E2E) packet delay. As a result, the requirement of a specific delay bound for packet delivery may not be satisfied. In this paper, we aim at maximizing the duty cycle while still guaranteeing that the packets arrive at the sink with the required probability, i.e., the required delay-constrained success ratio (DCSR) is achieved. In order to meet this objective, we propose a novel scheduling and forwarding scheme, namely the deadline-aware scheduling and forwarding (DASF) algorithm. In DASF, the E2E delay distribution with the given network model and parameters is estimated in order to determine the maximum duty cycle interval, with which the required DCSR is satisfied. Each node independently selects a wake-up time using the selected interval, and packets are forwarded to a node in the potential forwarding set, which is determined based on the distance between nodes and the sink. DASF does not require time synchronization between nodes, and a node does not need to maintain neighboring node information in advance. Simulation results show that the proposed scheme can satisfy a required delay-constrained success ratio and outperforms existing algorithms in terms of E2E delay and DCSR.

【 授权许可】

CC BY   
© 2016 by the authors; licensee MDPI, Basel, Switzerland.