Maximizing throughput for low duty-cycled sensor networks
Maximizing throughput for low duty-cycled sensor networks
复制标题
最大限度地提高低占空比传感器网络的吞吐量
DOI：
10.1016/j.comnet.2018.03.017
复制
发表时间：
2018
影响因子：
5.6
通讯作者：
Tang Zhanyong
中科院分区：
文献类型：
--
作者：
Xu Dan;Jiao Wenli;Yin Zhuang;Huang Junjie;Peng Yao;Chen Xiaojiang;Fang Dingyi;Tang Zhanyong
传感和通信是物联网（IoT）的基础。虽然能量效率是一般能量受限的传感器网络的MAC协议设计中的一个重要问题，但对于某些特定的传感器网络来说，吞吐量并不是微不足道的。本文提出了一种新的负载循环机制MaxPut，通过随机和调度负载循环机制的适当组合，在不牺牲能量效率的前提下最大化吞吐量，MaxPut尝试识别风险节点，使风险节点最大化利用邻居节点的活动周期，从而避免突发数据聚集引起的潜在缓冲区溢出.我们得到的整体吞吐量在网络中的同质和异构事件发生过程分别。此外，我们比较MaxPut对一个完全随机的占空比计划。仿真结果表明，MaxPut算法在网络吞吐量方面优于现有算法，而能耗几乎与现有的占空比算法相当.
Sensing and communication are foundations of the Internet of Things(IoT). Although energy efficiency is an important issue in MAC protocol design for general energy limited sensor networks, throughput is non trivial for some specific sensor networks. In this paper, we propose a new duty cycling scheme calledMaxPutthat can maximize throughput without sacrificing energy efficiency through the appropriate combination of random and scheduled duty cycling schemes.MaxPutattempts to identify risky nodes and enables risky nodes to maximize the utilization of active periods of their neighbors such thatMaxPutcan avoid potential buffer overflow due to aggregation of bursty data. We obtain overall throughput in networks with homogeneous and heterogeneous event occurrence processes respectively. Further, we compareMaxPutagainst a fully random duty cycling scheme. The simulation results show thatMaxPutoutperforms prior work with respect to the network throughput, while energy consumption is almost equivalent to the existing duty cycling scheme.