K-Nodes Multicasting Minimum Cost Spanning Trees in Wireless Mobile Ad Hoc Network (MANET)

Date Added: Feb 2012
Format: PDF

Mobile Ad-hoc NETworks (MANETs) are highly decentralized, independent and self-organizing networks. It is significant to study the cost of the network, to optimize the routing method by means of cross layer interaction across the layers of the network. In this paper, first the authors generate a minimum cost spanning tree for a given network of N- nodes using an efficient algorithm, and then they explain the problem of constructing a K-node Multicast Minimum Spanning Tree (KMMST) for any given multicasting group with K nodes, where K is less than n.