An Efficient Real-Time Routing with Presence of Concave Voids in Wireless Sensor Networks

1. An Efficient Real-Time Routing with Presence of Concave Voids in Wireless Sensor Networks Mohamed Aissani Abdelhamid Mellouk, Nadjib Badache, and Brahim Saidani University of Paris , USTHB University , Polytechnic School ACM IWCMC 2009

2. Outline • Introduction • Problem • Related Works • Assumption • Concave void avoidance scheme • Simulation Results • Conclusions

3. Introduction • Wireless sensor network (WSN) is composed of several sensor nodes deployed and scattered over a specific monitoring region for collecting sensed data. • Moreover, to bypass voids in sensor networks, most existing geographic routing protocols tend to route packets along the boundary nodes.

4. Problem s d

5. Related Works • T. He, J.A. Stankovic, C. Lu and T.F. Abdelzaher, “A Spatiotemporal Communication Protocol for Wireless Sensor Networks,” IEEE Transactions on Parallel and Distributed Systems 16(10): 995-1006, 2005. • Soft Real-Time, QoS Routing and Congestion Management, Traffic Load Balancing, Void Avoidance s d

6. Goal • To prevent data packets from traveling along the boundaries of voids. • To avoid them the concave zones of voids. s d

7. Assumption • Each node can get the location information of itself and of its one-hop neighbors • Sender node marks packets with their destination’s location.

8. Concave void avoidance scheme • Void Discovery Step • Void Announce Step • Packet Rerouting Step

9. Void Discovery Step • Initial phase • Node bi broadcasts a void-beacon packet to its one-hop neighbors s b0 d

10. Void Discovery Step • Initial phase s b0 θ b1 d

11. Void Discovery Step • Intermediate phase b0 b1 ψ d nk

12. Void Discovery Step • Final phase b7 b6 b5 b0 b4 b1 d b2 b3

13. Void Discovery Step • Final phase bj b0 v d bi

14. Void Announce Step SR：average radio range of sensor nodes bj r b0 v R d bi AA

15. Packet Rerouting Step • Sender s node inside the announce area AA s v b1 θ d AA

16. Void Announce Step • Due to the dynamics of a sensor network b7 b6 b5 b0 v b4 b1 d b2 b3

17. Simulation Results

18. Simulation Results

19. Simulation Results

20. Simulation Results

21. Conclusions • This paper proposed an efficient void avoidance scheme for real-time routing protocols. • Proposed scheme prevents data packets from traveling along the boundaries of voids and avoids them the concave zones of voids.

22. Thank you