Effective location-guided tree construction algorithms for small group multicast in MANET
K. Chen, Klara Nahrstedt · 2003
Group communication has become increasingly important in mobile ad hoc networks (MANET). Current multicast routing protocols in MANET have a large overhead due to the dynamic network topology. To overcome this problem, there is a recent shift towards stateless multicast in small groups. We introduce a small group multicast scheme, based on packet encapsulation, which uses a novel packet distribution tree construction algorithms for efficient data delivery. The tree is constructed with the goal of minimizing the overall bandwidth cost of the tree. Two construction algorithms, for a location-guided k-ary (LGK) tree and a location-guided Steiner (LGS) tree, utilize the geometric locations of the destination nodes as heuristics to compute the trees. They are accompanied by a hybrid location update mechanism to disseminate location information among a group of nodes. Our simulation results show that LGS tree has lower bandwidth cost than LGK tree when the location information of the nodes is up-to-date, and its cost is similar to that of an optimal Steiner multicast tree. When location information of the nodes is out-dated, LGK tree outperforms LGS tree due to its lower computational complexity.