An Efficient Core-Based Multicast Tree using Weighted Clustering in Ad-hoc Networks


KIPS Transactions on Computer and Communication Systems, Vol. 10, No. 3, pp. 377-386, Jun. 2003
10.3745/KIPSTC.2003.10.3.377,   PDF Download:

Abstract

This study suggested a technique to maintain an efficient core-based multicast tree using weighted clustering factors in mobile Ad-hoc networks. The biggest problem with the core-based multicast tree routing is to decide the position of core node. The distance of data transmission varies depending on the position of core node. The overhead´s effect on the entire network is great according to the recomposition of the multicast tree due to the movement of core node, clustering is used. A core node from cluster head nodes on the multicast tree within core area whose weighted factor is the least is chosen as the head core node. Way that compose multicast tree by weighted clustering factors thus and propose keeping could know that transmission distance and control overhead according to position andmobility of core node improve than existent multicast way, and when select core node, mobility is less, and is near in center of network multicast tree could verification by simulation stabilizing that transmission distance is short.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
Y. J. Park, S. J. Han and J. H. Lee, "An Efficient Core-Based Multicast Tree using Weighted Clustering in Ad-hoc Networks," KIPS Journal C (2001 ~ 2012) , vol. 10, no. 3, pp. 377-386, 2003. DOI: 10.3745/KIPSTC.2003.10.3.377.

[ACM Style]
Yang Jae Park, Seung Jin Han, and Jung Hyun Lee. 2003. An Efficient Core-Based Multicast Tree using Weighted Clustering in Ad-hoc Networks. KIPS Journal C (2001 ~ 2012) , 10, 3, (2003), 377-386. DOI: 10.3745/KIPSTC.2003.10.3.377.