Mathematical problems for complex networks

Copyright @ 2012 Zidong Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. This article is made available through the Brunel Open Access Publishing Fund.Complex networks do exist in our lives. The brain is a neural network. The global economy is a network of national economies. Computer viruses routinely spread through the Internet. Food-webs, ecosystems, and metabolic pathways can be represented by networks. Energy is distributed through transportation networks in living organisms, man-made infrastructures, and other physical systems. Dynamic behaviors of complex networks, such as stability, periodic oscillation, bifurcation, or even chaos, are ubiquitous in the real world and often reconfigurable. Networks have been studied in the context of dynamical systems in a range of disciplines. However, until recently there has been relatively little work that treats dynamics as a function of network structure, where the states of both the nodes and the edges can change, and the topology of the network itself often evolves in time. Some major problems have not been fully investigated, such as the behavior of stability, synchronization and chaos control for complex networks, as well as their applications in, for example, communication and bioinformatics

Enhanced Differential Crossover and Quantum Particle Swarm Optimization for IoT Applications

An optimized design with real-time and multiple realistic constraints in complex engineering systems is a crucial challenge for designers. In the non-uniform Internet of Things (IoT) node deployments, the approximation accuracy is directly affected by the parameters like node density and coverage. We propose a novel enhanced differential crossover quantum particle swarm optimization algorithm for solving nonlinear numerical problems. The algorithm is based on hybrid optimization using quantum PSO. Differential evolution operator is used to circumvent group moves in small ranges and falling into the local optima and improves global searchability. The cross operator is employed to promote information interchange among individuals in a group, and exceptional genes can be continued moderately, accompanying the evolutionary process's continuance and adding proactive and reactive features. The proposed algorithm's performance is verified as well as compared with the other algorithms through 30 classic benchmark functions in IEEE CEC2017, with a basic PSO algorithm and improved versions. The results show the smaller values of fitness function and computational efficiency for the benchmark functions of IEEE CEC2019. The proposed algorithm outperforms the existing optimization algorithms and different PSO versions, and has a high precision and faster convergence speed. The average location error is substantially reduced for the smart parking IoT application

Optimal leach protocol with improved bat algorithm in wireless sensor networks

© 2019, Korean Society for Internet Information. All rights reserved. A low-energy adaptive clustering hierarchy (LEACH) protocol is a low-power adaptive cluster routing protocol which was proposed by MIT’s Chandrakasan for sensor networks. In the LEACH protocol, the selection mode of cluster-head nodes is a random selection of cycles, which may result in uneven distribution of nodal energy and reduce the lifetime of the entire network. Hence, we propose a new selection method to enhance the lifetime of network, in this selection function, the energy consumed between nodes in the clusters and the power consumed by the transfer between the cluster head and the base station are considered at the same time. Meanwhile, the improved FTBA algorithm integrating the curve strategy is proposed to enhance local and global search capabilities. Then we combine the improved BA with LEACH, and use the intelligent algorithm to select the cluster head. Experiment results show that the improved BA has stronger optimization ability than other optimization algorithms, which the method we proposed (FTBA-TC-LEACH) is superior than the LEACH and LEACH with standard BA (SBA-LEACH). The FTBA-TC-LEACH can obviously reduce network energy consumption and enhance the lifetime of wireless sensor networks (WSNs)

Lightning search algorithm: a comprehensive survey

The lightning search algorithm (LSA) is a novel meta-heuristic optimization method, which is proposed in 2015 to solve constraint optimization problems. This paper presents a comprehensive survey of the applications, variants, and results of the so-called LSA. In LSA, the best-obtained solution is defined to improve the effectiveness of the fitness function through the optimization process by finding the minimum or maximum costs to solve a specific problem. Meta-heuristics have grown the focus of researches in the optimization domain, because of the foundation of decision-making and assessment in addressing various optimization problems. A review of LSA variants is displayed in this paper, such as the basic, binary, modification, hybridization, improved, and others. Moreover, the classes of the LSA’s applications include the benchmark functions, machine learning applications, network applications, engineering applications, and others. Finally, the results of the LSA is compared with other optimization algorithms published in the literature. Presenting a survey and reviewing the LSA applications is the chief aim of this survey paper

A quantum-inspired sensor consolidation measurement approach for cyber-physical systems.

Cyber-Physical System (CPS) devices interconnect to grab data over a common platform from industrial applications. Maintaining immense data and making instant decision analysis by selecting a feasible node to meet latency constraints is challenging. To address this issue, we design a quantum-inspired online node consolidation (QONC) algorithm based on a time-sensitive measurement reinforcement system for making decisions to evaluate the feasible node, ensuring reliable service and deploying the node at the appropriate position for accurate data computation and communication. We design the Angular-based node position analysis method to localize the node through rotation and t-gate to mitigate latency and enhance system performance. We formalize the estimation and selection of the feasible node based on quantum formalization node parameters (node contiguity, node optimal knack rate, node heterogeneity, probability of fusion variance error ratio). We design a fitness function to assess the probability of node fitness before selection. The simulation results convince us that our approach achieves an effective measurement rate of performance index by reducing the average error ratio from 0.17-0.22, increasing the average coverage ratio from 29% to 42%, and the qualitative execution frequency of services. Moreover, the proposed model achieves a 74.3% offloading reduction accuracy and a 70.2% service reliability rate compared to state-of-the-art approaches. Our system is scalable and efficient under numerous simulation frameworks

A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications

Particle swarm optimization (PSO) is a heuristic global optimization method, proposed originally by Kennedy and Eberhart in 1995. It is now one of the most commonly used optimization techniques. This survey presented a comprehensive investigation of PSO. On one hand, we provided advances with PSO, including its modifications (including quantum-behaved PSO, bare-bones PSO, chaotic PSO, and fuzzy PSO), population topology (as fully connected, von Neumann, ring, star, random, etc.), hybridization (with genetic algorithm, simulated annealing, Tabu search, artificial immune system, ant colony algorithm, artificial bee colony, differential evolution, harmonic search, and biogeography-based optimization), extensions (to multiobjective, constrained, discrete, and binary optimization), theoretical analysis (parameter selection and tuning, and convergence analysis), and parallel implementation (in multicore, multiprocessor, GPU, and cloud computing forms). On the other hand, we offered a survey on applications of PSO to the following eight fields: electrical and electronic engineering, automation control systems, communication theory, operations research, mechanical engineering, fuel and energy, medicine, chemistry, and biology. It is hoped that this survey would be beneficial for the researchers studying PSO algorithms

Can We `Feel' the Temperature of Knowledge? Modelling Scientific Popularity Dynamics via Thermodynamics

Just like everything in the nature, scientific topics flourish and perish. While existing literature well captures article's life-cycle via citation patterns, little is known about how scientific popularity and impact evolves for a specific topic. It would be most intuitive if we could `feel' topic's activity just as we perceive the weather by temperature. Here, we conceive knowledge temperature to quantify topic overall popularity and impact through citation network dynamics. Knowledge temperature includes 2 parts. One part depicts lasting impact by assessing knowledge accumulation with an analogy between topic evolution and isobaric expansion. The other part gauges temporal changes in knowledge structure, an embodiment of short-term popularity, through the rate of entropy change with internal energy, 2 thermodynamic variables approximated via node degree and edge number. Our analysis of representative topics with size ranging from 1000 to over 30000 articles reveals that the key to flourishing is topics' ability in accumulating useful information for future knowledge generation. Topics particularly experience temperature surges when their knowledge structure is altered by influential articles. The spike is especially obvious when there appears a single non-trivial novel research focus or merging in topic structure. Overall, knowledge temperature manifests topics' distinct evolutionary cycles

New Approaches in Cognitive Radios using Evolutionary Algorithms

Cognitive radio has claimed a promising technology to exploit the spectrum in an ad hoc network. Due many techniques have become a topic of discussion on cognitive radios, the aim of this paper was developed a contemporary survey of evolutionary algorithms in Cognitive Radio. According to the art state, this work had been collected the essential contributions of cognitive radios with the particularity of base they research in evolutionary algorithms. The main idea was classified the evolutionary algorithms and showed their fundamental approaches. Moreover, this research will be exposed some of the current issues in cognitive radios and how the evolutionary algorithms will have been contributed. Therefore, current technologies have matters presented in optimization, learning, and classification over cognitive radios where evolutionary algorithms can be presented big approaches. With a more comprehensive and systematic understanding of evolutionary algorithms in cognitive radios, more research in this direction may be motivated and refined

Energy efficient in cluster head and relay node selection for wireless sensor networks

Wireless Sensor Networks (WSNs) are defined as networks of nodes that work in a cooperative way to sense and control the surrounding environment. However, nodes contain limited energy which is the key limiting factor of the sensor network operation. In WSN architecture, the nodes are typically grouped into clusters where one node from each cluster is selected as the Cluster Head (CH) and relays utilisation to minimise energy consumption. Currently, the selection of CH based on a different combination of input variables. Example of these variables includes residual energy, communication cost, node density, mobility, cluster size and many others. Improper selection of sensor node (i.e. weak signal strength) as CH can cause an increase in energy consumption. Additionally, a direct transmission in dual-hop communication between sensor nodes (e.g. CH) with the base station (BS) uses high energy consumption. A proper selection of the relay node can assist in communication while minimising energy consumption. Therefore, the research aim is to prolong the network lifetime (i.e. reduce energy consumption) by improving the selection of CHs and relay nodes through a new combination of input variables and distance threshold approach. In CH selection, the Received Signal Strength Indicator (RSSI) scheme, residual energy, and centrality variable were proposed. Fuzzy logic was utilized in selecting the appropriate CHs based on these variables in the MATLAB. In relay node selection, the selection is based on the distance threshold according to the nearest distance with the BS. The selection of the optimal number of relay nodes is performed using K-Optimal and K-Means techniques. This ensures that all CHs are connected to at least one corresponding relay node (i.e. a 2-tier network) to execute the routing process and send the data to BS. To evaluate the proposal, the performance of Multi-Tier Protocol (MAP) and Stable Election Protocol (SEP) was compared based on 100, 200, and 800 nodes with 1 J and random energy. The simulation results showed that our proposed approach, refer to as Energy Efficient Cluster Heads and Relay Nodes (EECR) selection approach, extended the network lifetime of the wireless sensor network by 43% and 33% longer than SEP and MAP, respectively. This thesis concluded that with effective combinations of variables for CHs and relay nodes selection in static environment for data routing, EECR can effectively improve the energy efficiency of WSNs

Development an accurate and stable range-free localization scheme for anisotropic wireless sensor networks

With the high-speed development of wireless radio technology, numerous sensor nodes are integrated into wireless sensor networks, which has promoted plentiful location-based applications that are successfully applied in various fields, such as monitoring natural disasters and post-disaster rescue. Location information is an integral part of wireless sensor networks, without location information, all received data will lose meaning. However, the current localization scheme is based on equipped GPS on every node, which is not cost-efficient and not suitable for large-scale wireless sensor networks and outdoor environments. To address this problem, research scholars have proposed a rangefree localization scheme which only depends on network connectivity. Nevertheless, as the representative range-free localization scheme, Distance Vector-Hop (DV-Hop) localization algorithm demonstrates extremely poor localization accuracy under anisotropic wireless sensor networks. The previous works assumed that the network environment is evenly and uniformly distributed, ignored anisotropic factors in a real setting. Besides, most research academics improved the localization accuracy to a certain degree, but at expense of high communication overhead and computational complexity, which cannot meet the requirements of high-precision applications for anisotropic wireless sensor networks. Hence, finding a fast, accurate, and strong solution to solve the range-free localization problem is still a big challenge. Accordingly, this study aspires to bridge the research gap by exploring a new DV-Hop algorithm to build a fast, costefficient, strong range-free localization scheme. This study developed an optimized variation of the DV-Hop localization algorithm for anisotropic wireless sensor networks. To address the poor localization accuracy problem in irregular C-shaped network topology, it adopts an efficient Grew Wolf Optimizer instead of the least-squares method. The dynamic communication range is introduced to refine hop between anchor nodes, and new parameters are recommended to optimize network protocol to balance energy cost in the initial step. Besides, the weighted coefficient and centroid algorithm is employed to reduce cumulative error by hop count and cut down computational complexity. The developed localization framework is separately validated and evaluated each optimized step under various evaluation criteria, in terms of accuracy, stability, and cost, etc. The results of EGWO-DV-Hop demonstrated superior localization accuracy under both topologies, the average localization error dropped up to 87.79% comparing with basic DV-Hop under C-shaped topology. The developed enhanced DWGWO-DVHop localization algorithm illustrated a favorable result with high accuracy and strong stability. The overall localization error is around 1.5m under C-shaped topology, while the traditional DV-Hop algorithm is large than 20m. Generally, the average localization error went down up to 93.35%, compared with DV-Hop. The localization accuracy and robustness of comparison indicated that the developed DWGWO-DV-Hop algorithm super outperforms the other classical range-free methods. It has the potential significance to be guided and applied in practical location-based applications for anisotropic wireless sensor networks