Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: As sensor networks are deployed over various terrains, the complexity of their topology continues to grow. Voids in networks often cause existing geographic routing algorithms to fail. ,  propose a novel geographic routing algorithm called “Greedy Forwarding with VIrtual Position (ViP)”.  introduce virtual position as the middle position of all direct neighbors of a node. Instead of comparing nodes' real geographic positions, ViP employs virtual positions when selecting the next hop. Such virtual position reflects the neighborhood of a sensor node, as ll as the tendency of further forwarding. For sparsely-deployed networks, ViP increases success rate of packet routing without introducing significant overhead. Furthermore, multiple levels of virtual position can be obtained with localized iteration.  propose the “Greedy Forwarding with Multi-level Virtual Position (MVP)” algorithm and the “Greedy Forwarding with Hierarchical Virtual Position (HVP)” algorithm. Different levels of virtual positions and their combinations are used alternatively to increase success rate of packet routing in sensor networks.
['Jiaxi You', 'Dominik Lieckfeldt', 'Qi Han', 'Jakob Salzmann', 'Dirk Timmermann']
I am writing a research paper on a idea Look-ahead geographic routing for sensor networks
[{"from": "human", "value": "I am writing a research paper on a idea Look-ahead geographic routing for 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: As sensor networks are deployed over various terrains, the complexity of their topology continues to grow. Voids in networks often cause existing geographic routing algorithms to fail. ,  propose a novel geographic routing algorithm called \u201cGreedy Forwarding with VIrtual Position (ViP)\u201d.  introduce virtual position as the middle position of all direct neighbors of a node. Instead of comparing nodes' real geographic positions, ViP employs virtual positions when selecting the next hop. Such virtual position reflects the neighborhood of a sensor node, as ll as the tendency of further forwarding. For sparsely-deployed networks, ViP increases success rate of packet routing without introducing significant overhead. Furthermore, multiple levels of virtual position can be obtained with localized iteration.  propose the \u201cGreedy Forwarding with Multi-level Virtual Position (MVP)\u201d algorithm and the \u201cGreedy Forwarding with Hierarchical Virtual Position (HVP)\u201d algorithm. Different levels of virtual positions and their combinations are used alternatively to increase success rate of packet routing in sensor networks."}]