Academic Journals Database
Disseminating quality controlled scientific knowledge

A Routing Priority Scheduling Algorithm for MAC Layer in Wireless Sensor Networks

ADD TO MY LIST
 
Author(s): Liyong Bao | Dongfeng Zhao | Yifan Zhao

Journal: International Journal of Modern Education and Computer Science
ISSN 2075-0161

Volume: 3;
Issue: 2;
Start page: 37;
Date: 2011;
Original page

Keywords: WSNs | MAC scheme | Routing priority | mean queue length | mean cyclic time | the mean delay time

ABSTRACT
Based on the ideas of conflict-free transmission, priority to guarantee transmission quality for communication between the different clusters , this article proposes a scheduling Algorithm fit for the MAC scheme of WSNs, which has made it possible for the polling service capable of differentiating services of the cluster head node of two priority levels. The high-priority service of the cluster head is responsible for routing between the different clusters, via exhaustive service policy, while the low-priority services of the cluster head node, for communication within the cluster through limited service policy with good fairness. 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 and the mean delay time. It turns out that the findings from theoretical analysis correspond well with those from simulated experiments.

Tango Jona
Tangokurs Rapperswil-Jona

     Affiliate Program