Browse > Article

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

Cho Hyoung-Sang (인하대학교 정보통신대학원 멀티미디어통신망연구실)
Yoo Sang-Jo (인하대학교 정보통신대학원 멀티미디어통신망연구실)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.30, no.5B, 2005 , pp. 274-286 More about this Journal
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.
Keywords
Ad-hoc network; Wireless; Algorithm; Power; Energy;
Citations & Related Records
연도 인용수 순위
  • Reference
1 T. W. Haynes, Hedetnierni S. T., and P. J. Slater, 'Fundamentals of Domination in Graphs,' A Sireis of Monographs and Text books. Marcel Dekker, Inc., 1998
2 S. Guha and S. Khuller, 'Approximation algorithms for connected dominating set,' Algorithmica, 20(4):374-387, April 1998   DOI   ScienceOn
3 IEEE, 'Wireless LAN Medium Access Control and Physical Layer specifications,' IEEE 802.11 Standard, IEEE Computer Society LAN MAN Standards Committee (August 1999)
4 Y. H. Kang, Y. I. Born, 'Balancing Routing Energy Consumption in Wireless Ad-hoc Network Environments', The Journal of KICS, pp. 1671-1683, Oct, 2001
5 Feeney, L.M. and Nilsson, M., 'Investigating the energy consumption of a wireless network interface in an ad hoc networking environment,' Proceedings of IEEE Infocom, Anchorage AK, April, 2001
6 Chen Benjie, Jamieson Kyle, Balakrishnan H. and Morris Robert, 'SPAN: An Energy-Efficient Coordination Algorithm of Topology Maintenance in Ad hoc Wireless Networks', ACM Wireless Networks Journal, Volume 8, Number 5, pp. 481-494, September, 2002   DOI   ScienceOn
7 Y. P. Chen and A. L. Liestman, 'Approximating Minimum Size Weakly-Connected Dominating Sets for Clustering Mobile Ad hoc Networks', MOBIHOC '02, June, 2002
8 J. Wu and M. Gao, 'On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks,' in Proceedings of the 30th Annual International Conference on Parallel Processing, Valencia, Spain (September 2001)
9 J. Wu and H. Li, 'On calculating connected dominating set for efficient routing in ad hoc wireless networks,' in : Proceedings of the Third International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Seattle, WA (August 1999)