Vol.65, No.1, 2020, pp.835-845, doi:10.32604/cmc.2020.06050
RFID Based Non-Preemptive Random Sleep Scheduling in WSN
  • Tianle Zhang1, Lihua Yin1, Xiang Cui1, *, Abhishek Behl2, Fuqiang Dong3, Ziheng Cheng4, Kuo Ma4
1 Cyberspace Institute of Advanced Technology, Guangzhou University, Guangzhou, 510006, China.
2 Shailesh J. Mehta School of Management, Indian Institute of Technology, Bombay, India.
3 Cyberspace Security Research Center, Peng Cheng Laboratory, Shenzhen, 518000, China.
4 School of Cyberspace Security, Beijing University of Posts and Telecommunications, Beijing, 100876, China.
* Corresponding Author: Xiang Cui. Email: cuixiang@gzhu.edu.cn.
Received 17 January 2019; Accepted 03 June 2020; Issue published 23 July 2020
In Wireless Sensor Network (WSN), because battery and energy supply are constraints, sleep scheduling is always needed to save energy while maintaining connectivity for packet delivery. Traditional schemes have to ensure high duty cycling to ensure enough percentage of active nodes and then derogate the energy efficiency. This paper proposes an RFID based non-preemptive random sleep scheduling scheme with stable low duty cycle. It employs delay tolerant network routing protocol to tackle the frequent disconnections. A low-power RFID based non-preemptive wakeup signal is used to confirm the availability of next-hop before sending packet. It eliminates energy consumption of repeated retransmission of the delayed packets. Moreover, the received wakeup signal is postponed to take effect until the sleep period is finished, and the waken node then responds to the sending node to start the packet delivery. The scheme can keep stable duty cycle and then ensure energy saving effect compared with other sleeping scheduling methods.
Sleep scheduling, RFID, partially connected, Delay Tolerant Network (DTN), wakeup, non-preemptive.
Cite This Article
Zhang, T., Yin, L., Cui, X., Behl, A., Dong, F. et al. (2020). RFID Based Non-Preemptive Random Sleep Scheduling in WSN. CMC-Computers, Materials & Continua, 65(1), 835–845.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.