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...
Main Author: | Handrizal, M |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2011
|
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/3830/ http://umpir.ump.edu.my/id/eprint/3830/ http://umpir.ump.edu.my/id/eprint/3830/1/CD5984_M_HANDRIZAL.pdf |
Similar Items
-
Spread Spectrum Process Using Direct Sequence Spread Spectrum (DSSS) and Frequency Hopping Spread Spectrum (FHSS)
by: N. A., Handrizal, et al.
Published: (2009) -
Dynamic spectrum allocation scheme for heterogeneous network
by: Hasan, Mohammad Kamrul, et al.
Published: (2017) -
Assessment of dynamic spectrum allocation technique in
heterogeneous network
by: Ismail, Ahmad Fadzil, et al.
Published: (2017) -
Time-Varying Channel Tracking for Amplify-and-Forward Relay Network in High Doppler Spread
by: Rabbi, M. F., et al.
Published: (2017) -
Dynamic traffic light sequence algorithm using RFID
by: Al-Khateeb, Khalid A. Saeed, et al.
Published: (2011)