## Abstract

This paper introduces a distributed fault-tolerant topology control algorithm, called the Disjoint Path Vector (DPV), for heterogeneous wireless sensor networks composed of a large number of sensor nodes with limited energy and computing capability and several supernodes with unlimited energy resources. The DPV algorithm addresses the κ-degree Anycast Topology Control problem where the main objective is to assign each sensor's transmission range such that each has at least κ-vertex-disjoint paths to supernodes and the total power consumption is minimum. The resulting topologies are tolerant to κ-1 node failures in the worst case. We prove the correctness of our approach by showing that topologies generated by DPV are guaranteed to satisfy κ-vertex supernode connectivity. Our simulations show that the DPV algorithm achieves up to 4-fold reduction in total transmission power required in the network and 2-fold reduction in maximum transmission power required in a node compared to existing solutions.

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

Article number | 6786025 |

Pages (from-to) | 914-923 |

Number of pages | 10 |

Journal | IEEE Transactions on Parallel and Distributed Systems |

Volume | 26 |

Issue number | 4 |

DOIs | |

Publication status | Published - Apr 1 2015 |

## Keywords

- disjoint paths
- energy efficiency
- fault tolerance
- heterogeneous wireless sensor networks
- Topology control
- κ-connectivity

## ASJC Scopus subject areas

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