Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication
- Publication Type
Articles 1 - 5 of 5
Full-Text Articles in Engineering
Logistics Orchestration Modeling And Evaluation For Humanitarian Relief, Hoong Chuin Lau, Zhengping Li, Xin Du, Heng Jiang, Robert De Souza
Logistics Orchestration Modeling And Evaluation For Humanitarian Relief, Hoong Chuin Lau, Zhengping Li, Xin Du, Heng Jiang, Robert De Souza
Research Collection School Of Computing and Information Systems
This paper proposes an orchestration model for post-disaster response that is aimed at automating the coordination of scarce resources that minimizes the loss of human lives. In our setting, different teams are treated as agents and their activities are "orchestrated" to optimize rescue performance. Results from simulation are analysed to evaluate the performance of the optimization model.
Probabilistic Qos Analysis In Wireless Sensor Networks, Yunbo Wang
Probabilistic Qos Analysis In Wireless Sensor Networks, Yunbo Wang
Department of Computer Science and Engineering: Dissertations, Theses, and Student Research
Emerging applications of wireless sensor networks (WSNs) require real-time quality of service (QoS) guarantees to be provided by the network. Traditional analysis work only focuses on the first-order statistics, such as the mean and the variance of the QoS performance. However, due to unique characteristics of WSNs, a cross-layer probabilistic analysis of QoS performance is essential. In this dissertation, a comprehensive cross-layer probabilistic analysis framework is developed to investigate the probabilistic evaluation and optimization of QoS performance provided by WSNs. In this framework, the distributions of QoS performance metrics are derived, which are natural tools to discover the probabilities to …
Networking And Security Solutions For Vanet Initial Deployment Stage, Baber Aslam
Networking And Security Solutions For Vanet Initial Deployment Stage, Baber Aslam
Electronic Theses and Dissertations
Vehicular ad hoc network (VANET) is a special case of mobile networks, where vehicles equipped with computing/communicating devices (called "smart vehicles") are the mobile wireless nodes. However, the movement pattern of these mobile wireless nodes is no more random, as in case of mobile networks, rather it is restricted to roads and streets. Vehicular networks have hybrid architecture; it is a combination of both infrastructure and infrastructure-less architectures. The direct vehicle to vehicle (V2V) communication is infrastructure-less or ad hoc in nature. Here the vehicles traveling within communication range of each other form an ad hoc network. On the other …
Optimization Of Pilot Tones Using Differential Evolution Algorithm In Mimo-Ofdm Systems, Muhammet Nuri̇ Seyman, Necmi̇ Taşpinar
Optimization Of Pilot Tones Using Differential Evolution Algorithm In Mimo-Ofdm Systems, Muhammet Nuri̇ Seyman, Necmi̇ Taşpinar
Turkish Journal of Electrical Engineering and Computer Sciences
In this paper, we propose a differential evolution (DE) algorithm for optimizing the placement and power of the pilot tones that are utilized by a least square (LS) algorithm for channel estimation in multiple-input and multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) systems. Computer simulations demonstrated that the performance of the LS algorithm was increased by optimizing the pilot tones with the DE algorithm instead of locating them orthogonally. We used the upper bound of the mean square error (MSE) as a fitness function of the DE algorithm for optimization tasks. With the use of an upper bound, it is not necessary …
A Fitness Function Elimination Theory For Blackbox Optimization And Problem Class Learning, Gautham Anil
A Fitness Function Elimination Theory For Blackbox Optimization And Problem Class Learning, Gautham Anil
Electronic Theses and Dissertations
The modern view of optimization is that optimization algorithms are not designed in a vacuum, but can make use of information regarding the broad class of objective functions from which a problem instance is drawn. Using this knowledge, we want to design optimization algorithms that execute quickly (efficiency), solve the objective function with minimal samples (performance), and are applicable over a wide range of problems (abstraction). However, we present a new theory for blackbox optimization from which, we conclude that of these three desired characteristics, only two can be maximized by any algorithm. We put forward an alternate view of …