Degree and resource-constrained routing algorithm for application layer multicast in ad hoc networks

An ad hoc network is a self-organizing, dynamic and decentralized wireless network, which is established by a group of mobile nodes on a shared wireless channel without any preexisting infrastructure. These nodes dynamically construct temporary network to communicate with each other. Applications of this network require group oriented services. Hence multicast support is a critical feature for ad hoc networks. Application layer multicast protocols is more and more attractive in multicasting application, however, it receives little attention in ad hoc networks domain. In this paper, we will exhibit how effectively application layer multicast can benefit for ad hoc networks. We propose a degree and resource-constrained minimal delay spanning tree (DRCMD) for multicasting, and give three heuristic algorithms to solve it. We simulate and verify them with NS3. Experimental results show that DRCMD is able to cope with ad hoc networks dynamics and keep the multicast tree efficient. The results also indicate that group members receive a high proportion of data multicast by senders, even in the case of a highly dynamic network.