## Abstract

Inspired by the backbone concept in wired networks, virtual backbone is expected to bring substantial benefits to routing in wireless sensor networks (WSNs). Virtual backbone construction based on Connected Dominating Set (CDS) is a competitive approach among the existing methods used to establish virtual backbone in WSNs. Traditionally, CDS size was the only factor considered in the CDS-based approach. The motivation was that smaller CDS leads to simplified network maintenance. However, routing cost in terms of routing path length is also an important factor for virtual backbone construction. In our research, both of these two factors are taken into account. Specifically, we attempt to devise a polynomial-time constant-approximation algorithm that leads to a CDS with bounded CDS size and guaranteed routing cost. We prove that, under general graph model, there is no polynomial-time constant-approximation algorithm unless (P) (=NP). Under Unit Disk Graph (UDG) model, we propose an innovative polynomial-time constant-approximation algorithm, GOC-MCDS-C, that produces a CDS (D) whose size |(D)| is within a constant factor from that of the minimum CDS. In addition, for each node pair (u) and (v), there exists a routing path with all intermediate nodes in (D) and path length at most (7 · d(u,v)), where (d(u,v)) is the length of the shortest path between (u) and (v). Our theoretical analysis and simulation results show that the distributed version of the proposed algorithm, GOC-MCDS-D, outperforms the existing approaches.

Original language | English |
---|---|

Article number | 6216366 |

Pages (from-to) | 652-661 |

Number of pages | 10 |

Journal | IEEE Transactions on Parallel and Distributed Systems |

Volume | 24 |

Issue number | 4 |

DOIs | |

Publication status | Published - 2013 |

## Keywords

- Wireless sensor networks
- connected dominating set
- routing cost
- virtual backbone

## ASJC Scopus subject areas

- Signal Processing
- Hardware and Architecture
- Computational Theory and Mathematics