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...
Saved in:
Main Author: | Handrizal, M |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2011
|
Subjects: | |
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!
|
Similar Items
-
Performance study of spread spectrum wireless local area networks
by: Mohd. Nor, Sulaiman
Published: (1996) -
Multicarrier Frequency Hopping Spread Spectrum Techniques With Quasi-Cyclic Low Density Parity Check Codes Channel Coding
by: Yahya, Abid
Published: (2010) -
Machine learning classification of frequency-hopping spread spectrum signals in a multi-signal environment
by: Khan, Muhammad Turyalai
Published: (2023) -
Studies and simulations of direct sequence spread spectrum in military application /
by: Othman, Amarmuazam Usmani
Published: (2010) -
Uplink channel power control improvement in DS-CDMA system using channel predictions
by: A. Othman, Ibtesam
Published: (2013)