An Efficient Cluster Routing Protocol Based on 2-level Tree for Wireless Ad Hoc Networks


KIPS Transactions on Computer and Communication Systems, Vol. 3, No. 5, pp. 155-162, May. 2014
10.3745/KTCCS.2014.3.5.155,   PDF Download:

Abstract

We proposed a 2 level tree based cluster based routing protocol for mobile ad hoc networks. it is our crucial goal to establish improvedclustering’s structure in order to extend average node life-time and elevate the average packet delivery ratio. Because of insufficientwireless resources and energy, the method to form and manage clusters is useful for increasing network stability. but cluster-head fulfillsroles as a host and a router in clustering protocol of Ad hoc networks environment. Therefore energy exhaustion of cluster-head causescommunication interruption phenomenon. Effective management of cluster-head is key-point which determines the entire networkperformance. The scheme focuses on improving the performance the life time of the network and throughput through the management ofcluster-heads and its neighbor nodes. In simulation, we demonstrated that it would obtain averagely better 17% performance than LS2RP.


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]
L. Y. Joon and K. S. Chun, "An Efficient Cluster Routing Protocol Based on 2-level Tree for Wireless Ad Hoc Networks," KIPS Transactions on Computer and Communication Systems, vol. 3, no. 5, pp. 155-162, 2014. DOI: 10.3745/KTCCS.2014.3.5.155.

[ACM Style]
Lee Young Joon and Kim Sung Chun. 2014. An Efficient Cluster Routing Protocol Based on 2-level Tree for Wireless Ad Hoc Networks. KIPS Transactions on Computer and Communication Systems, 3, 5, (2014), 155-162. DOI: 10.3745/KTCCS.2014.3.5.155.