DSP Algorithm for Efficient Communication between Clusterheads in Cluster-based Ad hoc Networks 


Vol. 32,  No. 4, pp. 351-357, Apr.  2007


PDF Full-Text
  Abstract

Numerous papers that study ad hoc networks have used a hierarchical network structure to enhance scalability. The hierarchical structure typically consists of a number of clusters, each of which has its own clusterhead that maintains information. Clusterheads often need to exchange information among themselves in order to maintain information, and for such cases, a mechanism is needed to efficiently deliver information from one clusterhead to another. Here, we proposed a new distributed algorithm in which every node independently makes the decision about whether or not it forwards a received message. We used a simulation to demonstrate that the algorithm developed for this study is a considerable improvement over the control overhead algorithm.

  Statistics
Cumulative Counts from November, 2022
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]

S. Yun and H. Oh, "DSP Algorithm for Efficient Communication between Clusterheads in Cluster-based Ad hoc Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 4, pp. 351-357, 2007. DOI: .

[ACM Style]

Seok-yeol Yun and Hoon Oh. 2007. DSP Algorithm for Efficient Communication between Clusterheads in Cluster-based Ad hoc Networks. The Journal of Korean Institute of Communications and Information Sciences, 32, 4, (2007), 351-357. DOI: .

[KICS Style]

Seok-yeol Yun and Hoon Oh, "DSP Algorithm for Efficient Communication between Clusterheads in Cluster-based Ad hoc Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 4, pp. 351-357, 4. 2007.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880