Efficient Flooding in Ad hoc Networks using Cluster Formation based on Link Density


The KIPS Transactions:PartC, Vol. 14, No. 7, pp. 589-596, Dec. 2007
10.3745/KIPSTC.2007.14.7.589,   PDF Download:

Abstract

Although flooding has the disadvantages like a transmission of duplicated packets and a packet collision, it has been used frequently to find a path between a source and a sink node in a wireless ad hoc network. Clustering is one of the techniques that have been proposed to overcome those disadvantages. In this paper, we propose a new flooding mechanism in ad hoc networks using cluster formation based on the link density which means the number of neighbors within a node’s radio reach. To reduce traffic overhead in the cluster is to make the number of non-flooding nodes as large as possible. Therefore, a node with the most links in a cluster will be elected as cluster header. This method will reduce the network traffic overhead with a reliable network performance. Simulation results using NS2 show that cluster formation based on the link density can reduce redundant flooding without loss of network performance.


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]
J. H. Lee and K. H. Kwon, "Efficient Flooding in Ad hoc Networks using Cluster Formation based on Link Density," The KIPS Transactions:PartC, vol. 14, no. 7, pp. 589-596, 2007. DOI: 10.3745/KIPSTC.2007.14.7.589.

[ACM Style]
Jae Hyun Lee and Kyung Hee Kwon. 2007. Efficient Flooding in Ad hoc Networks using Cluster Formation based on Link Density. The KIPS Transactions:PartC, 14, 7, (2007), 589-596. DOI: 10.3745/KIPSTC.2007.14.7.589.