An Efficient Scheduling Algorithm for Cluster in Wireless Sensor Networks MAC Protocol

DOI

10.2991/ccit-14.2014.13How to use a DOI?

Keywords

WSNs, MAC scheme, priority-based, mean queue length, mean cyclic time.

Abstract

As one of the most important techniques in the 21st century, Wireless Sensor Networks(WSNs) receive a universal attention to the research on its key techniques. A solution is urgently expected to meet the higher-quality service requirements of new applications on the limited bandwidth of wireless networks. This paper proposes a scheduling Algorithm fit for the MAC scheme of WSNs, which has made possible the polling service capable of differentiating services of the cluster head node of two priority levels. The theoretical model of this scheme is established through Markov chain and probability generating function. Mathematical analysis is made on the mean queue length, the mean inquiry cyclic time. It turns out that the findings from theoretical analysis correspond well with those from simulated experiments.

Copyright

© 2014, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Yifan Zhao
AU  - Liyong Bao
AU  - Shaowen Yao
PY  - 2014/01
DA  - 2014/01
TI  - An Efficient Scheduling Algorithm for Cluster in Wireless Sensor Networks MAC Protocol
BT  - Proceedings of the 2014 International Conference on Computer, Communications and Information Technology
PB  - Atlantis Press
SP  - 42
EP  - 45
SN  - 1951-6851
UR  - https://doi.org/10.2991/ccit-14.2014.13
DO  - 10.2991/ccit-14.2014.13
ID  - Zhao2014/01
ER  -