Fault diagnosis of various systems on rolling stock has drawn the attention of many researchers. However, obtaining an optimized sensor set of these systems, which is a prerequisite for fault diagnosis, remains a majo...Fault diagnosis of various systems on rolling stock has drawn the attention of many researchers. However, obtaining an optimized sensor set of these systems, which is a prerequisite for fault diagnosis, remains a major challenge. Available literature suggests that the configuration of sensors in these systems is presently dependent on the knowledge and engineering experiences of designers, which may lead to insufficient or redundant development of various sensors. In this paper, the optimization of sensor sets is addressed by using the signed digraph （SDG） method. The method is modified for use in braking systems by the introduction of an effect-function method to replace the traditional quantitative methods. Two criteria are adopted to evaluate the capability of the sensor sets, namely, observability and resolution. The sensors configuration method of braking system is proposed. It consists of generating bipartite graphs from SDG models and then solving the set cover problem using a greedy algorithm. To demonstrate the improvement, the sensor configuration of the HP2008 braking system is investigated and fault diagnosis on a test bench is performed. The test results show that SDG algorithm can improve single-fault resolution from 6 faults to 10 faults, and with additional four brake cylinder pressure （BCP） sensors it can cover up to 67 double faults which were not considered by traditional fault diagnosis system. SDG methods are suitable for reducing redundant sensors and that the sensor sets thereby obtained are capable of detecting typical faults, such as the failure of a release valve. This study investigates the formal extension of the SDG method to the sensor configuration of braking system, as well as the adaptation supported by the effect-function method.展开更多
Wireless sensor networks are suffering from serious frequency interference.In this paper,we propose a channel assignment algorithm based on graph theory in wireless sensor networks.We first model the conflict infectio...Wireless sensor networks are suffering from serious frequency interference.In this paper,we propose a channel assignment algorithm based on graph theory in wireless sensor networks.We first model the conflict infection graph for channel assignment with the goal of global optimization minimizing the total interferences in wireless sensor networks.The channel assignment problem is equivalent to the generalized graph-coloring problem which is a NP-complete problem.We further present a meta-heuristic Wireless Sensor Network Parallel Tabu Search(WSN-PTS) algorithm,which can optimize global networks with small numbers of iterations.The results from a simulation experiment reveal that the novel algorithm can effectively solve the channel assignment problem.展开更多
This paper investigates the node localization problem for wireless sensor networks in three-dimension space. A distributed localization algorithm is presented based on the rigid graph. Before location, the communicati...This paper investigates the node localization problem for wireless sensor networks in three-dimension space. A distributed localization algorithm is presented based on the rigid graph. Before location, the communication radius is adaptively increasing to add the localizability. The localization process includes three steps: firstly, divide the whole globally rigid graph into several small rigid blocks; secondly, set up the local coordinate systems and transform them to global coordinate system; finally, use the quadrilateration iteration technology to locate the nodes in the wireless sensor network. This algorithm has the advantages of low energy consumption, low computational complexity as well as high expandability and high localizability. Moreover, it can achieve the unique and accurate localization. Finally, some simulations are provided to demonstrate the effectiveness of the proposed algorithm.展开更多
For the problem of track correlation failure under the influence of sensor system deviation in wireless sensor networks,a new track correlation method which is based on relative positional relation chart matching is p...For the problem of track correlation failure under the influence of sensor system deviation in wireless sensor networks,a new track correlation method which is based on relative positional relation chart matching is proposed.This method approximately simulates the track correlation determination process using artificial data,and integrally matches the relative position relation between multiple targets in the common measuring space of various sensors in order to fulfill the purpose of multi-target track correlation.The simulation results show that this method has high correlation accuracy and robustness.展开更多
Due to the mutual interference and sharing of wireless links in TDMA wireless sensor networks, conflicts will occur when data messages are transmitting between nodes. The broadcast scheduling problem （BSP） is aimed ...Due to the mutual interference and sharing of wireless links in TDMA wireless sensor networks, conflicts will occur when data messages are transmitting between nodes. The broadcast scheduling problem （BSP） is aimed to schedule each node in different slot of fixed length frame at least once, and the objective of BSP is to seek for the optimal feasible solution, which has the shortest length of frame slots, as well as the maximum node transmission. A two-stage mixed algorithm based on a fuzzy Hopfield neural network is proposed to solve this BSP in wireless sensor network. In the first stage, a modified sequential vertex coloring algorithm is adopted to obtain a minimal TDMA frame length. In the second stage, the fuzzy Hopfleld network is utilized to maximize the channel utilization ratio. Experimental results, obtained from the running on three benchmark graphs, show that the algorithm can achieve better performance with shorter frame length and higher channel utilizing ratio than other exiting BSP solutions.展开更多
Wireless multimedia sensor network (WMSN) consists of sensors that can monitor multimedia data from its surrounding, such as capturing image, video and audio. To transmit multimedia information, large energy is requir...Wireless multimedia sensor network (WMSN) consists of sensors that can monitor multimedia data from its surrounding, such as capturing image, video and audio. To transmit multimedia information, large energy is required which decreases the lifetime of the network. In this paper we present a clustering approach based on spectral graph partitioning (SGP) for WMSN that increases the lifetime of the network. The efficient strategies for cluster head selection and rotation are also proposed.展开更多
Wireless Multimedia Sensor Networks (WMSNs) are comprised of small embedded audio/video motes capable of extracting the surrounding environmental information, locally processing it and then wirelessly transmitting it ...Wireless Multimedia Sensor Networks (WMSNs) are comprised of small embedded audio/video motes capable of extracting the surrounding environmental information, locally processing it and then wirelessly transmitting it to sink/base station. Multimedia data such as image, audio and video is larger in volume than scalar data such as temperature, pressure and humidity. Thus to transmit multimedia information, more energy is required which reduces the lifetime of the network. Limitation of battery energy is a crucial problem in WMSN that needs to be addressed to prolong the lifetime of the network. In this paper we present a clustering approach based on Spectral Graph Partitioning (SGP) for WMSN that increases the lifetime of the network. The efficient strategies for cluster head selection and rotation are also proposed as part of clustering approach. Simulation results show that our strategy is better than existing strategies.展开更多
基金Supported by National Hi-tech Research and Development Program of China(863 Program,Grant No.2011AA110503-3)Fundamental Research Funds for the Central Universities of China(Grant No.2860219030)Foundation of Traction Power State Key Laboratory of Southwest Jiaotong University,China(Grant No.TPL1308)
文摘Fault diagnosis of various systems on rolling stock has drawn the attention of many researchers. However, obtaining an optimized sensor set of these systems, which is a prerequisite for fault diagnosis, remains a major challenge. Available literature suggests that the configuration of sensors in these systems is presently dependent on the knowledge and engineering experiences of designers, which may lead to insufficient or redundant development of various sensors. In this paper, the optimization of sensor sets is addressed by using the signed digraph （SDG） method. The method is modified for use in braking systems by the introduction of an effect-function method to replace the traditional quantitative methods. Two criteria are adopted to evaluate the capability of the sensor sets, namely, observability and resolution. The sensors configuration method of braking system is proposed. It consists of generating bipartite graphs from SDG models and then solving the set cover problem using a greedy algorithm. To demonstrate the improvement, the sensor configuration of the HP2008 braking system is investigated and fault diagnosis on a test bench is performed. The test results show that SDG algorithm can improve single-fault resolution from 6 faults to 10 faults, and with additional four brake cylinder pressure （BCP） sensors it can cover up to 67 double faults which were not considered by traditional fault diagnosis system. SDG methods are suitable for reducing redundant sensors and that the sensor sets thereby obtained are capable of detecting typical faults, such as the failure of a release valve. This study investigates the formal extension of the SDG method to the sensor configuration of braking system, as well as the adaptation supported by the effect-function method.
基金supported by National Key Basic Research Program of China(973 program) under Grant No. 2007CB307101National Natural Science Foundation of China under Grant No.60833002,No.60802016,No.60972010+1 种基金Next Generation Internet of China under Grant No.CNGI-0903-05the Fundamental Research Funds for the Central Universities under Grant No.2009YJS011
文摘Wireless sensor networks are suffering from serious frequency interference.In this paper,we propose a channel assignment algorithm based on graph theory in wireless sensor networks.We first model the conflict infection graph for channel assignment with the goal of global optimization minimizing the total interferences in wireless sensor networks.The channel assignment problem is equivalent to the generalized graph-coloring problem which is a NP-complete problem.We further present a meta-heuristic Wireless Sensor Network Parallel Tabu Search(WSN-PTS) algorithm,which can optimize global networks with small numbers of iterations.The results from a simulation experiment reveal that the novel algorithm can effectively solve the channel assignment problem.
基金supported by the National Natural Science Foundation of China(61375105 61403334)
文摘This paper investigates the node localization problem for wireless sensor networks in three-dimension space. A distributed localization algorithm is presented based on the rigid graph. Before location, the communication radius is adaptively increasing to add the localizability. The localization process includes three steps: firstly, divide the whole globally rigid graph into several small rigid blocks; secondly, set up the local coordinate systems and transform them to global coordinate system; finally, use the quadrilateration iteration technology to locate the nodes in the wireless sensor network. This algorithm has the advantages of low energy consumption, low computational complexity as well as high expandability and high localizability. Moreover, it can achieve the unique and accurate localization. Finally, some simulations are provided to demonstrate the effectiveness of the proposed algorithm.
基金Supported by the National Basic Research Program of China (973 Program) (2006CB303000)
文摘For the problem of track correlation failure under the influence of sensor system deviation in wireless sensor networks,a new track correlation method which is based on relative positional relation chart matching is proposed.This method approximately simulates the track correlation determination process using artificial data,and integrally matches the relative position relation between multiple targets in the common measuring space of various sensors in order to fulfill the purpose of multi-target track correlation.The simulation results show that this method has high correlation accuracy and robustness.
基金supported by the National Natural Science Foundation of China (60775047)Hunan Provincial Natural Science Foundation of China (07JJ6111)
文摘Due to the mutual interference and sharing of wireless links in TDMA wireless sensor networks, conflicts will occur when data messages are transmitting between nodes. The broadcast scheduling problem （BSP） is aimed to schedule each node in different slot of fixed length frame at least once, and the objective of BSP is to seek for the optimal feasible solution, which has the shortest length of frame slots, as well as the maximum node transmission. A two-stage mixed algorithm based on a fuzzy Hopfield neural network is proposed to solve this BSP in wireless sensor network. In the first stage, a modified sequential vertex coloring algorithm is adopted to obtain a minimal TDMA frame length. In the second stage, the fuzzy Hopfleld network is utilized to maximize the channel utilization ratio. Experimental results, obtained from the running on three benchmark graphs, show that the algorithm can achieve better performance with shorter frame length and higher channel utilizing ratio than other exiting BSP solutions.
文摘Wireless multimedia sensor network (WMSN) consists of sensors that can monitor multimedia data from its surrounding, such as capturing image, video and audio. To transmit multimedia information, large energy is required which decreases the lifetime of the network. In this paper we present a clustering approach based on spectral graph partitioning (SGP) for WMSN that increases the lifetime of the network. The efficient strategies for cluster head selection and rotation are also proposed.
文摘Wireless Multimedia Sensor Networks (WMSNs) are comprised of small embedded audio/video motes capable of extracting the surrounding environmental information, locally processing it and then wirelessly transmitting it to sink/base station. Multimedia data such as image, audio and video is larger in volume than scalar data such as temperature, pressure and humidity. Thus to transmit multimedia information, more energy is required which reduces the lifetime of the network. Limitation of battery energy is a crucial problem in WMSN that needs to be addressed to prolong the lifetime of the network. In this paper we present a clustering approach based on Spectral Graph Partitioning (SGP) for WMSN that increases the lifetime of the network. The efficient strategies for cluster head selection and rotation are also proposed as part of clustering approach. Simulation results show that our strategy is better than existing strategies.
