Unmanned aerial vehicles(UAVs)have become one of the key technologies to achieve future data collection due to their high mobility,rapid deployment,low cost,and the ability to establish line-of-sight communication lin...Unmanned aerial vehicles(UAVs)have become one of the key technologies to achieve future data collection due to their high mobility,rapid deployment,low cost,and the ability to establish line-of-sight communication links.However,when UAV swarm perform tasks in narrow spaces,they often encounter various spatial obstacles,building shielding materials,and high-speed node movements,which result in intermittent network communication links and cannot support the smooth comple-tion of tasks.In this paper,a high mobility and dynamic topol-ogy of the UAV swarm is particularly considered and the high dynamic mobile topology-based clustering(HDMTC)algorithm is proposed.Simulation and real flight verification results verify that the proposed HDMTC algorithm achieves higher stability of net-work,longer link expiration time(LET),and longer node lifetime,all of which improve the communication performance for UAV swarm networks.展开更多
Multi-target tracking(MTT) is a research hotspot of wireless sensor networks at present.A self-organized dynamic cluster task allocation scheme is used to implement collaborative task allocation for MTT in WSN and a s...Multi-target tracking(MTT) is a research hotspot of wireless sensor networks at present.A self-organized dynamic cluster task allocation scheme is used to implement collaborative task allocation for MTT in WSN and a special cluster member(CM) node selection method is put forward in the scheme.An energy efficiency model was proposed under consideration of both energy consumption and remaining energy balance in the network.A tracking accuracy model based on area-sum principle was also presented through analyzing the localization accuracy of triangulation.Then,the two models mentioned above were combined to establish dynamic cluster member selection model for MTT where a comprehensive performance index function was designed to guide the CM node selection.This selection was fulfilled using genetic algorithm.Simulation results show that this method keeps both energy efficiency and tracking quality in optimal state,and also indicate the validity of genetic algorithm in implementing CM node selection.展开更多
To avoid uneven energy consuming in wireless sen- sor networks, a clustering routing model is proposed based on a Bayesian game. In the model, Harsanyi transformation is introduced to convert a static game of incomple...To avoid uneven energy consuming in wireless sen- sor networks, a clustering routing model is proposed based on a Bayesian game. In the model, Harsanyi transformation is introduced to convert a static game of incomplete information to the static game of complete but imperfect information. In addition, the existence of Bayesian nash equilibrium is proved. A clustering routing algorithm is also designed according to the proposed model, both cluster head distribution and residual energy are considered in the design of the algorithm. Simulation results show that the algorithm can balance network load, save energy and prolong network lifetime effectively.展开更多
To improve the recognition rate of signal modulation recognition methods based on the clustering algorithm under the low SNR, a modulation recognition method is proposed. The characteristic parameter of the signal is ...To improve the recognition rate of signal modulation recognition methods based on the clustering algorithm under the low SNR, a modulation recognition method is proposed. The characteristic parameter of the signal is extracted by using a clustering algorithm, the neural network is trained by using the algorithm of variable gradient correction （Polak-Ribiere） so as to enhance the rate of convergence, improve the performance of recognition under the low SNR and realize modulation recognition of the signal based on the modulation system of the constellation diagram. Simulation results show that the recognition rate based on this algorithm is enhanced over 30% compared with the methods that adopt clustering algorithm or neural network based on the back propagation algorithm alone under the low SNR. The recognition rate can reach 90% when the SNR is 4 dB, and the method is easy to be achieved so that it has a broad application prospect in the modulating recognition.展开更多
Privacy is becoming one of the most notable challenges threatening wireless sensor networks(WSNs).Adversaries may use RF(radio frequency) localization techniques to perform hop-by-hop trace back to the source sensor&#...Privacy is becoming one of the most notable challenges threatening wireless sensor networks(WSNs).Adversaries may use RF(radio frequency) localization techniques to perform hop-by-hop trace back to the source sensor's location.A multiple k-hop clusters based routing strategy(MHCR) is proposed to preserve source-location privacy as well as enhance energy efficiency for WSNs.Owing to the inherent characteristics of intra-cluster data aggregation,each sensor of the interference clusters is able to act as a fake source to confuse the adversary.Moreover,dummy traffic could be filtered efficiently by the cluster heads during the data aggregation,ensuring no energy consumption be burdened in the hotspot of the network.Through careful analysis and calculation on the distribution and the number of interference clusters,energy efficiency is significantly enhanced without reducing the network lifetime.Finally,the security and delay performance of MHCR scheme are theoretically analyzed.Extensive analysis and simulation results demonstrate that MHCR scheme can improve both the location privacy security and energy efficiency markedly,especially in large-scale WSNs.展开更多
The network performance and the unmanned aerial vehicle(UAV)number are important objectives when UAVs are placed as communication relays to enhance the multi-agent information exchange.The problem is a non-determinist...The network performance and the unmanned aerial vehicle(UAV)number are important objectives when UAVs are placed as communication relays to enhance the multi-agent information exchange.The problem is a non-deterministic polynomial hard(NP-hard)multi-objective optimization problem,instead of generating a Pareto solution,this work focuses on considering both objectives at the same level so as to achieve a balanced solution between them.Based on the property that agents connected to the same UAV are a cluster,two clustering-based algorithms,M-K-means(MKM)and modified fast search and find density of peaks(MFSFDP)methods,are first proposed.Since the former algorithm requires too much computational time and the latter one requires too many relays,an algorithm for the balanced network performance and relay number(BPN)is proposed by discretizing the area to avoid missing the optimal relay positions and defining a new local density function to reflect the network performance metric.Simulation results demonstrate that the proposed algorithms are feasible and effective.Comparisons between these algorithms show that the BPN algorithm uses fewer relay UAVs than the MFSFDP and classic set-covering based algorithm,and its computational time is far less than the MKM algorithm.展开更多
For the problem of large network load generated by the Gnutella resource-searching model in Peer to Peer （P2P） network, a improved model to decrease the network expense is proposed, which establishes a duster in P2P...For the problem of large network load generated by the Gnutella resource-searching model in Peer to Peer （P2P） network, a improved model to decrease the network expense is proposed, which establishes a duster in P2P network, auto-organizes logical layers, and applies a hybrid mechanism of directional searching and flooding. The performance analysis and simulation results show that the proposed hierarchical searching model has availably reduced the generated message load and that its searching-response time performance is as fairly good as that of the Gnutella model.展开更多
An on-demand distributed clustering algorithm based on neural network was proposed. The system parameters and the combined weight for each node were computed, and cluster-heads were chosen using the weighted clusterin...An on-demand distributed clustering algorithm based on neural network was proposed. The system parameters and the combined weight for each node were computed, and cluster-heads were chosen using the weighted clustering algorithm, then a training set was created and a neural network was trained. In this algorithm, several system parameters were taken into account, such as the ideal node-degree, the transmission power, the mobility and the battery power of the nodes. The algorithm can be used directly to test whether a node is a cluster-head or not. Moreover, the clusters recreation can be speeded up.展开更多
An image segmentation algorithm of the restrained fuzzy Kohonen clustering network （RFKCN） based on high- dimension fuzzy character is proposed. The algorithm includes two steps. The first step is the fuzzification ...An image segmentation algorithm of the restrained fuzzy Kohonen clustering network （RFKCN） based on high- dimension fuzzy character is proposed. The algorithm includes two steps. The first step is the fuzzification of pixels in which two redundant images are built by fuzzy mean value and fuzzy median value. The second step is to construct a three-dimensional （3-D） feature vector of redundant images and their original images and cluster the feature vector through RFKCN, to realize image seg- mentation. The proposed algorithm fully takes into account not only gray distribution information of pixels, but also relevant information and fuzzy information among neighboring pixels in constructing 3- D character space. Based on the combination of competitiveness, redundancy and complementary of the information, the proposed algorithm improves the accuracy of clustering. Theoretical anal- yses and experimental results demonstrate that the proposed algorithm has a good segmentation performance.展开更多
To address the problems that input variables should be reduced as much as possible and explain output variables fully in building neural network model of complicated system, a variable selection method based on cluste...To address the problems that input variables should be reduced as much as possible and explain output variables fully in building neural network model of complicated system, a variable selection method based on cluster (analysis) was investigated. Similarity coefficient which describes the mutual relation of variables was defined. The methods of the highest contribution rate, part replacing whole and variable replacement are put forwarded and deduced by information theory. The software of the neural network based on cluster analysis, which can provide many kinds of methods for defining variable similarity coefficient, clustering system variable and evaluating variable cluster, was developed and applied to build neural network forecast model of cement clinker quality. The results show that all the network scale, training time and prediction accuracy are perfect. The practical application demonstrates that the method of selecting variables for neural network is feasible and effective.展开更多
Energy-efficient data gathering in multi-hop wireless sensor networks was studied,considering that different node produces different amounts of data in realistic environments.A novel dominating set based clustering pr...Energy-efficient data gathering in multi-hop wireless sensor networks was studied,considering that different node produces different amounts of data in realistic environments.A novel dominating set based clustering protocol (DSCP) was proposed to solve the data gathering problem in this scenario.In DSCP,a node evaluates the potential lifetime of the network (from its local point of view) assuming that it acts as the cluster head,and claims to be a tentative cluster head if it maximizes the potential lifetime.When evaluating the potential lifetime of the network,a node considers not only its remaining energy,but also other factors including its traffic load,the number of its neighbors,and the traffic loads of its neighbors.A tentative cluster head becomes a final cluster head with a probability inversely proportional to the number of tentative cluster heads that cover its neighbors.The protocol can terminate in O(n/lg n) steps,and its total message complexity is O(n2/lg n).Simulation results show that DSCP can effectively prolong the lifetime of the network in multi-hop networks with unbalanced traffic load.Compared with EECT,the network lifetime is prolonged by 56.6% in average.展开更多
Cooperative communication can achieve spatial diversity gains,and consequently combats signal fading due to multipath propagation in wireless networks powerfully.A novel complex field network-coded cooperation（CFNCC...Cooperative communication can achieve spatial diversity gains,and consequently combats signal fading due to multipath propagation in wireless networks powerfully.A novel complex field network-coded cooperation（CFNCC） scheme based on multi-user detection for the multiple unicast transmission is proposed.Theoretic analysis and simulation results demonstrate that,compared with the conventional cooperation（CC） scheme and network-coded cooperation（NCC） scheme,CFNCC would obtain higher network throughput and consumes less time slots.Moreover,a further investigation is made for the symbol error probability（SEP） performance of CFNCC scheme,and SEPs of CFNCC scheme are compared with those of NCC scheme in various scenarios for different signal to noise ratio（SNR） values.展开更多
To study multi-radio multi-channel （MR-MC） Ad Hoc networks based on 802.11, an efficient cross-layer routing protocol with the function of joint channel assignment, called joint channel assignment and cross-layer ro...To study multi-radio multi-channel （MR-MC） Ad Hoc networks based on 802.11, an efficient cross-layer routing protocol with the function of joint channel assignment, called joint channel assignment and cross-layer routing （JCACR）, is presented. Firstly, this paper introduces a new concept called channel utilization percentage （CUP）, which is for measuring the contention level of different channels in a node’s neighborhood, and deduces its optimal value for determining whether a channel is overloaded or not. Then, a metric parameter named channel selection metric （CSM） is designed, which actually reffects not only the channel status but also corresponding node’s capacity to seize it. JCACR evaluates channel assignment by CSM, performs a local optimization by assigning each node a channel with the smaller CSM value, and changes the working channel dynamically when the channel is overloaded. Therefore, the network load balancing can be achieved. In addition, simulation shows that, when compared with the protocol of weighted cumulative expected transfer time （WCETT）, the new protocol can improve the network throughput and reduce the end-to-end average delay with fewer overheads.展开更多
Based on immune clustering and evolutionary programming(EP), a hybrid algorithm to train the RBF network is proposed. An immune fuzzy C-means clustering algorithm (IFCM) is used to adaptively specify the amount and in...Based on immune clustering and evolutionary programming(EP), a hybrid algorithm to train the RBF network is proposed. An immune fuzzy C-means clustering algorithm (IFCM) is used to adaptively specify the amount and initial positions of the RBF centers according to input data set; then the RBF network is trained with EP that tends to global optima. The application of the hybrid algorithm in multiuser detection problem demonstrates that the RBF network trained with the algorithm has simple network structure with good generalization ability.展开更多
Classical network reliability problems assume both net- works and components have only binary states, fully working or fully failed states. But many actual networks are multi-state, such as communication networks and ...Classical network reliability problems assume both net- works and components have only binary states, fully working or fully failed states. But many actual networks are multi-state, such as communication networks and transportation networks. The nodes and arcs in the networks may be in intermediate states which are not fully working either fully failed. A simulation ap- proach for computing the two-terminal reliability of a multi-state network is described. Two-terminal reliability is defined as the probability that d units of demand can be supplied from the source to sink nodes under the time threshold T. The capacities of arcs may be in a stochastic state following any discrete or continuous distribution. The transmission time of each arc is also not a fixed number but stochastic according to its current capacity and de- mand. To solve this problem, a capacitated stochastic coloured Petri net is proposed for modelling the system behaviour. Places and transitions respectively stand for the nodes and arcs of a net- work. Capacitated transition and self-modified token colour with route information are defined to describe the multi-state network. By the simulation, the two-terminal reliability and node importance can be estimated and the optimal route whose reliability is highest can also be given. Finally, two examples of different kinds of multi- state networks are given.展开更多
基金supported by the National Key Research and Development Program of China(2024YFB4504500)Shanghai Collaborative Innovation Project(24xtcx00500).
文摘Unmanned aerial vehicles(UAVs)have become one of the key technologies to achieve future data collection due to their high mobility,rapid deployment,low cost,and the ability to establish line-of-sight communication links.However,when UAV swarm perform tasks in narrow spaces,they often encounter various spatial obstacles,building shielding materials,and high-speed node movements,which result in intermittent network communication links and cannot support the smooth comple-tion of tasks.In this paper,a high mobility and dynamic topol-ogy of the UAV swarm is particularly considered and the high dynamic mobile topology-based clustering(HDMTC)algorithm is proposed.Simulation and real flight verification results verify that the proposed HDMTC algorithm achieves higher stability of net-work,longer link expiration time(LET),and longer node lifetime,all of which improve the communication performance for UAV swarm networks.
基金Projects(90820302,60805027)supported by the National Natural Science Foundation of ChinaProject(200805330005)supported by the Research Fund for the Doctoral Program of Higher Education,ChinaProject(2009FJ4030)supported by Academician Foundation of Hunan Province,China
文摘Multi-target tracking(MTT) is a research hotspot of wireless sensor networks at present.A self-organized dynamic cluster task allocation scheme is used to implement collaborative task allocation for MTT in WSN and a special cluster member(CM) node selection method is put forward in the scheme.An energy efficiency model was proposed under consideration of both energy consumption and remaining energy balance in the network.A tracking accuracy model based on area-sum principle was also presented through analyzing the localization accuracy of triangulation.Then,the two models mentioned above were combined to establish dynamic cluster member selection model for MTT where a comprehensive performance index function was designed to guide the CM node selection.This selection was fulfilled using genetic algorithm.Simulation results show that this method keeps both energy efficiency and tracking quality in optimal state,and also indicate the validity of genetic algorithm in implementing CM node selection.
基金supported by the National Natural Science Fundation of China (60974082 60874085)+2 种基金the Fundamental Research Funds for the Central Universities (K50510700004)the Technology Plan Projects of Guangdong Province (20110401)the Team Project of Hanshan Normal University (LT201001)
文摘To avoid uneven energy consuming in wireless sen- sor networks, a clustering routing model is proposed based on a Bayesian game. In the model, Harsanyi transformation is introduced to convert a static game of incomplete information to the static game of complete but imperfect information. In addition, the existence of Bayesian nash equilibrium is proved. A clustering routing algorithm is also designed according to the proposed model, both cluster head distribution and residual energy are considered in the design of the algorithm. Simulation results show that the algorithm can balance network load, save energy and prolong network lifetime effectively.
基金supported by the National Natural Science Foundation of China(6107207061301179)the National Science and Technology Major Project(2010ZX03006-002-04)
文摘To improve the recognition rate of signal modulation recognition methods based on the clustering algorithm under the low SNR, a modulation recognition method is proposed. The characteristic parameter of the signal is extracted by using a clustering algorithm, the neural network is trained by using the algorithm of variable gradient correction （Polak-Ribiere） so as to enhance the rate of convergence, improve the performance of recognition under the low SNR and realize modulation recognition of the signal based on the modulation system of the constellation diagram. Simulation results show that the recognition rate based on this algorithm is enhanced over 30% compared with the methods that adopt clustering algorithm or neural network based on the back propagation algorithm alone under the low SNR. The recognition rate can reach 90% when the SNR is 4 dB, and the method is easy to be achieved so that it has a broad application prospect in the modulating recognition.
基金Supported by National Natural Science Foundation of China （60874063） and Innovation and Scientific Research Foundation of Graduate Student of Heilongjiang Province （YJSCX2012-263HLJ）
基金Project(2013DFB10070)supported by the International Science & Technology Cooperation Program of ChinaProject(2012GK4106)supported by the Hunan Provincial Science & Technology Program,ChinaProject(12MX15)supported by the Mittal Innovation Project of Central South University,China
文摘Privacy is becoming one of the most notable challenges threatening wireless sensor networks(WSNs).Adversaries may use RF(radio frequency) localization techniques to perform hop-by-hop trace back to the source sensor's location.A multiple k-hop clusters based routing strategy(MHCR) is proposed to preserve source-location privacy as well as enhance energy efficiency for WSNs.Owing to the inherent characteristics of intra-cluster data aggregation,each sensor of the interference clusters is able to act as a fake source to confuse the adversary.Moreover,dummy traffic could be filtered efficiently by the cluster heads during the data aggregation,ensuring no energy consumption be burdened in the hotspot of the network.Through careful analysis and calculation on the distribution and the number of interference clusters,energy efficiency is significantly enhanced without reducing the network lifetime.Finally,the security and delay performance of MHCR scheme are theoretically analyzed.Extensive analysis and simulation results demonstrate that MHCR scheme can improve both the location privacy security and energy efficiency markedly,especially in large-scale WSNs.
基金the National Natural Science Foundation of China(61573285)。
文摘The network performance and the unmanned aerial vehicle(UAV)number are important objectives when UAVs are placed as communication relays to enhance the multi-agent information exchange.The problem is a non-deterministic polynomial hard(NP-hard)multi-objective optimization problem,instead of generating a Pareto solution,this work focuses on considering both objectives at the same level so as to achieve a balanced solution between them.Based on the property that agents connected to the same UAV are a cluster,two clustering-based algorithms,M-K-means(MKM)and modified fast search and find density of peaks(MFSFDP)methods,are first proposed.Since the former algorithm requires too much computational time and the latter one requires too many relays,an algorithm for the balanced network performance and relay number(BPN)is proposed by discretizing the area to avoid missing the optimal relay positions and defining a new local density function to reflect the network performance metric.Simulation results demonstrate that the proposed algorithms are feasible and effective.Comparisons between these algorithms show that the BPN algorithm uses fewer relay UAVs than the MFSFDP and classic set-covering based algorithm,and its computational time is far less than the MKM algorithm.
文摘For the problem of large network load generated by the Gnutella resource-searching model in Peer to Peer （P2P） network, a improved model to decrease the network expense is proposed, which establishes a duster in P2P network, auto-organizes logical layers, and applies a hybrid mechanism of directional searching and flooding. The performance analysis and simulation results show that the proposed hierarchical searching model has availably reduced the generated message load and that its searching-response time performance is as fairly good as that of the Gnutella model.
基金Project (A1420060159) supported by the National Basic Research of China project (60234030) supported by the National Natural Science Foundation of China project(05005A) supported by Youth Foundation of Central South University of Forestry & Technology
文摘An on-demand distributed clustering algorithm based on neural network was proposed. The system parameters and the combined weight for each node were computed, and cluster-heads were chosen using the weighted clustering algorithm, then a training set was created and a neural network was trained. In this algorithm, several system parameters were taken into account, such as the ideal node-degree, the transmission power, the mobility and the battery power of the nodes. The algorithm can be used directly to test whether a node is a cluster-head or not. Moreover, the clusters recreation can be speeded up.
基金supported by the National Natural Science Foundation of China(61073106)the Aerospace Science and Technology Innovation Fund(CASC201105)
文摘An image segmentation algorithm of the restrained fuzzy Kohonen clustering network （RFKCN） based on high- dimension fuzzy character is proposed. The algorithm includes two steps. The first step is the fuzzification of pixels in which two redundant images are built by fuzzy mean value and fuzzy median value. The second step is to construct a three-dimensional （3-D） feature vector of redundant images and their original images and cluster the feature vector through RFKCN, to realize image seg- mentation. The proposed algorithm fully takes into account not only gray distribution information of pixels, but also relevant information and fuzzy information among neighboring pixels in constructing 3- D character space. Based on the combination of competitiveness, redundancy and complementary of the information, the proposed algorithm improves the accuracy of clustering. Theoretical anal- yses and experimental results demonstrate that the proposed algorithm has a good segmentation performance.
文摘To address the problems that input variables should be reduced as much as possible and explain output variables fully in building neural network model of complicated system, a variable selection method based on cluster (analysis) was investigated. Similarity coefficient which describes the mutual relation of variables was defined. The methods of the highest contribution rate, part replacing whole and variable replacement are put forwarded and deduced by information theory. The software of the neural network based on cluster analysis, which can provide many kinds of methods for defining variable similarity coefficient, clustering system variable and evaluating variable cluster, was developed and applied to build neural network forecast model of cement clinker quality. The results show that all the network scale, training time and prediction accuracy are perfect. The practical application demonstrates that the method of selecting variables for neural network is feasible and effective.
基金Projects(61173169,61103203)supported by the National Natural Science Foundation of ChinaProject(NCET-10-0798)supported by the Program for New Century Excellent Talents in University of ChinaProject supported by the Post-doctoral Program and the Freedom Explore Program of Central South University,China
文摘Energy-efficient data gathering in multi-hop wireless sensor networks was studied,considering that different node produces different amounts of data in realistic environments.A novel dominating set based clustering protocol (DSCP) was proposed to solve the data gathering problem in this scenario.In DSCP,a node evaluates the potential lifetime of the network (from its local point of view) assuming that it acts as the cluster head,and claims to be a tentative cluster head if it maximizes the potential lifetime.When evaluating the potential lifetime of the network,a node considers not only its remaining energy,but also other factors including its traffic load,the number of its neighbors,and the traffic loads of its neighbors.A tentative cluster head becomes a final cluster head with a probability inversely proportional to the number of tentative cluster heads that cover its neighbors.The protocol can terminate in O(n/lg n) steps,and its total message complexity is O(n2/lg n).Simulation results show that DSCP can effectively prolong the lifetime of the network in multi-hop networks with unbalanced traffic load.Compared with EECT,the network lifetime is prolonged by 56.6% in average.
基金supported by the National Natural Science Foundation of China(6104000561001126+5 种基金61271262)the China Postdoctoral Science Foundation Funded Project(201104916382012T50789)the Natural Science Foundation of Shannxi Province of China(2011JQ8036)the Special Fund for Basic Scientific Research of Central Colleges (CHD2012ZD005)the Research Fund of Zhejiang University of Technology(20100244)
文摘Cooperative communication can achieve spatial diversity gains,and consequently combats signal fading due to multipath propagation in wireless networks powerfully.A novel complex field network-coded cooperation（CFNCC） scheme based on multi-user detection for the multiple unicast transmission is proposed.Theoretic analysis and simulation results demonstrate that,compared with the conventional cooperation（CC） scheme and network-coded cooperation（NCC） scheme,CFNCC would obtain higher network throughput and consumes less time slots.Moreover,a further investigation is made for the symbol error probability（SEP） performance of CFNCC scheme,and SEPs of CFNCC scheme are compared with those of NCC scheme in various scenarios for different signal to noise ratio（SNR） values.
基金supported by the National Natural Science Foundationof China (60873195 61070220)+3 种基金the Natural Science Foundation of Anhui Province (070412049)the Outstanding Young Teacher Foundation of Anhui Higher Education Institutions of China (2009SQRZ167)the Natural Science Foundation of Anhui Higher Education Institutions of China (KJ2009B114)the Open Project Program of Engineering Research Center of Safety Critical Industry Measure and Control Technology (SCIMCT0802)
文摘To study multi-radio multi-channel （MR-MC） Ad Hoc networks based on 802.11, an efficient cross-layer routing protocol with the function of joint channel assignment, called joint channel assignment and cross-layer routing （JCACR）, is presented. Firstly, this paper introduces a new concept called channel utilization percentage （CUP）, which is for measuring the contention level of different channels in a node’s neighborhood, and deduces its optimal value for determining whether a channel is overloaded or not. Then, a metric parameter named channel selection metric （CSM） is designed, which actually reffects not only the channel status but also corresponding node’s capacity to seize it. JCACR evaluates channel assignment by CSM, performs a local optimization by assigning each node a channel with the smaller CSM value, and changes the working channel dynamically when the channel is overloaded. Therefore, the network load balancing can be achieved. In addition, simulation shows that, when compared with the protocol of weighted cumulative expected transfer time （WCETT）, the new protocol can improve the network throughput and reduce the end-to-end average delay with fewer overheads.
文摘Based on immune clustering and evolutionary programming(EP), a hybrid algorithm to train the RBF network is proposed. An immune fuzzy C-means clustering algorithm (IFCM) is used to adaptively specify the amount and initial positions of the RBF centers according to input data set; then the RBF network is trained with EP that tends to global optima. The application of the hybrid algorithm in multiuser detection problem demonstrates that the RBF network trained with the algorithm has simple network structure with good generalization ability.
基金supported by the National Natural Science Foundation of China (70971132)
文摘Classical network reliability problems assume both net- works and components have only binary states, fully working or fully failed states. But many actual networks are multi-state, such as communication networks and transportation networks. The nodes and arcs in the networks may be in intermediate states which are not fully working either fully failed. A simulation ap- proach for computing the two-terminal reliability of a multi-state network is described. Two-terminal reliability is defined as the probability that d units of demand can be supplied from the source to sink nodes under the time threshold T. The capacities of arcs may be in a stochastic state following any discrete or continuous distribution. The transmission time of each arc is also not a fixed number but stochastic according to its current capacity and de- mand. To solve this problem, a capacitated stochastic coloured Petri net is proposed for modelling the system behaviour. Places and transitions respectively stand for the nodes and arcs of a net- work. Capacitated transition and self-modified token colour with route information are defined to describe the multi-state network. By the simulation, the two-terminal reliability and node importance can be estimated and the optimal route whose reliability is highest can also be given. Finally, two examples of different kinds of multi- state networks are given.
