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

Full Text (PDF, 388KB), PP.37-43

Views: 0 Downloads: 0


Liyong Bao 1,* Dongfeng Zhao 1 Yifan Zhao 1

1. School of Information Science and Engineering of Yunnan University,Kunming, China

* Corresponding author.

DOI: https://doi.org/10.5815/ijmecs.2011.02.06

Received: 6 Dec. 2010 / Revised: 10 Jan. 2011 / Accepted: 25 Feb. 2011 / Published: 8 Apr. 2011

Index Terms

WSNs, MAC scheme, Routing priority, mean queue length, mean cyclic time, the mean delay time


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.

Cite This Paper

Liyong Bao, Dongfeng Zhao, Yifan Zhao, "A Routing Priority Scheduling Algorithm for MAC Layer in Wireless Sensor Networks", International Journal of Modern Education and Computer Science(IJMECS), vol.3, no.2, pp.37-43, 2011. DOI:10.5815/ijmecs.2011.02.06


[1]Demirkol I, Ersoy C, Alagoz F, “MAC protocols for wireless sensor networks: a survey,” IEEE Communications, vol. 44,2006, pp. 115-121.
[2]Akyildz I F, Melodia T, Chowdhury K R, “A survey on wireless multimedia sensor networks,”The International Journal of Computer and Telecommunications Networking, vol.51, 2007, pp.921-960.
[3]Lin Xiaohui, Yukwong Kwok, Wang Hui, “Cross-layer design for energy efficient communication in wireless sensor networks.Wireless Communications and Mobile Computing,” vol.9, 2009, pp.251-268.
[4]James M. Gilbert, Farooq Balouchi, “ Comparison of energy harvesting systems for Wireless Sensor Networks,” International Journal of Automation and Computing,” vol.5, 2008, pp. 334-347.
[5]Arisha K A,Youssef M A,Younis M F, “Energy-aware TDMA-based MAC for sensor networks,”In:Proceedings of IEEE Workshop on Integrated Management of Power Aware Communications,Computing and Networking.New York,USA:IEEE,2002,pp.189-201.
[6]Dam TV.Langendoen K, “An adaptive energy-efficient MAC protocol for wireless sensor networks,”In:Proceedings of the 1st International Conference Oll Embedded Networked Sensor Systems.California,USA:ACM,2003,pp.171-180.
[7]Schurgers C,Tsiatsis V,Ganeriwal S,Srivastava M, “Optimizing sensor networks in the energy-latency density design space,”IEEE Transactions on Mobile Computing, vol.1,2002,pp.70—80.
[8]Hnin Yu Shwe, JIANG Xiaohong, Suslginu Horiguchi, “ Energy saving in wireless sensor networks,”Journal of Communication and Computer, vol.6,2009, pp. 20-27.
[9]Rubin I, De Moraes L F, “ Message Delay Analysis for Polling and Token Multiple-Access Schemes for Local Communication Networks,”IEEE J. Select. Areas Commun, 1983, pp.935-947.
[10]Abinash Mahapatra, Kumar Anand, Dharma P. Agrawal, “QoS and Energy Aware Routing for Real-Time Traffic in Wireless Sensor Networks,” Computer Communications, 2006,pp.437-445.
[11]Ian F. Akyildiz, Ismail H. Kasimoglu. Wireless Sensor and Actor Networks: Research Challenges,” Ad Hoc Networks, vol.2,2004,pp.351-367.
[12]Jane Y. Yu and Peter H. J. Chong, “A Survey of Clustering Schemes for Mobile Ad Hoc Networks,” IEEE Communications Surveys & Tutorials. First Quarter ,vol.7,2005, pp.32- 48.
[13]H. Gupta, S.R. Das, Q. Gu, “ Connected Sensor Cover: Self-Organization of Sensor Networks for Efficient Query Execution,” ACM/IEEE Transactions on Networking, 2005.
[14]Takagi H, “Analysis of Polling Systems,”Cambridge, MA: The M.I.T. Press, 1986.
[15]Mei R D van der, and Winands E M M, “ Heavy traffic analysis of polling models by mean value analysis,” Performance Evaluation, vol.6,2008, pp. 400-416.
[16]Zhao Dongfeng, Zheng Sumin, “ Message Waiting Time Analysis for a Polling System with Gated Service,” Journal of China Institute of Communications, vol. 15,1994, pp.18-23.
[17]Zhao Dongfeng, Zheng Sumin, “ Analysis of a Polling Model with Exhaustive Service,” Acta. Electronica Sinica, vol.22, 1994, pp.102-107.
[18]Seungmin Baek, Hwakyung Rim, Sungchun Kim, “ Socket-based RR scheduling scheme for tightly coupled clusters providing single-name images,” Journal of Systems Architecture, Volume 50, Issue 6, 2004, pp. 299-308.
[19]Zhi Wang, Haibin Yu, Yeqiong Song, Youxian Sun, “ Characteristics of Mean Period of M1+M2/G/1 Polling System under Mixed Service,” Journal of China Institute of Communications,vol. 23, 2002, pp. 8-18.
[20]H. Levy, M. Sidi, “ Polling systems: applications, modeling and optimization,” IEEE Transactions on Communications, vol.38,1990,pp. 1750-1759.
[21]V M Vishnevskii, O V Semenova, “ Mathematical methods to study the polling systems,” Automation and Remote Control, vol.2,2006,pp. 173-220.
[22]Onno Boxma, Josine Bruin, Brian Fralix, “ Sojourn times in polling systems with various service disciplines,”Performance Evaluation, vol.66,2009, pp.621-639.