Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Multi-disciplinary Studies | en_US |
| dc.contributor | Department of Applied Mathematics | en_US |
| dc.creator | Lau, Chai-fat | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/2665 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | Graph applications on frequency assignment problems and map colouring | en_US |
| dcterms.abstract | Frequency Assignment Problems (FAP), or called Channel Assignment Problems (CAP) is a kind of assignment problems. The problems are tackled by setting a constraint model, which represents the minimum channel-separations between network stations in matrix form. Then it is to find a feasible channel assignment as a solution subject to the given constraints. Two traditional Heuristic End-Packing, Heuristic Ordering-Packing and a new developed Heuristic Graph-Approach methods have been studied through written programs. The most important discovery in this project is the theoretical background for the five assignment techniques of which the Graph-Approach technique is to solve a feasible solution set rather than using a traditional low-efficiency trial-and-error method in Ordering-Packing, End-Packing or Test-and-Assign methods. The traditional methods can be represented in Graph-Approach method and they are just some particular types derived from the method. Optimization for channel assignments has also been studied such as on the search for the possible minimum number of channels, and the selection of the best assignment through the performance analysis of the found feasible solutions for the channel assignment in a network system. Moreover, we can have optimization on the network system itself by the consideration of the effect of the channel separation constraints. Both Simplex Channel Assignments and Fixed Channel Assignments in a Complex Duplex Network System, taking account of the existing assigned channels in some network stations, have been studied. Since the Fixed Channel Assignment has similar requirements as the Dynamic Channel Assignment, and the Heuristic Graph-Approach method has been found to be very suitable for this type of assignment, it is believed that the Heuristic Graph-Approach method can be applied to Dynamic Channel Assignment efficiently. Finally, the assignment techniques subject to the given constraints are modelled for the finding of colouring of maps for South America and Africa continents that the minimum number of four colours can be used according to the Four-colour Theorem. | en_US |
| dcterms.extent | vi, 224 leaves : ill., col. maps ; 30 cm | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2000 | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.educationalLevel | M.Sc. | en_US |
| dcterms.LCSH | Mobile communication systems | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.accessRights | restricted access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b15235713.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 7.28 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/2665