An improved distributed algorithm for connected dominating sets in wireless ad hoc networks

被引：0
|
作者：
Liu, Hui [2 ]
Pan, Yi [1 ]
Cao, Jiannong [2 ]
机构：
[1] Department of Computer Science, Georgia State University, Atlanta, GA 30303, United States
[2] Department of Computing, Hong Kong Polytechnic University, Hong Kong, Hong Kong
来源：
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2004年 / 3358卷
基金：
中国国家自然科学基金;
关键词：
D O I：
10.1007/978-3-540-30566-8_41
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The idea of virtual backbone routing has been proposed for efficient routing among a set of mobile nodes in wireless ad hoc networks. Virtual backbone routing can reduce communication overhead and speedup the routing process compared with many existing on-demand routing protocols for routing detection. In many studies, Minimum Connected Dominating Set (MCDS) is used to approximate virtual backbones in a unit-disk graph. However finding a MCDS is a NP-hard problem. We propose a distributed, 3-phase protocol for calculating the CDS in this paper. Our new protocol largely reduces the number of nodes in CDS compared with Wu and Li's method, while message and time complexities of our approach remain almost the same as those of Wu and Li's method. We conduct extensive simulations and show our protocol can consistently outperform Wu and Li's method. The correctness of our protocol is proved through theoretical analysis. © Springer-Verlag Berlin Heidelberg 2004.
引用
收藏
页码：340 / 351
相关论文
共 50 条
  • [1] An improved distributed algorithm for connected dominating sets in wireless ad hoc networks
    Liu, H
    Pan, Y
    Cao, JN
    [J]. PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS, PROCEEDINGS, 2004, 3358 : 340 - 351
  • [2] Distributed heuristics for connected dominating sets in wireless ad hoc networks
    Alzoubi, KM
    Wan, PJ
    Frieder, O
    [J]. JOURNAL OF COMMUNICATIONS AND NETWORKS, 2002, 4 (01) : 22 - 29
  • [3] A distributed algorithm for connecting dominating sets in wireless ad hoc networks
    Cao Yongtao
    He Chen
    Wang Jun
    Zheng Chunlei
    [J]. 2006 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS PROCEEDINGS, VOLS 1-4: VOL 1: SIGNAL PROCESSING, 2006, : 1472 - +
  • [4] Constructing distributed connected dominating sets in wireless Ad Hoc and sensor networks
    Zheng C.
    Sun S.-X.
    Huang T.-Y.
    [J]. Ruan Jian Xue Bao/Journal of Software, 2011, 22 (05): : 1053 - 1066
  • [5] Distributed construction of connected dominating set in wireless ad hoc networks
    Wan, PJ
    Alzoubi, KM
    Frieder, O
    [J]. IEEE INFOCOM 2002: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS, 2002, : 1597 - 1604
  • [6] Distributed construction of connected dominating set in wireless ad hoc networks
    Wan, PJ
    Alzoubi, KM
    Frieder, O
    [J]. MOBILE NETWORKS & APPLICATIONS, 2004, 9 (02): : 141 - 149
  • [7] Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks
    Peng-Jun Wan
    Khaled M. Alzoubi
    Ophir Frieder
    [J]. Mobile Networks and Applications, 2004, 9 : 141 - 149
  • [8] A randomized connected dominating set algorithm in wireless ad hoc networks
    Cao, GT
    [J]. ICWN'04 & PCC'04, VOLS, 1 AND 2, PROCEEDINGS, 2004, : 16 - 21
  • [9] Connected D-Hop dominating sets in wireless ad hoc networks
    Vuong, THP
    Huynh, DT
    [J]. 6TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL IV, PROCEEDINGS: MOBILE/WIRELESS COMPUTING AND COMMUNICATION SYSTEMS I, 2002, : 54 - 58
  • [10] Iterative local solutions for connected dominating sets in ad hoc wireless networks
    Wu, Jie
    Dai, Fei
    Yang, Shuhui
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2008, 57 (05) : 702 - 715
12345