Energy Efficient TDMA Sleep Scheduling in Wireless Sensor Networks

Ma, Junchao; Lou, Wei; Wu, Yu‐Shan; Li, X.-Y.; Chen, Guihai

doi:10.1109/infcom.2009.5061970

Cited by 129 publications

(61 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Time-division multiple access (TDMA) is the basis on which schedule-based protocols are developed [19]. They conserve energy by making use of both scheduling and reservations.…”

Section: Background and Related Mac Protocolmentioning

confidence: 99%

Adaptive Sleep Efficient Hybrid Medium Access Control algorithm for next-generation wireless sensor networks

Bakhsh

AlGhamdi

Altalhi

et al. 2017

J Wireless Com Network

View full text Add to dashboard Cite

The scheduling algorithm is a fundamental design problem to allocate resources amongst different entities in distributive wireless sensor networks (WSNs). These sensor nodes have limited power and non-replenishable energy resources. In WSNs, the duty cycling mechanism is commonly used to save energy due to idle listening. On the other hand, a fixed duty cycling mechanism increases transmission latency in WSNs. Therefore, in order to ensure the prolonged network-life of WSNs, the medium access control (MAC) protocol should be tackled in an efficient manner to improve energy efficiency by minimizing idle listening, maximizing sleep duration, and eliminating data collision. This paper proposes a practical Adaptive Sleep Efficient Hybrid Medium Access Control (AEH-MAC) algorithm in which the key idea is to dynamically adjust nodes' sleep time to improve the scheduling in WSNs. The AEH-MAC allows nodes to adjust sleep time dynamically according to the traffic load and coordinate wakeup time with neighbour nodes. A series of short taken packets are transmitted to wake the receiver, and a prediction field is introduced in the ACK packets (GRANT/RELEASE) to reduce the waiting time of the source node. In the proposed algorithm, each node maps a conflict-free time slot for itself up to two-hop neighbouring nodes. The simulation results show that the AEH-MAC algorithm achieves high performance in terms of runtime, number of rounds, energy consumption, and slot reservation.

show abstract

“…Time-division multiple access (TDMA) is the basis on which schedule-based protocols are developed [19]. They conserve energy by making use of both scheduling and reservations.…”

Section: Background and Related Mac Protocolmentioning

confidence: 99%

Adaptive Sleep Efficient Hybrid Medium Access Control algorithm for next-generation wireless sensor networks

Bakhsh

AlGhamdi

Altalhi

et al. 2017

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…4(b) because l 2,1 interferes with l 6,7 . But l 3,1 , l 4,1 and l 5,1 do not interfere with l 6,7 , l 11,7 , l 12,7 and l 13,7 , so v 1 can still be assigned time slots from t 4 to t 6 when v 7 are assigned time slots from t 3 to t 6 . By this way, we could get another valid contiguous link scheduling using 8 time slots (as shown in Fig.…”

Section: Centralized Scheduling With Spatial Reusementioning

confidence: 99%

“…(4) We conduct simulations to show the efficiency of the proposed algorithms in terms of total energy consumption, throughput, and time delay. This paper has several additional advances compared to the preliminary work [13]: First, the contiguous link scheduling problem in WSNs is extended from homogeneous networks to heterogeneous networks. Second, the complete proof of the NP-completeness of the contiguous link scheduling problem in WSNs is provided.…”

Section: Introductionmentioning

confidence: 99%

Contiguous Link Scheduling for Data Aggregation in Wireless Sensor Networks

Lou

2014

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Abstract-Wireless sensor networks (WSNs) consist of a large number of battery-powered wireless sensor nodes, and one key issue in WSNs is to reduce the energy consumption while maintaining the normal functions of WSNs. Data aggregation, as a typical operation in data gathering applications, can cause a lot of energy wastage since sensor nodes, when not receiving data, may keep in the listen state during the data collection process. To save this energy wastage, sleep scheduling algorithms can be used to turn the nodes to the sleep state when their radios are not in use and wake them up when necessary. In this paper, we identify the contiguous link scheduling problem in WSNs, in which each node is assigned consecutive time slots so that the node can wake up only once in a scheduling period to fulfil its data collection task. The objective of the problem is to find an interference-free link scheduling with the minimum number of time slots used. In virtue of the contiguous link scheduling, the energy consumption caused by nodes' state transitions can be reduced. We prove the contiguous link scheduling problem in WSNs to be NP-complete, and then present efficient centralized and distributed algorithms with theoretical performance bounds in both homogeneous and heterogeneous networks. We also conduct simulation experiments that corroborate the theoretical results and demonstrate the efficiency of our proposed algorithms.

show abstract

“…Broadcast transmissions are expensive: they require to copy the same information n times where n is the number of neighbors. Such solutions are also called link scheduling in [32] and [33]. A genetic solution is proposed in [31].…”

Section: Solutions Dependent On the Medium Accessmentioning

confidence: 99%

“…However, if with edge coloring slots are not assigned carefully, a node can awake as many times as one-hop neighbors. Hence, the choice of contiguous slots would help in energy saving [61]. Moreover, edge coloring does not support broadcast communications.…”

Section: Choice Of Vertex Coloringmentioning

confidence: 99%

Energy Efficient Routing and Node Activity Scheduling in the OCARI Wireless Sensor Network

2010

View full text Add to dashboard Cite

Sensor nodes are characterized by a small size, a low cost, an advanced communication technology, but also a limited amount of energy. Energy efficient strategies are required in such networks to maximize network lifetime. In this paper, we focus on a solution integrating energy efficient routing and node activity scheduling. The energy efficient routing we propose, called EOLSR, selects the route and minimizes the energy consumed by an end-to-end transmission, while avoiding nodes with low residual energy. Simulation results show that EOLSR outperforms the solution selecting the route of minimum energy as well as the solution based on node residual energy. Cross-layering allows EOLSR to use information from the application layer or the MAC layer to reduce its overhead and increase network lifetime. Node activity scheduling is based on the following observation: the sleep state is the least power consuming state. So, to schedule node active and sleeping periods, we propose SERENA that colors all network nodes using a small number of colors, such that two nodes with the same color can transmit without interfering. The node color is mapped into a time slot during which the node can transmit. Consequently, each node is awake during its slot and the slots of its one-hop neighbors, and sleeps in the remaining time. We evaluate SERENA benefits obtained in terms of bandwidth, delay and energy. We also show how cross-layering with the application layer can improve the end-to-end delays for data gathering applications.

show abstract

Energy Efficient TDMA Sleep Scheduling in Wireless Sensor Networks

Cited by 129 publications

References 23 publications

Adaptive Sleep Efficient Hybrid Medium Access Control algorithm for next-generation wireless sensor networks

Adaptive Sleep Efficient Hybrid Medium Access Control algorithm for next-generation wireless sensor networks

Contiguous Link Scheduling for Data Aggregation in Wireless Sensor Networks

Energy Efficient Routing and Node Activity Scheduling in the OCARI Wireless Sensor Network

Contact Info

Product

Resources

About