Bi-velocity discrete particle swarm optimization and its application to multicast routing problem in communication networks

This paper proposes a novel bi-velocity discrete particle swarm optimization (BVDPSO) approach and extends its application to the NP-complete multicast routing problem (MRP). The main contribution is the extension of PSO from continuous domain to the binary or discrete domain. Firstly, a novel bi-velocity strategy is developed to represent possibilities of each dimension being 1 and 0. This strategy is suitable to describe the binary characteristic of the MRP where 1 stands for a node being selected to construct the multicast tree while 0 stands for being otherwise. Secondly, BVDPSO updates the velocity and position according to the learning mechanism of the original PSO in continuous domain. This maintains the fast convergence speed and global search ability of the original PSO. Experiments are comprehensively conducted on all of the 58 instances with small, medium, and large scales in the OR-library (Operation Research Library). The results confirm that BVDPSO can obtain optimal or near-optimal solutions rapidly as it only needs to generate a few multicast trees. BVDPSO outperforms not only several state-of-the-art and recent heuristic algorithms for the MRP problems, but also algorithms based on GA, ACO, and PSO

Energy efficiency performance improvements for ant-based routing algorithm in wireless sensor networks

The main problem for event gathering in wireless sensor networks (WSNs) is the restricted communication range for each node. Due to the restricted communication range and high network density, event forwarding in WSNs is very challenging and requires multihop data forwarding. Currently, the energy-efficient ant based routing (EEABR) algorithm, based on the ant colony optimization (ACO) metaheuristic, is one of the state-of-the-art energy-aware routing protocols. In this paper, we propose three improvements to the EEABR algorithm to further improve its energy efficiency. The improvements to the original EEABR are based on the following: (1) a new scheme to intelligently initialize the routing tables giving priority to neighboring nodes that simultaneously could be the destination, (2) intelligent update of routing tables in case of a node or link failure, and (3) reducing the flooding ability of ants for congestion control. The energy efficiency improvements are significant particularly for dynamic routing environments. Experimental results using the RMASE simulation environment show that the proposed method increases the energy efficiency by up to 9% and 64% in converge-cast and target-tracking scenarios, respectively, over the original EEABR without incurring a significant increase in complexity. The method is also compared and found to also outperform other swarm-based routing protocols such as sensor-driven and cost-aware ant routing (SC) and Beesensor

Distributed state estimation for uncertain Markov-type sensor networks with mode-dependent distributed delays

This the post-print version of the Article. The official published version can be accessed from the link below - Copyright @ 2012 John Wiley & Sons, Ltd.In this paper, the distributed state estimation problem is investigated for a class of sensor networks described by uncertain discrete-time dynamical systems with Markovian jumping parameters and distributed time-delays. The sensor network consists of sensor nodes characterized by a directed graph with a nonnegative adjacency matrix that specifies the interconnection topology (or the distribution in the space) of the network. Both the parameters of the target plant and the sensor measurements are subject to the switches from one mode to another at different times according to a Markov chain. The parameter uncertainties are norm-bounded that enter into both the plant system as well as the network outputs. Furthermore, the distributed time-delays are considered, which are also dependent on the Markovian jumping mode. Through the measurements from a small fraction of the sensors, this paper aims to design state estimators that allow the nodes of the sensor network to track the states of the plant in a distributed way. It is verified that such state estimators do exist if a set of matrix inequalities is solvable. A numerical example is provided to demonstrate the effectiveness of the designed distributed state estimators.This work was supported in part by the Royal Society of the U.K., the National Natural Science Foundation of China under Grants 60804028 and 61028008, the Specialized Research Fund for the Doctoral Program of Higher Education for New Teachers in China under Grant 200802861044, the Teaching and Research Fund for Excellent Young Teachers at Southeast University of China, the International Science and Technology Cooperation Project of China under Grant No. 2009DFA32050, and the Alexander von Humboldt Foundation of Germany

Bioinspired Principles for Large-Scale Networked Sensor Systems: An Overview

Biology has often been used as a source of inspiration in computer science and engineering. Bioinspired principles have found their way into network node design and research due to the appealing analogies between biological systems and large networks of small sensors. This paper provides an overview of bioinspired principles and methods such as swarm intelligence, natural time synchronization, artificial immune system and intercellular information exchange applicable for sensor network design. Bioinspired principles and methods are discussed in the context of routing, clustering, time synchronization, optimal node deployment, localization and security and privacy

Radio Frequency Energy Harvesting and Management for Wireless Sensor Networks

Radio Frequency (RF) Energy Harvesting holds a promising future for generating a small amount of electrical power to drive partial circuits in wirelessly communicating electronics devices. Reducing power consumption has become a major challenge in wireless sensor networks. As a vital factor affecting system cost and lifetime, energy consumption in wireless sensor networks is an emerging and active research area. This chapter presents a practical approach for RF Energy harvesting and management of the harvested and available energy for wireless sensor networks using the Improved Energy Efficient Ant Based Routing Algorithm (IEEABR) as our proposed algorithm. The chapter looks at measurement of the RF power density, calculation of the received power, storage of the harvested power, and management of the power in wireless sensor networks. The routing uses IEEABR technique for energy management. Practical and real-time implementations of the RF Energy using Powercast harvesters and simulations using the energy model of our Libelium Waspmote to verify the approach were performed. The chapter concludes with performance analysis of the harvested energy, comparison of IEEABR and other traditional energy management techniques, while also looking at open research areas of energy harvesting and management for wireless sensor networks.Comment: 40 pages, 9 figures, 5 tables, Book chapte

ACO-GCN: A FAULT DETECTION FUSION ALGORITHM FOR WIRELESS SENSOR NETWORK NODES

Wireless Sensor Network (WSN) has become a solution for real-time monitoring environments and is widely used in various fields. A substantial number of sensors in WSNs are prone to succumb to failures due to faulty attributes, complex working environments, and their hardware, resulting in transmission error data. To resolve the existing problem of fault detection in WSN, this paper presents a WSN node fault detection method based on ant colony optimization-graph convolutional network (ACO-GCN) models, which consists of an input layer, a space-time processing layer, and an output layer. First, the users apply the random search algorithm and the search strategy of the ant colony algorithm (ACO) to find the optimal path and locate the WSN node failures to grasp the overall situation. Then, the WSN fault node information obtained by the GCN model is learned. During the data training process, where the WSN fault node is used for error prediction, the weights and thresholds of the network are further adjusted to increase the accuracy of fault diagnosis. To evaluate the performance of the ACO-GCN model, the results show that the ACO-GCN model significantly improves the fault detection rate and reduces the false alarm rate compared with the benchmark algorithms. Moreover, the proposed ACO-GCN fusion algorithm can identify fault sensors more effectively, improve the service quality of WSN and enhance the stability of the system

A Survey on Underwater Acoustic Sensor Network Routing Protocols

Underwater acoustic sensor networks (UASNs) have become more and more important in ocean exploration applications, such as ocean monitoring, pollution detection, ocean resource management, underwater device maintenance, etc. In underwater acoustic sensor networks, since the routing protocol guarantees reliable and effective data transmission from the source node to the destination node, routing protocol design is an attractive topic for researchers. There are many routing algorithms have been proposed in recent years. To present the current state of development of UASN routing protocols, we review herein the UASN routing protocol designs reported in recent years. In this paper, all the routing protocols have been classified into different groups according to their characteristics and routing algorithms, such as the non-cross-layer design routing protocol, the traditional cross-layer design routing protocol, and the intelligent algorithm based routing protocol. This is also the first paper that introduces intelligent algorithm-based UASN routing protocols. In addition, in this paper, we investigate the development trends of UASN routing protocols, which can provide researchers with clear and direct insights for further research

A Review on Swarm Intelligence Based Routing Approaches

The principles of bio-inspired or swarm intelligence algorithms can be effectively used to achieve optimal solutions in routing for complex and dynamic wireless sensor networks or body area networks. As the name indicates, it is a field that is inspired by natural living beings like ants, bees, fishes, etc. Studies have proved that the routing protocols based on such bio-inspired methods perform better in terms of energy efficiency, reliability, adaptivity, scalability, and robustness. The general classification of routing protocols is classical-based and swarm-based routing protocols, where both the protocols were specifically categorized as data-centric, location-aware, hierarchical and network flow, and QoS aware protocols. In this paper, an evocative taxonomy and comparison of various swarm-based routing algorithms are presented. A brief discussion about the sensor network design and the major factors that influence the routing is also discussed. The comparative analysis of the selected swarm-based protocols is also done with respect to routing characteristics like query based, route selection, energy efficiency, and path selection. From the review, it is observed that the selection of a routing protocol is application dependent. This paper will be helpful to the researchers as a reference on bio-inspired algorithms for new protocol designs and also for the proper selection of routing protocols according to the type of applications