A big slot scheduling algorithm for the reliable delivery of real-time data packets in wireless sensor networks

9Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In wireless sensor networks (WSNs), guaranteeing a reliable data transmission over a time-varying wireless channel is a challenging task. The existing TDMA-based MAC protocols assign time slots to the nodes individually for the transmission of data packets safely. However, these protocols may not be suitable for the industrial WSNs in which the stability of wireless links is threatened by various obstacles. In this paper, we propose a new slot allocation and utilization method that allocates one big slot for all nodes at each depth of a tree, and allows the nodes to share it through contention. The big slot constrains the packet transmission delay of all nodes at the same depth, thereby limiting the packet transmission delay to a sink. We show by simulation that the proposed approach is very dependable against the time-varying channel in WSNs.

Cite

CITATION STYLE

APA

Oh, H., & Azad, M. A. K. (2016). A big slot scheduling algorithm for the reliable delivery of real-time data packets in wireless sensor networks. In Lecture Notes in Electrical Engineering (Vol. 348, pp. 13–25). Springer Verlag. https://doi.org/10.1007/978-81-322-2580-5_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free