A SURVEY: Duty cycle based routing and scheduling in wireless sensor networks

Abstract

Wireless sensor networks consist of spatially distributed sensor nodes, which can sense the environment by collecting, processing and transmitting the data to sink node. A critical issue in wireless sensor networks since most sensors is equipped with non-rechargeable batteries. The lifetime of a sensor network can be extended by jointly applying different techniques of scheduling and routing schemes also brings great challenges to the design of efficient distributed routing protocols for multi-hop wireless sensor networks. In scheduling algorithms, the nodes are arranged to sleep when they are not in use. The main purpose of scheduling algorithms is to minimize resource starvation and to ensure fairness amongst the parties utilizing the resources. The routing can be applied to wireless sensor networks for reducing energy consumption caused by retransmissions and dynamically detouring critical sensor nodes with less energy. To achieve network lifetime maximization of wireless sensor network through joint routing schemes and scheduling algorithms. This paper surveys the latest progresses in scheduling and routing schemes.