Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Wireless networks are increasingly used to carry applications with QoS constraints. Two problems arise when dealing with traffic with QoS constraints. One is admission control, which consists of determining whether it is possible to fulfill the demands of a set of clients. The other is finding an optimal scheduling policy to meet the demands of all clients. ,  propose a framework for jointly addressing three QoS criteria: delay, delivery ratio, and channel reliability.  analytically prove the necessary and sufficient con- dition for a set of clients to be feasible with respect to the above three criteria.  then establish an efficient algorithm for admission control to decide whether a set of clients is feasible.  further propose two scheduling policies and prove that they are feasibility optimal in the sense that they can meet the demands of every feasible set of clients. In addition,  show that these policies are easily implementable on the IEEE 802.11 mechanisms.  also present the results of simulation studies that appear to confirm the theoretical studies and suggest that the proposed policies outperform others tested under a variety of settings. devices, are accessing the same unlicensed channel as wireless networks, packet loss can no longer be neglected.  provide an analytical framework for addressing QoS constraints in wireless networks that allows the incorpora- tion of three criteria with each flow: delay, delivery ratio, and channel reliability.  first identify a necessary con- dition for a set of flows to be feasible with respect to the above three QoS criteria. Next, two dynamic scheduling policies for these applications are proposed.  prove that the proposed policies can meet the demand of every set of flows that satisfies the identified necessary condition. Thus,  not only show that the necessary condition is indeed sufficient, but  also prove our proposed policies are optimal. Finally, while the necessary and sufficient condition involves exponentially many inequalities to be checked,  show that those criteria can be simplified into linearly many tests.  thus obtain an efficient admission control algorithm for flows with QoS. Our contribution is therefore threefold. First  pro- pose a mathematical framework for QoS for handling deadlines, delivery ratios and channel unreliability. Sec- ond, the linear time algorithm makes admission control computationally efficient. Third, the simple nature of the policies proved to be feasibility optimal shows that scheduling for QoS is tractable and feasible at run time. In addition to the theoretical results,  also evaluate the proposed policies by simulation.  implement the two policies by widely-used IEEE 802.11 mechanisms.  compare the two policies against the IEEE 802.11 Dis- tributed Coordination Function (DCF) and a server-centric scheduler that gives equal transmission opportunities to all clients. Simulation results suggest that the proposed policies offer much better service than the two compared mechanisms.
['I-Hong Hou', 'Vivek S. Borkar', 'P. Kumar']
I am writing a research paper on a idea A Theory of QoS for Wireless
[{"from": "human", "value": "I am writing a research paper on a idea A Theory of QoS for Wireless"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Wireless networks are increasingly used to carry applications with QoS constraints. Two problems arise when dealing with traffic with QoS constraints. One is admission control, which consists of determining whether it is possible to fulfill the demands of a set of clients. The other is finding an optimal scheduling policy to meet the demands of all clients. ,  propose a framework for jointly addressing three QoS criteria: delay, delivery ratio, and channel reliability.  analytically prove the necessary and sufficient con- dition for a set of clients to be feasible with respect to the above three criteria.  then establish an efficient algorithm for admission control to decide whether a set of clients is feasible.  further propose two scheduling policies and prove that they are feasibility optimal in the sense that they can meet the demands of every feasible set of clients. In addition,  show that these policies are easily implementable on the IEEE 802.11 mechanisms.  also present the results of simulation studies that appear to confirm the theoretical studies and suggest that the proposed policies outperform others tested under a variety of settings. devices, are accessing the same unlicensed channel as wireless networks, packet loss can no longer be neglected.  provide an analytical framework for addressing QoS constraints in wireless networks that allows the incorpora- tion of three criteria with each flow: delay, delivery ratio, and channel reliability.  first identify a necessary con- dition for a set of flows to be feasible with respect to the above three QoS criteria. Next, two dynamic scheduling policies for these applications are proposed.  prove that the proposed policies can meet the demand of every set of flows that satisfies the identified necessary condition. Thus,  not only show that the necessary condition is indeed sufficient, but  also prove our proposed policies are optimal. Finally, while the necessary and sufficient condition involves exponentially many inequalities to be checked,  show that those criteria can be simplified into linearly many tests.  thus obtain an efficient admission control algorithm for flows with QoS. Our contribution is therefore threefold. First  pro- pose a mathematical framework for QoS for handling deadlines, delivery ratios and channel unreliability. Sec- ond, the linear time algorithm makes admission control computationally efficient. Third, the simple nature of the policies proved to be feasibility optimal shows that scheduling for QoS is tractable and feasible at run time. In addition to the theoretical results,  also evaluate the proposed policies by simulation.  implement the two policies by widely-used IEEE 802.11 mechanisms.  compare the two policies against the IEEE 802.11 Dis- tributed Coordination Function (DCF) and a server-centric scheduler that gives equal transmission opportunities to all clients. Simulation results suggest that the proposed policies offer much better service than the two compared mechanisms."}]