Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  consider the problem of random access in wireless local area networks (WLANs) with each station generating either elastic or inelastic traffic. Elastic traffic is usually non-real-time, while inelastic traffic is usually coming from real-time applications.  formulate a network utility maximization (NUM) problem, where the optimization variables are the persistent probabilities of the stations and the utilities are either concave or sigmoidal functions. Sigmoidal utility functions can better represent inelastic traffic sources compared to concave utility functions commonly used in the existing random access literature. Hover, they lead to non-convex NUM problems which are not easy to solve in general. By applying the dual decomposition method,  propose a subgradient algorithm to solve the formulated NUM problem.  also develop closed-form solutions for the dual subproblems involving sigmoidal functions that have to be solved in each iteration of the proposed algorithm. Furthermore,  obtain a sufficient condition on the link capacities which guarantees achieving the global optimal solution when our proposed algorithm is being used. If this condition is not satisfied, then  can still guarantee that the optimal value of the objective function is within some lor and upper bounds.  perform various simulations to validate our analytical models when the available link capacities meet or do not meet the sufficient optimality condition.
['Man Hon Cheung', 'Amir-Hamed Mohsenian-Rad', 'Vincent W. S. Wong', 'Robert Schober']
I am writing a research paper on a idea Random access for elastic and inelastic traffic in WLANs
[{"from": "human", "value": "I am writing a research paper on a idea Random access for elastic and inelastic traffic in WLANs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  consider the problem of random access in wireless local area networks (WLANs) with each station generating either elastic or inelastic traffic. Elastic traffic is usually non-real-time, while inelastic traffic is usually coming from real-time applications.  formulate a network utility maximization (NUM) problem, where the optimization variables are the persistent probabilities of the stations and the utilities are either concave or sigmoidal functions. Sigmoidal utility functions can better represent inelastic traffic sources compared to concave utility functions commonly used in the existing random access literature. Hover, they lead to non-convex NUM problems which are not easy to solve in general. By applying the dual decomposition method,  propose a subgradient algorithm to solve the formulated NUM problem.  also develop closed-form solutions for the dual subproblems involving sigmoidal functions that have to be solved in each iteration of the proposed algorithm. Furthermore,  obtain a sufficient condition on the link capacities which guarantees achieving the global optimal solution when our proposed algorithm is being used. If this condition is not satisfied, then  can still guarantee that the optimal value of the objective function is within some lor and upper bounds.  perform various simulations to validate our analytical models when the available link capacities meet or do not meet the sufficient optimality condition."}]