Back to Search Start Over

Fast Algorithm for Solving Cave-Filling Problems

Authors :
Mohammed Zafar Ali Khan
Kalpana Naidu
Source :
VTC Fall
Publication Year :
2016
Publisher :
IEEE, 2016.

Abstract

In this paper, a novel approach for solving the `Water- filling problem with peak power constraints for individual resources' also known as Cave-Filling Problem (CFP) is proposed. The proposed algorithm calculates a lower bound for the number of resources that are assigned positive powers, K, and then calculates the K powers only once. This lowers the total computational cost of the proposed algorithm significantly. Simulation results validate the proposed algorithm.

Subjects

Subjects :
Mathematical optimization
0203 mechanical engineering
Computational complexity theory
Computer science
0202 electrical engineering, electronic engineering, information engineering
020206 networking & telecommunications
020302 automobile design & engineering
Resource management
02 engineering and technology
Upper and lower bounds
Fast algorithm
Power (physics)

Details

Database :
OpenAIRE
Journal :
2016 IEEE 84th Vehicular Technology Conference (VTC-Fall)
Accession number :
edsair.doi...........47d96484d27d13abdebe1d5c9696e432

Tools

Authors Abstract Subjects Details