18.02.2014 Views

wireless ad hoc networking

wireless ad hoc networking

wireless ad hoc networking

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

22 Wireless Ad Hoc Networking<br />

R t =2R s<br />

R s<br />

R t =1.5R s<br />

s 2 s 4<br />

R s s 2<br />

s 4<br />

s 1<br />

s 1<br />

s 3<br />

s 3<br />

s 5<br />

s 5<br />

(a)<br />

(b)<br />

Figure 1.13 An example of the CCP + SPAN execution result. Solid circles mean<br />

sensing ranges R s , and dotted circles mean transmission ranges R t . The dotted<br />

lines between sensors represent communication links between sensors. (a) When<br />

R t = 2R s , 1-coverage implies 1-connectivity, so sensor s 1 can be turned off.<br />

(b) When R t = 1.5R s , sensor s 1 has to stay active to maintain the communication<br />

backbone.<br />

connectivity maintenance protocol. SPAN tries to maintain a communication<br />

backbone to provide connectivity while sensors not on the backbone are<br />

kept in the sleep mode. The CCP-SPAN-integrated protocol decides a sensor<br />

to be active if it satisfies the active principle in CCP or SPAN. Otherwise,<br />

it can enter the sleep mode. For example, in Figure 1.13(b), the R t < 2R s<br />

condition makes the network probably not connected after the coverage<br />

issue is satisfied. Although sensor s 1 is allowed to enter the sleep mode<br />

by CCP, it will be requested to stay active to connect with its neighbors to<br />

form a communication backbone according to SPAN. Note that the resulting<br />

network may remain k-covered but less than k-connected.<br />

Ref. [15] discusses the coverage-connectivity-combined issue by <strong>ad</strong>opting<br />

a probability-based coverage model and the concept of connected<br />

dominating set (CDS). The coverage of any location depends not only on<br />

the sensing ranges of sensors but also on its distances from these sensors.<br />

This probability model is similar to the models discussed in Section 1.2.2.<br />

To compute the coverage of the network, the sensing field is divided into<br />

grids. For each grid point, we compute its detection probability contributed<br />

by nearby sensors. Then, each sensor decides if it should stay active by<br />

observing the redundancy degrees of grid points within its sensing area.<br />

The redundancy degree of a sensor at a grid point is the end result of<br />

comparing the detection probability contributed by this sensor with it by

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

Saved successfully!

Ooh no, something went wrong!