IDEAS home Printed from https://ideas.repec.org/a/gvu/tcsst0/v2y2020i4id1968.html

An Efficient Cell Selection Approach in 4G Networks

Author

Listed:
  • Abul Bashar

Abstract

The cell selection mechanism that provides services to each mobile station is referred to as cell selection. For maximizing the current and future of cellular networks, it is necessary to optimize the process. The OFDMA-based systems are LTE-Advanced and IEEE 802.16m for satisfying the mobile station minimum demand by having one or more base station simultaneously. The problem is considered as the optimization problem and defines the problem as it is not considered as NP-hard and also not possible for approximation with a reasonable factor. The assumption is that the maximum required bandwidth of a single mobile station is defined as the r-fraction of the capacity of the base station. For cell selection, this paper consists of two algorithms. The first algorithm defines the creation of a (1-r) approximate solution, this is applicable when the coverage of the mobile station is done by one or more base station simultaneously. The second algorithm defines the creation of an approximate solution (1-r /2-r) when the coverage of each mobile station is covered by a maximum one base station. A simulation research that describes the benefit of using our algorithms that have limited and high-loaded power for the future of 4G networks completes the overall study. The performance and capacity are better than the existing algorithms.

Suggested Citation

Handle: RePEc:gvu:tcsst0:v:2:y:2020:i:4:id:1968
DOI: 10.36548/jtcsst.2020.4.003
as

Download full text from publisher

File URL: https://irojournals.com/tcsst/article/view/1968
File Function: Abstract page
Download Restriction: no

File URL: https://irojournals.com/tcsst/article/download/1968/1789
File Function: Full text
Download Restriction: no

File URL: https://libkey.io/10.36548/jtcsst.2020.4.003?utm_source=ideas
LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
---><---

More about this item

Keywords

;
;
;
;
;

Statistics

Access and download statistics

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gvu:tcsst0:v:2:y:2020:i:4:id:1968. See general information about how to correct material in RePEc.

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

We have no bibliographic references for this item. You can help adding them by using this form .

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Manager (email available below). General contact details of provider: https://irojournals.com/tcsst .

Please note that corrections may take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.