Flower Pollination Algorithm to Tune PID Controller of TCP/AQM Wireless Networks

The current study aims to conduct a simulation that is useful in developing an appropriate design that addresses the problem of congestion in the Internet network through controlling the queue of the router. The simulation is conducted through the proposed model for simulation with different control systems that help in raising the quality of performance such as traditional Proportional Integral Derivative (PID) and advanced optimal by Flower Pollination Algorithm  (FPA). It depends for Transmission Control Protocol/ Active Queue Management( TCP/AQM )simulation model for a linear system and another non-linear system. To adjust the network work and raise the level of performance, different control systems were chosen, taking into account all the things that appear through conducting experiments and for different purposes. One of the most important things that must be taken into consideration is the system disturbances as a result of the volume and values of the data, causing congestion . It was shown through the results of the experiments that were conducted considering the cases of the linear and nonlinear system to pass data traffic in the network and by adopting the different techniques of the control units, the preference of optimizasion systems over the traditional ones, as well as the preference of the traditional over  without control in close loop, is the improvement of the performance of linear systems compared to the open and closed system without control. The simulation results showed that very clear the superiority of the optimization by FPA-PID controller over the conventional system (PID)  , as well as very clear the superiority of  the traditional system (PID)over closed system without control and open loop system

Router-based network traffic observation by terminal sliding mode control theory

Since the early days of the Internet, network traffic monitoring (NTM) has always played a strategic role in understanding and characterizing users’ activities. Nowadays, with the increased complexity of the Internet infrastructure, applications, and services, this role has become more crucial than ever. The aims of NTM are mainly focused on the three improvements, which include the quality of service (QoS) of the network, optimization of resource usage, and enhancement of security in computer networks. Specifically speaking, firstly, network conditions can be recognized by the network manager with NTM scheme. It provides the complete details about the QoS of networks, such as bandwidth, throughput, propagation delay, link availability, jitter, server memory, database space and etc. Secondly, with NTM being implemented at network nodes, i.e., network gateways, such as routers, or network links, the network traffic that is traversing the network is under online observation. Thereby, the network utilization can be improved by optimizing the resource usage to avoid the network congestions. Thirdly, unauthenticated service or approaches to the server will be identified by regularly monitoring the traffic. The network convention and statistics about the traffic will be known easily which helps to troubleshoot the network. Security events will also be investigated and the entry of the user will be maintained for responsibility. The work in this thesis focuses on the development of an intelligent real-time dynamic router-based network traffic observation (RNTO) by using the terminal sliding-mode theory. The RNTO technique is applied at network gateways, i.e., routers, to estimate the status of the traffic flows at the router level. The aims of the proposed RNTO technique is to estimate the traffic states, such as queue length (QL)in router buffer, average congestion window size (ACwnd), and the queuing dynamics of the additional traffic flows (ATF). The main contributions of the work can be broadly categorized into four parts. First, the problem of router-based network traffic monitoring is formulated as an observer design by using TSM theory for RNTO applications. The proposed TSM observer in the research is a network-based monitoring, which is implemented into the network gateways, i.e., network routers. Different from the static network traffic monitoring methods, the TSM observer is designed by using control methods based on the fluid-flow mathematical model, which represents the traffic dynamics of the interactions in a set of TCP traffic flows through network routers. By considering the time delay and stochastic properties in the data transmission network, the sliding-mode observation strategy is proposed with its high robustness with system parameter uncertainties as well as the external disturbance rejection. Given the natural weakness of chattering in sliding mode control signal, which can affect the system state, the chattering avoiding technique of the proposed TSM observation was utilized by using a smooth control signal for estimating the abnormal dynamics. It does not need any low-pass filler, which will lead to a phase leg. In addition, for the stochastic dynamics of the network traffics, fast transient convergence at a distance from and within a close range of the equilibrium of the traffic dynamics is essential to quickly capture traffic dynamics in network systems. Thus, a fractional term has been considered in the TSM for faster convergence in system states to efficiently estimate the traffic behaviors. Second, the issue of internal dynamics in network observation system is studied by proposing a novel full-order TSM strategy to speed up the convergence rate of the estimation error. In the RNTO scheme, the precise estimation for ACwnd is needed to estimate the queuing dynamics of ATF. However, the estimation error for ACwnd is not available and it converges to origin asymptotically, which results in a long response time in estimation. The proposed novel TSM observer has been designed to drive the estimation error for ACwnd to a defined known area in the finite-time, which can be calculated. Thereby, the estimation error of ACwnd can converge to origin asymptotically within the defined area. This strategy has shortened the response time and improves the estimation accuracy. This further improves the estimation accuracy for ATF. The comparative studies are conducted to evaluate the performance. Third, the issue of algorithm-efficient RNTO is investigated by considering an event triggered sliding-mode observer to reduce the computational load and the communication burden. Instead of the time-driven observation scheme, the control of the sliding mode observer is formulated under the event triggered scheme. The control of the observer is designed to be smooth and is directly applied to estimate the dynamics of the additional traffic flows. The event triggered observation algorithms is developed to reduce the computational load of the network router and the communication resource of output link in the network. Fourth, the problem of global RNTO is addressed by developing a fuzzy TSM observer by using fuzzy theory to achieve global operation under network uncertainties. The existing RNTO schemes are based on the linearization of a certain network conditions, i.e., a fixed number of TCP connections, which is a constant value N. Given the network suffers from time-varying fading, shadowing and interference and the data rate changes over time, the current methods proposed so far might not effectively and accurately monitor and estimate the traffic dynamics under network uncertainties. The T-S fuzzy models are used to model the traffic dynamics of the time-varying data changes in network link resources, i.e. the time-varying number of TCP sections, N(t) in a mathematical model. Based on the T-S fuzzy models, the fuzzy terminal sliding mode observer is established by using the fuzzy logic theory to estimate the states of the network traffic to achieve the global observation performance under the network uncertainties. In the fuzzy terminal sliding mode observer, the control signal is designed to be continuous for application of estimating the additional traffic flows without the low-pass filter. To evaluate the proposed RNTO technique, the networking simulator tool Network Simulator II (NS-II) has been used. The proposed RNTO algorithms are coded and implemented into network routers in NS-II. Numerous simulation scenarios are considered and performed. The comparative studies are also conducted by analyzing the NS-2 results. The results have demonstrated the effectiveness and efficiency of the proposed RNTO algorithms

Resource allocation and congestion control strategies for networked unmanned systems

It is generally agreed that communication is a critical technological factor in designing networked unmanned systems (NUS) that consist of a large number of heterogeneous assets/nodes that may be configured in ad-hoc fashion and that incorporate intricate architectures. In order to successfully carry out the NUS missions, communication among assets need to be accomplished efficiently. In contrast with conventional networks, NUSs have specific features that may render communication more complex. The main distinct characteristics of NUS are as follows: (a) heterogeneity of assets in terms of resources, (b) multiple topologies that can be fully-connected, (c) real-time requirements imposed by delivery timeliness of messages under evolving and uncertain environments, (d) unknown and random time-delays that may degrade the closed-loop dynamics performance, (e) bandwidth constraints reflecting differences in assets behavior and dynamics, and (f) protocol limitations for complying with the wireless features of these networks. The NUS system consists of clusters each having three nodes, namely, a sensor, a decision-maker, and an actuator. Inspired by networked control systems (NCS), we introduced a generic framework for NUSs. Using the fluid flow model (FFM), the overall dynamical model of our network cluster is derived as a time-delay dependent system. The following three main issues are investigated in this thesis, bandwidth allocation, an integrated bandwidth allocation and flow rate control, and congestion control. To demonstrate the difficulty of addressing the bandwidth allocation control problem, a standard PID is implemented for our network cluster. It is shown that in presence of feedback loops and time-delays in the network, this controller induces flow oscillations and consequently, in the worst-case scenario, network instability. To address this problem, nonlinear control strategies are proposed instead. These strategies are evaluated subject to presence of unknown delays and measurable/estimated input traffic. For different network configurations, the error dynamics of the entire controlled cluster is derived and sufficient stability conditions are obtained. In addition, our proposed bandwidth allocation control strategy is evaluated when the NUS assets are assumed to be mobile. The bandwidth allocation problem is often studied in an integrated fashion with the flow rate control and the connection admission control (CAC). In fact, due to importance of interaction of various components, design of the entire control system is often more promising than optimization of individual components. In this thesis, several robust integrated bandwidth allocation and flow rate control strategies are proposed. The third issue that is investigated in this thesis is the congestion control for differentiated-services (DiffServ) networks. In our proposed congestion control strategies, the buffer queue length is used as a feedback information to control locally the queue length of each buffer by acting on the bandwidth and simultaneously a feedback signaling notifies the ordinary sources regarding the allowed maximum rate. Using sliding mode generalized variable structure control techniques (SM-GVSC), two congestion control approaches are proposed, namely, the non degenerate and degenerate GVS control approaches. By adopting decentralized end-to-end, semi-decentralized end-to-end, and distributed hop-by-hop control approaches, our proposed congestion control strategies are investigated for a DiffServ loopless mesh network (Internet) and a DiffServ fully-connected NUS. Contrary to the semi-decentralized end-to-end congestion control strategy, in the distributed hop-by-hop congestion control strategy, each output port controller communicates the maximum allowed flow rate only to its immediate upstream node(s) and/or source(s). This approach reduces the required amount of information in the flow control when Compared to other approaches in which the allowed flow rate is sent to all the upstream sources communicating through an output port