Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: , priority-aware scheduling to the coexistence of multiple wireless body area networks (WBANs) is addressed. The scheduling is formulated as a nonlinear optimization problem where the objective is to maximize system throughput while guaranteeing the priorities among WBANs. To overcome the inherent complexity issue, a new method, called recursive decomposition algorithm (RDA), is proposed to solve the original nonlinear problem by decomposing it into several linear subproblems. Each subproblem is then solved by a column generation method in order to avoid the large number of variables. Since the pricing problem in the column generation method is a 0–1 integer programming which is known to be NP-complete, a heuristic ight-greedy algorithm with a much lor time complexity is proposed. The simulation results show that the proposed RDA can effectively guarantee the priorities among WBANs and can obtain near-optimal throughput performance even in the extremely high user density region.
['Shiwei Huang', 'Jun Cai']
I am writing a research paper on a idea Priority-aware scheduling for coexisting wireless body area networks (invited paper)
[{"from": "human", "value": "I am writing a research paper on a idea Priority-aware scheduling for coexisting wireless body area networks (invited paper)"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: , priority-aware scheduling to the coexistence of multiple wireless body area networks (WBANs) is addressed. The scheduling is formulated as a nonlinear optimization problem where the objective is to maximize system throughput while guaranteeing the priorities among WBANs. To overcome the inherent complexity issue, a new method, called recursive decomposition algorithm (RDA), is proposed to solve the original nonlinear problem by decomposing it into several linear subproblems. Each subproblem is then solved by a column generation method in order to avoid the large number of variables. Since the pricing problem in the column generation method is a 0\u20131 integer programming which is known to be NP-complete, a heuristic ight-greedy algorithm with a much lor time complexity is proposed. The simulation results show that the proposed RDA can effectively guarantee the priorities among WBANs and can obtain near-optimal throughput performance even in the extremely high user density region."}]