An improved algorithm for channel allocation on direct sequence spread spectrum

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 channe...

Full description

Saved in:

Bibliographic Details
Main Author:	Handrizal, M
Format:	Thesis
Language:	English
Published:	2011
Subjects:	TK Electrical engineering Electronics Nuclear engineering
Online Access:	http://umpir.ump.edu.my/id/eprint/3830/1/CD5984_AN%20IMPROVED%20ALGORITHM%20FOR%20CHANNEL%20%20%20ALLOCATION%20ON%20DIRECT%20SEQUENCE%20SPREAD%20SPECTRUM.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-ump-ir.3830
record_format	uketd_dc
spelling	my-ump-ir.38302023-03-23T07:10:59Z An improved algorithm for channel allocation on direct sequence spread spectrum 2011-07 Handrizal, M TK Electrical engineering. Electronics Nuclear engineering 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. 2011-07 Thesis http://umpir.ump.edu.my/id/eprint/3830/ http://umpir.ump.edu.my/id/eprint/3830/1/CD5984_AN%20IMPROVED%20ALGORITHM%20FOR%20CHANNEL%20%20%20ALLOCATION%20ON%20DIRECT%20SEQUENCE%20SPREAD%20SPECTRUM.pdf pdf en public masters Universiti Malaysia Pahang Faculty of Computer System & Software Engineering Ahmad, Noraziah
institution	Universiti Malaysia Pahang Al-Sultan Abdullah
collection	UMPSA Institutional Repository
language	English
advisor	Ahmad, Noraziah
topic	TK Electrical engineering Electronics Nuclear engineering
spellingShingle	TK Electrical engineering Electronics Nuclear engineering Handrizal, M An improved algorithm for channel allocation on direct sequence spread spectrum
description	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.
format	Thesis
qualification_level	Master's degree
author	Handrizal, M
author_facet	Handrizal, M
author_sort	Handrizal, M
title	An improved algorithm for channel allocation on direct sequence spread spectrum
title_short	An improved algorithm for channel allocation on direct sequence spread spectrum
title_full	An improved algorithm for channel allocation on direct sequence spread spectrum
title_fullStr	An improved algorithm for channel allocation on direct sequence spread spectrum
title_full_unstemmed	An improved algorithm for channel allocation on direct sequence spread spectrum
title_sort	improved algorithm for channel allocation on direct sequence spread spectrum
granting_institution	Universiti Malaysia Pahang
granting_department	Faculty of Computer System & Software Engineering
publishDate	2011
url	http://umpir.ump.edu.my/id/eprint/3830/1/CD5984_AN%20IMPROVED%20ALGORITHM%20FOR%20CHANNEL%20%20%20ALLOCATION%20ON%20DIRECT%20SEQUENCE%20SPREAD%20SPECTRUM.pdf
_version_	1783731906587656192

An improved algorithm for channel allocation on direct sequence spread spectrum

Similar Items