Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In this work,  study the problem of scheduling a maximal set of transmitters subjected to an interference constraint across all the nodes. Given a set of nodes, the problem reduces to finding the maximum cardinality of a subset of nodes that can concurrently transmit without violating interference constraints. The resulting packing problem is a binary optimization problem and is NP hard.  propose a semi-definite relaxation (SDR) for this problem and provide bounds on the relaxation.
['Rakshith Jagannath', 'Radha Krishna Ganti', 'N. S. Upadhye']
I am writing a research paper on a idea Maximal Packing with Interference Constraints
[{"from": "human", "value": "I am writing a research paper on a idea Maximal Packing with Interference Constraints"}, {"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,  study the problem of scheduling a maximal set of transmitters subjected to an interference constraint across all the nodes. Given a set of nodes, the problem reduces to finding the maximum cardinality of a subset of nodes that can concurrently transmit without violating interference constraints. The resulting packing problem is a binary optimization problem and is NP hard.  propose a semi-definite relaxation (SDR) for this problem and provide bounds on the relaxation."}]