A novel gossip-based sensing coverage algorithm for dense wireless sensor networks Vinh Tran-Quang a, Takumi Miyoshi a,b a Graduate School of Engineering,

A novel gossip-based sensing coverage algorithm for dense wireless sensor networks

Vinh Tran-Quang a , Takumi Miyoshi a,b

a Graduate School of Engineering, Shibaura Institute of Technology, Saitama 337-8570, Japanb College of Systems Engineering and Science, Shibaura Institute of Technology, Saitama 337-8570, Japan

Computer Networks

Volume 53, Issue 13, 28 August 2009, Pages 2275-2287

2

Outline

Introduction Definitions and MSCR problem formulation Application of the MSCR algorithm Maximum sensing coverage region algorithm Performance evaluation Conclusion

3

Introduction

In wireless sensor networks Once deployed, however, most applications of

sensor networks expect a long system lifetime. The energy expenditure of sensors has to be

wisely managed by their architectures and protocols to prolong the overall network lifetime.

4

Introduction

In a dense network The sensing areas of different nodes may be

similar and overlap with those of neighboring nodes.

It is important to place or select them so that the monitored area is covered as much as possible without diminishing the overall system coverage.

5

Introduction

We propose a new architecture for routing in large distributed WSNs Removing redundant sensor nodes Permits configurable QoS coverage parameters Low communication overhead

6

Definitions and MSCR problem formulation

Definition 1. The neighbor set of a sensor node si

Communication Range

Sensing Range

Neighbor

Overlapping neighbor

Si Sj

Rs

2Rs

7

Definition 2. The sensing region of a sensor si located at (xi,

yi), denoted by Siregion, is a set of all points within

si’s sensing range. A point p is said to be k-covered if it is within at least k sensors’ sensing regions.

Si

Sj

1-covered2-covered

Definitions and MSCR problem formulation

8

Definition 3. Boundary arc The arc created by two overlapped sensor nodes

si and sj is the arc created by two intersection points between two sensing region boundaries.

)2

),((cos 1

s

ji

R

ssd

Definitions and MSCR problem formulation

0o

90o

180o

270o

9

Definition 4. MSRC (Maximum sensing coverage region)

Given a set of m sensors S=s1, s2, . . . , sm deployed in a desired area and a natural number k

The MSCR problem is the problem of finding a subset S’ guarantees that the whole area is k-covered Achieves a maximum sensing region

SS '

Definitions and MSCR problem formulation

10

Application of the MSCR algorithm

Send sleep_msg. or Send active_msg.

Setup phase

Steady phase

11

Maximum sensing coverage region algorithm

Si

S3

S4

S5

S1

S2

k times

12

Maximum sensing coverage region algorithm

S3

S4

S5

S1

S2

Redundant Node

Si

Send sleep_msg

S3

S3

S3

k=1

13

Performance evaluation

Parameter Value

Initial energy (Einitial) 2 J

Data packet size 500 byte

Broadcast packet size 25 byte

Packet header size 25 byte

Data frames 30

Energy of transceiver electron (Eelec) 50 nJ/bit

Energy for transmission in free space model (Efs)

10 pJ/bit/m2

Energy for transmission in multi-path model (Emp)

0.0013 pJ/bit/m4

Threshold distance (d0) 75 m

14

Performance evaluation

MSCR-LEACHG k=2

Cluster Head

Redundant Node

Active Node

15

Performance evaluation

16

Performance evaluation

17

Performance evaluation

18

Conclusion

We have defined the maximum sensing coverage region problem for randomly distributed WSNs and proposed a gossip-based sensing-coverage-aware algorithm to solve this problem.

Simulation results confirmed Reduced total energy consumption Significantly increased network lifetime