A Load-balanced Topology Maintenance with Partial Topology Reconstruction 


Vol. 35,  No. 12, pp. 1188-1197, Dec.  2010


PDF
  Abstract

A most important thing in a connected dominating set(CDS)-based routing in a wireless ad-hoc network is to select a minimum number of dominating nodes and then build a backbone network which is made of them. Node failure in a CDS is an event of non-negligible probability. For applications where fault tolerance is critical, a traditional dominating-set based routing may not be a desirable form of clustering. It is necessary to minimize the frequency of reconstruction of a CDS to reduce message overhead due to message flooding. The idea is that by finding alternative nodes within a restricted range and locally reconstructing a CDS to include them, instead of totally reconstructing a new CDS. With the proposed algorithm, the resulting number of dominating nodes after partial reconstruction of CDS is not changed and also its execution time is faster than well-known algorithm of construction of CDS by 20~40%. In the case of high mobility situation, the proposed algorithm gives better results for the performance metrics, packet receive ratio and energy consumption.

  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]

Y. Hong and H. Lim, "A Load-balanced Topology Maintenance with Partial Topology Reconstruction," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 12, pp. 1188-1197, 2010. DOI: .

[ACM Style]

Youn-Sik Hong and Hwa-Seok Lim. 2010. A Load-balanced Topology Maintenance with Partial Topology Reconstruction. The Journal of Korean Institute of Communications and Information Sciences, 35, 12, (2010), 1188-1197. DOI: .

[KICS Style]

Youn-Sik Hong and Hwa-Seok Lim, "A Load-balanced Topology Maintenance with Partial Topology Reconstruction," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 12, pp. 1188-1197, 12. 2010.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880