1. Energy Aware Directed Diffusion for Wireless Sensor Networks Jisul Choe, 2Keecheon Kim Konkuk University, Seoul, Korea jschoe4mbc@gmail.com, kckim@konkuk.ac.kr

2. Outline ◆ 1.Abstract ◆ 2.Introduction ◆ 3.Related work 3.1 Directed Diffusion 3.1 Directed Diffusion 3.2 An Energy Efficient Direct Diffusion Routing 3.2 An Energy Efficient Direct Diffusion Routing Protocol Protocol ◆ 4. EADD: Energy Aware Directed Diffusion 4.1 EADD 4.1 EADD 4.2 The same average available energy 4.2 The same average available energy problem problem 4.3 The relative energy table 4.3 The relative energy table ◆ 5. Result

3. 1.Abstract (1) ◆ Duplicate messages : Reducing duplicate packets is good for energy efficiency. packets is good for energy efficiency. ◆ Directed Diffusion : (1) One of the energy efficient routing protocols. (1) One of the energy efficient routing protocols. (2) Instead of forwarding broadcast packets. (2) Instead of forwarding broadcast packets.

4. 1.Abstract(2) ◆ EADD: ◆ EADD: (1) Depends on each node ’ s available (1) Depends on each node ’ s available energy changes the node ’ s forwarding energy changes the node ’ s forwarding moment. moment. (2) allows the nodes to response more (2) allows the nodes to response more quickly than the node which have quickly than the node which have lower available energy. lower available energy. EADD is helpful to achieve balanced node ’ s energy EADD is helpful to achieve balanced node ’ s energy distribution and extension of network life cycle. distribution and extension of network life cycle.

5. Outline ◆ 1.Abstract ◆ 2.Introduction ◆ 3.Related work 3.1 Directed Diffusion 3.1 Directed Diffusion 3.2 An Energy Efficient Direct Diffusion Routing 3.2 An Energy Efficient Direct Diffusion Routing Protocol Protocol ◆ 4. EADD: Energy Aware Directed Diffusion 4.1 EADD 4.1 EADD 4.2 The same average available energy 4.2 The same average available energy problem problem 4.3 The relative energy table 4.3 The relative energy table ◆ 5. Result

6. 2.Introduction(1) 2.Introduction(1) ◆ Broadcast : moreover sensor nodes are densely deployed. (1)advantage : WSN maintain high connectivity (1)advantage : WSN maintain high connectivity (2)defect : generate numerous duplicate (2)defect : generate numerous duplicate messages messages Consequently, to prevent duplicate messages to be propagated all over network.

7. 2.Introduction(2) 2.Introduction(2) ◆ Energy aware schemes can improve the unbalanced distribution. unbalanced distribution. ◆ EADD : (1) resolve the reinforced path without (1) resolve the reinforced path without comparison. comparison. (2) depends on each node ’ s available (2) depends on each node ’ s available energy to changes the node ’ s energy to changes the node ’ s forwarding moment forwarding moment

8. Outline ◆ 1.Abstract ◆ 2.Introduction ◆ 3.Related work 3.1 Directed Diffusion 3.1 Directed Diffusion 3.2 An Energy Efficient Direct Diffusion Routing 3.2 An Energy Efficient Direct Diffusion Routing Protocol Protocol ◆ 4. EADD: Energy Aware Directed Diffusion 4.1 EADD 4.1 EADD 4.2 The same average available energy 4.2 The same average available energy problem problem 4.3 The relative energy table 4.3 The relative energy table ◆ 5. Result

9. 3. Related work 3.1 Directed Diffusion ◆ The routing protocols in WSN are divided into flat and hierarchical routing protocol [1]. and hierarchical routing protocol [1]. (1) flat routing : every node can equally (1) flat routing : every node can equally participate in routing. participate in routing. (2) hierarchical routing : the network divided (2) hierarchical routing : the network divided into a number of clusters, the into a number of clusters, the nodes located in the cluster always nodes located in the cluster always transmit the data through the transmit the data through the head node. head node. DD is one of the flat routing protocols. DD is one of the flat routing protocols.

10. 1. 2. 3.

11. Outline ◆ 1.Abstract ◆ 2.Introduction ◆ 3.Related work 3.1 Directed Diffusion 3.1 Directed Diffusion 3.2 An Energy Efficient Direct Diffusion Routing 3.2 An Energy Efficient Direct Diffusion Routing Protocol Protocol ◆ 4. EADD: Energy Aware Directed Diffusion 4.1 EADD 4.1 EADD 4.2 The same average available energy 4.2 The same average available energy problem problem 4.3 The relative energy table 4.3 The relative energy table ◆ 5. Result

12. 3.2 An Energy Efficient Direct Diffusion Routing Protocol ◆ For DD: (1) maintain the minimum delay during a certain (1) maintain the minimum delay during a certain period of time. period of time. (2) don ’ t consider about the energy balancing (2) don ’ t consider about the energy balancing to cause decrease the network life cycle. to cause decrease the network life cycle. focus on following considerations: (1) Total communication cost of the path (1) Total communication cost of the path (2) Average remaining energy of the nodes on the path (2) Average remaining energy of the nodes on the path (3) Minimum node energy on the path (3) Minimum node energy on the path (4) Node connectivity (4) Node connectivity

13. Outline ◆ 1.Abstract ◆ 2.Introduction ◆ 3.Related work 3.1 Directed Diffusion 3.1 Directed Diffusion 3.2 An Energy Efficient Direct Diffusion Routing 3.2 An Energy Efficient Direct Diffusion Routing Protocol Protocol ◆ 4. EADD: Energy Aware Directed Diffusion 4.1 EADD 4.1 EADD 4.2 The same average available energy 4.2 The same average available energy problem problem 4.3 The relative energy table 4.3 The relative energy table ◆ 5. Result

14. 4. EADD: Energy Aware Directed Diffusion 4.1 EADD ◆ Let ’ s assume that there are two gradient paths (path X and path Y) which receive same interest message from the sink node. message from the sink node.

15. ◆ DD : just reinforce the first path (fastest path) as soon as sink node set up first gradient path. sink node set up first gradient path. ◆ EADD : path X and Y has different arrival time. If a node has more available energy, the node can get faster has more available energy, the node can get faster response time. response time.

16. ◆ (1)EADD set up a gradient between source and destination, the nodes on gradient should wait until calculated time pass the nodes on gradient should wait until calculated time pass over. over. (2)When a node sets up the gradient with previous node, it (2)When a node sets up the gradient with previous node, it should fix appointed time to forward the gradient to next should fix appointed time to forward the gradient to next node. node.

17. Outline ◆ 1.Abstract ◆ 2.Introduction ◆ 3.Related work 3.1 Directed Diffusion 3.1 Directed Diffusion 3.2 An Energy Efficient Direct Diffusion Routing 3.2 An Energy Efficient Direct Diffusion Routing Protocol Protocol ◆ 4. EADD: Energy Aware Directed Diffusion 4.1 EADD 4.1 EADD 4.2 The same average available energy 4.2 The same average available energy problem problem 4.3 The relative energy table 4.3 The relative energy table ◆ 5. Result

18. 4.2 The same average available energy problem additional MAC field to record the lowest available energy additional MAC field to record the lowest available energy value on each path. value on each path.

19. Outline ◆ 1.Abstract ◆ 2.Introduction ◆ 3.Related work 3.1 Directed Diffusion 3.1 Directed Diffusion 3.2 An Energy Efficient Direct Diffusion Routing 3.2 An Energy Efficient Direct Diffusion Routing Protocol Protocol ◆ 4. EADD: Energy Aware Directed Diffusion 4.1 EADD 4.1 EADD 4.2 The same average available energy 4.2 The same average available energy problem problem 4.3 The relative energy table 4.3 The relative energy table ◆ 5. Result

20. 4.3 The relative energy table

21. Outline ◆ 1.Abstract ◆ 2.Introduction ◆ 3.Related work 3.1 Directed Diffusion 3.1 Directed Diffusion 3.2 An Energy Efficient Direct Diffusion Routing 3.2 An Energy Efficient Direct Diffusion Routing Protocol Protocol ◆ 4. EADD: Energy Aware Directed Diffusion 4.1 EADD 4.1 EADD 4.2 The same average available energy 4.2 The same average available energy problem problem 4.3 The relative energy table 4.3 The relative energy table ◆ 5. Result

22. 5. Result ◆ Restrictions: (1)Each node is located in the point of the square. (1)Each node is located in the point of the square. (2)Gradient path is created only toward arrow direction. (2)Gradient path is created only toward arrow direction. (3)Only shortest path can be the gradient from the source (3)Only shortest path can be the gradient from the source to destination. to destination. (4)Thick arrows mean reinforced path. (4)Thick arrows mean reinforced path. ◆ Assumption: (1)Events take place at the fixed area. (1)Events take place at the fixed area. (2)When set up gradient, a node on the (2)When set up gradient, a node on the gradient consumes 0.2% energy. gradient consumes 0.2% energy. (3)Data transmission consumes 0.4% (3)Data transmission consumes 0.4% energy. energy.