Notice of Violation of IEEE Publication Principles: A low delay multi-source multicast algorithm for ad hoc networks

Notice of Violation of IEEE Publication Principles

"A Low Delay Multi-source Multicast Algorithm for Ad hoc Networks"
by Yinbo Zuo, Xianggao Cai, Xiaola Lin
in the Proceedings of the 6th Joint IFIP Wireless and Mobile Networking Conference (WMNC), April 2013

After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE’s Publication Principles.

This paper is a duplication of the original text from the paper cited below. The original text was copied without attribution (including appropriate references to the original author(s) and/or paper title) and without permission.

Due to the nature of this violation, reasonable effort should be made to remove all past references to this paper, and future references should be made to the following article:

"A Depth-optimal Low-complexity Distributed Wireless Multicast Algorithm"
by A. Sinan Akyurek and Elif Uysal-Biyikoglu
in The Computer Journal, Vol. 54 No. 6, March 2011


In this paper, we present a multi-source multi-cast algorithm for wireless ad hoc networks. As a tree-based routing approach, it forms a tree connecting source(s) to the multicast destinations. Our algorithm ensures that each multicast destination gets packets from the shortest path that has the minimum numbers of hops to its nearest source. Our approach is multi-source support and fully distributed. We also extend our algorithm to provide an alternative tree to improve its robustness for networks with frequent link failures and node mobility. With extensive simulations on a large set of network instances in different scenarios, we show that our algorithm has lower end to end delay and shorter hop distance than the well-known tree-based multicast algorithm MAODV, although the total number of transmissions is slightly larger than MAODV. Moreover, under low to moderate node mobility the delay performance of our approach is virtually unaffected.