EasiRCC: A Method of Rule-Matching and Conflict Resolution for Smart Home

被引:0
|
作者
Huang X. [1 ,2 ]
Li D. [1 ]
Shi H. [1 ]
Cui L. [1 ]
机构
[1] Institute of Computing Technology, Chinese Academy of Sciences, Beijing
[2] University of Chinese Academy of Sciences, Beijing
来源
Jisuanji Yanjiu yu Fazhan/Computer Research and Development | 2017年 / 54卷 / 12期
基金
中国国家自然科学基金;
关键词
Conflict resolution; Hash function; Internet of things; Mixed-priority; Rule-matching; Smart home;
D O I
10.7544/issn1000-1239.2017.20160646
中图分类号
学科分类号
摘要
With the rapid development of the Internet of things, smart home based on Internet of things has gradually entered into family life of people. The user can accord to the requirement for personalized and customized service life. However, smart home systems appear conflicts between rules frequently, because the number of rules is becoming more and more. Therefore, this paper proposes EasiRCC, a new-type method of rapid rule-matching and conflict resolution. Resolving the conflict problem mainly focuses on rule-matching and conflict resolution. Firstly, for the problem of rule-matching, because repeating matching takes place in the existing methods frequently, we propose an algorithm named EasiRMA, which is used to fast match rule based on Hash function and raise the efficiency of rule-matching. Secondly, for the problem of conflict resolution, we come up with a scheduling mechanism of mixed-priority, which the system can adaptively adjust priority of rules, and resolve rule-conflict in time. Experimental results show that EasiRCC's efficiency of rule-matching is not changing as the number of rules is increased, and its running time is constant, but the running time of traditional matching method is O(N), and EasiRCC can effectively resolve conflict in the condition that does not affect users' normal household lives. © 2017, Science Press. All right reserved.
引用
收藏
页码:2711 / 2720
页数:9
相关论文
empty
未找到相关数据