A Dynamic Scheme Based on Clustering for Wireless Sensor Networks MAC Protocol

Abstract

Wireless Sensor Networks(WSNs), as one of the most important techniques in the 21st century, receives a universal attention to the research on its key techniques. A solution is urgently expected to meet the higher-quality service requirements of various applications on the limited bandwidth of wireless networks. Based on the ideas of Priority-based polling transmission with high-efficiency, and dynamic self-adaptation to loading, this paper presents a new analysis model of MAC Scheme of wireless sensor networks, which has made possible the Cluster Header capable of differentiating the nodes of different priority levels under mixed services policy and which has improved the flexibility and adaptability of the system via adjustment of the switch-in service in three time of load change input. The theoretical model of this protocol is established with Markov chain and probability generating function. Mathematical analysis is made on the mean queue length and the mean inquiry cyclic time of the common queue and the key node. It turns out that the findings from theoretical analysis correspond well with those from simulated experiments.