To solve dynamic obstacle avoidance problems, a novel algorithm was put forward with the advantages of wireless sensor network (WSN). In view of moving velocity and direction of both the obstacles and robots, a mathem...To solve dynamic obstacle avoidance problems, a novel algorithm was put forward with the advantages of wireless sensor network (WSN). In view of moving velocity and direction of both the obstacles and robots, a mathematic model was built based on the exposure model, exposure direction and critical speeds of sensors. Ant colony optimization (ACO) algorithm based on bionic swarm intelligence was used for solution of the multi-objective optimization. Energy consumption and topology of the WSN were also discussed. A practical implementation with real WSN and real mobile robots were carried out. In environment with multiple obstacles, the convergence curve of the shortest path length shows that as iterative generation grows, the length of the shortest path decreases and finally reaches a stable and optimal value. Comparisons show that using sensor information fusion can greatly improve the accuracy in comparison with single sensor. The successful path of robots without collision validates the efficiency, stability and accuracy of the proposed algorithm, which is proved to be better than tradition genetic algorithm (GA) for dynamic obstacle avoidance in real time.展开更多
Radio block center(RBC)system is the core equipment of China train control system-3(CTCS-3).Now,the fault analysis of RBC system mainly depends on manual work,and the diagnostic results are inaccurate and inefficient....Radio block center(RBC)system is the core equipment of China train control system-3(CTCS-3).Now,the fault analysis of RBC system mainly depends on manual work,and the diagnostic results are inaccurate and inefficient.Therefore,the intelligent fault diagnosis method of RBC system based on one-hot model,kernel principal component analysis(KPCA)and self-organizing map(SOM)network was proposed.Firstly,the fault document matrix based on one-hot model was constructed by the fault feature lexicon selected manually and fault tracking record table.Secondly,the KPCA method was used to reduce the dimension and noise of the fault document matrix to avoid information redundancy.Finally,the processed data were input into the SOM network to train the KPCA-SOM fault classification model.Compared with back propagation(BP)neural network algorithm and SOM network algorithm,common fault patterns of train control RBC system can be effectively distinguished by KPCA-SOM intelligent diagnosis model,and the accuracy and processing efficiency are further improved.展开更多
Failure of one or multiple critical nodes may partition wireless sensor networks into disjoint segments, and thus brings negative effect on the applications. We propose DCRS, a Distributed Connectivity Restoration Str...Failure of one or multiple critical nodes may partition wireless sensor networks into disjoint segments, and thus brings negative effect on the applications. We propose DCRS, a Distributed Connectivity Restoration Strategy to tolerate the failure of one critical node. Because of the energy restriction of sensor nodes, the energy overhead of the recovery process should be minimized to extend the lifetime of the network. To achieve it, we first design a novel algorithm to identify 2-critical nodes only relying on the positional information of 1-hop neighbors and some 2-hop neighbors, and then we present the criteria to select an appropriate backup for each critical node. Finally, we improve the cascaded node movement algorithm by determining whether a node can move to another non-adjacent node directly or not to reduce the number of nodes moved. The effectiveness of DCRS is validated through extensive simulation experiments.展开更多
MANET routing is critical and routing decision should be made sooner before the node leaves the network.Fast decisions always compensate network performance.In addition,most MANET routing protocols assume a friendly a...MANET routing is critical and routing decision should be made sooner before the node leaves the network.Fast decisions always compensate network performance.In addition,most MANET routing protocols assume a friendly and cooperative environment,and hence are vulnerable to various attacks.Trust and Reputation would serve as a major solution to these problems.Learning the network characteristics and choosing right routing decisions at right times would be a significant solution.In this work,we have done an extensive survey of fault tolerant protocols and ant colony algorithms applied to routing in MANETs.We propose a QoS constrained fault tolerant ant lookahead routing algorithm which attempts to identify valid route and look-ahead route pairs which might help in choosing the alternate path in case of valid route failure.The results prove that the proposed algorithm takes better routing decisions with 20-30 percent improvement compared with existing ant colony algorithms.展开更多
In a multi-hop wireless mesh network, wireless links are vulnerable due to severe channel fading, interference and physical damage. In this paper, we will provide a coding scheme to protect from multiple failures in w...In a multi-hop wireless mesh network, wireless links are vulnerable due to severe channel fading, interference and physical damage. In this paper, we will provide a coding scheme to protect from multiple failures in wireless mesh networks to achieve high throughput where the redundancy is considered for the average number of failures. Our coding scheme is designed to protect from the average number of failures to increase the network throughput. When the number of failures is more than the average case, the destination will have to wait for more coded packets in the following time slots.展开更多
基金Project(60475035) supported by the National Natural Science Foundation of China
文摘To solve dynamic obstacle avoidance problems, a novel algorithm was put forward with the advantages of wireless sensor network (WSN). In view of moving velocity and direction of both the obstacles and robots, a mathematic model was built based on the exposure model, exposure direction and critical speeds of sensors. Ant colony optimization (ACO) algorithm based on bionic swarm intelligence was used for solution of the multi-objective optimization. Energy consumption and topology of the WSN were also discussed. A practical implementation with real WSN and real mobile robots were carried out. In environment with multiple obstacles, the convergence curve of the shortest path length shows that as iterative generation grows, the length of the shortest path decreases and finally reaches a stable and optimal value. Comparisons show that using sensor information fusion can greatly improve the accuracy in comparison with single sensor. The successful path of robots without collision validates the efficiency, stability and accuracy of the proposed algorithm, which is proved to be better than tradition genetic algorithm (GA) for dynamic obstacle avoidance in real time.
基金Natural Science Foundation of Gansu Province(No.1310RJZA061)。
文摘Radio block center(RBC)system is the core equipment of China train control system-3(CTCS-3).Now,the fault analysis of RBC system mainly depends on manual work,and the diagnostic results are inaccurate and inefficient.Therefore,the intelligent fault diagnosis method of RBC system based on one-hot model,kernel principal component analysis(KPCA)and self-organizing map(SOM)network was proposed.Firstly,the fault document matrix based on one-hot model was constructed by the fault feature lexicon selected manually and fault tracking record table.Secondly,the KPCA method was used to reduce the dimension and noise of the fault document matrix to avoid information redundancy.Finally,the processed data were input into the SOM network to train the KPCA-SOM fault classification model.Compared with back propagation(BP)neural network algorithm and SOM network algorithm,common fault patterns of train control RBC system can be effectively distinguished by KPCA-SOM intelligent diagnosis model,and the accuracy and processing efficiency are further improved.
文摘Failure of one or multiple critical nodes may partition wireless sensor networks into disjoint segments, and thus brings negative effect on the applications. We propose DCRS, a Distributed Connectivity Restoration Strategy to tolerate the failure of one critical node. Because of the energy restriction of sensor nodes, the energy overhead of the recovery process should be minimized to extend the lifetime of the network. To achieve it, we first design a novel algorithm to identify 2-critical nodes only relying on the positional information of 1-hop neighbors and some 2-hop neighbors, and then we present the criteria to select an appropriate backup for each critical node. Finally, we improve the cascaded node movement algorithm by determining whether a node can move to another non-adjacent node directly or not to reduce the number of nodes moved. The effectiveness of DCRS is validated through extensive simulation experiments.
文摘MANET routing is critical and routing decision should be made sooner before the node leaves the network.Fast decisions always compensate network performance.In addition,most MANET routing protocols assume a friendly and cooperative environment,and hence are vulnerable to various attacks.Trust and Reputation would serve as a major solution to these problems.Learning the network characteristics and choosing right routing decisions at right times would be a significant solution.In this work,we have done an extensive survey of fault tolerant protocols and ant colony algorithms applied to routing in MANETs.We propose a QoS constrained fault tolerant ant lookahead routing algorithm which attempts to identify valid route and look-ahead route pairs which might help in choosing the alternate path in case of valid route failure.The results prove that the proposed algorithm takes better routing decisions with 20-30 percent improvement compared with existing ant colony algorithms.
文摘In a multi-hop wireless mesh network, wireless links are vulnerable due to severe channel fading, interference and physical damage. In this paper, we will provide a coding scheme to protect from multiple failures in wireless mesh networks to achieve high throughput where the redundancy is considered for the average number of failures. Our coding scheme is designed to protect from the average number of failures to increase the network throughput. When the number of failures is more than the average case, the destination will have to wait for more coded packets in the following time slots.
