Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In this work,  consider the goal of scheduling the maximum number of voice calls in a TDMA-based multi-radio, multi-channel mesh network. One of the main challenges to achieve this goal is the difficulty in providing strict (packet-level) delay guarantees for voice traffic in capacity limited multi-hop wireless networks. In this context,  propose DelayCheck, an online centralized scheduling and call-admission-control (CAC) algorithm which effectively schedules constant-bit-rate voice traffic in TDMA-based mesh networks. DelayCheck solves the joint routing, channel assignment and link scheduling problem while satisfying the constraint.  formulate an offline version of this scheduling problem as an Integer Linear Program (ILP), the LP relaxation of which gives us an optimality upper bound.  compare the output of DelayCheck with the LP-based upper bound as ll as with two state-of-the-art prior scheduling algorithms. DelayCheck performs remarkably ll, accepting about 93% of voice calls as compared to LP-based upper bound. As compared to state-of-the-art algorithms, DelayCheck improves scheduler efficiency by more than 34% and reduces call rejections by 2 fold.  also demonstrate that DelayCheck efficiently exploits the number of channels available for scheduling. With implementation optimizations,  show that DelayCheck has low memory and CPU requirements, thus making it practical.
['Vijay Gabale', 'Ashish Chiplunkar', 'Bhaskaran Raman', 'Partha Dutta']
I am writing a research paper on a idea DelayCheck: Scheduling voice over multi-hop multi-channel wireless mesh networks
[{"from": "human", "value": "I am writing a research paper on a idea DelayCheck: Scheduling voice over multi-hop multi-channel wireless mesh networks"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In this work,  consider the goal of scheduling the maximum number of voice calls in a TDMA-based multi-radio, multi-channel mesh network. One of the main challenges to achieve this goal is the difficulty in providing strict (packet-level) delay guarantees for voice traffic in capacity limited multi-hop wireless networks. In this context,  propose DelayCheck, an online centralized scheduling and call-admission-control (CAC) algorithm which effectively schedules constant-bit-rate voice traffic in TDMA-based mesh networks. DelayCheck solves the joint routing, channel assignment and link scheduling problem while satisfying the constraint.  formulate an offline version of this scheduling problem as an Integer Linear Program (ILP), the LP relaxation of which gives us an optimality upper bound.  compare the output of DelayCheck with the LP-based upper bound as ll as with two state-of-the-art prior scheduling algorithms. DelayCheck performs remarkably ll, accepting about 93% of voice calls as compared to LP-based upper bound. As compared to state-of-the-art algorithms, DelayCheck improves scheduler efficiency by more than 34% and reduces call rejections by 2 fold.  also demonstrate that DelayCheck efficiently exploits the number of channels available for scheduling. With implementation optimizations,  show that DelayCheck has low memory and CPU requirements, thus making it practical."}]