Analysis of d-Hop Dominating Set Problem for Directed Graph with Indegree Bounded by One

Joydeep Banerjee, Arun Das, Arunabha Sen

Efficient communication between nodes in ad-hoc networks can be established through repeated cluster formations with designated \textit{cluster-heads}. In this context minimum d-ho…