This paper proposes efficient approximation algorithms for the Total Dominating Set (TDS) and Total Roman Dominating Set (TRDS) problems in unit disk graphs.