File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/978-3-642-14553-7_22
- Scopus: eid_2-s2.0-77955872768
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Deterministic online call control in cellular networks and triangle-free cellular networks
Title | Deterministic online call control in cellular networks and triangle-free cellular networks |
---|---|
Authors | |
Keywords | Asymptotic performance Competitive algorithms Online call control Frequency division multiplexing Wireless telecommunication systems |
Issue Date | 2010 |
Publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ |
Citation | The 4th International Frontiers of Algorithmics Workshop (FAW 2010), Wuhan, China, 11-13 August 2010. In Lecture Notes in Computer Science, 2010, v. 6213, p. 222–233 How to Cite? |
Abstract | Wireless Communication Networks based on Frequency Division Multiplexing (FDM in short) plays 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 to the neighboring assigned frequencies. Since frequency is a scarce resource, the main problem in wireless networks is how to utilize the frequency as fully as possible. In this paper, we consider the call control problem. Given a fixed bandwidth of frequencies and a sequence of communication requests, in handling each request, we must immediately choose an available frequency to accept (or reject) it. The objective of call control problem is to maximize the number of accepted requests. We study the asymptotic performance, i.e., the number of requests in the sequence and the number of available frequencies are very large positive integers. In this paper, we give a 7/3-competitive algorithm for call control problem in cellular network, improving the previous 2.5-competitive result. Moreover, we investigate the triangle-free cellular network, propose a 9/4-competitive algorithm and prove that the lower bound of competitive ratio is at least 5/3. © 2010 Springer-Verlag Berlin Heidelberg. |
Description | LNCS v. 6213 is the conference proceedings of FAW 2010 |
Persistent Identifier | http://hdl.handle.net/10722/129572 |
ISSN | 2023 SCImago Journal Rankings: 0.606 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chan, JWT | en_HK |
dc.contributor.author | Chin, FYL | en_HK |
dc.contributor.author | Han, X | en_HK |
dc.contributor.author | Lam, KC | en_HK |
dc.contributor.author | Ting, HF | en_HK |
dc.contributor.author | Zhang, Y | en_HK |
dc.date.accessioned | 2010-12-23T08:39:23Z | - |
dc.date.available | 2010-12-23T08:39:23Z | - |
dc.date.issued | 2010 | en_HK |
dc.identifier.citation | The 4th International Frontiers of Algorithmics Workshop (FAW 2010), Wuhan, China, 11-13 August 2010. In Lecture Notes in Computer Science, 2010, v. 6213, p. 222–233 | en_HK |
dc.identifier.issn | 0302-9743 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/129572 | - |
dc.description | LNCS v. 6213 is the conference proceedings of FAW 2010 | - |
dc.description.abstract | Wireless Communication Networks based on Frequency Division Multiplexing (FDM in short) plays 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 to the neighboring assigned frequencies. Since frequency is a scarce resource, the main problem in wireless networks is how to utilize the frequency as fully as possible. In this paper, we consider the call control problem. Given a fixed bandwidth of frequencies and a sequence of communication requests, in handling each request, we must immediately choose an available frequency to accept (or reject) it. The objective of call control problem is to maximize the number of accepted requests. We study the asymptotic performance, i.e., the number of requests in the sequence and the number of available frequencies are very large positive integers. In this paper, we give a 7/3-competitive algorithm for call control problem in cellular network, improving the previous 2.5-competitive result. Moreover, we investigate the triangle-free cellular network, propose a 9/4-competitive algorithm and prove that the lower bound of competitive ratio is at least 5/3. © 2010 Springer-Verlag Berlin Heidelberg. | en_HK |
dc.language | eng | en_US |
dc.publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ | en_HK |
dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | en_HK |
dc.rights | The original publication is available at www.springerlink.com | - |
dc.subject | Asymptotic performance | - |
dc.subject | Competitive algorithms | - |
dc.subject | Online call control | - |
dc.subject | Frequency division multiplexing | - |
dc.subject | Wireless telecommunication systems | - |
dc.title | Deterministic online call control in cellular networks and triangle-free cellular networks | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.email | Chin, FYL:chin@cs.hku.hk | en_HK |
dc.identifier.email | Ting, HF:hfting@cs.hku.hk | en_HK |
dc.identifier.authority | Chin, FYL=rp00105 | en_HK |
dc.identifier.authority | Ting, HF=rp00177 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/978-3-642-14553-7_22 | en_HK |
dc.identifier.scopus | eid_2-s2.0-77955872768 | en_HK |
dc.identifier.hkuros | 178327 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-77955872768&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 6213 LNCS | en_HK |
dc.identifier.spage | 222 | en_HK |
dc.identifier.epage | 233 | en_HK |
dc.publisher.place | Germany | en_HK |
dc.description.other | The 4th International Frontiers of Algorithmics Workshop (FAW 2010), Wuhan, China, 11-13 August 2010. In Lecture Notes in Computer Science, 2010, v. 6213, p. 222–233 | - |
dc.identifier.scopusauthorid | Chan, JWT=16021445200 | en_HK |
dc.identifier.scopusauthorid | Chin, FYL=7005101915 | en_HK |
dc.identifier.scopusauthorid | Han, X=34872071800 | en_HK |
dc.identifier.scopusauthorid | Lam, KC=36439880500 | en_HK |
dc.identifier.scopusauthorid | Ting, HF=7005654198 | en_HK |
dc.identifier.scopusauthorid | Zhang, Y=7601329213 | en_HK |
dc.identifier.issnl | 0302-9743 | - |