Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Paging schemes for wireless systems have been ll studied in the literature. Hover, most schemes are considered on per user basis. In these schemes, when an incoming call arrives at a mobile terminal (MT), a paging request (PR) is put in a queue. PRs are served in an FIFO manner. When a PR is served, a search process is carried out to find the corresponding MT in a location area (LA). Most schemes study how to achieve a better performance in terms of cost with/without delay constraints per PR, and totally ignore other PRs in the queue until the MT is found or all the cells in the LA have been paged. ,  propose a non-blocking pipeline probability paging scheme, which assumes known knowledge on location probabilities of individual MTs, under a paging delay constraint, where the location probability of an MT in a cell is the probability that the MT is in the cell. The proposed scheme is independent of the number of PRs in the queue and the arrival rate of PRs. Our study shows that the proposed scheme outperforms both the sequential probability paging scheme with known knowledge on location probabilities of individual MTs and the blanket paging scheme in terms of discovery rate and the total delay. Finally,  study several optimization problems with quality of service constraint for the pipeline probability paging scheme.
['Yang Xiao', 'Hui Chen', 'Mohsen Guizani']
I am writing a research paper on a idea Non-Blocking Pipeline Paging with Known Location Probabilities for Wireless Systems
[{"from": "human", "value": "I am writing a research paper on a idea Non-Blocking Pipeline Paging with Known Location Probabilities for Wireless Systems"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Paging schemes for wireless systems have been ll studied in the literature. Hover, most schemes are considered on per user basis. In these schemes, when an incoming call arrives at a mobile terminal (MT), a paging request (PR) is put in a queue. PRs are served in an FIFO manner. When a PR is served, a search process is carried out to find the corresponding MT in a location area (LA). Most schemes study how to achieve a better performance in terms of cost with/without delay constraints per PR, and totally ignore other PRs in the queue until the MT is found or all the cells in the LA have been paged. ,  propose a non-blocking pipeline probability paging scheme, which assumes known knowledge on location probabilities of individual MTs, under a paging delay constraint, where the location probability of an MT in a cell is the probability that the MT is in the cell. The proposed scheme is independent of the number of PRs in the queue and the arrival rate of PRs. Our study shows that the proposed scheme outperforms both the sequential probability paging scheme with known knowledge on location probabilities of individual MTs and the blanket paging scheme in terms of discovery rate and the total delay. Finally,  study several optimization problems with quality of service constraint for the pipeline probability paging scheme."}]