MST-BASED CLUSTERING TOPOLOGY CONTROL ALGORITHM FOR WIRELESS SENSOR NETWORKS

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.

Controlled Teleportation Using Four-Particle Cluster State

A controlled teleportation scheme is presented.In this scheme,quantum information of a single-qubit stateor an entangled two-qubits state is transmitted from a sender (Alice) to a receiver (Charlie) via a four-particle clusterstate under the control of the supervisor (Bob).The feature of this scheme is that the teleportation between the senderand the receiver depends on the control of the supervisor.

High resurgence of dengue vector populations after space spraying in an endemic urban area of Thailand:A cluster randomized controlled trial

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.

Cluster consensus of second-order multi-agent systems via pinning control

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.

Clustering Network Topology Control Method Based on Responsibility 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.

Quality of Service Improvement with Optimal Software-Defined Networking Controller and Control Plane Clustering

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.

A New Self-Adapting Admission Control Algorithm for Differential Service in Web Clusters

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.

Successive lag cluster consensus on multi-agent systems via delay-dependent impulsive control

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.

Controlled Teleportation of an Arbitrary Two-Particle State by One EPR Pair and Cluster State

A scheme for controlled teleportation of an arbitrary two-particle state using a maximally entangled EPRpair and a cluster state as the quantum channel is proposed.After receiving Alice’s Bell state measurement results,the controller performs a joint measurement on his particles under a non-maximally entangled Bell-basis.The receiverneeds to introduce an auxiliary qubit,and performs a series of appropriate unitary transformations on his particles.Theoriginal state can be teleported successfully with the probability 2 cos2 9.

Controlled Teleportation of Two-Partic le Entanglement via a Cluster State

In order to teleport an unknown two-particle entangled state via a cluster state,a controlled teleportation scheme is proposed.It is shown that an unknown two-particle entangled state can be successfully transmitted from the sender Alice to the receiver Bob with the help of the supervisor Charlie via the only one four-particle cluster state.The receiver can reconstruct the teleported state according to the measurement results of the sender and supervisor.Quantum Controlled-NOT (CNOT) gate and POVM are used,which have been accomplished in a quantum experiment,so it is believed that this scheme will be realized by experiment.By analysis,the success probability of the proposed scheme reaches 1.0.

Intelligent Control Scheme of Engineering Machinery of Cluster Hybrid System

In a hybrid system, the subsystems with discrete dynamics play a central role in a hybrid system. In the course of engineering machinery of cluster construction, the discrete control law is hard to obtain because the construction environment is complex and there exist many affecting factors. In this paper, hierarchically intelligent control, expert control and fuzzy control are introduced into the discrete subsystems of engineering machinery of cluster hybrid system, so as to rebuild the hybrid system and make the discrete control law easily and effectively obtained. The structures, reasoning mechanism and arithmetic of intelligent control are replanted to discrete dynamic, conti- nuous process and the interface of the hybrid system. The structures of three types of intelligent hybrid system are presented and the human experiences summarized from engineering machinery of cluster are taken into account.

Cluster synchronization in community network with nonidentical nodes via intermittent pinning control

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.

A NEW DYNAMIC QUOTA-BASED ADMISSION CONTROL WITH SUB-NEGOTIATION FOR SOFTSWITCH-BASED CLUSTERED MEDIA SERVER

Based on the demand of the admission control of softswitch-based clustered media server, this pa- per proposed a new dynamic quota-based admission control algorithm that has a sub-negotiation process. The strongpoint of quota-based algorithm had been inherited in the algorithm and at the same time some new ideas had also been introduced into it. Simulations of the algorithm had been conducted on the Petri net model and the results show that this algorithm has excellent performance. In order to find the optimal resource quota set- ting in real time, the paper proposed two approximation analysis methods. It can be seen from analysis results that these two methods can be used to get sub-optimal quota values quickly and effectively. These two ap- proximation analysis methods will play important roles in implementation of the algorithm in system.

一种无需指定船舶位置的新型船舶大规模自主编队方法

[目的]针对船舶大规模编队通信量大、编队速度慢、不便于扩充等问题,提出一种新型的虚拟壁面编队方法。[方法]使用局部通信,根据自然规律,设定虚拟作用力驱使船舶向目标位置集合,并通过虚拟壁面调整队形,从而实现船舶编队的目的。[结果]结果表明,所提方法能够按照“就近原则”快速地完成编队,通信量低且不随编队规模而增加。通过对船舶编队的静态、动态、旋转、缩放和避障的仿真验证了这种算法的有效性。[结论]所提虚拟壁面法具有通信量低、编队速度快、扩充简单等优势,在船舶大规模编队中具有明显优势。

A Virtual Router Cluster System Based on the Separation of the Control Plane and the Data Plane

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.

Clustering Countries on COVID-19 Data among Different Waves Using K-Means Clustering

The COVID-19 pandemic has caused an unprecedented spike in confirmed cases in 230 countries globally. In this work, a set of data from the COVID-19 coronavirus outbreak has been subjected to two well-known unsupervised learning techniques: K-means clustering and correlation. The COVID-19 virus has infected several nations, and K-means automatically looks for undiscovered clusters of those infections. To examine the spread of COVID-19 before a vaccine becomes widely available, this work has used unsupervised approaches to identify the crucial county-level confirmed cases, death cases, recover cases, total_cases_per_million, and total_deaths_per_million aspects of county-level variables. We combined countries into significant clusters using this feature subspace to assist more in-depth disease analysis efforts. As a result, we used a clustering technique to examine various trends in COVID-19 incidence and mortality across nations. This technique took the key components of a trajectory and incorporates them into a K-means clustering process. We separated the trend lines into measures that characterize various features of a trend. The measurements were first reduced in dimension, then clustered using a K-means algorithm. This method was used to individually calculate the incidence and death rates and then compare them.

A Location-Based Clustering Topology Control Algorithm in WSN

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.

面向光伏集群的配电网模型⁃数据联合驱动无功/电压控制

传统配电网的无功/电压控制(VVC)方法,难以兼顾控制决策的全局最优性与实时响应能力,分布式光伏(DPV)的分散化、高比例并网导致该矛盾日益突出。结合模型优化的寻优能力与深度强化学习的在线决策效率,提出了面向光伏(PV)集群的配电网模型-数据联合驱动VVC策略。首先,考虑日前优化调度与日内实时控制的运行特征,结合DPV集群划分,构建了配电网分布式两阶段VVC框架;然后,以系统运行网损最低为目标,建立了配电网分布式日前VVC模型,并提出了基于Nesterov加速梯度的分布式求解算法;其次,以日前决策为输入量,建立了基于部分可观马尔可夫博弈的配电网实时VVC模型,并提出了基于迭代终止惩罚函数的改进多智能体深度确定性策略梯度算法;最后,基于MATLAB/PyCharm软件平台进行了算例分析,验证了所提方法的全局趋优性以及实时响应能力,提高了PV高比例接入配电网运行的经济性和安全性。

基于模糊理论的输电网络电压无功控制策略

为解决新能源、电动汽车、储能等新技术应用下,高复杂度电力系统电压稳定控制问题,提出了一种基于模糊理论的输电网络电压无功控制策略。该方法引入模糊理论中的隶属度函数,根据系统节点与不同分区之间的耦合程度制定无功控制策略。根据灵敏度计算网络各个节点之间的电气距离,通过模糊聚类算法对节点进行初步分区,并采用聚类融合算法对聚类产生的多个结果进行融合,从而得到最终分区结果。根据关键节点对各个分区的隶属度制定主辅控制策略。IEEE30节点输电网络的算例分析表明,该控制策略可以有效实现对无功功率的控制。

高精度视觉感应技术在水肥一体机中的应用

以农田水肥智能化管理为研究对象,构建了一种高精度视觉感应式水肥一体机。采用高精度视觉感应技术获取作物生长状态参数图像,基于超像素图像分割技术,对复杂的作物生长状态图像特征向量进行提取,采用模糊聚类算法对图像进行分割处理,根据目标图像的像素值统计结果进行生长状态预测,并结合环境参数信息,构建灌溉过程土壤电导率EC和pH预测模型。测试结果表明:水肥一体机控制系统能够有效预测作物对水肥需求,提高了灌溉过程混肥精度,可节约灌溉用水量、提升生产效率、降低人工成本。