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 条

[21] Subarea Tree Routing in Multi-hop Wireless Ad hoc Networks
Liu Gui-kai
Shan Chun-li
Wei Gang
Wang Hong-jiang
2008 11TH IEEE SINGAPORE INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS (ICCS), VOLS 1-3, 2008, : 1693 - 1697
[22] Predictive multi-hop stable routing in vehicular ad hoc networks
Division of IT, Netaji Subhas Institute of Technology, University of Delhi, New Delhi, India
不详
不详
ACS/IEEE Int. Conf. Comput. Syst. Appl., AICCSA, 2010,
[23] Opportunistic Routing in Multi-rate Multi-hop Ad Hoc Networks
Al-Zubi, Raed Taleb
Krunz, Marwan
2012 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2012,
[24] A Constant-Factor Approximation for d-Hop Connected Dominating Sets in Unit Disk Graph
Gao, Xiaofeng
Li, Xianyue
Wu, Weili
PROCEEDINGS OF THE TENTH INTERNATIONAL CONFERENCE ON INFORMATION AND MANAGEMENT SCIENCES, 2011, 10 : 263 - 272
[25] Improving broadcast operations in ad hoc networks using two-hop connected dominating sets
Spohn, MA
Garcia-Luna-Aceves, J
GLOBECOM 2004: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE WORKSHOPS, 2004, : 147 - 152
[26] D-Hop: a Dynamic and Distributed Protocol for Vehicle Routing
de Brito, Mariana Ramos
Duarte-Figueiredo, Fatima de L. P.
2017 IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS (ISCC), 2017, : 1073 - 1078
[27] A constant-factor approximation for d-hop connected dominating sets in unit disk graph
Gao, Xiaofeng
Wu, Weili
Zhang, Xuefei
Li, Xianyue
INTERNATIONAL JOURNAL OF SENSOR NETWORKS, 2012, 12 (03) : 125 - 136
[28] Mobility-based d-hop clustering algorithm for mobile ad hoc networks
Er, II
Seah, WKG
2004 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, VOLS 1-4: BROADBAND WIRELESS - THE TIME IS NOW, 2004, : 2359 - 2364
[29] Distributed algorithm for efficient construction and maintenance of connected k-hop dominating sets in mobile ad hoc networks
Yang, Hong-Yen
Lin, Chia-Hung
Tsai, Ming-Jer
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2008, 7 (04) : 444 - 457
[30] MURU: A multi-hop routing protocol for urban vehicular ad hoc networks
Mo, Zhaomin
Zhu, Hao
Makki, Kia
Pissinou, Niki
2006 3RD ANNUAL INTERNATIONAL CONFERENCE ON MOBILE AND UBIQUITOUS SYSTEMS - WORKSHOPS, 2006, : 198 - +

← 1 2 3 4 5 →