A minimum connected dominating set (MCDS) can be used as virtual backbone in ad-hoc wireless networks for efficient routing and broadcasting tasks. To find the MCDS is an NP- complete problem even in unit disk graphs. Many suboptimal algorithms are reported in the literature to find the MCDS using local information instead to use global network knowledge, achieving an important reduction in complexity. Since a wireless network continuously changes due to, for ex- ample, power restrictions, sensors faults, sensors disconnection etc., it is needed to adapt the MCDS to the new network configuration. In this paper, we study the influence of removing a node on the MCDS and we propose a localized reconfiguration algorithm to obtain the MCDS of the new network topology.
Authors
- dr inż. Magda Dettlaff link open in new tab ,
- dr inż. Magdalena Lemańska link open in new tab ,
- prof. Adriana Dapena,
- prof. Maria Jose Souto-Salorio
Additional information
- Category
- Publikacja w czasopiśmie
- Type
- publikacje elektroniczne
- Language
- angielski
- Publication year
- 2015
