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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
