Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  proposes two joint routing and scheduling algorithms which minimize the data delivery latency while enhancing the energy efficiency in wireless sensor networks (WSNs). In our algorithms,  first model the network as a directed graph G init  orientating to the sink node on the basis of the location and lossy behavior of the wireless links. Next,  introduce two directed graphs G res  and G hip  taking into consideration the energy efficiency and latency, respectively. The scheduling algorithm is developed on the two graphs by solving an integer linear program (ILP) that minimizes energy consumption and mean latency in the network. Owing to the blacklist of links in the two graphs G res , G hop  with respect to G init , the computation complexity of ILP is decreased considerably. Simulation results show that our proposed algorithms are highly effective in improving network performance.
['Dang Hoa Tran', 'Dong-Sung Kim']
I am writing a research paper on a idea Minimum latency and energy efficiency routing with lossy link awareness in wireless sensor networks
[{"from": "human", "value": "I am writing a research paper on a idea Minimum latency and energy efficiency routing with lossy link awareness in wireless sensor networks"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  proposes two joint routing and scheduling algorithms which minimize the data delivery latency while enhancing the energy efficiency in wireless sensor networks (WSNs). In our algorithms,  first model the network as a directed graph G init  orientating to the sink node on the basis of the location and lossy behavior of the wireless links. Next,  introduce two directed graphs G res  and G hip  taking into consideration the energy efficiency and latency, respectively. The scheduling algorithm is developed on the two graphs by solving an integer linear program (ILP) that minimizes energy consumption and mean latency in the network. Owing to the blacklist of links in the two graphs G res , G hop  with respect to G init , the computation complexity of ILP is decreased considerably. Simulation results show that our proposed algorithms are highly effective in improving network performance."}]