Energy-efficient routing under delay constraint in duty-cycle wireless sensor networks
by Mengmeng Xu; Hai Zhu; Hengzhou Xu; Xiaofei Yang
International Journal of Sensor Networks (IJSNET), Vol. 33, No. 1, 2020

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.

Online publication date: Fri, 24-Apr-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com