Distributed algorithms for connected domination in wireless networks

DOI10.1016/j.jpdc.2007.04.003zbMath1120.68113OpenAlexW1981982709MaRDI QIDQ2373893

Srinivasan Parthasarathy, Rajiv Gandhi

Publication date: 16 July 2007

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2007.04.003

zbMATH Keywords

interferenceconnected dominating set

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (4)

A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs ⋮ An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs ⋮ A near optimal periodic transmission schedule in bounded degree wireless sensor network ⋮ Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems

This page was built for publication: Distributed algorithms for connected domination in wireless networks