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.

Citations

1845	Dynamic source routing in ad-hoc wireless networks - Johnson, Maltz - 1996
1221	Highly dynamic destination-sequenced distance vector routing (DSDV) for mobile computers - Perkins, Bhagwat - 1994
221	Approximation Algorithms for Connected Dominating Sets. Algorithmica - Guha, Khuller - 1998
180	Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets - Das, Bharghavan - 1997
91	Routing in Ad Hoc Networks Using a Spine - Das, Sivakumar, et al. - 1997
57	A Routing Protocol for Packet Radio Networks - Murthy, Garcia-Luna-Aceves - 1995
41	Routing in Ad Hoc Networks Using a Virtual Backbone - Das, Sivakumar, et al.
33	A clusterbased approach for routing in ad hoc networks, in - Krishna, Chatterjee, et al. - 1995
1	Distributed algorithms for generating loop-free routes with frequently changing topology - PI - 1981