Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: For disconnected Vehicular Ad hoc NETworks (VANETs), the carry-and-forward mechanism is promising to ensure the delivery success ratio at the cost of a longer delay, as the vehicle travel speed is much lor than the wireless signal propagation speed. Estimating delay is critical to select the paths with low delay, and is also challenging given the random topology and high mobility, and the difficulty to let the message propagate along the selected path. ,  first propose a simple yet effective propagation strategy considering bidirectional vehicle traffic for two-dimensional VANETs, so the opposite-direction vehicles can be used to accelerate the message propagation and the message can largely follow the selected path. Focusing on the propagation delay, an analytical framework is developed to quantify the expected path delay. Using the analytical model, a source node can apply the shortest-path algorithm to select the path with the lost expected delay. Performance evaluation by simulation show that, when the vehicle density is uneven but known, the proposed Minimum Delay Routing Algorithm can achieve a substantial reduction in delay compared with the geocast-routing approach, and its performance is close to the flooding-based Epidemic algorithm, while our solution maintains only a single copy of the message.
['Jianping He', 'Lin Cai', 'Jianping Pan', 'Peng Cheng']
I am writing a research paper on a idea Delay Analysis and Routing for Two-Dimensional VANETs Using Carry-and-Forward Mechanism
[{"from": "human", "value": "I am writing a research paper on a idea Delay Analysis and Routing for Two-Dimensional VANETs Using Carry-and-Forward Mechanism"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: For disconnected Vehicular Ad hoc NETworks (VANETs), the carry-and-forward mechanism is promising to ensure the delivery success ratio at the cost of a longer delay, as the vehicle travel speed is much lor than the wireless signal propagation speed. Estimating delay is critical to select the paths with low delay, and is also challenging given the random topology and high mobility, and the difficulty to let the message propagate along the selected path. ,  first propose a simple yet effective propagation strategy considering bidirectional vehicle traffic for two-dimensional VANETs, so the opposite-direction vehicles can be used to accelerate the message propagation and the message can largely follow the selected path. Focusing on the propagation delay, an analytical framework is developed to quantify the expected path delay. Using the analytical model, a source node can apply the shortest-path algorithm to select the path with the lost expected delay. Performance evaluation by simulation show that, when the vehicle density is uneven but known, the proposed Minimum Delay Routing Algorithm can achieve a substantial reduction in delay compared with the geocast-routing approach, and its performance is close to the flooding-based Epidemic algorithm, while our solution maintains only a single copy of the message."}]