5篇
您的检索式：作者名="Tan Minsheng"
|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | A low power MAC protocol for wireless sensor networks 显示文摘 | Tian Haitao Tan Minsheng Chen Wei | 2010 | Network Security Technology & Application2010，，1： | 1 |
| 2 | A Low Power MAC Protocol for Wireless Sensor Networks 显示文摘 | Tian Haitao Tan Minsheng Chen Wei | 2010 | Network Security Technology & Application2010，，1： | 1 |
| 3 | An artificial immunity--based proactive defense system显示文摘 | Tan minsheng Yu honfxiao Zhao zhiguo | 2007 | IEEE in- ternational Conference on Robotics and Biomimetics2007，15，18： | 1 |
| 4 | Improvement for LEACH Algorithm in Wireless Sensor Network显示文摘According to the energy bottleneck of the wireless sensor network, the LEACH algorithm is improved in this paper, in the LEACH algorithm, it maybe that the cluster head nodes are far from the base station, and cluster head node has non-uniform distribution, in this case, nodes soon died after consuming energy, so the focus from three aspects of the optimal number of the cluster head and uniform distribution and many jump communication to improve, the improved algorithm through the simulation tests show that network node energy has been obviously saved, at the same time the lifecycle of the system is also effectively extension. In the application of the wireless sensor, we should always hold the principle of energy-first, therefore the LEACH which is a hierarchical routing protocol can save energy has played a crucial role, but the optimal number of the cluster head and uniform distribution can’t be archived because of the change of the location of the cluster head nodes. In addition, when the cluster head far away from center sink node communicate with center sink node, the cluster head will exhaust energy quickly to die, that may affect lifecycle of whole of monitoring network and lead to worse expansibility. For some problems of the LEACH algorithm, the LEACH algorithm is improved in this paper from three aspects of the optimal number of the cluster head and uniform distribution and many jump communication, the improved algorithm through the simulation tests show that network node energy has been obviously saved. | Shiying Xia Minsheng Tan Zhiguo Zhao Ting Xiang | 2016 | 国际计算机前沿大会会议论文集2016，，1： | 0 |
| 5 | HCS: Expanding H-Code RAID 6 without Recalculating Parity Blocks in Big Data Circumstance显示文摘This paper introduces a new RAID 6 expanding method HCS, which is facing the circumstance of big data. HCS expands H-Code manner RAID 6. Two key techniques are used to avoid parity blocks’ recalculating.The first one is anti-diagonal data blocks’ selection, and the other one is horizontal data migration. These two techniques ensure the data blocks are retained in the same verification zone, that is horizontal verification zone and anti-diagonal verification zone. Experimental results showed that, compared with SDM, which is also a fast expansion method, HCS can reduce 3.6% expansion time and promote 4.62% performance under four traces. | Shiying Xia Yu Mao Minsheng Tan Weipeng Jing | 2015 | 国际计算机前沿大会会议论文集2015，，1： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员