发表状态 | 已发表Published |
题名 | Delay and energy-efficient data collection scheme-based matrix filling theory for dynamic traffic IoT |
作者 | |
发表日期 | 2019-12-01 |
发表期刊 | Eurasip Journal on Wireless Communications and Networking
![]() |
ISSN/eISSN | 1687-1472 |
卷号 | 2019期号:1 |
摘要 | Data collection is the basic functions of the Internet of Things (IoT), in which the sensed data are concentrations from sensor nodes to the sink, with a timely style, so the smart response can be done for emergency. The goal of multi-modal sensor data fusion is to obtain simple and accurate data to enhance system reliability and fault tolerance. Energy efficiency and small delay are the most important indicators which govern the performance of IoT. Convergecast is a low-latency data collection strategy based on effective time division multiple access (TDMA), in which each sensor node generates a packet, and m packets can aggregate to a packet. However, in most practical networks, sensor nodes do not necessarily generate packets during each data collection cycle, but instead generate packets from time to time. In the previous convergecast strategy, each node was fixedly allocated a slot, which increased the delay and wasted energy. A delay and energy-efficient data collection (DEEDC) scheme-based matrix filling theory is proposed to collect data in a randomly generated WSNs with minimum delay and energy consumption. The DEEDC scheme uses a clustering approach. For each cluster, the number of slots required for transmission is calculated by matrix filling theory, not the number of nodes that actually generate data. This ensures that data can be collected in a network with randomly generated data (number of slots ≤ number of nodes), thereby avoiding the allocation of slots for each node and the acquisition of redundant data to lead to the wastage of time and energy. Based on the above, a mixed slot scheduling strategy is proposed to construct energy and delay-efficient, collision-free schedule scheme. After extensive theoretical analysis, by using the DEEDC scheme, the delay is reduced by about 50~80%, and the energy consumed is reduced by about 40~57%. |
关键词 | Clustered routing Energy efficient Low latency Matrix filling Multi-modal |
DOI | 10.1186/s13638-019-1490-5 |
URL | 查看来源 |
收录类别 | SCIE |
语种 | 英语English |
WOS研究方向 | Engineering ; Telecommunications |
WOS类目 | Engineering, Electrical & Electronic ; Telecommunications |
WOS记录号 | WOS:000472855600002 |
Scopus入藏号 | 2-s2.0-85067957349 |
引用统计 | |
文献类型 | 期刊论文 |
条目标识符 | https://repository.uic.edu.cn/handle/39GCC9TT/7086 |
专题 | 个人在本单位外知识产出 |
通讯作者 | Xie, Mande |
作者单位 | 1.School of Computer Science, Central South University, Changsha, 410083, China 2.School of Informatics, Hunan University of Chinese Medicine, Changsha, 410208, China 3.Department of Computer Science and Technology, Huaqiao University, Xiamen, 361021, China 4.School of Computer Science and Information Engineering, Zhejiang Gongshang University, Hangzhou, 310018, China 5.School of Computer Science and Engineering, Hunan University of Science and Technology, Xiangtan, 411201, China 6.Department of Electrical, Computer, Software, and Systems Engineering,Embry-Riddle Aeronautical University, Daytona Beach, 32114, United States 7.Faculty of Informatics & Electronics, Zhejiang SCI-Tech University, Hangzhou, 310018, China |
推荐引用方式 GB/T 7714 | Xiang, Xuemei,Liu, Wei,Wang, Tianet al. Delay and energy-efficient data collection scheme-based matrix filling theory for dynamic traffic IoT[J]. Eurasip Journal on Wireless Communications and Networking, 2019, 2019(1). |
APA | Xiang, Xuemei., Liu, Wei., Wang, Tian., Xie, Mande., Li, Xiong., .. & Zhang, Guoping. (2019). Delay and energy-efficient data collection scheme-based matrix filling theory for dynamic traffic IoT. Eurasip Journal on Wireless Communications and Networking, 2019(1). |
MLA | Xiang, Xuemei,et al."Delay and energy-efficient data collection scheme-based matrix filling theory for dynamic traffic IoT". Eurasip Journal on Wireless Communications and Networking 2019.1(2019). |
条目包含的文件 | 条目无相关文件。 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论