Energy-efficient clustering in mobile ad-hoc networks using multi-objective particle swarm optimization

A mobile ad hoc network (MANET) is dynamic in nature and is composed of wirelessly connected nodes that perform hop-by-hop routing without the help of any fixed infrastructure. One of the important requirements of a MANET is the efficiency of energy, which increases the lifetime of the network. Several techniques have been proposed by researchers to achieve this goal and one of them is clustering in MANETs that can help in providing an energy-efficient solution. Clustering involves the selection of cluster-heads (CHs) for each cluster and fewer CHs result in greater energy efficiency as these nodes drain more power than noncluster-heads. In the literature, several techniques are available for clustering by using optimization and evolutionary techniques that provide a single solution at a time. In this paper, we propose a multi-objective solution by using multi-objective particle swarm optimization (MOPSO) algorithm to optimize the number of clusters in an ad hoc network as well as energy dissipation in nodes in order to provide an energy-efficient solution and reduce the network traffic. In the proposed solution, inter-cluster and intra-cluster traffic is managed by the cluster-heads. The proposed algorithm takes into consideration the degree of nodes, transmission power, and battery power consumption of the mobile nodes. The main advantage of this method is that it provides a set of solutions at a time. These solutions are achieved through optimal Pareto front. We compare the results of the proposed approach with two other well-known clustering techniques; WCA and CLPSO-based clustering by using different performance metrics. We perform extensive simulations to show that the proposed approach is an effective approach for clustering in mobile ad hoc networks environment and performs better than the other two approaches.     

Proactive task migration with a self-adjusting migration threshold for dynamic thermal management of multi-core processors

Request for more computation power steadily forces designers to provide more powerful processors using more number of cores on a single chip. The increasing complexity of processors leads to higher integration density, power density, and temperature. For avoiding thermal emergencies, various dynamic thermal management techniques have been presented. In this paper, we present a novel online self-adjusting temperature threshold schema for dynamic thermal management to minimize both average and peak temperature with very low performance overhead. Our proposed algorithm adjusts migration threshold according to workload and hardware platforms. The experimental results indicate that our technique can significantly decrease the average and peak temperature compared to Linux standard scheduler, and two well-known thermal management techniques: PDTM and TAS.     

A localization algorithm for large scale mobile wireless sensor networks: a learning approach

Localization is a crucial problem in wireless sensor networks and most of the localization algorithms given in the literature are non-adaptive and designed for fixed sensor networks. In this paper, we propose a learning based localization algorithm for mobile wireless sensor networks. By this technique, mobility in the network will be discovered by two crucial methods in the beacons: position and distance checks methods. These two methods help to have accurate localization and constrain communication just when it is necessary. The proposed method localizes the nodes based on connectivity information (hop count), which doesn’t need extra hardware and is cost efficient. The experimental results show that the proposed algorithm is scalable with a small set of beacons in large scale network with a high density of nodes. The given algorithm is fast and free from a pre-deployment requirement. The simulation results show the high performance of the proposed algorithm.     

A new set distance and its application to shape registration

We propose a new distance measure, called Complement weighted sum of minimal distances, between finite sets in ${\mathbb Z }^n$ and evaluate its usefulness for shape registration and matching. In this set distance the contribution of each point of each set is weighted according to its distance to the complement of the set. In this way, outliers and noise contribute less to the new similarity measure. We evaluate the performance of the new set distance for registration of shapes in binary images and compare it to a number of often used set distances found in the literature. The most extensive evaluation uses a set of synthetic 2D images. We also show three examples of real problems: registering a set of 2D images extracted from synchrotron radiation micro-computed tomography (SR $\upmu $ CT) volumes depicting bone implants; the difficult multi-modal registration task of finding the exact location of a 2D slice of a bone implant, as imaged by a light microscope, within a 3D SR $\upmu $ CT volume of the same implant; and finally recognition of handwritten characters. The evaluation shows that our new set distance performs well for all tasks and outperforms the other observed distance measures in most cases. It is therefore useful in many image registration and shape comparison tasks.     

On the Design of Observer for Nonlinear Time‐Delay Systems

This paper suggests a new method to design observers in a class of nonlinear time‐delay systems with delays in system states. The method is based on an extension of the well‐known state‐dependent Riccati equation (SDRE) technique. The conditions for locally asymptotic stability of the proposed observer are investigated. Some numerical simulations are provided to show the design procedure and the flexibility of the proposed observer.     

Stabilization of positive switched systems with time-varying delays under asynchronous switching

This paper investigates the state feedback stabilization problem for a class of positive switched systems with time-varying delays under asynchronous switching in the frameworks of continuous-time and discrete-time dynamics. The so-called asynchronous switching means that the switches between the candidate controllers and system modes are asynchronous. By constructing an appropriate co-positive type Lyapunov-Krasovskii functional and further allowing the functional to increase during the running time of active subsystems, sufficient conditions are provided to guarantee the exponential stability of the resulting closed-loop systems, and the corresponding controller gain matrices and admissible switching signals are presented. Finally, two illustrative examples are given to show the effectiveness of the proposed methods.     

Non‐fragile H ∞ control for switched stochastic delay systems with application to water quality process

In this paper, the problem of non‐fragile observer‐based H _∞ control for discrete‐time switched delay systems is investigated. Both data missing and time delays are taken into account in the links from sensors to observers and from controllers to actuators. Because data missing satisfies the Bernoulli distribution, such problem is transformed into an H _∞ control problem for stochastic switched delay systems. Average dwell time approach is used to obtain sufficient conditions on the solvability of such problems. A numerical example and a real example for water quality control are provided to illustrate the effectiveness and potential applications of the proposed techniques. Copyright © 2013 John Wiley & Sons, Ltd.     

Estimation of impact forces during multi-point collisions involving small deformations

Multibody System Dynamics - Collision between hard objects causes abrupt changes in the velocities of the system, which are characterized by very large contact forces over very small time...