A Novel Reliable Data Dissemination Protocol for Real-Time Data in Wireless Sensor Networks

1. A Novel Reliable Data Dissemination Protocol for Real-Time Data in Wireless Sensor Networks Seungmin Oh, YongbinYim, Jeongcheol Lee, Hosung Park and Sang-Ha Kim Department of Computer Engineering Chungnam National University IEEE WCNC 2012

2. Outline • Introduction • Goals • Network Model • Proposed Protocol • Performance Evaluation • Conclusion

3. Introduction • Wireless sensor networks (WSNs) typically consist of a large number of sensor nodes and sink nodes. • battlefield surveillance • earthquake response systems Sink node sink Sensor node Flooding Direction Data Collection Direction source

4. Introduction • End-to-end real-time data dissemination • the desired delivery speed from sources to thesink failure Sink node Sensor node Flooding Direction Data Collection Direction

5. Introduction • Timeliness and Reliability • desired time deadline • multiple paths Sink node Sensor node Source node Flooding Direction Data Collection Direction

6. Goals • This paper propose a reliable and real-time service protocol with geographical parallel track concept. • The parallel track provides the guarantee of node-disjoint multipath as disjoint multipath has high reliability of multiple path.

7. Network Model • A large number of homogeneous sensor nodes • Long distance data delivery is performed through multi-hop communication manner • The source nodes that generate event data could be provided the location of sink • Each sensor node is aware of its own location after deployment by receiving GPS signals • Every sensor node has its own neighbor node table including the coordinates and the estimated delay of its neighbors by periodic beacon signaling.

8. Network Model • desired delivery speed Ssetspeed • end-to-end distance D(source,sink) • desired time deadline Tsetdeadline

9. Proposed Protocol

10. Proposed Protocol destination(source node;sink node) desired delivery speed Ssetspeed desired time deadline Tsetdeadline sequence number width of tracks payload Y D f(xd, yd) S f(xs, ys) (0, 0) X

11. Proposed Protocol radio range Y bandwidth 5 Track Level = 3 D f(xd, yd) H 1 h 0 packet size 2 4 S f(xs, ys) 6 (0, 0) X

12. Proposed Protocol • forwarding candidate set

13. Proposed Protocol • forwarding candidate set

14. Proposed Protocol • neighbor node table

15. Proposed Protocol + Y f(x, y) > 0 5 Track Level = 3 D f(xd, yd) H 1 f(x, y) < 0 h 0 2 4 f(x, y) S f(xs, ys) 6 (0, 0) X

16. Proposed Protocol • Prohibiting multiple paths in a track • data packets of caching sequence number

17. Performance Evaluation • Qualnetnetwork simulator version 4.0 • 1,000 sensor nodes • 500m × 500m square area • The radio range ofeach sensor nodes is about 30m • The source node generates30 bytes-data packets with interval 0.05s • The simulation timeis 50s

18. Performance Evaluation

19. Performance Evaluation

20. Performance Evaluation

21. Performance Evaluation

22. Conclusion • Merging path decreases the reliability due to the path failure. • We exploit a geographical parallel tracks for disjoint multipath. • Simulation shows that the proposed protocol is superior to the related studies in terms of the successful data delivery for time deadline and the energy consumption.