This paper considers the problem of calculating dominating sets in networks with bounded degree. In these networks, the maximal degree of any node is bounded by Δ, which is usuall...
—This paper presents a group-based security scheme for distributed wireless sensor networks. The scheme is proposed with 3-types of entities: one or more base stations, Y number ...
Md. Abdul Hamid, Md. Mustafizur Rahman, Young Yig ...
We consider an efficient distributed algorithm for determining a dominating and absorbant set of vertices (mobile hosts) in a given directed graph that represents an ad hoc wirel...
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...