Channel assignments using constrained greedy algorithm, T-coloring and simulated annealing in mesh and cellular networks
Channel assignment is an important step in communication networks. The objectives of minimizing networks interference and the channels used are the problems in the channel assignments of the networks. In real environments, some difference will be expected in the performance of the networks when the...
Saved in:
Main Author: | Salahudin, Nur Atikah |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/86203/1/NurAtikahSalahudinPFS2018.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Optimal channel assignment for multi-hop wimax mesh networks
by: Haleem, Ahmed Shain
Published: (2016) -
An enhanced simulated annealing approach for cylindrical, rectangular mesh, and semi-diagonal torus network topologies
by: Adzhar, Noraziah
Published: (2015) -
Channel assignment and congestion control in multi-radio multi-channel wireless mesh networks
by: Musaddiq, Arslan
Published: (2015) -
Channel assignment for throughput improvement in multi-rate multi-channel wireless mesh networks
by: Yip, Sook Chin
Published: (2011) -
Channel assignment and optimal path selection for cognitive radio wireless mesh networks
by: Maqbool, Wajahat
Published: (2021)