High-throughput drilling of titanium alloys

Experiments of high-throughput drilling of Ti–6Al–4V at 183 m/min cutting speed and 156 mm³/s material removal rate (MRR) using a 4 mm diameter WC–Co spiral point drill were conducted. The tool material and geometry and drilling process parameters, including cutting speed, feed, and fluid supply, were studied to evaluate the effect on drill life, thrust force, torque, energy, and burr formation. The tool wear mechanism, hole surface roughness, and chip light emission and morphology for high-throughput drilling were investigated. Supplying the cutting fluid via through-the-drill holes has proven to be a critical factor for drill life, which can be increased by 10 times compared to that of dry drilling at 183 m/min cutting speed and 0.051 mm/rev feed. Under the same MRR of 156 mm³/s with a doubled feed of 0.102 mm/rev (91 m/min cutting speed), over 200 holes can be drilled. The balance of cutting speed and feed is essential to achieve long drill life and good hole surface roughness. This study demonstrates that, using proper drilling process parameters, spiral point drill geometry, and fine-grained WC–Co tool material, the high-throughput drilling of Ti alloy is technically feasible.     

无线网络中TCP/NC协议性能分析与仿真验证

为改进传统传输控制协议( TCP)在无线网络中的性能,运用Matlab对TCP Reno,TCP Vegas和基于网络编码的TCP/NC吞吐率分析模型进行数值求解,分析3个模型在不同网络环境下应达到的理论值,验证TCP/NC模型在理论上能否提高其吞吐率。基于NS-2对3种吞吐率模型进行仿真,结果表明,TCP/NC及其分析模型可有效改进TCP协议。     

基于竞争窗口递减因子自适应调整退避算法

包括IEEE802.11、802.15.4标准在内的许多无线网络协议都采用二进制指数退避机制管理数据的重发。在动态分布式的网络环境中,二进制指数退避算法固定的竞争窗口递减方式难以适应动态变化的网络规模。针对这一问题,提出了一种改进的回退机制,该机制通过引入竞争窗口递减因子,自适应地调整无线节点的等待时间,以实现网络吞吐量的最大化。同时,在算法实现上提出一种启发式算法以跟踪网络中竞争节点数量的改变。在IEEE 802.11DCF协议中以相同的物理层参数进行仿真,结果表明改进算法提高了网络吞吐量,降低了分组平均接入时延。     

一种利用并发提高数据处理吞吐率的模型

针对分布式组网终端集中式数据采集与处理系统实时性高、数据吞吐量大、周期性强等特点,引入了一种利用并发机制的大吞吐量实时数据处理模型,在讨论模型基本结构和原理的基础上,深入研究了决定模型数据吞吐效率和时效性能的并发缓存机制和算法设计。利用该模型实现的数据采集处理系统在基于GPRS组网的1500个自动气象站数据采集与处理业务应用中,性能稳定可靠,能够满足对周期性大批量实时＂浪涌＂数据进行实时快速处理的要求,大大提高了数据处理的吞吐效率。     

基于3D Mesh结构的一种静态路由算法

3D NoC在同构多核系统中相比2D NoC具有更为优越的性能.本文在研究3D Mesh结构的基础上,对拓扑结构中的平均延时和理想吞吐量进行了理论上的评估,并提出了一种基于3D Mesh的新的静态路由算法,最后运用NS2网络仿真软件对其进行仿真和比较.实验结果显示,新的路由算法可以有效地提高吞吐量,并在大规模数据传输时...     

多速率环境下AODV协议的改进

分析AODV协议在多速率环境下的不足,提出一种改进的协议AODV-HC.AODV-HC采用传输容量作为判断路径优劣的标准,通过链路单向稳定性和链路传输能力的度量,构建路径传输容量度量体系.在路径选择上将每条链路的稳定性和链路可承载的容量纳入考虑因素,能有效解决多速率环境下多跳低速链路带来的吞吐量限制.通过对AODV协议的路由请求信息和路由表的扩充以及对路由发现和路由回复过程的改进来实现AODV-HC协议.仿真实验表明基于传输容量度量的AODV-HC协议在节点高密度分布时能够提高网络的饱和吞吐量和分组交付率,降低平均分组传输时延.     

无线Ad hoc网络MAC层吞吐量分析

MAC层吞吐量分析是无线Ad hoc网络容量分析的基础。对CSMA协议特别是IEEE802.11DCF协议建立了一个Markov链分析模型。分析得出状态间的转移概率,通过建立状态方程得出稳态概率的线性方程。通过数值方法得出稳态解,从而得到无线Ad hoc网络MAC层吞吐量,并与公认的网络容量分析结果做了比较。通过吞吐量与节点数及分组大小的关系曲线,为网络性能的优化提供了理论基础。     

基于块I/O的RAID设计

磁盘阵列(RAID)是当前能够提供存储系统高可用性和高可靠性的一项重要技术。它通过软硬件的冗余和奇偶校验提供数据的重构和恢复。针对当前在RAID控制软件设计的过程中面临多次数据拷贝的问题,文中提出了一种基于块I/O的RAID系统设计。它利用最新的Linux内核所提供的BIO机制,插入到SCSI Target的中间层进行数据I/O的处理。它能屏蔽掉上层不同的设备驱动类型,提供到IP-SAN的无缝链接。实验表明,该设计能够减少数据的传输延迟,最大限度地提高数据传输过程中的吞吐率,避免了多次昂贵的内存拷贝操作。     

Throughput analysis in censoring-based cooperative cognitive radio network with energy harvesting

An energy harvesting (EH) and cooperative cognitive radio (CR) network (CRN) is studied in this paper where CR users transmit data through a primary user (PU) channel if the channel remains idle, else an optimal number CRs helps in transmission of PU. To achieve the optimum number of CRs (ONCR) involved in cooperation, a novel scheme based on a combination of channel censoring and total error is proposed. The performance of the proposed scheme is investigated under RF harvesting scenario. The EH is dependent on sensing decision and a CR source harvests energy from PU's RF signal. The harvested energy (HE) is split into two parts: One part is used by the CR network (CRN) for its own transmission, and the other part is used for supporting PU. The effect of the energy allocation factor on total throughput is also investigated. New expressions for optimal number of CRs and throughput are developed. The effect of network parameters such as sensing time, censoring threshold, and energy allocation parameter (EAP) on throughput is investigated. Impact of distance between nodes is also studied.