Zone-based virtual backbone formation in wireless ad hoc networks

被引:21
作者
Han, Bo [1 ]
机构
[1] Univ Maryland, Dept Comp Sci, College Pk, MD 20742 USA
关键词
Wireless ad hoc networks; Virtual backbone; Connected dominating set; Minimum connected dominating set; Distributed algorithm; CONNECTED DOMINATING SETS; MOBILE; ALGORITHMS; HEURISTICS;
D O I
10.1016/j.adhoc.2008.01.003
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Efficient protocol for clustering and backbone formation is one of the most important issues in wireless ad hoc networks. Connected dominating set (CDS) formation is a promising approach for constructing virtual backbone. However, finding the minimum CDS in an arbitrary graph is a NP-Hard problem. In this paper, we present a novel zone-based distributed algorithm for CDS formation in wireless ad hoc networks. In this Zone algorithm, we combine the zone and level concepts to sparsify the CDS constructed by previous well-known approaches. Therefore, this proposed algorithm call significantly reduce the CDS size. Particularly, we partition the wireless network into different zones, construct a dominating tree for each zone and connect adjacent zones by inserting additional connectors into the final CDS (at the zone borders). Our comprehensive simulation study using a custom simulator shows that this zone-based algorithm is more effective than previous approaches. The number of nodes in the CDS formed by this Zone algorithm is tip to around 66% less than that constructed by others. Moreover, we also compare the performance of Zone algorithm with some recently proposed CDS formation protocols in ns2 simulator. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:183 / 200
页数:18
相关论文
共 41 条
[1]   Distributed heuristics for connected dominating sets in wireless ad hoc networks [J].
Alzoubi, KM ;
Wan, PJ ;
Frieder, O .
JOURNAL OF COMMUNICATIONS AND NETWORKS, 2002, 4 (01) :22-29
[2]  
ALZOUBI KM, 2002, P 3 ACM INT S MOB AD, P157
[3]  
[Anonymous], 1960, MATH Z, DOI DOI 10.1007/BF01159721
[4]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
[5]  
[Anonymous], PERIODICA POLYTECHNI
[6]   THE ARCHITECTURAL ORGANIZATION OF A MOBILE RADIO NETWORK VIA A DISTRIBUTED ALGORITHM [J].
BAKER, DJ ;
EPHREMIDES, A .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1981, 29 (11) :1694-1701
[7]  
Bao Lichun., 2003, MOBIHOC 03, P129, DOI DOI 10.1145/778415.778432
[8]  
Basagni S., 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975), P70, DOI 10.1109/MAHSS.2004.1392076
[9]   Distributed clustering for ad hoc networks [J].
Basagni, S .
FOURTH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS, AND NETWORKS (I-SPAN'99), PROCEEDINGS, 1999, :310-315
[10]   Localized protocols for ad hoc clustering and backbone formation: A performance comparison [J].
Basagni, S ;
Mastrogiovanni, M ;
Panconesi, A ;
Petrioli, C .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2006, 17 (04) :292-306