MARC details
| 000 -LEADER |
|---|
| fixed length control field |
03424nam a2200265 a 4500 |
| 001 - CONTROL NUMBER |
|---|
| control field |
vtls000058754 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
KUKTEM |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20251114204513.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
120321t2011 my a f m 000 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
THE0003639(Local) |
| 039 #9 - LEVEL OF BIBLIOGRAPHIC CONTROL AND CODING DETAIL [OBSOLETE] |
|---|
| Level of rules in bibliographic description |
201905161514 |
| Level of effort used to assign nonsubject heading access points |
zulaiha |
| Level of effort used to assign subject headings |
201710061538 |
| Level of effort used to assign classification |
aishah |
| -- |
201203211123 |
| -- |
ida |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
UMP |
| 090 ## - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN) |
|---|
| Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) |
TK5103.45 .H36 2011 rs Thesis |
| 100 0# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Handrizal |
| 245 13 - TITLE STATEMENT |
|---|
| Title |
An improved algorithm for channel allocation on direct sequence spread spectrum / |
| Statement of responsibility, etc. |
Handrizal |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
Kuantan, Pahang : |
| Name of publisher, distributor, etc. |
UMP, |
| Date of publication, distribution, etc. |
2011 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xiv, 92 p. : |
| Other physical details |
ill. (some col.) ; |
| Dimensions |
30 cm. + |
| Accompanying material |
1 CD-ROM |
| 502 ## - DISSERTATION NOTE |
|---|
| Dissertation note |
Thesis (Master of Science (Computer)) -- Universiti Malaysia Pahang - 2011 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc. note |
Bibliography : p. [89]-92 |
| 520 3# - SUMMARY, ETC. |
|---|
| Summary, etc. |
Graph coloring is an assignment a color to each vertex, which each vertex that adjacent is given a different color. Graph coloring is a useful algorithm for channel allocation on Direct Sequence Spread Spectrum (DSSS). Through this algorithm, each access point (AP) that adjacent gives different channels based on colors available. Welsh Powell algorithm and Degree of saturation (Dsatur) are the popular algorithms being used for channel allocation in this domain. Welsh Powell algorithm is an algorithm that tries to solve the graph coloring problem. Dsatur algorithm is an algorithm coloring sorted by building sequence of vertices dynamically. However, these algorithms have its weaknesses in terms of the minimum number of channel required. In this study, channel allocation called Vertex Merge Algorithm (VMA) is proposed with aim to minimize number of required channels. It is based on the logical structure of vertex in order to a coloring the graph. Each vertex on the graph arranged based on decreasing number of degree. The vertex in the first place on the set gives a color, and then this vertex is merged with non-adjacent vertex. This process is repeatedly until all vertices colored. The assignment provides a minimum number of channels required. A series of an experiment was carried out by using one computer. Vertex Merge Algorithm (VMA) simulation is developed under Linux platform. It was carried out in Hypertext Preprocessor (PHP) programming integrated with GNU Image Manupulation Program (GIMP) for open and edit image. The experimental results show that the proposed algorithm work successfully in channel allocation on DSSS with the minimum of channels required. The average percentage reduction in the number of required channels among the VMA, Dsatur algorithm and Welsh Powell algorithm in the simple graph is equivalent to 0.0%. Meanwhile between the VMA and Dsatur algorithm in the complex graph is equivalent to 18.1%. However, VMA and Welsh Powell algorithm is not compared in the complex graph since its drawback in terms of not fulfill the graph coloring concept. This is because there are two adjacent vertices have the same color. Overall, even there is no reduction for number of required channel among VMA, Dsatur algorithm and Welsh Powell algorithm in the simple graph, but the outstanding significant contribution of VMA since it has reduction in the complex graph. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Spread spectrum communications |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Graph algorithms |
| 856 40 - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
<a href="http://ecollib.ump.edu.my/3828/">http://ecollib.ump.edu.my/3828/</a> |
| Public note |
Library access only |