Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

PDF

Series

2006

Faculty of Informatics - Papers (Archive)

Networks

Articles 1 - 4 of 4

Full-Text Articles in Entire DC Network

Generic Scheduling Framework And Algorithm For Time-Varying Wireless Networks, Gengfa Fang, Yi Sun, Jihua Zhou, Jinglin Shi, Eryk Dutkiewicz Jan 2006

Generic Scheduling Framework And Algorithm For Time-Varying Wireless Networks, Gengfa Fang, Yi Sun, Jihua Zhou, Jinglin Shi, Eryk Dutkiewicz

Faculty of Informatics - Papers (Archive)

In this paper, the problem of scheduling multiple users sharing a time varying wireless channel is studied, in networks such as in 3G CDMA and IEEE 802.16. We propose a new generic wireless packet scheduling framework (WPSF), which takes into account not only the quality of service (QoS) requirements but also the wireless resource consumed. The framework is generic in the sense that it can be used with different resource constraints and QoS requirements depending on the traffic flow types. Subsequently, based on this framework a minimum rate and channel aware (MRCA) scheduling algorithm is presented. MRCA attempts to greedily …


Sava: A Novel Self-Adaptive Vertical Handoff Algorithm For Heterogeous Wireless Networks, Min Liu, Zhong-Cheng Li, Xiao-Bing Guo, Eryk Dutkiewicz, Ming-Hui Wang Jan 2006

Sava: A Novel Self-Adaptive Vertical Handoff Algorithm For Heterogeous Wireless Networks, Min Liu, Zhong-Cheng Li, Xiao-Bing Guo, Eryk Dutkiewicz, Ming-Hui Wang

Faculty of Informatics - Papers (Archive)

The next generation wireless networking (4G) is envisioned as a convergence of different wireless access technologies with diverse levels of performance. Vertical handoff (VHO) is the basic requirement for convergence of different access technologies and has received tremendous attention from the academia and industry all over the world. During the VHO procedure, handoff decision is the most important step that affects the normal working of communication. In this paper, we propose a novel vertical handoff decision algorithm, self- adaptive VHO algorithm (SAVA), and compare its performance with conventional algorithms. SAVA synthetically considers the long term movement region and short term …


Performance Evaluation Of Vertical Handoff Decision Algorithms In Heterogeneous Wireless Networks, Min Liu, Zhong-Cheng Li, Xiao-Bing Guo, Eryk Dutkiewicz, De-Kui Zhang Jan 2006

Performance Evaluation Of Vertical Handoff Decision Algorithms In Heterogeneous Wireless Networks, Min Liu, Zhong-Cheng Li, Xiao-Bing Guo, Eryk Dutkiewicz, De-Kui Zhang

Faculty of Informatics - Papers (Archive)

In recent years, many research works have focused on vertical handoff (VHO) decision algorithms. However, evaluation scenarios in different papers are often quite different and there is no consensus on how to evaluate performance of VHO algorithms. In this paper, we address this important issue by proposing an approach for systematic and thorough performance evaluation of VHO algorithms. Firstly we define the evaluation criteria for VHO with two metrics: matching ratio and average ping-pong number. Subsequently we analyze the general movement characteristics of mobile hosts and identify a set of novel performance evaluation models for VHO algorithms. Equipped with these …


Fitness Evaluation For Structural Optimisation Genetic Algorithms Using Neural Networks, Koren Ward, Timothy J. Mccarthy Jan 2006

Fitness Evaluation For Structural Optimisation Genetic Algorithms Using Neural Networks, Koren Ward, Timothy J. Mccarthy

Faculty of Informatics - Papers (Archive)

This paper relates to the optimisation of structural design using Genetic Algorithms (GAs) and presents an improved method for determining the fitness of genetic codes that represent possible design solutions by using a neural network to generalize fitness. Two problems that often impede design optimization using genetic algorithms are expensive fitness evaluation and high epistasis. In this paper we show that by using a neural network as a fitness approximator, optimal solutions to certain design problems can be achieved in significantly less generations and with considerably less fitness evaluations.