Packet aggregation real-time scheduling for large-scale WIA-PA industrial wireless sensor networks | |
Jin X(金曦)1![]() ![]() | |
Department | 工业控制网络与系统研究室 |
Source Publication | ACM Transactions on Embedded Computing Systems
![]() |
ISSN | 1539-9087 |
2018 | |
Volume | 17Issue:5Pages:1-19 |
Indexed By | SCI ; EI |
EI Accession number | 20183905871009 |
WOS ID | WOS:000452067400007 |
Contribution Rank | 1 |
Funding Organization | National Natural Science Foundation of China ; Youth Innovation Promotion Association of the Chinese Academy of Sciences |
Keyword | Industrial Wireless Sensor Networks Packet Aggregation Real-time Scheduling Multi-channel Tdma |
Abstract | The IEC standard WIA-PA is a communication protocol for industrial wireless sensor networks. Its special features, including a hierarchical topology, hybrid centralized-distributed management and packet aggregation make it suitable for large-scale industrial wireless sensor networks. Industrial systems place large real-time requirements on wireless sensor networks. However, the WIA-PA standard does not specify the transmission methods, which are vital to the real-time performance of wireless networks, and little work has been done to address this problem. In this article, we propose a real-time aggregation scheduling method for WIA-PA networks. First, to satisfy the real-time constraints on dataflows, we propose a method that combines the real-time theory with the classical bin-packing method to aggregate original packets into the minimum number of aggregated packets. The simulation results indicate that our method outperforms the traditional bin-packing method, aggregating up to 35% fewer packets, and improves the real-time performance by up to 10%. Second, to make it possible to solve the scheduling problem of WIA-PA networks using the classical scheduling algorithms, we transform the ragged time slots of WIA-PA networks to a universal model. In the simulation, a large number of WIA-PA networks are randomly generated to evaluate the performances of several real-time scheduling algorithms. By comparing the results, we obtain that the earliest deadline first real-time scheduling algorithm is the preferred method for WIA-PA networks. |
Language | 英语 |
WOS Subject | Computer Science, Hardware & Architecture ; Computer Science, Software Engineering |
WOS Keyword | Energy Efficiency |
WOS Research Area | Computer Science |
Funding Project | National Natural Science Foundation of China[61502474] ; National Natural Science Foundation of China[61533015] ; Youth Innovation Promotion Association of the Chinese Academy of Sciences |
Citation statistics | |
Document Type | 期刊论文 |
Identifier | http://ir.sia.cn/handle/173321/22820 |
Collection | 工业控制网络与系统研究室 |
Corresponding Author | Zeng P(曾鹏) |
Affiliation | 1.Shenyang Institute of Automation, Chinese Academy of Sciences and Key Laboratory of Networked Control Systems, Chinese Academy of Sciences, 114 Nanta Street, Shenyang 110016, China 2.Hong Kong Polytechnic University, Hong Kong, China |
Recommended Citation GB/T 7714 | Jin X,Guan N,Xia CQ,et al. Packet aggregation real-time scheduling for large-scale WIA-PA industrial wireless sensor networks[J]. ACM Transactions on Embedded Computing Systems,2018,17(5):1-19. |
APA | Jin X,Guan N,Xia CQ,Wang JT,&Zeng P.(2018).Packet aggregation real-time scheduling for large-scale WIA-PA industrial wireless sensor networks.ACM Transactions on Embedded Computing Systems,17(5),1-19. |
MLA | Jin X,et al."Packet aggregation real-time scheduling for large-scale WIA-PA industrial wireless sensor networks".ACM Transactions on Embedded Computing Systems 17.5(2018):1-19. |
Files in This Item: | ||||||
File Name/Size | DocType | Version | Access | License | ||
Packet aggregation r(2037KB) | 期刊论文 | 出版稿 | 开放获取 | CC BY-NC-SA | View Application Full Text |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment