18.02.2014 Views

wireless ad hoc networking

wireless ad hoc networking

wireless ad hoc networking

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Coverage and Connectivity of Wireless Sensor Networks 19<br />

Reference times:<br />

Ref 3 Ref 4 Ref 1 Ref 2<br />

0 8 11 14 19T=20 s<br />

Schedule for A<br />

Schedule for B<br />

Schedule for C<br />

Schedule for D<br />

Integrated<br />

schedule of s 1 :<br />

1<br />

2.5<br />

2.5<br />

11 16.5<br />

11<br />

12.5 16.5<br />

12.5<br />

11<br />

T 1 front<br />

T 1 end<br />

Figure 1.10 The schedule of s 1 for the example in Figure 1.9 after joining the<br />

schedules for all grid points covered by s 1 .<br />

inste<strong>ad</strong> of using grid points, this scheme utilizes the result in Ref. [2] by calculating<br />

sensors’ schedules based on the intersection points of their sensing<br />

ranges. This will significantly reduce the computational complexity. Second,<br />

several optimization mechanisms are proposed to balance sensors’<br />

energy consumption by intelligently selecting sensors’ reference times.<br />

In Ref. [13], the first modification is called the 1-Coverage-Preserving<br />

(1-CP) protocol. It <strong>ad</strong>opts the same frame structure as in Ref. [12]. Inste<strong>ad</strong><br />

of considering grid points, this algorithm considers the intersection points<br />

among the perimeters of sensors’ sensing ranges. For example, to calculate<br />

s 1 ’s on-duty schedule, points p, q, and r in Figure 1.11(a) are considered.<br />

The final integrated schedule of s 1 is the union of the schedules for these<br />

intersection points, as shown in Figure 1.11(b). Typically, the number of<br />

intersection points is much less than the number of grid points. So the<br />

computational cost is significantly reduced.<br />

Ref. [13] also proposes an energy-based 1-CP protocol that can intelligently<br />

select sensors’ reference times. To prolong network lifetime, this protocol<br />

utilizes sensors’ remaining energies to balance their energy consumption.<br />

This is achieved in two steps: first, the reference times of sensors with<br />

more energies should be placed more sparsely than those with less energies<br />

in the duration of a round. For example, each round is logically divided into<br />

two zones with different lengths, (0, 3T /4) and (3T /4, T ), where T is the<br />

time duration of a round. A sensor s i with remaining energy E i ranked<br />

at top 50% among its neighbors should choose its reference time randomly<br />

from the larger zone, while a sensor s i with E i ranked at the bottom<br />

50% should choose from the smaller zone. Second, the parameters Tfront<br />

i<br />

and Tend i of s i are also chosen based on E i . For any intersection point p,

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!