A virtual-force based multicast routing algorithm for mobile ad-hoc networks

Multicast routing algorithms for mobile ad-hoc networks have been extensively researched in the recent past. In this paper, we deal with the multicasting problem using the notion of virtual forces. The nodes' location information is used to generate virtual circuits corresponding to the multicast path. We look at the effective force exerted on a packet and determine whether a node could be considered as a Steiner node. We have integrated QoS parameters into the virtual force computation in the form of dampening force. The algorithm produces relatively minimal multicast trees under the set of constraints. Our algorithm provides improvement in average residual energy in the network as well as effective cost per data packet transmitted. This paper presents the first virtual force based multicast routing algorithm for mobile ad-hoc networks.