1 February 2017 in Digital Communications and Networks
Fast recovery and minimum utilization of resources are the two main criteria for determining the protection scheme quality. We address the problem of providing a hybrid protection approach on elastic optical networks under contiguity and continuity of available spectrum constraints. Two main hypotheses are used in this paper for backup paths computation. In the first case, it is assumed that backup paths resources are dedicated. In the second case, the assumption is that backup paths resources are available shared resources. The objective of the study is to minimize spectrum utilization to reduce blocking probability on a network. For this purpose, an efficient survivable Hybrid Protection Lightpath (HybPL) algorithm is proposed for providing shared or dedicated backup path protection based on the efficient energy calculation and resource availability. Traditional First-Fit and Best-Fit schemes are employed to search and assign the available spectrum resources. The simulation results show that HybPL presents better performance in terms of blocking probability, compared with the Minimum Resources Utilization Dedicated Protection (MRU-DP) algorithm which offers better performance than the Dedicated Protection (DP) algorithm
1 May 2003 in Applied Mathematics and Computation
1 March 2023 in Indonesian Journal of Electrical Engineering and Computer Science
Wireless sensor networks (WSNs) contain an inordinate number of sensor nodes that are spatially distributed. The network is composed of entities that determine its lifetime. The WSN nodes are equipped with a battery whose autonomy is limited in duration. In this paper, different solutions are introduced to improve the overall energy consumption of the network in order to improve its lifetime. Contrary to many works considering the clustering algorithm as one potential candidate to improve the network's lifetime, this study has investigated the firefly algorithm optimization where an optimal cluster head is selected from a group of nodes. The set-up process of the cluster head is based on a set of conditions. To measure the performance of the proposed approach, the number of dead nodes and data packets received by the base station (BS) or sink node are considered. The results are tested on 100 nodes for 5000 transmission rounds, the amount of data transported is 20 million bits a little more than the other methods. It has been shown that the proposed solution outperformed the traditional low energy adaptive clustering hierarchy (LEACH), threshold sensitive energy efficient sensor network (TEEN), and developed distributed energy-efficient clustering (DEEC) approaches.
1 January 2001 in International Journal of Systems Science
This paper presents the design of a predictive controller for decentralized control of an irrigation canal. The overall canal is decomposed into N subsystems (reaches) separated by a control structure (gate). The subsystems are interdependent because flow through the structures depends on both up- and downstream water levels. Here, predictive control theory is used to formulate a set of local controllers for the automatic operation of each reach gate. The control scheme presented explicitly takes into account the interactions among subsystems. The objective of each controller is to maintain the downstream end water level of each reach at a constant target value under external perturbation. To evaluate the controller performance in realistic conditions, it is tested on an open-canal flow non-linear model. The case study considered deals with eight canal reaches.