The controller is indispensable in software-defined networking(SDN).With several features,controllers monitor the network and respond promptly to dynamic changes.Their performance affects the quality-of-service(QoS)in...The controller is indispensable in software-defined networking(SDN).With several features,controllers monitor the network and respond promptly to dynamic changes.Their performance affects the quality-of-service(QoS)in SDN.Every controller supports a set of features.However,the support of the features may be more prominent in one controller.Moreover,a single controller leads to performance,single-point-of-failure(SPOF),and scalability problems.To overcome this,a controller with an optimum feature set must be available for SDN.Furthermore,a cluster of optimum feature set controllers will overcome an SPOF and improve the QoS in SDN.Herein,leveraging an analytical network process(ANP),we rank SDN controllers regarding their supporting features and create a hierarchical control plane based cluster(HCPC)of the highly ranked controller computed using the ANP,evaluating their performance for the OS3E topology.The results demonstrated in Mininet reveal that a HCPC environment with an optimum controller achieves an improved QoS.Moreover,the experimental results validated in Mininet show that our proposed approach surpasses the existing distributed controller clustering(DCC)schemes in terms of several performance metrics i.e.,delay,jitter,throughput,load balancing,scalability and CPU(central processing unit)utilization.展开更多
In this paper, we propose a novel clustering topology control algorithm named Minimum Spanning Tree (MST)-based Clustering Topology Control (MCTC) for Wireless Sensor Networks (WSNs), which uses a hybrid approach to a...In this paper, we propose a novel clustering topology control algorithm named Minimum Spanning Tree (MST)-based Clustering Topology Control (MCTC) for Wireless Sensor Networks (WSNs), which uses a hybrid approach to adjust sensor nodes' transmission power in two-tiered hi- erarchical WSNs. MCTC algorithm employs a one-hop Maximum Energy & Minimum Distance (MEMD) clustering algorithm to decide clustering status. Each cluster exchanges information between its own Cluster Members (CMs) locally and then deliveries information to the Cluster Head (CH). Moreover, CHs exchange information between CH and CH and afterwards transmits aggregated in- formation to the base station finally. The intra-cluster topology control scheme uses MST to decide CMs' transmission radius, similarly, the inter-cluster topology control scheme applies MST to decide CHs' transmission radius. Since the intra-cluster topology control is a full distributed approach and the inter-cluster topology control is a pure centralized approach performed by the base station, therefore, MCTC algorithm belongs to one kind of hybrid clustering topology control algorithms and can obtain scalability topology and strong connectivity guarantees simultaneously. As a result, the network topology will be reduced by MCTC algorithm so that network energy efficiency will be improved. The simulation results verify that MCTC outperforms traditional topology control schemes such as LMST, DRNG and MEMD at the aspects of average node's degree, average node's power radius and network lifetime, respectively.展开更多
Objective: To examine the resurgence rate, house density index(HDI) and parous rate of the Aedes aegypti vector after space spraying carried out by the routine spraying team,and compare with the rates after standard i...Objective: To examine the resurgence rate, house density index(HDI) and parous rate of the Aedes aegypti vector after space spraying carried out by the routine spraying team,and compare with the rates after standard indoor ultra low volume(SID-ULV) spraying carried out by the trained research spraying team.Methods: Between March and September 2014, a cluster randomized controlled trial including 12 clusters(6 regular ULV, 6 SID-ULV) with totally 4 341 households was conducted, and around 20–31 houses in each cluster were selected for assessment. The parous rate and HDI of collected mosquitoes 2 days before and 1, 2 and 6 days after spraying were obtained and compared.Results: The HDI dropped significantly from the baseline 1 and 2 days after spraying to a non-zero value in the SID-ULV treated locations but not in the regular ULV group locations. However, by 6 days after spraying, the HDI of both groups had returned to the base value measured 2 days before spraying. There were no statistically significant differences in the parous rate between groups.Conclusions: SID-ULV is more effective in reducing Aedes aegypti populations.However, rapid resurgence of dengue vector after spraying in urban areas was observed in both groups.展开更多
This paper investigates the cluster consensus problem for second-order multi-agent systems by applying the pinning control method to a small collection of the agents. Consensus is attained independently for different ...This paper investigates the cluster consensus problem for second-order multi-agent systems by applying the pinning control method to a small collection of the agents. Consensus is attained independently for different agent clusters according to the community structure generated by the group partition of the underlying graph and sufficient conditions for both cluster and general consensus are obtained by using results from algebraic graph theory and the LaSalle Invariance Principle. Finally, some simple simulations are presented to illustrate the technique.展开更多
We introduce a new consensus pattern, named a successive lag cluster consensus(SLCC), which is a generalized pattern of successive lag consensus(SLC). By applying delay-dependent impulsive control, the SLCC of first-o...We introduce a new consensus pattern, named a successive lag cluster consensus(SLCC), which is a generalized pattern of successive lag consensus(SLC). By applying delay-dependent impulsive control, the SLCC of first-order and second-order multi-agent systems is discussed. Furthermore, based on graph theory and stability theory, some sufficient conditions for the stability of SLCC on multi-agent systems are obtained. Finally, several numerical examples are given to verify the correctness of our 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.展开更多
A new admission control algorithm considering the network self-similar access characteristics is proposed. Taking advantage of the mathematical model of the network traffic admission control which can effectively over...A new admission control algorithm considering the network self-similar access characteristics is proposed. Taking advantage of the mathematical model of the network traffic admission control which can effectively overcome the self-similar characteristics of the network requests, through the scheduling of the differential service qucue based on priority while at the same time taking into account various factors including access characteristics of requests, load information, etc, smoothness of the admission control is ensured by the algorithm proposed in this paper. We design a non-linear self-adapting control algorithm by introducing an exponential admission function, thus overcomes the negative aspects introduced by static threshold parameters. Simulation results show that the scheme proposed in this paper can effectively improve the resource utilization of the clusters, while at the same time protecting the service with high priority. Our simulation results also show that this algorithm can improve system stability and reliability too. Key words Web cluster - admission control - differential service - self-similar - self-adapting CLC number TP 393 Foundation item: Supported by the National Natural Science Foundation of China (10375024) and the Hunan Natural Science Foundation of China(03JJY4054)Biography: LIU An-feng(1971-), male, Ph. D candidate, majoring in network computing, Web QoS.展开更多
In this paper, cluster synchronization in community network with nonidentical nodes is investigated. By combining intermittency with a pinning control scheme, some effective controllers are designed. In the control sc...In this paper, cluster synchronization in community network with nonidentical nodes is investigated. By combining intermittency with a pinning control scheme, some effective controllers are designed. In the control scheme, only one node in each community is controlled and coupling weights of a spanning tree in each community are enhanced. Based on the Lyapunov function method and mathematical analysis technique, two results for achieving cluster synchronization are obtained. Noticeably, by introducing an adaptive strategy, some universal adaptive intermittent pinning controllers are designed for different networks. Finally, two numerical simulations are performed to verify the correctness of the derived results.展开更多
This paper proposes a virtual router cluster system based on the separation of the control plane and the data plane from multiple perspectives,such as architecture,key technologies,scenarios and standardization.To som...This paper proposes a virtual router cluster system based on the separation of the control plane and the data plane from multiple perspectives,such as architecture,key technologies,scenarios and standardization.To some extent,the virtual cluster simplifies network topology and management,achieves automatic conFig.uration and saves the IP address.It is a kind of low-cost expansion method of aggregation equipment port density.展开更多
Aiming at the existing problems in Leach algorithm,which has short network survival time and high energy consumption,a new location-based clustering topology control algorithm is proposed.Based on Leach algorithm,impr...Aiming at the existing problems in Leach algorithm,which has short network survival time and high energy consumption,a new location-based clustering topology control algorithm is proposed.Based on Leach algorithm,improvements have been done.Firstly,when selecting cluster head,node degree,remaining energy,and the number of being cluster head,these three elements are taken into consideration.Secondly,by running the minimum spanning tree algorithm,the tree routing is constructed.Finally,selecting the next hop between clusters is done by MTE algorithm.Simulation results show that the presented control algorithm has not only a better adaptability in the large-scale networks,but also a bigger improvement in terms of some indicators of performance such as network lifetime and network energy consumption.展开更多
In this paper, we propose a controlled quantum state sharing scheme to share an arbitrary two-qubit state using a five-qubit cluster state and the Bell state measurement. In this scheme, the five-qubit cluster state i...In this paper, we propose a controlled quantum state sharing scheme to share an arbitrary two-qubit state using a five-qubit cluster state and the Bell state measurement. In this scheme, the five-qubit cluster state is shared by a sender （Alice）, a controller （Charlie）, and a receiver （Bob）, and the sender only needs to perform the Bell-state measurements on her particles during the quantum state sharing process, the controller performs a single-qubit projective measurement on his particles, then the receiver can reconstruct the arbitrary two-qubit state by performing some appropriate unitary transformations on his particles after he has known the measured results of the sender and the controller.展开更多
僵尸网络(Botnet)是一种从传统恶意代码形态进化而来的新型攻击方式,为攻击者提供了隐匿、灵活且高效的一对多命令与控制信道(Command and Control channel,C&C)机制,可以控制大量僵尸主机实现信息窃取、分布式拒绝服务攻击和垃圾...僵尸网络(Botnet)是一种从传统恶意代码形态进化而来的新型攻击方式,为攻击者提供了隐匿、灵活且高效的一对多命令与控制信道(Command and Control channel,C&C)机制,可以控制大量僵尸主机实现信息窃取、分布式拒绝服务攻击和垃圾邮件发送等攻击目的。该文提出一种与僵尸网络结构和C&C协议无关,不需要分析数据包的特征负载的僵尸网络检测方法。该方法首先使用预过滤规则对捕获的流量进行过滤,去掉与僵尸网络无关的流量;其次对过滤后的流量属性进行统计;接着使用基于X-means聚类的两步聚类算法对C&C信道的流量属性进行分析与聚类,从而达到对僵尸网络检测的目的。实验证明,该方法高效准确地把僵尸网络流量与其他正常网络流量区分,达到从实际网络中检测僵尸网络的要求,并且具有较低的误判率。展开更多
基金supported by the MSIT(Ministry of Science and ICT),Korea,under the ITRC(Information Technology Research Center)support program(IITP-2020-2018-0-01431)supervised by the IITP(Institute for Information&Communications Technology Planning&Evaluation).
文摘The controller is indispensable in software-defined networking(SDN).With several features,controllers monitor the network and respond promptly to dynamic changes.Their performance affects the quality-of-service(QoS)in SDN.Every controller supports a set of features.However,the support of the features may be more prominent in one controller.Moreover,a single controller leads to performance,single-point-of-failure(SPOF),and scalability problems.To overcome this,a controller with an optimum feature set must be available for SDN.Furthermore,a cluster of optimum feature set controllers will overcome an SPOF and improve the QoS in SDN.Herein,leveraging an analytical network process(ANP),we rank SDN controllers regarding their supporting features and create a hierarchical control plane based cluster(HCPC)of the highly ranked controller computed using the ANP,evaluating their performance for the OS3E topology.The results demonstrated in Mininet reveal that a HCPC environment with an optimum controller achieves an improved QoS.Moreover,the experimental results validated in Mininet show that our proposed approach surpasses the existing distributed controller clustering(DCC)schemes in terms of several performance metrics i.e.,delay,jitter,throughput,load balancing,scalability and CPU(central processing unit)utilization.
文摘In this paper, we propose a novel clustering topology control algorithm named Minimum Spanning Tree (MST)-based Clustering Topology Control (MCTC) for Wireless Sensor Networks (WSNs), which uses a hybrid approach to adjust sensor nodes' transmission power in two-tiered hi- erarchical WSNs. MCTC algorithm employs a one-hop Maximum Energy & Minimum Distance (MEMD) clustering algorithm to decide clustering status. Each cluster exchanges information between its own Cluster Members (CMs) locally and then deliveries information to the Cluster Head (CH). Moreover, CHs exchange information between CH and CH and afterwards transmits aggregated in- formation to the base station finally. The intra-cluster topology control scheme uses MST to decide CMs' transmission radius, similarly, the inter-cluster topology control scheme applies MST to decide CHs' transmission radius. Since the intra-cluster topology control is a full distributed approach and the inter-cluster topology control is a pure centralized approach performed by the base station, therefore, MCTC algorithm belongs to one kind of hybrid clustering topology control algorithms and can obtain scalability topology and strong connectivity guarantees simultaneously. As a result, the network topology will be reduced by MCTC algorithm so that network energy efficiency will be improved. The simulation results verify that MCTC outperforms traditional topology control schemes such as LMST, DRNG and MEMD at the aspects of average node's degree, average node's power radius and network lifetime, respectively.
基金Supported by the National Science and Technology Development Agency,Thailand(Research Chair Grant NO.P-10-10307)
文摘Objective: To examine the resurgence rate, house density index(HDI) and parous rate of the Aedes aegypti vector after space spraying carried out by the routine spraying team,and compare with the rates after standard indoor ultra low volume(SID-ULV) spraying carried out by the trained research spraying team.Methods: Between March and September 2014, a cluster randomized controlled trial including 12 clusters(6 regular ULV, 6 SID-ULV) with totally 4 341 households was conducted, and around 20–31 houses in each cluster were selected for assessment. The parous rate and HDI of collected mosquitoes 2 days before and 1, 2 and 6 days after spraying were obtained and compared.Results: The HDI dropped significantly from the baseline 1 and 2 days after spraying to a non-zero value in the SID-ULV treated locations but not in the regular ULV group locations. However, by 6 days after spraying, the HDI of both groups had returned to the base value measured 2 days before spraying. There were no statistically significant differences in the parous rate between groups.Conclusions: SID-ULV is more effective in reducing Aedes aegypti populations.However, rapid resurgence of dengue vector after spraying in urban areas was observed in both groups.
基金Project supported by the National Natural Science Foundation of China (Grant No. 70571059)
文摘This paper investigates the cluster consensus problem for second-order multi-agent systems by applying the pinning control method to a small collection of the agents. Consensus is attained independently for different agent clusters according to the community structure generated by the group partition of the underlying graph and sufficient conditions for both cluster and general consensus are obtained by using results from algebraic graph theory and the LaSalle Invariance Principle. Finally, some simple simulations are presented to illustrate the technique.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.61663006 and 11661026)the Guangxi Natural Science Foundation Program,China(Grant No.2015GXNSFBB139002)+1 种基金the Guangxi Key Laboratory of Cryptography and Information Security,China(Grant No.GCIS201612)the Innovation of GUET Graduate Education,China(Grant No.2018YJCX57)
文摘We introduce a new consensus pattern, named a successive lag cluster consensus(SLCC), which is a generalized pattern of successive lag consensus(SLC). By applying delay-dependent impulsive control, the SLCC of first-order and second-order multi-agent systems is discussed. Furthermore, based on graph theory and stability theory, some sufficient conditions for the stability of SLCC on multi-agent systems are obtained. Finally, several numerical examples are given to verify the correctness of our 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.
文摘A new admission control algorithm considering the network self-similar access characteristics is proposed. Taking advantage of the mathematical model of the network traffic admission control which can effectively overcome the self-similar characteristics of the network requests, through the scheduling of the differential service qucue based on priority while at the same time taking into account various factors including access characteristics of requests, load information, etc, smoothness of the admission control is ensured by the algorithm proposed in this paper. We design a non-linear self-adapting control algorithm by introducing an exponential admission function, thus overcomes the negative aspects introduced by static threshold parameters. Simulation results show that the scheme proposed in this paper can effectively improve the resource utilization of the clusters, while at the same time protecting the service with high priority. Our simulation results also show that this algorithm can improve system stability and reliability too. Key words Web cluster - admission control - differential service - self-similar - self-adapting CLC number TP 393 Foundation item: Supported by the National Natural Science Foundation of China (10375024) and the Hunan Natural Science Foundation of China(03JJY4054)Biography: LIU An-feng(1971-), male, Ph. D candidate, majoring in network computing, Web QoS.
基金supported by National Natural Science Foundation of China(61304256)Zhejiang Provincial Natural Science Foundation of China(LQ13F030013)+4 种基金Project of the Education Department of Zhejiang Province(Y201327006)Young Researchers Foundation of Zhejiang Provincial Top Key Academic Discipline of Mechanical Engineering and Zhejiang Sci-Tech University Key Laboratory(ZSTUME01B15)New Century 151 Talent Project of Zhejiang Province521 Talent Project of Zhejiang Sci-Tech UniversityYoung and Middle-aged Talents Foundation of Zhejiang Provincial Top Key Academic Discipline of Mechanical Engineering
基金Project supported jointly by the National Natural Science Foundation of China(Grant No.61463022)the Natural Science Foundation of Jiangxi Province of China(Grant No.20132BAB201016)+1 种基金the Natural Science Foundation of Jiangxi Educational Committee,Jiangxi Province,China(Grant No.GJJ14273)the Graduate Innovation Fund of Jiangxi Normal University(Grant No.YJS2014061)
文摘In this paper, cluster synchronization in community network with nonidentical nodes is investigated. By combining intermittency with a pinning control scheme, some effective controllers are designed. In the control scheme, only one node in each community is controlled and coupling weights of a spanning tree in each community are enhanced. Based on the Lyapunov function method and mathematical analysis technique, two results for achieving cluster synchronization are obtained. Noticeably, by introducing an adaptive strategy, some universal adaptive intermittent pinning controllers are designed for different networks. Finally, two numerical simulations are performed to verify the correctness of the derived results.
基金supported by the Collaboration Research on Key Techniques of Future Network between China,Japan and Korea(2010DFB13470)~~
文摘This paper proposes a virtual router cluster system based on the separation of the control plane and the data plane from multiple perspectives,such as architecture,key technologies,scenarios and standardization.To some extent,the virtual cluster simplifies network topology and management,achieves automatic conFig.uration and saves the IP address.It is a kind of low-cost expansion method of aggregation equipment port density.
基金Financial by program for Liaoning Outstanding Talents in University(LR2012007)
文摘Aiming at the existing problems in Leach algorithm,which has short network survival time and high energy consumption,a new location-based clustering topology control algorithm is proposed.Based on Leach algorithm,improvements have been done.Firstly,when selecting cluster head,node degree,remaining energy,and the number of being cluster head,these three elements are taken into consideration.Secondly,by running the minimum spanning tree algorithm,the tree routing is constructed.Finally,selecting the next hop between clusters is done by MTE algorithm.Simulation results show that the presented control algorithm has not only a better adaptability in the large-scale networks,but also a bigger improvement in terms of some indicators of performance such as network lifetime and network energy consumption.
基金Project supported by the National Natural Science Foundation of China (Grant No.10902083)the Natural Science Foundation of Shannxi Province,China (Grant No.2009JM1007)
文摘In this paper, we propose a controlled quantum state sharing scheme to share an arbitrary two-qubit state using a five-qubit cluster state and the Bell state measurement. In this scheme, the five-qubit cluster state is shared by a sender （Alice）, a controller （Charlie）, and a receiver （Bob）, and the sender only needs to perform the Bell-state measurements on her particles during the quantum state sharing process, the controller performs a single-qubit projective measurement on his particles, then the receiver can reconstruct the arbitrary two-qubit state by performing some appropriate unitary transformations on his particles after he has known the measured results of the sender and the controller.
文摘僵尸网络(Botnet)是一种从传统恶意代码形态进化而来的新型攻击方式,为攻击者提供了隐匿、灵活且高效的一对多命令与控制信道(Command and Control channel,C&C)机制,可以控制大量僵尸主机实现信息窃取、分布式拒绝服务攻击和垃圾邮件发送等攻击目的。该文提出一种与僵尸网络结构和C&C协议无关,不需要分析数据包的特征负载的僵尸网络检测方法。该方法首先使用预过滤规则对捕获的流量进行过滤,去掉与僵尸网络无关的流量;其次对过滤后的流量属性进行统计;接着使用基于X-means聚类的两步聚类算法对C&C信道的流量属性进行分析与聚类,从而达到对僵尸网络检测的目的。实验证明,该方法高效准确地把僵尸网络流量与其他正常网络流量区分,达到从实际网络中检测僵尸网络的要求,并且具有较低的误判率。
