ON LOCALITY OF DOMINATING SET IN AD HOC NETWORKS WITH SWITCH-ON/OFF OPERATIONS

1 September 2002

journal article
Published by World Scientific Pub Co Pte Ltd in Journal of Interconnection Networks

Vol. 3 (3) , 129-147
https://doi.org/10.1142/s0219265902000598

Abstract

Efficient routing among a set of mobile hosts is one of the most important functions in ad hoc wireless networks. 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 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 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. In addition, locality of host status updated is also verified through simulation.

Keywords

This publication has 10 references indexed in Scilit:

Extended dominating-set-based routing in ad hoc wireless networks with unidirectional links
IEEE Transactions on Parallel and Distributed Systems, 2002
Power-aware localized routing in wireless networks
IEEE Transactions on Parallel and Distributed Systems, 2001
Maximum battery life routing to support ubiquitous mobile computing in wireless ad hoc networks
IEEE Communications Magazine, 2001
Self organization in mobile ad hoc networks: the approach of Terminodes
IEEE Communications Magazine, 2001
Challenges in mobile ad hoc networking
IEEE Communications Magazine, 2001
Dynamic power management in wireless sensor networks
IEEE Design & Test of Computers, 2001
Approximation Algorithms for Connected Dominating Sets
Algorithmica, 1998
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications, 1997
A channel access scheme for large dense packet radio networks
ACM SIGCOMM Computer Communication Review, 1996
Unit disk graphs
Discrete Mathematics, 1990