Dynamic scheming the duty cycle in the opportunistic routing sensor network

Abstract

Summary In wireless sensor networks, a lot of applications need the sensed information be transmitted to the sink node within a predefined time threshold. So end‐to‐end delay is an important performance metric in wireless sensor networks. Opportunistic routing protocols have been proposed to reduce the waiting delay. In the duty cycle networks, increasing the duty cycle ratio can also reduce the end‐to‐end delay. However, this method will consume more energy. It is obvious that there exists a trade‐off between delay and energy consumption. So adjusting the duty cycle ratio of each node can investigate this trade‐off. To the best of our knowledge, no existing work takes both of end‐to‐end delay and energy efficiency into consideration in the opportunistic routing networks. In this paper, we want to minimize the whole energy consumption while guaranteeing the expected end‐to‐end delay between the source nodes and the sink node is below the given threshold. To deal with this problem, we propose a dynamic duty cycle scheme which can significantly reduce the energy consumption and guarantee the expected end‐to‐end delay demand in the opportunistic routing network. To be specific, firstly, we formulate a new metric with the wake‐up time slots as the variable to measure the end‐to‐end delay. Secondly, for simplifying the complex problem, we decompose it into a set of single‐hop delay guarantee problems. Feedback controller has been used to solve the problem. We also analyze the influence of the multiple receivers in the same forwarding set. Finally, we conduct extensive simulations to evaluate the performance of the proposed algorithm. The experimental results reveal that our scheme can guarantee the delay requirement, meanwhile, significantly reduce the energy consumption compared with prior schemes.

DDS: A Delay-Constrained Duty-Cycle Scheduling Algorithm in Wireless Sensor Networks

“…A few studies [20][21][22]25] considered the delay bound requirement in WSNs. For example, Yang and Augé-Blum [20] proposed a wake-up scheduling-based forwarding scheme to satisfy the delay bound while the network achieves a high packet delivery ratio.…”

“…As a result, it is hard for them to achieve a balanced performance between E2E delay and energy consumption. We also note that a few studies [20][21][22] considered both the delay bound requirement and energy consumption. However, those works required additional information or certain assumptions.…”

“…However, those works required additional information or certain assumptions. For example, nodes have to synchronize wake-up schedules among other nodes in the network [20][21][22].…”

“…• This work proposes the delay-constrained duty-cycle scheduling (DDS) algorithm to achieve low energy consumption while satisfying the delay requirement in duty-cycled WSNs. Unlike several existing works [7][8][9][10][11][12][20][21][22] which needed strict time synchronization, DDS does not require time synchronization nor wake-up synchronization. Moreover, in contrast to some studies which assumed a specific node deployment [18,19,25] (i.e., uniformly random distribution), the proposed duty-cycle scheduling algorithm can be applied to WSNs with various node deployment scenarios.…”

Foreword to the special issue on parallel and distributed computing with its applications

“…D. Takafuji, K. Nakano, Y. Ito, and J. L. Bordim demonstrated a time‐optimal implementation for bulk execution of an oblivious sequential algorithm and developed a tool named C2CU to automatically generate a CUDA C program for this bulk execution. End‐to‐end delay and energy consumption are the key concerns in designing wireless sensor networks (WSNs); B. Niu, H. Qi, K. Li, X. Liu, and W. Xue addressed this problem in previous study, where a dynamic duty cycle scheme is proposed to reduce the energy consumption while guaranteeing the expected end‐to‐end delay demand in the opportunistic routing network.…”