Algorithm 2 Border area coverage algorithm, at each cluster head (CH).
INPUT: BCH
OUTPUT: Bactive
1.	for all i ∈ BCH do
2.	Develop ζB, the set of all nodes having no overlapping region with neighbors, using Equation (7)
3.	end for
4.	Bcov ← {BCH \ ζB}
5.	sort Bcov in descending order of covered border length
6.	Bactive ← first element in Bcov
7.	while Complete border is not covered do
8.	for all k ∈ Bcov do
9.	for all i ∈ Bactive && i ≠ k do
10.	if overlap(i, k) < α then
11.	Bactive ← {Bactive ∪ i}
12.	Bcov ← {Bcov \ i}
13.	end if
14.	end for
15.	end for
16.	α = α × 2
17.	end while
18.	Bactive ← {ζB ∪ Bactive}