File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Fixed channel assignment optimization for cellular mobile networks

TitleFixed channel assignment optimization for cellular mobile networks
Authors
KeywordsCell re-ordering
Fixed channel assignment
Heuristics, hotspot
Issue Date2000
PublisherOxford 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?
AbstractThe 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 Identifierhttp://hdl.handle.net/10722/73999
ISSN
2015 Impact Factor: 0.3
2015 SCImago Journal Rankings: 0.184
References

 

DC FieldValueLanguage
dc.contributor.authorYeung, KLen_HK
dc.contributor.authorYum, TSPen_HK
dc.date.accessioned2010-09-06T06:56:49Z-
dc.date.available2010-09-06T06:56:49Z-
dc.date.issued2000en_HK
dc.identifier.citationIeice Transactions On Communications, 2000, v. E83-B n. 8, p. 1783-1791en_HK
dc.identifier.issn0916-8516en_HK
dc.identifier.urihttp://hdl.handle.net/10722/73999-
dc.description.abstractThe 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.languageengen_HK
dc.publisherOxford University Press. The Journal's web site is located at http://ietcom.oxfordjournals.org/en_HK
dc.relation.ispartofIEICE Transactions on Communicationsen_HK
dc.subjectCell re-orderingen_HK
dc.subjectFixed channel assignmenten_HK
dc.subjectHeuristics, hotspoten_HK
dc.titleFixed channel assignment optimization for cellular mobile networksen_HK
dc.typeArticleen_HK
dc.identifier.emailYeung, KL:kyeung@eee.hku.hken_HK
dc.identifier.authorityYeung, KL=rp00204en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-0034250601en_HK
dc.identifier.hkuros61628en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0034250601&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volumeE83-Ben_HK
dc.identifier.issue8en_HK
dc.identifier.spage1783en_HK
dc.identifier.epage1791en_HK
dc.publisher.placeUnited Kingdomen_HK
dc.identifier.scopusauthoridYeung, KL=7202424908en_HK
dc.identifier.scopusauthoridYum, TSP=36949354100en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats