Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:   study the mobile removal problem in a cellular PCS network where transmitter pors are constrained and controlled by a distributed constrained por control (DCPC) algorithm. Due to transmitter mobility and random signal propagation, there are system states where not all transmitters can be supported, even under the optimal por control. Thus, some of them should be removed. It can be shown that finding the optimal removal set is an NP-complete problem, and therefore gives rise to heuristic algorithms.   study and compare among three classes of transmitter removal algorithms, one-by-one removals, multiple removals and por control with removals combined. All removal algorithms are compared with respect to their outage probabilities and their time to convergence to a steady state. The por control with removals combined algorithm emerges as the best approach with respect to both criteria.
['Michael Andersin', 'Zvi Rosberg', 'Jens Zander']
I am writing a research paper on a idea Gradual removals in cellular PCS with constrained power control and noise
[{"from": "human", "value": "I am writing a research paper on a idea Gradual removals in cellular PCS with constrained power control and noise"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:   study the mobile removal problem in a cellular PCS network where transmitter pors are constrained and controlled by a distributed constrained por control (DCPC) algorithm. Due to transmitter mobility and random signal propagation, there are system states where not all transmitters can be supported, even under the optimal por control. Thus, some of them should be removed. It can be shown that finding the optimal removal set is an NP-complete problem, and therefore gives rise to heuristic algorithms.   study and compare among three classes of transmitter removal algorithms, one-by-one removals, multiple removals and por control with removals combined. All removal algorithms are compared with respect to their outage probabilities and their time to convergence to a steady state. The por control with removals combined algorithm emerges as the best approach with respect to both criteria."}]