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)

Algorithm

Articles 1 - 3 of 3

Full-Text Articles in Entire DC Network

Hadamard Ideals And Hadamard Matrices With Two Circulant Cores, I. S. Kotsireas, C. Koukouvinos, Jennifer Seberry Jul 2006

Hadamard Ideals And Hadamard Matrices With Two Circulant Cores, I. S. Kotsireas, C. Koukouvinos, Jennifer Seberry

Faculty of Informatics - Papers (Archive)

We apply Computational Algebra methods to the construction of Hadamard matrices with two circulant cores, given by Fletcher, Gysin and Seberry. We introduce the concept of Hadamard ideal, to systematize the application of Computational Algebra methods for this construction. We use the Hadamard ideal formalism to perform exhaustive search constructions of Hadamard matrices with two circulant cores for the twelve orders 8, 12, 16, 20, 24, 28, 32, 36, 40, 44, 48, 52. The total number of such Hadamard matrices is proportional to the square of the parameter. We use the Hadamard ideal formalism to compute the proportionality constants for …


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 …