File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Online call control in cellular networks revisited

TitleOnline call control in cellular networks revisited
Authors
KeywordsAsymptotic performance
Call control
Cellular network
Hybrid algorithms
On-line algorithms
Issue Date2012
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/ipl
Citation
Information Processing Letters, 2012, v. 112 n. 1-2, p. 21-25 How to Cite?
AbstractWireless communication networks based on frequency division multiplexing (FDM in short) play an important role in the field of communications, in which each request can be satisfied by assigning a frequency. To avoid interference, each assigned frequency must be different from the neighboring assigned frequencies. Since frequencies are scarce resources, the main problem in wireless networks is how to fully utilize the given bandwidth of frequencies. In this paper, we consider the online call control problem. Given a fixed bandwidth of frequencies and a sequence of communication requests arriving over time, each request must be either satisfied immediately after its arrival by assigning an available frequency, or rejected. The objective of the call control problem is to maximize the number of accepted requests. We study the asymptotic performance of this problem, i.e., the number of requests in the sequence and the bandwidth of frequencies are very large. In this paper, we give a 7/3-competitive algorithm, say CACO, for the call control problem in cellular networks, improving the previous 2.5-competitive result, and show that CACO is best possible among a class of HYBRID algorithms. © 2011 Elsevier B.V. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/152471
ISSN
2023 Impact Factor: 0.7
2023 SCImago Journal Rankings: 0.404
ISI Accession Number ID
Funding AgencyGrant Number
NSFC11171086
11101065
HK RGCHKU-7117/09E
HKU-7171/08E
Funding Information:

Research supported by NSFC (11171086).

References

 

DC FieldValueLanguage
dc.contributor.authorZhang, Yen_US
dc.contributor.authorChin, FYLen_US
dc.contributor.authorTing, HFen_US
dc.contributor.authorChan, JWTen_US
dc.contributor.authorHan, Xen_US
dc.contributor.authorLam, KCen_US
dc.date.accessioned2012-06-26T06:39:28Z-
dc.date.available2012-06-26T06:39:28Z-
dc.date.issued2012en_US
dc.identifier.citationInformation Processing Letters, 2012, v. 112 n. 1-2, p. 21-25en_US
dc.identifier.issn0020-0190en_US
dc.identifier.urihttp://hdl.handle.net/10722/152471-
dc.description.abstractWireless communication networks based on frequency division multiplexing (FDM in short) play an important role in the field of communications, in which each request can be satisfied by assigning a frequency. To avoid interference, each assigned frequency must be different from the neighboring assigned frequencies. Since frequencies are scarce resources, the main problem in wireless networks is how to fully utilize the given bandwidth of frequencies. In this paper, we consider the online call control problem. Given a fixed bandwidth of frequencies and a sequence of communication requests arriving over time, each request must be either satisfied immediately after its arrival by assigning an available frequency, or rejected. The objective of the call control problem is to maximize the number of accepted requests. We study the asymptotic performance of this problem, i.e., the number of requests in the sequence and the bandwidth of frequencies are very large. In this paper, we give a 7/3-competitive algorithm, say CACO, for the call control problem in cellular networks, improving the previous 2.5-competitive result, and show that CACO is best possible among a class of HYBRID algorithms. © 2011 Elsevier B.V. All rights reserved.en_US
dc.languageengen_US
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/iplen_US
dc.relation.ispartofInformation Processing Lettersen_US
dc.subjectAsymptotic performanceen_US
dc.subjectCall controlen_US
dc.subjectCellular networken_US
dc.subjectHybrid algorithms-
dc.subjectOn-line algorithms-
dc.titleOnline call control in cellular networks revisiteden_US
dc.typeArticleen_US
dc.identifier.emailZhang, Y: yzhang@cs.hku.hken_US
dc.identifier.emailChin, FYL: chin@cs.hku.hken_US
dc.identifier.emailTing, HF: hfting@cs.hku.hk-
dc.identifier.emailChan, JWT: cswtchan@gmail.com-
dc.identifier.emailHan, X: hanxin.mail@gmail.com-
dc.identifier.emailLam, KC: pandaman@163.com-
dc.identifier.authorityChin, FYL=rp00105en_US
dc.identifier.authorityTing, HF=rp00177en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1016/j.ipl.2011.10.005en_US
dc.identifier.scopuseid_2-s2.0-80054052545en_US
dc.identifier.hkuros208025-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-80054052545&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume112en_US
dc.identifier.issue1-2en_US
dc.identifier.spage21en_US
dc.identifier.epage25en_US
dc.identifier.isiWOS:000298209700005-
dc.publisher.placeNetherlandsen_US
dc.identifier.scopusauthoridLam, KC=36439880500en_US
dc.identifier.scopusauthoridHan, X=34872071800en_US
dc.identifier.scopusauthoridChan, JWT=16021445200en_US
dc.identifier.scopusauthoridTing, HF=7005654198en_US
dc.identifier.scopusauthoridChin, FYL=7005101915en_US
dc.identifier.scopusauthoridZhang, Y=35114314500en_US
dc.identifier.citeulike9909122-
dc.identifier.issnl0020-0190-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats