From the perspective of psychological contract,this paper discusses mechanism of consumers' network cluster behavior in the context of brand crisis. On the basis of Simmel's conflict theory,it presented new fi...From the perspective of psychological contract,this paper discusses mechanism of consumers' network cluster behavior in the context of brand crisis. On the basis of Simmel's conflict theory,it presented new findings of network cluster behavior. It is concluded that brand crisis exerts significant influence on breach of psychological contract. Particularly,functional brand crisis more easily leads to breach of transactional psychological contract,while value brand crisis more easily leads to breach of relational psychological contract. Breach of transactional psychological contract more easily leads to realistic network cluster behavior,while breach of relational psychological contract does not necessarily lead to non-realistic network cluster behavior.展开更多
This study proposes the use of a novel integrated framework for 2D en route airspace sub-sectorization.The integrated framework combines the multi-commodity flow optimization approach,complex network cluster-ing appro...This study proposes the use of a novel integrated framework for 2D en route airspace sub-sectorization.The integrated framework combines the multi-commodity flow optimization approach,complex network cluster-ing approach,and Minimum Bounding Geometry(MBG)-coupled Rule-based Approach for boundary design.A decomposition-based discrete particle swarm optimization(DPSO)is used to solve the clustering problem.The output of the flow optimization is used as a guiding standard for the DPSO.Experimentations were performed using the Indian airspace sector to validate the framework and DPSO was run for different maximum number of generations(maxgen).The findings reveal that the multi-commodity flow approach captures system-wide flow operations.Clustering results corresponding to maxgen=100 and maxgen=150 perform best in terms of equitable and balanced distribution of cluster size and traffic load.The MBG-coupled Rule-based Approach leads to com-pact and convex sub-sector boundary design.Major implications of this research include dynamic adaptability of the integrated framework,increased sensitivity of sector design to network evolution,and a computationally tractable framework.The higher controllability of the proposed framework also offers an increased acceptance among practitioners.展开更多
The regulatory role of the Micro-RNAs (miRNAs) in the messenger RNAs (mRNAs) gene expression is well understood by the biologists since some decades, even though the delving into specific aspects is in progress. Clust...The regulatory role of the Micro-RNAs (miRNAs) in the messenger RNAs (mRNAs) gene expression is well understood by the biologists since some decades, even though the delving into specific aspects is in progress. Clustering is a cornerstone in bioinformatics research, offering a potent computational tool for analyzing diverse types of data encountered in genomics and related fields. MiRNA clustering plays a pivotal role in deciphering the intricate regulatory roles of miRNAs in biological systems. It uncovers novel biomarkers for disease diagnosis and prognosis and advances our understanding of gene regulatory networks and pathways implicated in health and disease, as well as drug discovery. Namely, we have implemented clustering procedure to find interrelations among miRNAs within clusters, and their relations to diseases. Deep clustering (DC) algorithms signify a departure from traditional clustering methods towards more sophisticated techniques, that can uncover intricate patterns and relationships within gene expression data. Deep learning (DL) models have shown remarkable success in various domains, and their application in genomics, especially for tasks like clustering, holding immense promise. The deep convolutional clustering procedure used is different from other traditional methods, demonstrating unbiased clustering results. In the paper, we implement the procedure on a Multiple Myeloma miRNA dataset publicly available on GEO platform, as a template of a cancer instance analysis, and hazard some biological issues.展开更多
The evolution of networks in rural industrial clusters,in particular in the context of China has been paid more attention to in the world.Applying the theory and techniques of social network analysis (SNA),this study ...The evolution of networks in rural industrial clusters,in particular in the context of China has been paid more attention to in the world.Applying the theory and techniques of social network analysis (SNA),this study is with particular regard to the business network relationships and their evolutionary dynamics of steel measuring tape manufacturing clustered in Nanzhuang Village,Yucheng County of Henan Province,China,which is important for better understanding the industrial and regional development in less developed rural areas.From data collected by comprehensive questionnaire survey in 2002 and mass interviews with 60 enterprises and assembling families and several government authorities in 2002,2003,2004,2005 and 2008,four types of networks are identified: spin-off,consulting,communication and cooperative.The characteristic of these networks is outlined in detail.Compared with the high-tech clusters of typical developed areas,the networks that have evolved in traditional manufacturing clusters are more affected by emotive linkages.The cluster networks are shown to exhibit a polycentric hierarchical structure.The family relationships are the dominate spin-off channels of enterprises,while the supply and demand relationships and the mobility of the skilled workers are also important paths of network learning,and the cooperation relationships are comparatively stable.Besides the root enterprises,the middle-sized enterprises are comparatively more active than small-sized enterprises,and the intermediary agencies and the service institutions act as bridges of the inter-enterprises cooperation.By analysis of the structure of networks and the interactions between the networks,the four stages of network evolution are also identified.The four stages are dominated by the family networks,the internal division production networks,the local innovation networks and the global supply networks respectively,and they play different roles in cluster development.展开更多
Network traffic classification is essential in supporting network measurement and management.Many existing traffic classification approaches provide application-level results regardless of the network quality of servi...Network traffic classification is essential in supporting network measurement and management.Many existing traffic classification approaches provide application-level results regardless of the network quality of service(QoS)requirements.In practice,traffic flows from the same application may have irregular network behaviors that should be identified to various QoS classes for best network resource management.To address the issues,we propose to conduct traffic classification with two newly defined QoSaware features,i.e.,inter-APP similarity and intraAPP diversity.The inter-APP similarity represents the close QoS association between the traffic flows that originate from the different Internet applications.The intra-APP diversity describes the QoS variety of the traffic even among those originated from the same Internet application.The core of performing the QoS-aware feature extraction is a Long-Short Term Memory neural network based Autoencoder(LSTMAE).The QoS-aware features extracted by the encoder part of the LSTM-AE are then clustered into the corresponding QoS classes.Real-life data from multiple applications are collected to evaluate the proposed QoS-aware network traffic classification approach.The evaluation results demonstrate the efficacy of the extracted QoS-aware features in supporting the traffic classification,which can further contribute to future network measurement and management.展开更多
To reduce the interference among small cells of Ultra-Dense Networks(UDN),an improved Clustering-Assisted Resource Allocation(CARA)scheme is proposed in this paper.The proposed scheme is divided into three steps.First...To reduce the interference among small cells of Ultra-Dense Networks(UDN),an improved Clustering-Assisted Resource Allocation(CARA)scheme is proposed in this paper.The proposed scheme is divided into three steps.First,an Interference-Limited Clustering Algorithm(ILCA)based on interference graph corresponding to the interference relationship between Femtocell Base Stations(FBSs),is proposed to group FBSs into disjoint clusters,in which a pre-threshold is set to constrain the sum of interference in each cluster,and a Cluster Head(CH)is selected for each cluster.Then,CH performs a twostage sub-channel allocation within its associated cluster,where the first stage assigns one sub-channel to each user of the cluster and the second stage assigns a second sub-channel to some users.Finally,a power allocation method is designed to maximize throughput for a given clustering and sub-channel configuration.Simulation results indicate that the proposed scheme distributes FBSs into each cluster more evenly,and significantly improves the system throughput compared with the existing schemes in the same scenario.展开更多
In a sensor network, data collected by different sensors are often correlated because they are observations of related phenomena. Efficient sensor data fusion is one of the most important issues in building real senso...In a sensor network, data collected by different sensors are often correlated because they are observations of related phenomena. Efficient sensor data fusion is one of the most important issues in building real sensor networks. To balance energy cost, how to select a cluster head is a key problem that must be addressed. In this paper, we use a compression-centric data collection algorithm for use in wireless sensor networks. Also, we propose a balanced cluster head selection algorithm in each cluster. Simulation results are used to investigate the performance of the algorithm. Compared to the exhaustive search solutions, the proposed algorithm shows a significant improvement in power consumption.展开更多
In this paper, an energy efficient clustering algorithm based on neighbors （EECABN） for wireless sensor networks is proposed. In the algorithm, an optimized weight of nodes is introduced to determine the priority of...In this paper, an energy efficient clustering algorithm based on neighbors （EECABN） for wireless sensor networks is proposed. In the algorithm, an optimized weight of nodes is introduced to determine the priority of clustering procedure. As improvement, the weight is a measurement of energy and degree as usual, and even associates with distance from neighbors, distance to the sink node, and other factors. To prevent the low energy nodes being exhausted with energy, the strong nodes should have more opportunities to act as cluster heads during the clustering procedure. The simulation results show that the algorithm can effectively prolong whole the network lifetime. Especially at the early stage that some nodes in the network begin to die, the process can be postponed by using the algorithm.展开更多
Cluster synchronization in a network of non-identical dynamic systems is studied in this paper, using two-cluster synchronization for detailed analysis and discussion. The results show that the common intercluster cou...Cluster synchronization in a network of non-identical dynamic systems is studied in this paper, using two-cluster synchronization for detailed analysis and discussion. The results show that the common intercluster coupling condition is not always needed for the diffusively coupled network. Several sufficient conditions are obtained by using the Schur unitary triangularization theorem, which extends previous results. Some numerical examples are presented for illustration.展开更多
A common and critical operation for wireless sensor networks is data gathering. The efficient clustering of a sensor network that can save energy and improve coverage efficiency is an important requirement for many up...A common and critical operation for wireless sensor networks is data gathering. The efficient clustering of a sensor network that can save energy and improve coverage efficiency is an important requirement for many upper layer network functions. This study concentrates on how to form clusters with high uniformity while prolonging the network lifetime. A novel clustering scheme named power- and coverage- aware clustering （PCC） is proposed, which can adaptively select cluster heads according to a hybrid of the nodesI residual energy and loyalty degree. Additionally, the PCC scheme is independent of node distribution or density, and it is free of node hardware limitations, such as self-locating capability and time synchronization. Experiment results show that the scheme performs well in terms of cluster size （and its standard deviation）, number of nodes alive over time, total energy consumption, etc.展开更多
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.展开更多
Wireless sensor networks are widely used for its flexibility, but they also suffer from problems like limited capacity, large node number and vulnerability to security threats. In this paper, we propose a multi-path r...Wireless sensor networks are widely used for its flexibility, but they also suffer from problems like limited capacity, large node number and vulnerability to security threats. In this paper, we propose a multi-path routing protocol based on the credible cluster heads. The protocol chooses nodes with more energy remained as cluster heads at the cluster head choosing phase, and then authenticates them by the neighbor cluster heads. Using trust mechanisms it creates the credit value, and based on the credit value the multi-path cluster head routing can finally be found. The credit value is created and exchanged among the cluster heads only. Theoretical analysis combined with simulation results demonstrate that this protocol can save the resource, prolong the lifetime, and ensure the security and performance of the network.展开更多
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.展开更多
This study presents a clustering algorithm based on hierarchical expansion to solve the problem of community detection in scientific collaboration network. The characteristics of achievements information related to sc...This study presents a clustering algorithm based on hierarchical expansion to solve the problem of community detection in scientific collaboration network. The characteristics of achievements information related to scientific and technological domains are analyzed,and then an ontology that represents their latent collaborative relations is built to detect clusters from the collaboration network. A case study is conducted to collect a data set of research achievements in the electric vehicle field and better clustering results are obtained. A hierarchical recommendation framework that enriches the domain ontologies and retrieves more relevant information resources is proposed in the last part of this paper. This work also lays out a novel insight into the exploitation of scientific collaboration network to better classify achievements information.展开更多
Ambient Assisted Living(AAL) is becoming an important research field. Many technologies have emerged related with pervasive computing vision, which can give support for AAL. One of the most reliable approaches is base...Ambient Assisted Living(AAL) is becoming an important research field. Many technologies have emerged related with pervasive computing vision, which can give support for AAL. One of the most reliable approaches is based on wireless sensor networks(WSNs). In this paper, we propose a coverage-aware unequal clustering protocol with load separation(CUCPLS) for data gathering of AAL applications based on WSNs. Firstly, the coverage overlap factor for nodes is introduced that accounts for the degree of target nodes covered. In addition, to balance the intra-cluster and inter-cluster energy consumptions, different competition radiuses of CHs are computed theoretically in different rings, and smaller clusters are formed near the sink. Moreover, two CHs are selected in each cluster for load separation to alleviate the substantial energy consumption difference between a single CH and its member nodes. Furthermore, a backoff waiting time is adopted during the selection of the two CHs to reduce the number of control messages employed. Simulation results demonstrate that the CUCPLS not only can achieve better coverage performance, but also balance the energy consumption of a network and prolong network lifetime.展开更多
A heterogeneous wireless sensor network comprises a number of inexpensive energy constrained wireless sensor nodes which collect data from the sensing environment and transmit them toward the improved cluster head in ...A heterogeneous wireless sensor network comprises a number of inexpensive energy constrained wireless sensor nodes which collect data from the sensing environment and transmit them toward the improved cluster head in a coordinated way. Employing clustering techniques in such networks can achieve balanced energy consumption of member nodes and prolong the network lifetimes.In classical clustering techniques, clustering and in-cluster data routes are usually separated into independent operations. Although separate considerations of these two issues simplify the system design, it is often the non-optimal lifetime expectancy for wireless sensor networks. This paper proposes an integral framework that integrates these two correlated items in an interactive entirety. For that,we develop the clustering problems using nonlinear programming. Evolution process of clustering is provided in simulations. Results show that our joint-design proposal reaches the near optimal match between member nodes and cluster heads.展开更多
The unmanned aerial vehicle(UAV)self-organizing network is composed of multiple UAVs with autonomous capabilities according to a certain structure and scale,which can quickly and accurately complete complex tasks such...The unmanned aerial vehicle(UAV)self-organizing network is composed of multiple UAVs with autonomous capabilities according to a certain structure and scale,which can quickly and accurately complete complex tasks such as path planning,situational awareness,and information transmission.Due to the openness of the network,the UAV cluster is more vulnerable to passive eavesdropping,active interference,and other attacks,which makes the system face serious security threats.This paper proposes a Blockchain-Based Data Acquisition(BDA)scheme with privacy protection to address the data privacy and identity authentication problems in the UAV-assisted data acquisition scenario.Each UAV cluster has an aggregate unmanned aerial vehicle(AGV)that can batch-verify the acquisition reports within its administrative domain.After successful verification,AGV adds its signcrypted ciphertext to the aggregation and uploads it to the blockchain for storage.There are two chains in the blockchain that store the public key information of registered entities and the aggregated reports,respectively.The security analysis shows that theBDAconstruction can protect the privacy and authenticity of acquisition data,and effectively resist a malicious key generation center and the public-key substitution attack.It also provides unforgeability to acquisition reports under the Elliptic Curve Discrete Logarithm Problem(ECDLP)assumption.The performance analysis demonstrates that compared with other schemes,the proposed BDA construction has lower computational complexity and is more suitable for the UAV cluster network with limited computing power and storage capacity.展开更多
This paper deals with the cluster exponential synchronization of a class ot complex networks wlm nyorm coupm^g and time-varying delay. Through constructing an appropriate Lyapunov-Krasovskii functional and applying th...This paper deals with the cluster exponential synchronization of a class ot complex networks wlm nyorm coupm^g and time-varying delay. Through constructing an appropriate Lyapunov-Krasovskii functional and applying the theory of the Kronecker product of matrices and the linear matrix inequality （LMI） technique, several novel sufficient conditions for cluster exponential synchronization are obtained. These cluster exponential synchronization conditions adopt the bounds of both time delay and its derivative, which are less conservative. Finally, the numerical simulations are performed to show the effectiveness of the theoretical results.展开更多
The topology control is an effective approach which can improve the quality of wireless sensor network at all sides. Through studying the mechanism of sensor network data transmission, the nature of data transmission ...The topology control is an effective approach which can improve the quality of wireless sensor network at all sides. Through studying the mechanism of sensor network data transmission, the nature of data transmission in wireless sensor network is concluded as a kind of responsibility transmission. By redefining the responsibility and availability of nodes, the strategy for cluster head selection is studied, the responsibility and availability is determined by the combination of the residual energy, location and current flow of nodes. Based on the above, new clustering network topology control algorithm based on responsibility transmission CNTCABRT and hierarchical multi-hop CNTCABRT is presented in this paper, whose algorithm structure is along the famous LEACH algorithm. Experimental result demonstrates its promising performance over the famous LEACH algorithm in the cluster head selection, the size of cluster, the deployment of nodes and the lifetime of nodes, and several innovative conclusions are proposed finally.展开更多
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.展开更多
文摘From the perspective of psychological contract,this paper discusses mechanism of consumers' network cluster behavior in the context of brand crisis. On the basis of Simmel's conflict theory,it presented new findings of network cluster behavior. It is concluded that brand crisis exerts significant influence on breach of psychological contract. Particularly,functional brand crisis more easily leads to breach of transactional psychological contract,while value brand crisis more easily leads to breach of relational psychological contract. Breach of transactional psychological contract more easily leads to realistic network cluster behavior,while breach of relational psychological contract does not necessarily lead to non-realistic network cluster behavior.
基金PMRF PM/MHRD-20-16823.03 for the financial support。
文摘This study proposes the use of a novel integrated framework for 2D en route airspace sub-sectorization.The integrated framework combines the multi-commodity flow optimization approach,complex network cluster-ing approach,and Minimum Bounding Geometry(MBG)-coupled Rule-based Approach for boundary design.A decomposition-based discrete particle swarm optimization(DPSO)is used to solve the clustering problem.The output of the flow optimization is used as a guiding standard for the DPSO.Experimentations were performed using the Indian airspace sector to validate the framework and DPSO was run for different maximum number of generations(maxgen).The findings reveal that the multi-commodity flow approach captures system-wide flow operations.Clustering results corresponding to maxgen=100 and maxgen=150 perform best in terms of equitable and balanced distribution of cluster size and traffic load.The MBG-coupled Rule-based Approach leads to com-pact and convex sub-sector boundary design.Major implications of this research include dynamic adaptability of the integrated framework,increased sensitivity of sector design to network evolution,and a computationally tractable framework.The higher controllability of the proposed framework also offers an increased acceptance among practitioners.
文摘The regulatory role of the Micro-RNAs (miRNAs) in the messenger RNAs (mRNAs) gene expression is well understood by the biologists since some decades, even though the delving into specific aspects is in progress. Clustering is a cornerstone in bioinformatics research, offering a potent computational tool for analyzing diverse types of data encountered in genomics and related fields. MiRNA clustering plays a pivotal role in deciphering the intricate regulatory roles of miRNAs in biological systems. It uncovers novel biomarkers for disease diagnosis and prognosis and advances our understanding of gene regulatory networks and pathways implicated in health and disease, as well as drug discovery. Namely, we have implemented clustering procedure to find interrelations among miRNAs within clusters, and their relations to diseases. Deep clustering (DC) algorithms signify a departure from traditional clustering methods towards more sophisticated techniques, that can uncover intricate patterns and relationships within gene expression data. Deep learning (DL) models have shown remarkable success in various domains, and their application in genomics, especially for tasks like clustering, holding immense promise. The deep convolutional clustering procedure used is different from other traditional methods, demonstrating unbiased clustering results. In the paper, we implement the procedure on a Multiple Myeloma miRNA dataset publicly available on GEO platform, as a template of a cancer instance analysis, and hazard some biological issues.
基金Under the auspices of National Natural Science Foundation of China (No.41071080,41071082)Key Bidding Project for Soft Science in Henan Province in 2010 (No.102400410002)Key Project of the Humanities and Social Sciences Research Base in Ministry of Education (No.YRCSD08A10)
文摘The evolution of networks in rural industrial clusters,in particular in the context of China has been paid more attention to in the world.Applying the theory and techniques of social network analysis (SNA),this study is with particular regard to the business network relationships and their evolutionary dynamics of steel measuring tape manufacturing clustered in Nanzhuang Village,Yucheng County of Henan Province,China,which is important for better understanding the industrial and regional development in less developed rural areas.From data collected by comprehensive questionnaire survey in 2002 and mass interviews with 60 enterprises and assembling families and several government authorities in 2002,2003,2004,2005 and 2008,four types of networks are identified: spin-off,consulting,communication and cooperative.The characteristic of these networks is outlined in detail.Compared with the high-tech clusters of typical developed areas,the networks that have evolved in traditional manufacturing clusters are more affected by emotive linkages.The cluster networks are shown to exhibit a polycentric hierarchical structure.The family relationships are the dominate spin-off channels of enterprises,while the supply and demand relationships and the mobility of the skilled workers are also important paths of network learning,and the cooperation relationships are comparatively stable.Besides the root enterprises,the middle-sized enterprises are comparatively more active than small-sized enterprises,and the intermediary agencies and the service institutions act as bridges of the inter-enterprises cooperation.By analysis of the structure of networks and the interactions between the networks,the four stages of network evolution are also identified.The four stages are dominated by the family networks,the internal division production networks,the local innovation networks and the global supply networks respectively,and they play different roles in cluster development.
文摘Network traffic classification is essential in supporting network measurement and management.Many existing traffic classification approaches provide application-level results regardless of the network quality of service(QoS)requirements.In practice,traffic flows from the same application may have irregular network behaviors that should be identified to various QoS classes for best network resource management.To address the issues,we propose to conduct traffic classification with two newly defined QoSaware features,i.e.,inter-APP similarity and intraAPP diversity.The inter-APP similarity represents the close QoS association between the traffic flows that originate from the different Internet applications.The intra-APP diversity describes the QoS variety of the traffic even among those originated from the same Internet application.The core of performing the QoS-aware feature extraction is a Long-Short Term Memory neural network based Autoencoder(LSTMAE).The QoS-aware features extracted by the encoder part of the LSTM-AE are then clustered into the corresponding QoS classes.Real-life data from multiple applications are collected to evaluate the proposed QoS-aware network traffic classification approach.The evaluation results demonstrate the efficacy of the extracted QoS-aware features in supporting the traffic classification,which can further contribute to future network measurement and management.
基金performed in the Project “Research on the Hierarchical Interference Elimination Technology for UDN Based on MIMO” supported by the Henan Scientific and Technological Research Project (172102210023)“Research on clustering and frequency band allocation in JT-Co MP supported by Department of Education of Henan Province (19A510013)”
文摘To reduce the interference among small cells of Ultra-Dense Networks(UDN),an improved Clustering-Assisted Resource Allocation(CARA)scheme is proposed in this paper.The proposed scheme is divided into three steps.First,an Interference-Limited Clustering Algorithm(ILCA)based on interference graph corresponding to the interference relationship between Femtocell Base Stations(FBSs),is proposed to group FBSs into disjoint clusters,in which a pre-threshold is set to constrain the sum of interference in each cluster,and a Cluster Head(CH)is selected for each cluster.Then,CH performs a twostage sub-channel allocation within its associated cluster,where the first stage assigns one sub-channel to each user of the cluster and the second stage assigns a second sub-channel to some users.Finally,a power allocation method is designed to maximize throughput for a given clustering and sub-channel configuration.Simulation results indicate that the proposed scheme distributes FBSs into each cluster more evenly,and significantly improves the system throughput compared with the existing schemes in the same scenario.
基金supported by the National Natural Science Foundation of China(No.60772055)
文摘In a sensor network, data collected by different sensors are often correlated because they are observations of related phenomena. Efficient sensor data fusion is one of the most important issues in building real sensor networks. To balance energy cost, how to select a cluster head is a key problem that must be addressed. In this paper, we use a compression-centric data collection algorithm for use in wireless sensor networks. Also, we propose a balanced cluster head selection algorithm in each cluster. Simulation results are used to investigate the performance of the algorithm. Compared to the exhaustive search solutions, the proposed algorithm shows a significant improvement in power consumption.
基金Project supported by the Shanghai Leading Academic Discipline Project (Grant No.S30108)
文摘In this paper, an energy efficient clustering algorithm based on neighbors （EECABN） for wireless sensor networks is proposed. In the algorithm, an optimized weight of nodes is introduced to determine the priority of clustering procedure. As improvement, the weight is a measurement of energy and degree as usual, and even associates with distance from neighbors, distance to the sink node, and other factors. To prevent the low energy nodes being exhausted with energy, the strong nodes should have more opportunities to act as cluster heads during the clustering procedure. The simulation results show that the algorithm can effectively prolong whole the network lifetime. Especially at the early stage that some nodes in the network begin to die, the process can be postponed by using the algorithm.
基金Project supported by the "13115" Program, China (Grant No. 2008ZDKG-37)the National Natural Science Foundation of China (Grant Nos. 61072139, 61072106, 60804021, and 61001202)the Fundamental Research Funds for the Central Universities of China (Grant Nos. Y10000902036, JY10000902039, JY10000970001, and JY10000902001)
文摘Cluster synchronization in a network of non-identical dynamic systems is studied in this paper, using two-cluster synchronization for detailed analysis and discussion. The results show that the common intercluster coupling condition is not always needed for the diffusively coupled network. Several sufficient conditions are obtained by using the Schur unitary triangularization theorem, which extends previous results. Some numerical examples are presented for illustration.
基金supported by National Basic Research Program of China (No. 2010CB731800)National Natural Science Foundation of China (No. 60934003)Educational Foundation of Hebei Province (No. 2008147)
文摘A common and critical operation for wireless sensor networks is data gathering. The efficient clustering of a sensor network that can save energy and improve coverage efficiency is an important requirement for many upper layer network functions. This study concentrates on how to form clusters with high uniformity while prolonging the network lifetime. A novel clustering scheme named power- and coverage- aware clustering （PCC） is proposed, which can adaptively select cluster heads according to a hybrid of the nodesI residual energy and loyalty degree. Additionally, the PCC scheme is independent of node distribution or density, and it is free of node hardware limitations, such as self-locating capability and time synchronization. Experiment results show that the scheme performs well in terms of cluster size （and its standard deviation）, number of nodes alive over time, total energy consumption, etc.
基金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.
文摘Wireless sensor networks are widely used for its flexibility, but they also suffer from problems like limited capacity, large node number and vulnerability to security threats. In this paper, we propose a multi-path routing protocol based on the credible cluster heads. The protocol chooses nodes with more energy remained as cluster heads at the cluster head choosing phase, and then authenticates them by the neighbor cluster heads. Using trust mechanisms it creates the credit value, and based on the credit value the multi-path cluster head routing can finally be found. The credit value is created and exchanged among the cluster heads only. Theoretical analysis combined with simulation results demonstrate that this protocol can save the resource, prolong the lifetime, and ensure the security and performance of the network.
基金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 Social Science Foundation of China(No.14CTQ045)China Postdoctoral Science Foundation(No.2015M570131)
文摘This study presents a clustering algorithm based on hierarchical expansion to solve the problem of community detection in scientific collaboration network. The characteristics of achievements information related to scientific and technological domains are analyzed,and then an ontology that represents their latent collaborative relations is built to detect clusters from the collaboration network. A case study is conducted to collect a data set of research achievements in the electric vehicle field and better clustering results are obtained. A hierarchical recommendation framework that enriches the domain ontologies and retrieves more relevant information resources is proposed in the last part of this paper. This work also lays out a novel insight into the exploitation of scientific collaboration network to better classify achievements information.
基金supported by the National Nature Science Foundation of China (61170169, 61170168)
文摘Ambient Assisted Living(AAL) is becoming an important research field. Many technologies have emerged related with pervasive computing vision, which can give support for AAL. One of the most reliable approaches is based on wireless sensor networks(WSNs). In this paper, we propose a coverage-aware unequal clustering protocol with load separation(CUCPLS) for data gathering of AAL applications based on WSNs. Firstly, the coverage overlap factor for nodes is introduced that accounts for the degree of target nodes covered. In addition, to balance the intra-cluster and inter-cluster energy consumptions, different competition radiuses of CHs are computed theoretically in different rings, and smaller clusters are formed near the sink. Moreover, two CHs are selected in each cluster for load separation to alleviate the substantial energy consumption difference between a single CH and its member nodes. Furthermore, a backoff waiting time is adopted during the selection of the two CHs to reduce the number of control messages employed. Simulation results demonstrate that the CUCPLS not only can achieve better coverage performance, but also balance the energy consumption of a network and prolong network lifetime.
基金supported by National Natural Science Foundation of China(Nos.61304131 and 61402147)Grant of China Scholarship Council(No.201608130174)+2 种基金Natural Science Foundation of Hebei Province(Nos.F2016402054 and F2014402075)the Scientific Research Plan Projects of Hebei Education Department(Nos.BJ2014019,ZD2015087 and QN2015046)the Research Program of Talent Cultivation Project in Hebei Province(No.A2016002023)
文摘A heterogeneous wireless sensor network comprises a number of inexpensive energy constrained wireless sensor nodes which collect data from the sensing environment and transmit them toward the improved cluster head in a coordinated way. Employing clustering techniques in such networks can achieve balanced energy consumption of member nodes and prolong the network lifetimes.In classical clustering techniques, clustering and in-cluster data routes are usually separated into independent operations. Although separate considerations of these two issues simplify the system design, it is often the non-optimal lifetime expectancy for wireless sensor networks. This paper proposes an integral framework that integrates these two correlated items in an interactive entirety. For that,we develop the clustering problems using nonlinear programming. Evolution process of clustering is provided in simulations. Results show that our joint-design proposal reaches the near optimal match between member nodes and cluster heads.
基金supported in part by the National Key R&D Program of China under Project 2020YFB1006004the Guangxi Natural Science Foundation under Grants 2019GXNSFFA245015 and 2019GXNSFGA245004+2 种基金the National Natural Science Foundation of China under Projects 62162017,61862012,61962012,and 62172119the Major Key Project of PCL under Grants PCL2021A09,PCL2021A02 and PCL2022A03the Innovation Project of Guangxi Graduate Education YCSW2021175.
文摘The unmanned aerial vehicle(UAV)self-organizing network is composed of multiple UAVs with autonomous capabilities according to a certain structure and scale,which can quickly and accurately complete complex tasks such as path planning,situational awareness,and information transmission.Due to the openness of the network,the UAV cluster is more vulnerable to passive eavesdropping,active interference,and other attacks,which makes the system face serious security threats.This paper proposes a Blockchain-Based Data Acquisition(BDA)scheme with privacy protection to address the data privacy and identity authentication problems in the UAV-assisted data acquisition scenario.Each UAV cluster has an aggregate unmanned aerial vehicle(AGV)that can batch-verify the acquisition reports within its administrative domain.After successful verification,AGV adds its signcrypted ciphertext to the aggregation and uploads it to the blockchain for storage.There are two chains in the blockchain that store the public key information of registered entities and the aggregated reports,respectively.The security analysis shows that theBDAconstruction can protect the privacy and authenticity of acquisition data,and effectively resist a malicious key generation center and the public-key substitution attack.It also provides unforgeability to acquisition reports under the Elliptic Curve Discrete Logarithm Problem(ECDLP)assumption.The performance analysis demonstrates that compared with other schemes,the proposed BDA construction has lower computational complexity and is more suitable for the UAV cluster network with limited computing power and storage capacity.
基金supported by the National Natural Science Foundation of China (Grant Nos. 61074073 and 61034005)the Fundamental Research Funds for the Central Universities of China (Grant No. N110504001)the Open Project of the State Key Laboratory of Management and Control for Complex Systems, China (Grant No. 20110107)
文摘This paper deals with the cluster exponential synchronization of a class ot complex networks wlm nyorm coupm^g and time-varying delay. Through constructing an appropriate Lyapunov-Krasovskii functional and applying the theory of the Kronecker product of matrices and the linear matrix inequality （LMI） technique, several novel sufficient conditions for cluster exponential synchronization are obtained. These cluster exponential synchronization conditions adopt the bounds of both time delay and its derivative, which are less conservative. Finally, the numerical simulations are performed to show the effectiveness of the theoretical results.
文摘The topology control is an effective approach which can improve the quality of wireless sensor network at all sides. Through studying the mechanism of sensor network data transmission, the nature of data transmission in wireless sensor network is concluded as a kind of responsibility transmission. By redefining the responsibility and availability of nodes, the strategy for cluster head selection is studied, the responsibility and availability is determined by the combination of the residual energy, location and current flow of nodes. Based on the above, new clustering network topology control algorithm based on responsibility transmission CNTCABRT and hierarchical multi-hop CNTCABRT is presented in this paper, whose algorithm structure is along the famous LEACH algorithm. Experimental result demonstrates its promising performance over the famous LEACH algorithm in the cluster head selection, the size of cluster, the deployment of nodes and the lifetime of nodes, and several innovative conclusions are proposed finally.
文摘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.
