A center-of-gravity multicast routing protocol for traveling search in wireless mesh network

Many proposals have been made for multicast routing protocols for use in a wireless mesh network. When the multicast group changes, these protocols flood the network with control packets to reestablish the topology. This inefficient solution is problematic when the multicast group changes frequently. This paper proposes a center-of-gravity multicast routing protocol (GMRP). Even when nodes that need to be searched change each time a user makes a request, this protocol generates autonomously, uniquely and in a distributed manner a unicursal route that goes through all these nodes. The paper evaluates GMRP by comparing it with a conventional method, Multicast Ad-hoc On-demand Distance Vector (MAODV).