Title: Energy-efficient routing under delay constraint in duty-cycle wireless sensor networks

Authors: Mengmeng Xu; Hai Zhu; Hengzhou Xu; Xiaofei Yang

Addresses: School of Network Engineering, Zhoukou Normal University, Zhoukou, 466001, Henan, China ' School of Network Engineering, Zhoukou Normal University, Zhoukou, 466001, Henan, China ' School of Network Engineering, Zhoukou Normal University, Zhoukou, 466001, Henan, China ' School of Electronics and Information, Jiangsu University of Science and Technology, Zhenjiang, 212003, Jiangsu, China

Abstract: In this paper, we investigate the problem of energy-efficient routing design from a sensor node to a sink node under a given delay constraint. The network topologies in duty-cycle wireless sensor networks (WSNs) are changed from one time-slot to another due to each sensor node's active/dormant schedule. A series of network topologies over a period of time are modelled as a virtual time-expanded graph. Then, the problem of routing design on the time-expanded graph is defined, whose aim is to find a space-time path from a sensor node to the sink node with the minimum energy consumption under a delay constraint. Next, an energy-efficient routing algorithm in time-expanded graph (ERTG) is proposed to find the optimal space-time path. Simulation results validate the effectiveness of the proposed algorithm in energy savings.

Keywords: routing; energy-efficiency; delay constraint; WSN; wireless sensor network; duty-cycle; time-expanded graph.

DOI: 10.1504/IJSNET.2020.106884

International Journal of Sensor Networks, 2020 Vol.33 No.1, pp.8 - 15

Received: 23 Dec 2019
Accepted: 13 Jan 2020
Published online: 24 Apr 2020 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article