×

A decentralized heuristic approach towards resource allocation in femtocell networks. (English) Zbl 1422.91393

Summary: Femtocells represent a novel configuration for existing cellular communication, contributing towards the improvement of coverage and throughput. The dense deployment of these femtocells causes significant femto-macro and femto-femto interference, consequently deteriorating the throughput of femtocells. In this study, we compare two heuristic approaches, i.e., particle swarm optimization (PSO) and genetic algorithm (GA), for joint power assignment and resource allocation, within the context of the femtocell environment. The supposition made in this joint optimization is that the discrete power levels are available for the assignment. Furthermore, we have employed two variants of each PSO and GA: inertia weight and constriction factor model for PSO, and twopoint and uniform crossover for GA. The two proposed algorithms are in a decentralized manner, with no involvement of any centralized entity. The comparison is carried out between the two proposed algorithms for the aforementioned joint optimization problem. The contrast includes the performance metrics: including average objective function, min-max throughput of the femtocells, average throughput of the femto users, outage rate and time complexity. The results demonstrate that the decentralized PSO constriction factor outperforms the others in terms of the aforementioned performance metrics.

MSC:

91B32 Resource and cost allocation (including fair division, apportionment, etc.)
68M12 Network protocols
90C59 Approximation methods and heuristics in mathematical programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[2] DOI: 10.1109/MCOM.2008.4623708 · doi:10.1109/MCOM.2008.4623708
[3] Femtocell-based network enhancement by interference management and coordination of information for seamless connectivityhttp://www.ict-freedom.eu/
[4] DOI: 10.1109/MWC.2012.6231163 · doi:10.1109/MWC.2012.6231163
[5] DOI: 10.1109/MCOM.2013.6461192 · doi:10.1109/MCOM.2013.6461192
[6] DOI: 10.1016/j.jnca.2012.04.021 · doi:10.1016/j.jnca.2012.04.021
[7] DOI: 10.1109/TWC.2009.081386 · doi:10.1109/TWC.2009.081386
[8] DOI: 10.1109/4235.735432 · Zbl 05452126 · doi:10.1109/4235.735432
[10] DOI: 10.1109/TSMCA.2005.859094 · doi:10.1109/TSMCA.2005.859094
[11] </b>Basso, Optimal resource allocation with minimum activation levels and fixed costs, Eur. J. Oper. Res. 131 pp 536– (2001) · Zbl 1161.91423 · doi:10.1016/S0377-2217(00)00093-X
[12] Ibaraki, Resource Allocation Problems: Algorithms Approaches (1988) · Zbl 0786.90067
[13] DOI: 10.4018/jamc.2012040102 · doi:10.4018/jamc.2012040102
[14] DOI: 10.1186/1687-1499-2012-349 · doi:10.1186/1687-1499-2012-349
[23] DOI: 10.3390/s90705339 · doi:10.3390/s90705339
[25] DOI: 10.1016/j.eswa.2010.12.064 · doi:10.1016/j.eswa.2010.12.064
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.