The k-barrier coverage problem is known as the problem of detecting the intruders by at least k sensors when the intruders moving along the crossing paths from one boundary to another. This paper proposes decentralized algorithms to cope with the k-barrier coverage problem. For a given value k, the proposed algorithms find out the maximum disjoint sets of sensors such that each set of sensors meets the requirement of k-barrier coverage for users. Three mechanisms, called Basic, Backtracking, and Branch, are proposed for constructing as more as possible the disjoint sets of sensors that satisfy the requirement of k-barrier coverage. Performance study reveals that the proposed algorithms achieve near-optimal performance.