File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: Fixed channel assignment optimization for cellular mobile networks
Title | Fixed channel assignment optimization for cellular mobile networks |
---|---|
Authors | |
Keywords | Cell re-ordering Fixed channel assignment Heuristics, hotspot |
Issue Date | 2000 |
Publisher | Oxford University Press. The Journal's web site is located at http://ietcom.oxfordjournals.org/ |
Citation | Ieice Transactions On Communications, 2000, v. E83-B n. 8, p. 1783-1791 How to Cite? |
Abstract | The optimization of channel assignment in cellular mobile networks is an NP-complete combinatorial optimization problem. For any reasonable size network, only sub-optimal solutions can be obtained by heuristic algorithms. In this paper, six channel assignment heuristic algorithms are proposed and evaluated. They are the combinations of three channel assignment strategies and two cell ordering methods. What we found are (i) the node-color ordering of cells is a more efficient ordering method than the node-degree ordering; (ii) the frequency exhaustive strategy is more suitable for systems with highly non-uniformly distributed traffic, and the requirement exhaustive strategy is more suitable for systems with less nonuniformly distributed traffic; and (iii) the combined frequency and requirement exhaustive strategy with node-color re-ordering is the most efficient algorithm. The frequency spans obtained using the proposed algorithms are much lower than that reported in the literature, and in many cases are equal to the theoretical lower bounds. |
Persistent Identifier | http://hdl.handle.net/10722/73999 |
ISSN | 2023 Impact Factor: 0.7 2023 SCImago Journal Rankings: 0.246 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yeung, KL | en_HK |
dc.contributor.author | Yum, TSP | en_HK |
dc.date.accessioned | 2010-09-06T06:56:49Z | - |
dc.date.available | 2010-09-06T06:56:49Z | - |
dc.date.issued | 2000 | en_HK |
dc.identifier.citation | Ieice Transactions On Communications, 2000, v. E83-B n. 8, p. 1783-1791 | en_HK |
dc.identifier.issn | 0916-8516 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/73999 | - |
dc.description.abstract | The optimization of channel assignment in cellular mobile networks is an NP-complete combinatorial optimization problem. For any reasonable size network, only sub-optimal solutions can be obtained by heuristic algorithms. In this paper, six channel assignment heuristic algorithms are proposed and evaluated. They are the combinations of three channel assignment strategies and two cell ordering methods. What we found are (i) the node-color ordering of cells is a more efficient ordering method than the node-degree ordering; (ii) the frequency exhaustive strategy is more suitable for systems with highly non-uniformly distributed traffic, and the requirement exhaustive strategy is more suitable for systems with less nonuniformly distributed traffic; and (iii) the combined frequency and requirement exhaustive strategy with node-color re-ordering is the most efficient algorithm. The frequency spans obtained using the proposed algorithms are much lower than that reported in the literature, and in many cases are equal to the theoretical lower bounds. | en_HK |
dc.language | eng | en_HK |
dc.publisher | Oxford University Press. The Journal's web site is located at http://ietcom.oxfordjournals.org/ | en_HK |
dc.relation.ispartof | IEICE Transactions on Communications | en_HK |
dc.subject | Cell re-ordering | en_HK |
dc.subject | Fixed channel assignment | en_HK |
dc.subject | Heuristics, hotspot | en_HK |
dc.title | Fixed channel assignment optimization for cellular mobile networks | en_HK |
dc.type | Article | en_HK |
dc.identifier.email | Yeung, KL:kyeung@eee.hku.hk | en_HK |
dc.identifier.authority | Yeung, KL=rp00204 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.scopus | eid_2-s2.0-0034250601 | en_HK |
dc.identifier.hkuros | 61628 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-0034250601&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | E83-B | en_HK |
dc.identifier.issue | 8 | en_HK |
dc.identifier.spage | 1783 | en_HK |
dc.identifier.epage | 1791 | en_HK |
dc.publisher.place | United Kingdom | en_HK |
dc.identifier.scopusauthorid | Yeung, KL=7202424908 | en_HK |
dc.identifier.scopusauthorid | Yum, TSP=36949354100 | en_HK |
dc.identifier.issnl | 0916-8516 | - |