CONSTRUCTION AND EVALUATION OF MESHES BASED ON SHORTEST PATH TREE VS. STEINER TREE FOR MULTICAST ROUTING IN MOBILE AD HOC NETWORKS
James J. Sims, Natarajan Meghanathan · 2010
A mobile ad hoc network (MANET) is a network of mobile devices that continuously restructure their topology due to mobility. Proposals on tree-based routing versus mesh-based routing protocols have shown that mesh-based multicast routing gives improved results for MANETs. The main reason for this is because trees are highly susceptible to failure due to frequent mobility. This paper will look at the developing a mesh from two different structures: a shortest path tree and a minimum Steiner tree. In each of the two cases, we extend a tree to a mesh by incorporating edges, which exist in the network graph, between any two constituent nodes of the tree. The goal is to look and determine how the implementation of these two structures can affect the overall performance of the multicast mesh and derive theoretical