Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  consider the problem of association of wireless stations (STAs) with an access network served by a wireless local area network (WLAN) and a 3G cellular network. There is a set of WLAN Access Points (APs) and a set of 3G Base Stations (BSs) and a number of STAs each of which needs to be associated with one of the APs or one of the BSs.  concentrate on downlink bulk elastic transfers. Each association provides each ST with a certain transfer rate.  evaluate an association on the basis of the sum log utility of the transfer rates and seek the utility maximizing association.  also obtain the optimal time scheduling of service from a 3G BS to the associated STAs.  propose a fast iterative heuristic algorithm to compute an association. Numerical results show that our algorithm converges in a few steps yielding an association that is within 1% (in objective value) of the optimal (obtained through exhaustive search); in most cases the algorithm yields an optimal solution.
['K. Premkumar', 'Anurag Kumar']
I am writing a research paper on a idea Optimum Association of Mobile Wireless Devices with a WLAN-3G Access Network
[{"from": "human", "value": "I am writing a research paper on a idea Optimum Association of Mobile Wireless Devices with a WLAN-3G Access Network"}, {"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 association of wireless stations (STAs) with an access network served by a wireless local area network (WLAN) and a 3G cellular network. There is a set of WLAN Access Points (APs) and a set of 3G Base Stations (BSs) and a number of STAs each of which needs to be associated with one of the APs or one of the BSs.  concentrate on downlink bulk elastic transfers. Each association provides each ST with a certain transfer rate.  evaluate an association on the basis of the sum log utility of the transfer rates and seek the utility maximizing association.  also obtain the optimal time scheduling of service from a 3G BS to the associated STAs.  propose a fast iterative heuristic algorithm to compute an association. Numerical results show that our algorithm converges in a few steps yielding an association that is within 1% (in objective value) of the optimal (obtained through exhaustive search); in most cases the algorithm yields an optimal solution."}]