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 条
  • [41] Analytical models for single-hop and multi-hop ad hoc networks
    Alizadeh-Shabdiz, F
    Subramaniam, S
    FIRST INTERNATIONAL CONFERENCE ON BROADBAND NETWORKS, PROCEEDINGS, 2004, : 449 - 458
  • [42] Analytical Models for Single-Hop and Multi-Hop Ad Hoc Networks
    Farshid Alizadeh-Shabdiz
    Suresh Subramaniam
    Mobile Networks and Applications, 2006, 11 : 75 - 90
  • [43] Analytical models for single-hop and multi-hop ad hoc networks
    Alizadeh-Shabdiz, F
    Subramaniam, S
    MOBILE NETWORKS & APPLICATIONS, 2006, 11 (01): : 75 - 90
  • [44] Distributed power management protocols for multi-hop mobile ad hoc networks
    Wu, SL
    Tseng, PC
    Chou, ZT
    COMPUTER NETWORKS, 2005, 47 (01) : 63 - 85
  • [45] Performance Modeling and Analysis of Distributed Multi-hop Wireless Ad Hoc Networks
    Li, Xu
    Gao, He
    Liang, Yanan
    Xiong, Ke
    Liu, Ying
    2016 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2016,
  • [46] Distributed flow-based scheduling in multi-hop ad hoc networks
    Yang, DQ
    Li, VOK
    2004 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-7, 2004, : 4167 - 4171
  • [47] Distributed multi-radio channel allocation in multi-hop ad hoc networks
    Gao, Lin
    Wang, Xinbing
    Xu, Youyun
    Chen, Wen
    2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13, 2008, : 3156 - 3160
  • [48] Routing in ad-hoc networks using minimum connected dominating sets
    Das, B
    Bharghavan, V
    ICC'97: 1997 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS - TOWARDS THE KNOWLEDGE MILLENNIUM, CONFERENCE RECORD - VOLS 1-3, 1997, : 376 - 380
  • [49] Efficient Algorithms for Connected Dominating Sets in Ad Hoc Networks
    Kassaei, Hossein
    Mehrandish, Mona
    Narayanan, Lata
    Opatrny, Jaroslav
    2010 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC 2010), 2010,
  • [50] Energy conservation and routing efficiency tradeoff in multi-hop wireless ad hoc networks
    Sun, XB
    Zhou, Z
    2003 INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY, VOL 1 AND 2, PROCEEDINGS, 2003, : 1278 - 1281
12345