On locality of dominating set in ad hoc networks with switch-on/off operations

Author

Wu, Jie ; Dai, Fei

Author_Institution

Dept. of Comput. Sci. & Eng., Florida Atlantic Univ., Boca Raton, FL, USA

fYear

2002

fDate

6/24/1905 12:00:00 AM

Firstpage

74

Lastpage

79

Abstract

Routing based on a connected dominating set is a promising approach, where the search space for a route is reduced to the hosts in the set. A set is dominating if all the hosts in the system are either in the set or neighbors of hosts in the set. In this paper we first review a distributed formation of a connected dominating set called marking process and dominating-set-based routing. Then we propose several ways to reduce the size of the dominating set and study the locality of dominating set in ad hoc wireless networks with switch-on/off operations. Results show that the dominating set derived from the marking process exhibits good locality properties; i.e., the change of a host status, gateway (dominating) or non-gateway (dominated), affects only the status of hosts in a restricted vicinity

Keywords

graph theory; mobile radio; network topology; packet radio networks; telecommunication network routing; ad hoc networks; connected dominating set; connected graph; dominating set locality; dominating-set-based routing; gateway; host status; marking process; mobile hosts; network topology; routing; switch-on/off operations; wireless networks; Ad hoc networks; Computer science; Distributed algorithms; Intelligent networks; Network topology; Routing; Transmitters; Urban areas; Wireless networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Architectures, Algorithms and Networks, 2002. I-SPAN '02. Proceedings. International Symposium on

Conference_Location

Makati City, Metro Manila

ISSN

1087-4089

Print_ISBN

0-7695-1579-7

Type

conf

DOI

10.1109/ISPAN.2002.1004265

Filename

1004265