Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A location-based reliable multicast algorithm for mobile ad hoc networks is proposed in this paper. A grid network with geographical location information is divided into a high-channel subnetwork and a low-channel subnetwork according to labels of grids. Then destination nodes are partitioned into groups by using location information, the multicast routing is done in label order for each group. The proposed algorithm does not require the maintenance of a distribution structure(e.g., a tree or a mesh) or a planar graph, which introduces extra cost. A forwarding node only uses information about positions of its destinations and its own neighbors to determine next hops and to detour obstacles or faulty nodes. The localized operations can take advantage of the por saving in wireless network. The proposed algorithm is thus very ll suited for highly dynamic networks. The performance of the proposed algorithm is evaluated by means of simulation.
['Jipeng Zhou', 'Jianheng Lu']
I am writing a research paper on a idea Location-Based Reliable Multicast Routing Algorithm for Mobile Ad Hoc Networks
[{"from": "human", "value": "I am writing a research paper on a idea Location-Based Reliable Multicast Routing Algorithm for Mobile Ad Hoc Networks"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A location-based reliable multicast algorithm for mobile ad hoc networks is proposed in this paper. A grid network with geographical location information is divided into a high-channel subnetwork and a low-channel subnetwork according to labels of grids. Then destination nodes are partitioned into groups by using location information, the multicast routing is done in label order for each group. The proposed algorithm does not require the maintenance of a distribution structure(e.g., a tree or a mesh) or a planar graph, which introduces extra cost. A forwarding node only uses information about positions of its destinations and its own neighbors to determine next hops and to detour obstacles or faulty nodes. The localized operations can take advantage of the por saving in wireless network. The proposed algorithm is thus very ll suited for highly dynamic networks. The performance of the proposed algorithm is evaluated by means of simulation."}]