Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2004, Vol. 27 ›› Issue (3): 88-92.

• PAPERS • Previous Articles     Next Articles

A Cost-Priority Distributed Algorithm for Connected Dominating Set in Virtual Backbone-Based Mobile Ad hoc Networks

CHENG Sheng, ZHANG Xu, FENG Mei-yu, DING Wei   

  1. Broadband Communication Networks Laboratory, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2003-06-12 Online:2004-03-28

Abstract: Building of virtual backbone in mobile Ad hoc networks can effectively reduce the numbers of nodes used to run routing protocols. The virtual backbone consists of minimum connected dominating set (MCDS). Classical MCDS algorithms were compared with in several. A newly cost-priority distributed approximation MCDS algorithm was proposed, in which the flow was introduced. Simulation shows that the performance of the proposed algorithm has advantage over the existed ones.

Key words: mobile Ad hoc networks, virtual backbone, minimum connected dominating set

CLC Number: