DMCA
On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks (1999)
| Citations: | 376 - 39 self |
BibTeX
@MISC{Wu99oncalculating,
author = {Jie Wu and et al.},
title = { On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks},
year = {1999}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad-hoc wireless networks. Routing based on a connected dominating set is a frequently used approach, where the searching space for a route is reduced to nodes in the set. A set is dominating if all the nodes in the system are either in the set or neighbors of nodes in the set. In this paper, we propose a simple and efficient distributed algorithm for calculating connected dominating set in ad-hoc wireless networks, where connections of nodes are determined by their geographical distances. Our simulation results show that the proposed approach outperforms a classical algorithm. Our approach can be potentially used in designing efficient routing algo-rithms based on a connected dominating set.
