基于小波包变换的模拟电路故障诊断

把小波包变换用于模拟电路故障诊断中。由于输出信号的各频率成分能量的变化表征了电路中某些元器件的损坏情况,因此,利用小波包变换有效地提取故障特征信息,提出了“能量——故障”的故障诊断方法。计算和实验结果表明：该方法可以快速高效地进行模拟电路故障诊断与定位。     

小波包分析在故障特征提取与识别中的应用

对观测信号进行小波包分析,从而提取故障信息,建立能够表征系统特征的状态向量,用模式识别的方法对系统进行故障检测与定位,实现系统的故障诊断。     

基于光纤光栅传感技术的复合材料损伤检测

随着科学技术的不断进步和发展,越来越多的新型复合材料构件在工业制造过程中被采用,然而复合材料在服役过程中一旦损坏将造成巨大的损失,因此对复合材料的结构健康检测显得十分重要。将布拉格光纤光栅（FBG）传感技术应用于玻璃纤维复合材料薄板检测,采用主动冲击的方式在玻璃纤维复合材料板上激励声波,采集损伤前后的冲击响应信号,研究基于小波包能量谱的冲击响应的损伤识别。通过小波包分解,得到损伤前后的小波能量谱变化比直方图,比较图中各阶小波包能量比,能够实现复合材料的损伤识别。     

基于小波包与支持向量机结合的滤波器故障诊断研究

首先介绍了小波包分解与重构算法和支持向量机的分类算法,然后以一个带通滤波器故障诊断为实例,利用小波包提取特征响应向量建立样本集,并利用支持向量机完成滤波器电路的故障诊断,诊断效果良好。     

基于小波包分析的辐射源特征提取和识别算法

提出了一种基于小波包的变换方法。该方法通过对不同脉内调制方式进行频带能量的提取,并引入支持向量机来完成对辐射源的分类。该小波包变换对信号局部的时频特征具有较好的分辨率。仿真结果表明,文中的小波包变换信号时频特征的分析精度优于传统算法。     

基于小波包变换的辐射源信号特征提取和识别

文中基于小波包变换方法,对MSK信号辐射源提取了J-散度特征和能量特征,结合支持向量机分类器完成辐射源的识别,仿真结果表明：两者识别率均达到90％以上,从而验证了基于小波包变换的辐射源识别的有效性。     

基于小波分析的倒装芯片主动红外缺陷检测

随着微电子技术的需求和发展,倒装芯片技术在高密度微型化封装领域得到了快速发展和广泛应用,而现有的一些倒装芯片检测方法存在一定的不足之处。为此,研究了主动红外的倒装芯片缺陷检测方法。实验中使用激光加热对倒装样片施加非接触热激励,通过红外热像仪获取样片温度分布。采用小波分析方法提取包括小波熵在内的信号特征,采用自组织神经网络对不同类型焊球进行聚类识别。研究表明,通过自组织神经网络可以有效地将不同缺陷焊球与参考焊球通过距离映射法映射到不同区域从而区分开,并且可以将未知焊球信号映射到相应的区域实现聚类识别。因此该方法可以有效实现倒装芯片的缺陷检测。     

压电耦合智能板结构中微损伤识别方法研究

基于小波包能量谱分析方法,研究了压电耦合板结构中微损伤及其损伤程度的检测和识别方法。通过建立压电耦合板的谱有限元模型,数值模拟研究了金属板中微小凹陷损伤发生细微变化时传感器的动态响应;进而采用小波包分析技术对响应信号进行分解,得到一系列子信号的能量谱,分析了不同程度凹陷损伤对各节点能量谱的分布和幅值变化所产生的影响。研究结果表明,小波包能量谱能够对微小凹陷损伤及其损伤程度进行较为灵敏地识别,为实际检测工作提供了参考。     

小波包在车载移动电话语音信号提取中的应用

利用小波包理论对车载移动电话的接收信号进行小波包变换,通过设定一合适的阈值对变换后的信号进行量化处理．提取出主要由发动机产生的噪声信号,然后用实际检测信号减去小波包变换信号,得出汽车司机的语音信号．从而达到消除噪声的目的。利用MATLAB的小波工具箱对所提出的方法进行验证,结果表明提取后的信号与驾驶员的声音信号十分相似,误差较小,对发动机噪声有明显的抑制作用。     

超声散射CT信号的特征提取

超声检测技术中,缺陷的定性分类这一技术难题至今尚未得以彻底解决。研究了希尔伯特-黄变换(HHT)和小波包变换(WPT)在超声散射CT特征提取中的应用。以荷兰试块作为测试对象,针对3个不同的检测面,采用HHT和WPT提取能量特征,采用基于距离的类别可分性判据对特征提取结果进行评价,起了定量衡量尺度的作用。实验结果表明:对于本实验中信号频率比较单一的超声散射CT信号,WPT提取的能量特征比HHT提取的能量特征更为有效。     

基于压电陶瓷的灌浆套筒内壁锈蚀监测研究

为了识别灌浆套筒内壁因氯离子侵蚀后达到的不同锈蚀程度,首先,通过加速锈蚀的相关理论方法推导了套筒内壁达到不同锈蚀率所需要的时长;然后,采用电化学法对套筒内壁进行加速锈蚀,并使用锈蚀监测系统对5组不同锈蚀工况下的试件进行监测,获得各试件在不同激励频率下的时域信号;最后,通过信号峰-峰值和小波包能量值对时域信号进行分析,提...     

基于最优小波包基的信号增强算法研究及应用

本文介绍了小波包分析的基本理论以及小波包信号降噪的基本原理,与小波变换相比,小波包变换则是对小波分解中所得到的高频部分再继续细分为一些子频带,具有更精细的信噪分离能力,所以对包含大量中、高频信息的信号能更好地进行时频局部化分析。小波包变换在信号去噪中有着非常重要的应用,因此利用小波包对信号进行消噪也越来越受到科学界的关注。本文的主旨在于研究最优小波包基函数的选取方法,以小波包分析为基础,根据最小代价原理研究信号分解的最佳小波包基,从而在最优小波包基的基础上获得最好的信号增强效果。     

Improved ant colony-based multi-constrained QoS energy-saving routing and throughput optimization in wireless Ad-hoc networks简

In order to establish a route supporting multi-constrained quality of service（QoS）, increase network throughput and reduce network energy consumption, an improved ant colony-based multi-constrained QoS energy-saving routing algorithm（IAMQER） is proposed. The ant colony algorithm, as one of the available heuristic algorithms, is used to find the optimal route from source node to destination node. The proposed IAMQER algorithm, which is based on the analysis of local node information such as node queue length, node forwarding number of data packets and node residual energy, balances the relationship between the network throughput and the energy consumption, thus improving the performance of network in multi-constrained QoS routing. Simulation results show that this IAMQER algorithm can find the QoS route that reduce average energy consumption and improves network packet delivery ratio under the end-to-end delay and packet loss ratio constraints.     

Analysis of mean packet delay for upstream transmissions in passive optical networks with sleep mode

The sleep mode has been introduced to improve the energy efficiency of passive optical networks (PONs) with interleaved polling with adaptive cycle time (IPACT) as a medium access control (MAC) scheme. For energy saving, the sleep mode of each optical network unit (ONU) is activated based on the packet queue length for upstream traffic. We model such a PON as an N-user M/G/1 queue with reservations and vacations. Based on the framework of M/G/1 queueing analysis with some modification made to incorporate the nature of IPACT as well as the sleep mode, we derive a closed form expression of the mean packet delay. A unique challenge in our analysis is that certain quantities such as the residual time of an on-going sleep period for the upstream channel must be considered from the network's viewpoint while the delay due to the sleep mode experienced by a packet must be considered from the ONU's viewpoint. Simulation experiments are conducted to validate the analytical results and to show that the results are relatively insensitive to packet arrival statistics for large sleep periods. Finally, we demonstrate how a sleep period can be chosen given the quality-of-service (QoS) requirement on the mean packet delay.     

EARQ: Energy Aware Routing for Real-Time and Reliable Communication in Wireless Industrial Sensor Networks

Wireless industrial sensor networks are wireless sensor networks which have been adapted to industrial applications. Most techniques for wireless sensor networks can be applied to wireless industrial sensor networks. However, for industrial applications of wireless industrial sensor networks, new requirements such as real-time, reliable delivery need to be considered. In this paper, we propose EARQ, which is a novel routing protocol for wireless industrial sensor networks. It provides real-time, reliable delivery of a packet, while considering energy awareness. In EARQ, a node estimates the energy cost, delay and reliability of a path to the sink node, based only on information from neighboring nodes. Then, it calculates the probability of selecting a path, using the estimates. When packet forwarding is required, it randomly selects the next node. A path with lower energy cost is likely to be selected, because the probability is inversely proportional to the energy cost to the sink node. To achieve real-time delivery, only paths that may deliver a packet in time are selected. To achieve reliability, it may send a redundant packet via an alternate path, but only if it is a source of a packet. Experimental results show that EARQ is suitable for industrial applications, due to its capability for energy efficient, real-time, reliable communications.      

Energy-efficient packet transmission over a wireless link

The paper considers the problem of minimizing the energy used to transmit packets over a wireless link via lazy schedules that judiciously vary packet transmission times. The problem is motivated by the following observation. With many channel coding schemes, the energy required to transmit a packet can be significantly reduced by lowering transmission power and code rate and therefore transmitting the packet over a longer period of time. However, information is often time-critical or delay-sensitive and transmission times cannot be made arbitrarily long. We therefore consider packet transmission schedules that minimize energy subject to a deadline or a delay constraint. Specifically, we obtain an optimal offline schedule for a node operating under a deadline constraint. An inspection of the form of this schedule naturally leads us to an online schedule which is shown, through simulations, to perform closely to the optimal offline schedule. Taking the deadline to infinity, we provide an exact probabilistic analysis of our offline scheduling algorithm. The results of this analysis enable us to devise a lazy online algorithm that varies transmission times according to backlog. We show that this lazy schedule is significantly more energy-efficient compared to a deterministic (fixed transmission time) schedule that guarantees queue stability for the same range of arrival rates.     

A reliable and security method for data aggregation in WSNs

Data aggregation in wireless sensor networks (WSNs) eliminates the data redundancy and is widely accepted as an essential paradigm for energy efficient routing in sensor networks. In this paper, we describe a protocol called RDA which associates a packet's reliability in data transmission with the amount of information it contains and gives the packet containing more information higher reliability in data transmission by adjust the degree of redundancy. Our algorithm is not associated with some special routing schemes, hence it can be used in any kinds of routing schemes for wireless sensor networks especially where data aggregation takes place and ensure a data packet with more information be transmitted more reliably and in that way reliability per energy could be improved.     

On energy efficiency of geographic opportunistic routing in lossy multihop wireless networks

Geographic opportunistic routing (GOR) is an emerging technique that can improve energy efficiency in lossy multihop wireless networks. GOR makes local routing decision by using nodes?? location information, and exploits the broadcast nature and spatial diversity of the wireless medium to improve the packet forwarding reliability. In this paper, our goal is to fully understand the principles and tradeoffs in GOR, thus provide insightful analysis and guidance to the design of more efficient routing protocols in multihop wireless networks. We propose a local metric, one-hop energy efficiency (OEE), to balance the packet advancement, reliability and energy consumption in GOR. We identify and prove important properties about GOR on selecting and prioritizing the forwarding candidates in order to maximize the expected packet advancement. Leveraging the proved properties, we then propose two localized candidate selection algorithms with O(N ³) running time to determine the forwarding candidate set that maximizes OEE, where N is the number of available next-hop neighbors. Through extensive simulations, we show that GOR applying OEE achieves better energy efficiency than the existing geographic routing and blind opportunistic routing schemes under different node densities and packet sizes.     

A novel scheme for protecting receiver's location privacy in wireless sensor networks

Due to the open nature of a sensor network, it is relatively easy for an adversary to eavesdrop and trace packet movement in the network in order to capture the receiver physically. After studying the adversary's behavior patterns, we present countermeasures to this problem. We propose a locationprivacy routing protocol (LPR) that is easy to implement and provides path diversity. Combining with fake packet injection, LPR is able to minimize the traffic direction information that an adversary can retrieve from eavesdropping. By making the directions of both incoming and outgoing traffic at a sensor node uniformly distributed, the new defense system makes it very hard for an adversary to perform analysis on locally gathered information and infer the direction to which the receiver locates. We evaluate our defense system based on three criteria: delivery time, privacy protection strength, and energy cost. The simulation results show that LPR with fake packet injection is capable of providing strong protection for the receiver?s location privacy. Under similar energy cost, the safe time of the receiver provided by LPR is much longer than other methods, including Phantom routing [1] and DEFP [2]. The performance of our system can be tuned through a few system parameters that determine the tradeoff between energy cost and the strength of location-privacy protection.