检索结果-南通市图书馆

RFID Based non-preemptive Random Sleep Scheduling in WSN

Computers, Materials & Continua 2020年第10期65卷 835-845页

作者： Tianle Zhang Lihua Yin Xiang Cui Abhishek Behl Fuqiang Dong Ziheng Cheng Kuo Ma Cyberspace Institute of Advanced Technology Guangzhou UniversityGuangzhou510006China Shailesh J.Mehta School of Management Indian Institute of TechnologyBombayIndia Cyberspace Security Research Center Peng Cheng LaboratoryShenzhen518000China School of Cyberspace Security Beijing University of Posts and TelecommunicationsBeijing100876China

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 *** schemes have to ensure high duty cycling to ensure enough percentage of active nodes and then derogate the energy *** paper proposes an RFID based non-preemptive random sleep scheduling scheme with stable low duty *** 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 *** eliminates energy consumption of repeated retransmission of the delayed ***,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 *** 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

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Algorithm for Cost non-preemptive Scheduling of Partial k-Trees

引用

Open Journal of Applied Sciences 2012年第4期2卷 233-236页

作者： Yiming Li Zhiqian Ye Xiao Zhou Center of Mordern Educational Technology Wenzhou University Wenzhou Zhejiang 325035 P.R.China College of Biomedical Engineering and Science Instrument Zhejiang University Hangzhou Zhejiang 310027 P.R. China Graduate School of Information Sciences Tohoku University Sendai 980-8579 Japan

Let G be a graph, in which each vertex (job) v has a positive integer weight (processing time) p(v) and eachedge (u,v) represented that the pair of jobs u and v cannot be processed in the same slot. In this paper we assume that every job is non-preemptive. Let C={1,2,...} be a color set. A multicoloring (scheduling) F of G is to assign each job v a set of p(v) consecutive positive integers (processing consecutive time slots) in C so that any pair of adjacent vertices receive disjoint sets. Such a multicoloring is called a non-preemptive scheduling. The cost non-preemptive scheduling problem is to find an optimal multicoloring of G.

关键词： Coloring non-preemptive scheduling Partial k-tree

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Optimal Patient Routing Policies at Diagnosis-stage in Outpatient Department non-preemptive Queues

Optimal Patient Routing Policies at Diagnosis-stage in Outpa...

引用

第26届中国控制与决策会议

作者： Huabo Zhu Dan Chen Jun Gong Jiafu Tang College of Information Science and Engineering Northeastern University State Key Laboratory of Synthetical Automation for Process Industries (Northeastern University) Liaoning Institute of Science and Technology

ISBN: (纸本)9781479937097

The diagnosis-stage is always the bottleneck stage for the normal arriving patient flow and the referral patient flow influx in Outpatient Department（OD） in Chinese hospital. And the referral patient has high-priority than the normal arriving patient in general. How to minimize the referral patients mean waiting time and meanwhile keeping the normal patients queue stable? Around the goal a general two types of patient flow with non-preemptive and homogeneous server queueing model is established. An optimal patients routing policies named admissible policy is proposed and the main result formulas are developed. Some analysis around the result is made to verify the validity of the admissible policy. Based on result analysis a new question about server fairness workload is discovered in future research.

关键词： admissible policy non-preemptive homogeneous healthcare queues

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：