Contention based scheduling for femtocell access points in a densely deployed network environment

Title
Contention based scheduling for femtocell access points in a densely deployed network environment
Author(s)
최진구윤정균[윤정균]윤성국[윤성국]박세웅[박세웅]
Keywords
HETEROGENEOUS NETWORKS; MANAGEMENT
Issue Date
201203
Publisher
ELSEVIER SCIENCE BV
Citation
COMPUTER NETWORKS, v.56, no.4, pp.1236 - 1248
Abstract
The proliferation of new data intensive devices has caused an enormous burden on wireless systems. A femtocell network is a promising new technology developed to meet these demands. Since each femtocell network consists of uncoordinated subnetworks that work independently, the interference between subnetworks can result in a significant degradation of the overall network capacity. In this paper, we address the interference problem between uncoordinated femtocell access points (FAPs) and propose a distributed FAP scheduling scheme in a densely deployed femtocell network where FAPs interfere with each other. In contrast to previous works that have focused on dynamic power and frequency management, our approach focuses on time sharing through FAP contention. Depending on the outcome of contention, our method selects a winning FAP to be the sole user of the next time frame. The approach operates in a fully distributed manner with help from mobile nodes (MNs). To implement this scheme, we develop a new synchronous frame structure, which uses special common control channels. Through simulations, we observe that the proposed scheme doubles the network capacity compared to the legacy non-contending scheme, and could serve as the basis for future standards on femtocell networks. (C) 2011 Elsevier B.V. All rights reserved.
URI
http://hdl.handle.net/YU.REPOSITORY/29646http://dx.doi.org/10.1016/j.comnet.2011.12.003
ISSN
1389-1286
Appears in Collections:
공과대학 > 모바일정보통신공학과 > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE