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. Index Terms - WSNs, MAC scheme, priority-based, mean queue length, mean cyclic time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
