Efficient Clustering Using Memetic Adaptive Hill Climbing Algorithm in WSN

Wireless Sensor Networks are composed of autonomous sensing devices which are interconnected to form a closed network.This closed network is intended to share sensitive location-centric information from a source node to the base station through efficient routing mechanisms.The efficiency of the sensor node is energy bounded,acts as a concentrated area for most researchers to offer a solution for the early draining power of sensors.Network management plays a significant role in wireless sensor networks,which was obsessed with the factors like the reliability of the network,resource management,energy-efficient routing,and scalability of services.The topology of the wireless sensor networks acts dri-ven factor for network efficiency which can be effectively maintained by perform-ing the clustering process effectively.More solutions and clustering algorithms have been offered by various researchers,but the concern of reduced efficiency in the routing process and network management still exists.This research paper offers a hybrid algorithm composed of a memetic algorithm which is an enhanced version of a genetic algorithm integrated with the adaptive hill-climbing algorithm for performing energy-efficient clustering process in the wireless sensor networks.The memetic algorithm employs a local searching methodology to mitigate the premature convergence,while the adaptive hill-climbing algorithm is a local search algorithm that persistently migrates towards the increased elevation to determine the peak of the mountain(i.e.,)best cluster head in the wireless sensor networks.The proposed hybrid algorithm is compared with the state of art clus-tering algorithm to prove that the proposed algorithm outperforms in terms of a network life-time,energy consumption,throughput,etc.

A Discrete-Time Traffic and Topology Adaptive Routing Algorithm for LEO Satellite Networks

“Minimizing path delay” is one of the challenges in low Earth orbit (LEO) satellite network routing algo-rithms. Many authors focus on propagation delays with the distance vector but ignore the status information and processing delays of inter-satellite links. For this purpose, a new discrete-time traffic and topology adap-tive routing (DT-TTAR) algorithm is proposed in this paper. This routing algorithm incorporates both inher-ent dynamics of network topology and variations of traffic load in inter-satellite links. The next hop decision is made by the adaptive link cost metric, depending on arrival rates, time slots and locations of source-destination pairs. Through comprehensive analysis, we derive computation formulas of the main per-formance indexes. Meanwhile, the performances are evaluated through a set of simulations, and compared with other static and adaptive routing mechanisms as a reference. The results show that the proposed DT-TTAR algorithm has better performance of end-to-end delay than other algorithms, especially in high traffic areas.

An improved genetic algorithm with dynamic topology

The genetic algorithm （GA） is a nature-inspired evolutionary algorithm to find optima in search space via the interac- tion of individuals. Recently, researchers demonstrated that the interaction topology plays an important role in information exchange among individuals of evolutionary algorithm. In this paper, we investigate the effect of different network topolo- gies adopted to represent the interaction structures. It is found that GA with a high-density topology ends up more likely with an unsatisfactory solution, contrarily, a low-density topology can impede convergence. Consequently, we propose an improved GA with dynamic topology, named DT-GA, in which the topology structure varies dynamically along with the fitness evolution. Several experiments executed with 15 well-known test functions have illustrated that DT-GA outperforms other test GAs for making a balance of convergence speed and optimum quality. Our work may have implications in the combination of complex networks and computational intelligence.

Optimization of a Network Topology Generation Algorithm Based on Spatial Information Network

Spatial information network(SIN)is a network with high speed and periodicity of node operation.In recent days,China will build a complete asteroid monitoring and warning system and a near-Earth asteroid defense system.This requires launching more low-Earth orbit satellites.In order to adapt to the increase in the number of near-Earth satellites,the dynamic optimization of space informa-tion network topology between satellites will have research significance.Consid-ering the visibility of satellite networking,the connectivity of satellite nodes,and the number of links connected to the whole network,with the goal of minimizing the end-to-end delay between satellite nodes in the network as the optimization goal,a network topology optimization model that meets multiple constraints is constructed,and the model is solved using greedy algorithm and simulated anneal-ing algorithm.In the process of simulated annealing,the networkflow algorithm is innovatively proposed for neighborhood solution.Experiments show that the simulated annealing hybrid neighborhood algorithm is significantly better than the simulated annealing random neighborhood algorithm.

Topology control based on quantum genetic algorithm in sensor networks

Nowadays,two trends appear in the application of sensor networks in which both multi-service and quality of service(QoS)are supported.In terms of the goal of low energy consumption and high connectivity,the control on topology is crucial.The algorithm of topology control based on quantum genetic algorithm in sensor networks is proposed.An advantage of the quantum genetic algorithm over the conventional genetic algorithm is demonstrated in simulation experiments.The goals of high connectivity and low consumption of energy are reached.

Efficient distributed address assignment algorithm based on topology maintenance in ZigBee networks

Adopting the borrowed address algorithm can decrease the orphan nodes in ZigBee networks that use distributed address assignment mechanism （DAAM）. The existing borrowed address algorithms can increase the success rate of address assignment, but they have defects such as greater cost of overhead and time in founding network caused by breaking topology. To solve such problems, we propose an more efficient distributed borrowed address assignment algorithm based on topology maintenance （A2BTM） that has a topology maintenance function. It borrows address firstly from the offspring nodes in the same branch for the orphan nodes and replies distributed the request of the borrowed address message immediately, to maintain the network topology and decrease the overhead and time spent on the mechanism of borrowed address. Theoretical and simulation analyses manifest that AZBTM algorithm outperforms DAAM and its improved algorithms in terms of the overhead and time spent in founding network, on the premise of keeping a higher success rate of address assignment. Furthermore, A2BTM can lessen the influence from detour phenomenon efficiently.

Power savings in software defined data center networks via modified hybrid genetic algorithm

In modern data centers, power consumed by network is an observable portion of the total energy budget and thus improving the energy efficiency of data center networks （DCNs） truly matters. One effective way for this energy efficiency is to make the size of DCNs elastic along with traffic demands by flow consolidation and bandwidth scheduling, i.e., turning off unnecessary network components to reduce the power consumption. Meanwhile, having the instinct support for data center management, software defined networking （SDN） provides a paradigm to elastically control the resources of DCNs. To achieve such power savings, most of the prior efforts just adopt simple greedy heuristic to reduce computational complexity. However, due to the inherent problem of greedy algorithm, a good-enough optimization cannot be always guaranteed. To address this problem, a modified hybrid genetic algorithm （MHGA） is employed to improve the solution＇s accuracy, and the fine-grained routing function of SDN is fully leveraged. The simulation results show that more efficient power management can be achieved than the previous studies, by increasing about 5% of network energy savings.

A Genetic Algorithm and Analysis of Designing Large Enterprise Network Topology

The design of enterprise network topology is in fact a multi-object nonlinear programming problem. In this paper, distance, traffic distribution and transmission delay are chosen as the important factors to be considered in the subnetwork partition of the network topology design. A mathematical model is presented and The Genetic Algorithm is used to solve the optimization object function. The application results demonstrate that the method can well solve the problem of subnetwork partition.

A survey of routing algorithm for mesh Network-on-Chip

With the rapid development of semiconductor in- dustry, the number of cores integrated on chip increases quickly, which brings tough challenges such as bandwidth, scalability and power into on-chip interconnection. Under such background, Network-on-Chip （NoC） is proposed and gradually replacing the traditional on-chip interconnections such as sharing bus and crossbar. For the convenience of physical layout, mesh is the most used topology in NoC design. Routing algorithm, which decides the paths of pack- ets, has significant impact on the latency and throughput of network. Thus routing algorithm plays a vital role in a wellperformed network. This study mainly ：focuses on the routing algorithms of mesh NoC. By whether taking network information into consideration in routing decision, routing algorithms of NoC can be roughly classified into oblivious routing and adaptive routing. Oblivious routing costs less without adaptiveness while adaptive routing is on the contrary. To combine the advantages of oblivious and adaptive routing algorithm, half-adaptive algorithms were proposed. In this paper, the concepts, taxonomy and features of routing algorithms of NoC are introduced. Then the importance of routing algorithms in mesh NoC is highlighted, and representative routing algorithms with respective features are reviewed and summarized. Finally, we try to shed light upon the future work of NoC routing algorithms.

Community detection with consideration of non-topological information

In a network described by a graph, only topological structure information is considered to determine how the nodes are connected by edges. Non-topological information denotes that which cannot be determined directly from topological information. This paper shows, by a simple example where scientists in three research groups and one external group form four communities, that in some real world networks non-topological information （in this example, the research group affiliation） dominates community division. If the information has some influence on the network topological structure, the question arises as to how to find a suitable algorithm to identify the communities based only on the network topology. We show that weighted Newman algorithm may be the best choice for this example. We believe that this idea is general for real-world complex networks.

基于CatBoost算法的配电网分区拓扑辨识

含多分布式电源配电网的拓扑结构具有多样性与多变性,影响拓扑辨识的实时性和准确性。提出一种基于CatBoost算法的配电网分区拓扑辨识方法。构建结合拓扑分区的配电网拓扑辨识框架,采用区域开关状态矩阵描述拓扑结构,以进行物理上的辨识降维;提出基于CatBoost算法的特征选择与拓扑辨识方法,通过分区并行离线训练得到历史拓扑和未知拓扑的区域拓扑辨识CatBoost模型,通过在线应用得到实时的区域开关状态矩阵标签,形成配电网开关状态矩阵,实现系统拓扑辨识。配电网算例系统测试结果验证了所提方法的有效性。

无线传感器网络能量均衡混合拓扑维护策略

针对恶劣环境下无人值守的无线传感器网络能量受限特性,提出一种时间和能量混合拓扑维护策略,以达到实现节点能量均衡的目的。将拓扑控制分为网络初始化阶段、拓扑构建阶段和拓扑维护阶段,在随机部署和虚拟骨干网络构建的前提下,确立了能量和时间作为拓扑维护触发条件的合理性。仿真表明,所提出的混合拓扑维护策略使网络生命周期提升了44.6%,90%覆盖率结束时间增加了1.4倍,为无线传感器网络的节能部署提供了参考。

基于改进水波算法的复杂多人共站装配线平衡研究

针对实际装配环境中存在多人协同装配和共站的情况,研究了考虑工序复杂程度与工人能力差异的多人协作共站装配线平衡问题。首先,考虑到装配工序的复杂程度需指派不同规模和类型的工人组,建立了以最小化工作站数量和工人数量为目标函数的多目标优化数学模型;在此基础上,提出一种改进的离散水波优化算法,对算子进行了离散化改造,并设计了基于拓扑排序的编码方案和启发式的解码方案,同时引入扰动个体和路径重连的搜索策略来增加解的多样性,进而提高解的质量;最后,通过求解两类测试用例,以线效率和平滑指数作为性能指标,验证了改进离散水波算法在求解复杂多人共站装配线平衡问题上的可行性与有效性,并将算法应用到动车装配线平衡优化中。

一种改进的MANET加权分簇算法

移动自组网(Mobile Ad Hoc Network, MANET)主要应用于军事活动、灾后救援等大规模的活动中,随着节点数的增加、移动速度的加快,网络拓扑变得更加复杂,网络稳定性和性能也随之下降。频繁的网络拓扑变化会导致簇结构变得不稳定并且控制开销也会增加。为了解决这一问题,提出了一种改进的加权分簇算法,通过仿真表明,该算法可以有效地提高大规模移动自组网的性能。

无人装备系统网络拓扑弹性优化研究

针对无人装备系统的网络拓扑结构优化,着力提升网络拓扑弹性,增强装备系统抵抗风险能力这一问题,主要是对无人装备系统网络结构特点进行分析,以无人装备系统的弹性度量和弹性优化理论为基础构建出PA优化算法,通过增加优化边的策略达到提升无人装备系统的弹性的目的,最后通过案例验证了该方法的科学性和有效性,表明该方法能够极大程度上提升网络拓扑弹性,增强网络结构的强度和韧性,对恶意攻击的抵御能力显著增强,对提升装备系统的作战效能具有重要意义。

LAOV网络及其拓扑排序算法

针对网格工作流调度、生产和施工计划的制订等领域的特殊需求,引入了一类顶点带层次的AOV网络-LAOV网络。本文对AOV网络、层次、LAOV网络进行了严格的定义,并对顶点层次取值的几种情形作了详细的讨论。然后针对其中一种合理情形的LAOV网络提出了拓扑排序算法,讨论了栈或队列的选择、有向回路的判定等问题,并分析了算法的复杂度。最后对LAOV网络及拓扑排序算法进行实验分析。因为算法输出的解不唯一,在实验分析时设计了评判程序对算法输出进行验证。实验分析结果表明算法是正确的,时空效率也比较好。

基于FPGA的两阶段配电网拓扑实时辨识算法

对配电网拓扑进行准确的实时辨识是电力系统安全稳定运行的基础,但随着新能源的接入以及配电网规模不断增大,配电网拓扑结构的动态变化愈加频繁且难以辨识。然而,现有配电网拓扑辨识算法所使用的历史数据需要人工对其进行拓扑标注,且拓扑辨识时间长,难以实现配电网拓扑实时辨识。因此,文中提出了一种基于现场可编程逻辑门阵列(FPAG)的两阶段配电网拓扑结构实时辨识算法。该算法不需要预先给出配电网拓扑类别的数量,即可对已有历史数据进行相应的拓扑标注及分类,并且基于FPGA实现了对配电网拓扑的实时辨别。该算法分为2个阶段:第1阶段采用变分贝叶斯高斯混合模型,对已有历史数据进行相应的拓扑标注及分类;第2阶段采用麻雀搜索算法,使得支持向量机快速收敛得到最优参数,以实现对配电网拓扑结构的精准辨识。基于该算法,利用FPGA并行架构以及高速高密度特性建立了实时拓扑结构辨识平台。最后,通过算例分析验证了所提辨识方法的有效性和优越性。

双通道时延脉冲耦合神经网络的AOV-网拓扑排序

在时延脉冲耦合神经网络DPCNN的基础上提出了双通道时延脉冲耦合神经网络(DCDPCNN,Dual Channels DPCNN)模型,并提出了利用DCDPCNN来实现AOV-网拓扑排序算法。该算法在深度优先搜索的同时兼顾广度优先搜索,同时忽略节点进栈顺序,在求得的拓扑序列的个数、计算中的临时数据量、有向环判断、计算速度方面,比传统算法有了较大的改进。