Power, mobility and wireless channel condition aware connected dominating set construction algorithm in the wireless ad-hoc networks 


Vol. 30,  No. 5, pp. 274-286, May  2005


PDF
  Abstract

In this paper, we propose a new power-efficient and reliable connected dominating set based routing protocol in the mobile ad hoc networks. Gateway nodes must be elected in consideration of residual energy and mobility because frequent reconstruction of connected dominating set result in transmission error for route losses. If node density is high, it results in a lot of contentions and more delays for network congestion. Therefore, in this paper, we propose a new construction method of connected dominating set that supports reliable and efficient data transmission through minimizing reconstruction of connected dominating set by delaying neighbor set advertisement message broadcast in proportion to weighted sum of residual energy, mobility, and the number of neighbor nodes. The performance of the proposed protocol is proved by simulation of various conditions.

  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]

H. Cho and S. Yoo, "Power, mobility and wireless channel condition aware connected dominating set construction algorithm in the wireless ad-hoc networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 5, pp. 274-286, 2005. DOI: .

[ACM Style]

Hyoung-Sang Cho and Sang-Jo Yoo. 2005. Power, mobility and wireless channel condition aware connected dominating set construction algorithm in the wireless ad-hoc networks. The Journal of Korean Institute of Communications and Information Sciences, 30, 5, (2005), 274-286. DOI: .

[KICS Style]

Hyoung-Sang Cho and Sang-Jo Yoo, "Power, mobility and wireless channel condition aware connected dominating set construction algorithm in the wireless ad-hoc networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 5, pp. 274-286, 5. 2005.