Dynamic Group Discovery and Routing in Ad Hoc Networks
Xiaoyan Hong, Mário Gerla · 2002
In some applications of large scale Ad Hoc networks, for example, advanced battlefield scenarios, the assumption that different sets of nodes move as groups is extremely helpful in achieving efficient and scalable routing. In some applications, the groups are known in advance. In other applications, however, groups form very dynamically. For instance, in a battle theater, new missions are often created by rearranging and regrouping the current assets in response to new emergencies etc. The regrouping is done by the applications and is not necessarily communicated to the network layer. The network layer must thus ”discover ” the groups independently in order to achieve group routing scalability. In this paper we assume that groups are not known in advanced. We introduce a dynamic group discovery and formation scheme that aggregates nodes based on movement affinity and assigns unique ID numbers to the groups. Once groups are discovered, we apply the Landmark Ad Hoc Routing (LANMAR) scheme to achieve scalable routing. The simulation results demonstrate that the proposed scheme can efficiently and dynamically recognize the mobile groups leading to stable LANMAR operation. I.