Distributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets

被引：25
|
作者：
Rieck, MQ
Pai, S
Dhar, S
机构：
[1] San Jose State Univ, San Jose, CA 95192 USA
[2] Drake Univ, Des Moines, IA 50311 USA
[3] Microsoft Corp, Mountain View, CA 94043 USA
来源：
COMPUTER NETWORKS | 2005年 / 47卷 / 06期
关键词：
D-dominating set; ad hoc wireless networks; D-closure; routing algorithm;
D O I：
10.1016/j.comnet.2004.09.005
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper describes a distributed algorithm (generalized d-CDS) for producing a variety of d-dominating sets of nodes that can be used to form the backbone of an ad hoc wireless network. In special cases (ordinary d-CDS), these sets are also d-hop connected and has a desirable "shortest path property". Routing via the backbone created is also discussed. The algorithm has a "constant time" complexity in the limited sense that it is unaffected by expanding the size of the network as long as the maximal node degree is not allowed to increase too. The performances of this algorithm for various parameters are compared, and also compared with other algorithms. (c) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码：785 / 799
页数：15
相关论文
共 50 条
  • [1] Connected D-Hop dominating sets in wireless ad hoc networks
    Vuong, THP
    Huynh, DT
    6TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL IV, PROCEEDINGS: MOBILE/WIRELESS COMPUTING AND COMMUNICATION SYSTEMS I, 2002, : 54 - 58
  • [2] Connected d-hop dominating sets in mobile ad hoc networks
    Nguyen, Trac N.
    Huynh, Dung T.
    2006 4TH INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC AND WIRELESS NETWORKS, VOLS 1 AND 2, 2006, : 138 - +
  • [3] A new adaptive distributed routing protocol using d-hop dominating sets for mobile ad hoc networks
    Shi, ZN
    Srimani, PK
    PDPTA '04: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-3, 2004, : 1049 - 1055
  • [4] Adapting D-hop dominating sets to topology changes in ad hoc networks
    Vuong, THP
    Huynh, DT
    NINTH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, PROCEEDINGS, 2000, : 348 - 353
  • [5] Distributed Construction of d-hop Connected Dominating Sets for Wireless Sensor Networks
    Skiadopoulos, Konstantinos
    Giannakis, Konstantinos
    Oikonomou, Konstantinos
    Stavrakakis, Ioannis
    Aissa, Sonia
    2018 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2018,
  • [6] Using density-based d-hop connected d-dominating sets routing scheme to achieve load balancing for wireless sensor networks
    Ko, Ren-Song
    Huang, Chi-Hung
    2007 IEEE WIRELESS COMMUNICATIONS & NETWORKING CONFERENCE, VOLS 1-9, 2007, : 4218 - 4223
  • [7] Construction of d-Hop Connected Dominating Sets in Wireless Sensor Networks
    Zheng, Chan
    Yin, Ling
    Sun, Shixin
    CEIS 2011, 2011, 15
  • [8] <bold>Adapting Connected D-Hop Dominating Sets to Topology Changes in Wireless Ad Hoc Networks</bold>
    Bolla, Jason A.
    Huynh, D. T.
    2006 IEEE INTERNATIONAL PERFORMANCE COMPUTING AND COMMUNICATIONS CONFERENCE, VOLS 1 AND 2, 2006, : 207 - +
  • [9] Adaptive D-Hop Connected Dominating Set in Highly Dynamic Flying Ad-Hoc Networks
    Wang, Bowen
    Sun, Yanjing
    Do-Duy, Tan
    Garcia-Palacios, Emiliano
    Q. Duong, Trung
    IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2021, 8 (03): : 2651 - 2664
  • [10] Energy-Efficient Connected D-Hop Dominating Sets in Wireless Sensor Networks
    Nguyen, Trac N.
    Huynh, D. T.
    2009 IEEE INTERNATIONAL CONFERENCE ON PERVASIVE COMPUTING AND COMMUNICATIONS (PERCOM), VOLS 1 AND 2, 2009, : 613 - 618
12345