| Date post: | 22-Dec-2015 |
| Category: |
Documents |
| View: | 228 times |
| Download: | 4 times |
Energy Aware Directed Energy Aware Directed Diffusion for Wireless Sensor Diffusion for Wireless Sensor
NetworksNetworks
Jisul Choe 2Keecheon KimJisul Choe 2Keecheon KimKonkuk University Seoul KoreaKonkuk University Seoul Korea
jschoe4mbcgmailcom kckimkonkukackrjschoe4mbcgmailcom kckimkonkukackr
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
1Abstract (1)1Abstract (1)
Duplicate messages Duplicate messages Reducing duplicateReducing duplicate packets is good for energy efficiencypackets is good for energy efficiency
Directed Diffusion Directed Diffusion (1) One of the energy efficient routing protocols(1) One of the energy efficient routing protocols (2) (2) Instead ofInstead of forwarding broadcast packetsforwarding broadcast packets
1Abstract(2)1Abstract(2)
EADD EADD (1) (1) Depends onDepends on each each nodersquos availablenodersquos available energyenergy changes the nodersquos forwardingchanges the nodersquos forwarding momentmoment (2) allows the nodes to response more(2) allows the nodes to response more quickly than the node which havequickly than the node which have lower available energy lower available energy
EADD is EADD is helpful tohelpful to achieve balanced nodersquos energy achieve balanced nodersquos energy distribution and extension of network life cycledistribution and extension of network life cycle
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
2Introduction(1)2Introduction(1)
Broadcast Broadcast moreover sensor nodes are moreover sensor nodes are densely deployeddensely deployed (1)advantage WSN maintain high connectivity (1)advantage WSN maintain high connectivity (2)defect (2)defect generate numerous duplicategenerate numerous duplicate messagesmessages
Consequently to prevent duplicate messages to be propagatedConsequently to prevent duplicate messages to be propagatedall over network all over network
2Introduction(2)2Introduction(2)
Energy aware schemes can Energy aware schemes can improveimprove the the unbalanced distributionunbalanced distribution
EADD EADD (1)(1) resolve the resolve the reinforced path withoutreinforced path without comparisoncomparison (2) depends on each nodersquos available(2) depends on each nodersquos available energy to changes the nodersquosenergy to changes the nodersquos forwarding momentforwarding moment
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
3 Related work3 Related work31 Directed Diffusion31 Directed Diffusion
The routing protocols in WSN are divided into The routing protocols in WSN are divided into flatflat and and hierarchicalhierarchical routing protocol [1] routing protocol [1] (1) (1) flat routingflat routing every node can every node can equallyequally participate in routingparticipate in routing (2) (2) hierarchical routinghierarchical routing the network divided the network divided into into aa number of clustersnumber of clusters the the nodes located in the cluster nodes located in the cluster alwaysalways transmit the data through thetransmit the data through the head nodehead node
DD is one of the DD is one of the flat routingflat routing protocols protocols
1 21 2
33
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
32 An Energy Efficient Direct Diffusion Routing Protocol32 An Energy Efficient Direct Diffusion Routing Protocol
For DD For DD
(1) (1) maintain the minimum delay during a certainmaintain the minimum delay during a certain
period of timeperiod of time
(2) (2) donrsquot consider about the energy balancingdonrsquot consider about the energy balancing
to cause to cause decrease the network life cycledecrease the network life cycle
focus on following considerationsfocus 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
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
4 EADD Energy Aware Directed4 EADD Energy Aware DirectedDiffusionDiffusion
41 EADD41 EADD
Letrsquos assume that there are two gradient paths Letrsquos assume that there are two gradient paths (path X and path Y) which receive same interest(path X and path Y) which receive same interest
message from the sink nodemessage from the sink node
DD DD just reinforce the first path ( just reinforce the first path (fastest pathfastest path) as soon as) as soon as sink node set up first gradient path sink node set up first gradient path
EADD EADD path X and Y has different arrival time If a node path X and Y has different arrival time If a node has more available energy the node can has more available energy the node can get fasterget faster response timeresponse time
(1)EADD set up a gradient between source and destination(1)EADD set up a gradient between source and destination the nodes on gradient should the nodes on gradient should wait until calculated time passwait until calculated time pass overover (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 should fix appointed timefix appointed time to forward the gradient to to forward the gradient to nextnext nodenode
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy 42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
42 The same average available energy problem42 The same average available energy problem
additional MAC field to record the lowest available energyadditional MAC field to record the lowest available energy value on each pathvalue on each path
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
43 The relative energy table43 The relative energy table
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
5 Result5 Result RestrictionsRestrictions (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 destinationto destination (4)Thick arrows mean reinforced path(4)Thick arrows mean reinforced path
AssumptionAssumption1048698 1048698 (1)Events take place at the fixed area(1)Events take place at the fixed area1048698 1048698 (2)When set up gradient a node on the(2)When set up gradient a node on the gradient consumes 02 energygradient consumes 02 energy1048698 1048698 (3)Data transmission consumes 04(3)Data transmission consumes 04 energyenergy
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
1Abstract (1)1Abstract (1)
Duplicate messages Duplicate messages Reducing duplicateReducing duplicate packets is good for energy efficiencypackets is good for energy efficiency
Directed Diffusion Directed Diffusion (1) One of the energy efficient routing protocols(1) One of the energy efficient routing protocols (2) (2) Instead ofInstead of forwarding broadcast packetsforwarding broadcast packets
1Abstract(2)1Abstract(2)
EADD EADD (1) (1) Depends onDepends on each each nodersquos availablenodersquos available energyenergy changes the nodersquos forwardingchanges the nodersquos forwarding momentmoment (2) allows the nodes to response more(2) allows the nodes to response more quickly than the node which havequickly than the node which have lower available energy lower available energy
EADD is EADD is helpful tohelpful to achieve balanced nodersquos energy achieve balanced nodersquos energy distribution and extension of network life cycledistribution and extension of network life cycle
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
2Introduction(1)2Introduction(1)
Broadcast Broadcast moreover sensor nodes are moreover sensor nodes are densely deployeddensely deployed (1)advantage WSN maintain high connectivity (1)advantage WSN maintain high connectivity (2)defect (2)defect generate numerous duplicategenerate numerous duplicate messagesmessages
Consequently to prevent duplicate messages to be propagatedConsequently to prevent duplicate messages to be propagatedall over network all over network
2Introduction(2)2Introduction(2)
Energy aware schemes can Energy aware schemes can improveimprove the the unbalanced distributionunbalanced distribution
EADD EADD (1)(1) resolve the resolve the reinforced path withoutreinforced path without comparisoncomparison (2) depends on each nodersquos available(2) depends on each nodersquos available energy to changes the nodersquosenergy to changes the nodersquos forwarding momentforwarding moment
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
3 Related work3 Related work31 Directed Diffusion31 Directed Diffusion
The routing protocols in WSN are divided into The routing protocols in WSN are divided into flatflat and and hierarchicalhierarchical routing protocol [1] routing protocol [1] (1) (1) flat routingflat routing every node can every node can equallyequally participate in routingparticipate in routing (2) (2) hierarchical routinghierarchical routing the network divided the network divided into into aa number of clustersnumber of clusters the the nodes located in the cluster nodes located in the cluster alwaysalways transmit the data through thetransmit the data through the head nodehead node
DD is one of the DD is one of the flat routingflat routing protocols protocols
1 21 2
33
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
32 An Energy Efficient Direct Diffusion Routing Protocol32 An Energy Efficient Direct Diffusion Routing Protocol
For DD For DD
(1) (1) maintain the minimum delay during a certainmaintain the minimum delay during a certain
period of timeperiod of time
(2) (2) donrsquot consider about the energy balancingdonrsquot consider about the energy balancing
to cause to cause decrease the network life cycledecrease the network life cycle
focus on following considerationsfocus 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
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
4 EADD Energy Aware Directed4 EADD Energy Aware DirectedDiffusionDiffusion
41 EADD41 EADD
Letrsquos assume that there are two gradient paths Letrsquos assume that there are two gradient paths (path X and path Y) which receive same interest(path X and path Y) which receive same interest
message from the sink nodemessage from the sink node
DD DD just reinforce the first path ( just reinforce the first path (fastest pathfastest path) as soon as) as soon as sink node set up first gradient path sink node set up first gradient path
EADD EADD path X and Y has different arrival time If a node path X and Y has different arrival time If a node has more available energy the node can has more available energy the node can get fasterget faster response timeresponse time
(1)EADD set up a gradient between source and destination(1)EADD set up a gradient between source and destination the nodes on gradient should the nodes on gradient should wait until calculated time passwait until calculated time pass overover (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 should fix appointed timefix appointed time to forward the gradient to to forward the gradient to nextnext nodenode
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy 42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
42 The same average available energy problem42 The same average available energy problem
additional MAC field to record the lowest available energyadditional MAC field to record the lowest available energy value on each pathvalue on each path
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
43 The relative energy table43 The relative energy table
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
5 Result5 Result RestrictionsRestrictions (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 destinationto destination (4)Thick arrows mean reinforced path(4)Thick arrows mean reinforced path
AssumptionAssumption1048698 1048698 (1)Events take place at the fixed area(1)Events take place at the fixed area1048698 1048698 (2)When set up gradient a node on the(2)When set up gradient a node on the gradient consumes 02 energygradient consumes 02 energy1048698 1048698 (3)Data transmission consumes 04(3)Data transmission consumes 04 energyenergy
1Abstract (1)1Abstract (1)
Duplicate messages Duplicate messages Reducing duplicateReducing duplicate packets is good for energy efficiencypackets is good for energy efficiency
Directed Diffusion Directed Diffusion (1) One of the energy efficient routing protocols(1) One of the energy efficient routing protocols (2) (2) Instead ofInstead of forwarding broadcast packetsforwarding broadcast packets
1Abstract(2)1Abstract(2)
EADD EADD (1) (1) Depends onDepends on each each nodersquos availablenodersquos available energyenergy changes the nodersquos forwardingchanges the nodersquos forwarding momentmoment (2) allows the nodes to response more(2) allows the nodes to response more quickly than the node which havequickly than the node which have lower available energy lower available energy
EADD is EADD is helpful tohelpful to achieve balanced nodersquos energy achieve balanced nodersquos energy distribution and extension of network life cycledistribution and extension of network life cycle
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
2Introduction(1)2Introduction(1)
Broadcast Broadcast moreover sensor nodes are moreover sensor nodes are densely deployeddensely deployed (1)advantage WSN maintain high connectivity (1)advantage WSN maintain high connectivity (2)defect (2)defect generate numerous duplicategenerate numerous duplicate messagesmessages
Consequently to prevent duplicate messages to be propagatedConsequently to prevent duplicate messages to be propagatedall over network all over network
2Introduction(2)2Introduction(2)
Energy aware schemes can Energy aware schemes can improveimprove the the unbalanced distributionunbalanced distribution
EADD EADD (1)(1) resolve the resolve the reinforced path withoutreinforced path without comparisoncomparison (2) depends on each nodersquos available(2) depends on each nodersquos available energy to changes the nodersquosenergy to changes the nodersquos forwarding momentforwarding moment
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
3 Related work3 Related work31 Directed Diffusion31 Directed Diffusion
The routing protocols in WSN are divided into The routing protocols in WSN are divided into flatflat and and hierarchicalhierarchical routing protocol [1] routing protocol [1] (1) (1) flat routingflat routing every node can every node can equallyequally participate in routingparticipate in routing (2) (2) hierarchical routinghierarchical routing the network divided the network divided into into aa number of clustersnumber of clusters the the nodes located in the cluster nodes located in the cluster alwaysalways transmit the data through thetransmit the data through the head nodehead node
DD is one of the DD is one of the flat routingflat routing protocols protocols
1 21 2
33
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
32 An Energy Efficient Direct Diffusion Routing Protocol32 An Energy Efficient Direct Diffusion Routing Protocol
For DD For DD
(1) (1) maintain the minimum delay during a certainmaintain the minimum delay during a certain
period of timeperiod of time
(2) (2) donrsquot consider about the energy balancingdonrsquot consider about the energy balancing
to cause to cause decrease the network life cycledecrease the network life cycle
focus on following considerationsfocus 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
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
4 EADD Energy Aware Directed4 EADD Energy Aware DirectedDiffusionDiffusion
41 EADD41 EADD
Letrsquos assume that there are two gradient paths Letrsquos assume that there are two gradient paths (path X and path Y) which receive same interest(path X and path Y) which receive same interest
message from the sink nodemessage from the sink node
DD DD just reinforce the first path ( just reinforce the first path (fastest pathfastest path) as soon as) as soon as sink node set up first gradient path sink node set up first gradient path
EADD EADD path X and Y has different arrival time If a node path X and Y has different arrival time If a node has more available energy the node can has more available energy the node can get fasterget faster response timeresponse time
(1)EADD set up a gradient between source and destination(1)EADD set up a gradient between source and destination the nodes on gradient should the nodes on gradient should wait until calculated time passwait until calculated time pass overover (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 should fix appointed timefix appointed time to forward the gradient to to forward the gradient to nextnext nodenode
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy 42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
42 The same average available energy problem42 The same average available energy problem
additional MAC field to record the lowest available energyadditional MAC field to record the lowest available energy value on each pathvalue on each path
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
43 The relative energy table43 The relative energy table
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
5 Result5 Result RestrictionsRestrictions (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 destinationto destination (4)Thick arrows mean reinforced path(4)Thick arrows mean reinforced path
AssumptionAssumption1048698 1048698 (1)Events take place at the fixed area(1)Events take place at the fixed area1048698 1048698 (2)When set up gradient a node on the(2)When set up gradient a node on the gradient consumes 02 energygradient consumes 02 energy1048698 1048698 (3)Data transmission consumes 04(3)Data transmission consumes 04 energyenergy
1Abstract(2)1Abstract(2)
EADD EADD (1) (1) Depends onDepends on each each nodersquos availablenodersquos available energyenergy changes the nodersquos forwardingchanges the nodersquos forwarding momentmoment (2) allows the nodes to response more(2) allows the nodes to response more quickly than the node which havequickly than the node which have lower available energy lower available energy
EADD is EADD is helpful tohelpful to achieve balanced nodersquos energy achieve balanced nodersquos energy distribution and extension of network life cycledistribution and extension of network life cycle
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
2Introduction(1)2Introduction(1)
Broadcast Broadcast moreover sensor nodes are moreover sensor nodes are densely deployeddensely deployed (1)advantage WSN maintain high connectivity (1)advantage WSN maintain high connectivity (2)defect (2)defect generate numerous duplicategenerate numerous duplicate messagesmessages
Consequently to prevent duplicate messages to be propagatedConsequently to prevent duplicate messages to be propagatedall over network all over network
2Introduction(2)2Introduction(2)
Energy aware schemes can Energy aware schemes can improveimprove the the unbalanced distributionunbalanced distribution
EADD EADD (1)(1) resolve the resolve the reinforced path withoutreinforced path without comparisoncomparison (2) depends on each nodersquos available(2) depends on each nodersquos available energy to changes the nodersquosenergy to changes the nodersquos forwarding momentforwarding moment
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
3 Related work3 Related work31 Directed Diffusion31 Directed Diffusion
The routing protocols in WSN are divided into The routing protocols in WSN are divided into flatflat and and hierarchicalhierarchical routing protocol [1] routing protocol [1] (1) (1) flat routingflat routing every node can every node can equallyequally participate in routingparticipate in routing (2) (2) hierarchical routinghierarchical routing the network divided the network divided into into aa number of clustersnumber of clusters the the nodes located in the cluster nodes located in the cluster alwaysalways transmit the data through thetransmit the data through the head nodehead node
DD is one of the DD is one of the flat routingflat routing protocols protocols
1 21 2
33
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
32 An Energy Efficient Direct Diffusion Routing Protocol32 An Energy Efficient Direct Diffusion Routing Protocol
For DD For DD
(1) (1) maintain the minimum delay during a certainmaintain the minimum delay during a certain
period of timeperiod of time
(2) (2) donrsquot consider about the energy balancingdonrsquot consider about the energy balancing
to cause to cause decrease the network life cycledecrease the network life cycle
focus on following considerationsfocus 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
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
4 EADD Energy Aware Directed4 EADD Energy Aware DirectedDiffusionDiffusion
41 EADD41 EADD
Letrsquos assume that there are two gradient paths Letrsquos assume that there are two gradient paths (path X and path Y) which receive same interest(path X and path Y) which receive same interest
message from the sink nodemessage from the sink node
DD DD just reinforce the first path ( just reinforce the first path (fastest pathfastest path) as soon as) as soon as sink node set up first gradient path sink node set up first gradient path
EADD EADD path X and Y has different arrival time If a node path X and Y has different arrival time If a node has more available energy the node can has more available energy the node can get fasterget faster response timeresponse time
(1)EADD set up a gradient between source and destination(1)EADD set up a gradient between source and destination the nodes on gradient should the nodes on gradient should wait until calculated time passwait until calculated time pass overover (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 should fix appointed timefix appointed time to forward the gradient to to forward the gradient to nextnext nodenode
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy 42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
42 The same average available energy problem42 The same average available energy problem
additional MAC field to record the lowest available energyadditional MAC field to record the lowest available energy value on each pathvalue on each path
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
43 The relative energy table43 The relative energy table
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
5 Result5 Result RestrictionsRestrictions (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 destinationto destination (4)Thick arrows mean reinforced path(4)Thick arrows mean reinforced path
AssumptionAssumption1048698 1048698 (1)Events take place at the fixed area(1)Events take place at the fixed area1048698 1048698 (2)When set up gradient a node on the(2)When set up gradient a node on the gradient consumes 02 energygradient consumes 02 energy1048698 1048698 (3)Data transmission consumes 04(3)Data transmission consumes 04 energyenergy
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
2Introduction(1)2Introduction(1)
Broadcast Broadcast moreover sensor nodes are moreover sensor nodes are densely deployeddensely deployed (1)advantage WSN maintain high connectivity (1)advantage WSN maintain high connectivity (2)defect (2)defect generate numerous duplicategenerate numerous duplicate messagesmessages
Consequently to prevent duplicate messages to be propagatedConsequently to prevent duplicate messages to be propagatedall over network all over network
2Introduction(2)2Introduction(2)
Energy aware schemes can Energy aware schemes can improveimprove the the unbalanced distributionunbalanced distribution
EADD EADD (1)(1) resolve the resolve the reinforced path withoutreinforced path without comparisoncomparison (2) depends on each nodersquos available(2) depends on each nodersquos available energy to changes the nodersquosenergy to changes the nodersquos forwarding momentforwarding moment
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
3 Related work3 Related work31 Directed Diffusion31 Directed Diffusion
The routing protocols in WSN are divided into The routing protocols in WSN are divided into flatflat and and hierarchicalhierarchical routing protocol [1] routing protocol [1] (1) (1) flat routingflat routing every node can every node can equallyequally participate in routingparticipate in routing (2) (2) hierarchical routinghierarchical routing the network divided the network divided into into aa number of clustersnumber of clusters the the nodes located in the cluster nodes located in the cluster alwaysalways transmit the data through thetransmit the data through the head nodehead node
DD is one of the DD is one of the flat routingflat routing protocols protocols
1 21 2
33
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
32 An Energy Efficient Direct Diffusion Routing Protocol32 An Energy Efficient Direct Diffusion Routing Protocol
For DD For DD
(1) (1) maintain the minimum delay during a certainmaintain the minimum delay during a certain
period of timeperiod of time
(2) (2) donrsquot consider about the energy balancingdonrsquot consider about the energy balancing
to cause to cause decrease the network life cycledecrease the network life cycle
focus on following considerationsfocus 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
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
4 EADD Energy Aware Directed4 EADD Energy Aware DirectedDiffusionDiffusion
41 EADD41 EADD
Letrsquos assume that there are two gradient paths Letrsquos assume that there are two gradient paths (path X and path Y) which receive same interest(path X and path Y) which receive same interest
message from the sink nodemessage from the sink node
DD DD just reinforce the first path ( just reinforce the first path (fastest pathfastest path) as soon as) as soon as sink node set up first gradient path sink node set up first gradient path
EADD EADD path X and Y has different arrival time If a node path X and Y has different arrival time If a node has more available energy the node can has more available energy the node can get fasterget faster response timeresponse time
(1)EADD set up a gradient between source and destination(1)EADD set up a gradient between source and destination the nodes on gradient should the nodes on gradient should wait until calculated time passwait until calculated time pass overover (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 should fix appointed timefix appointed time to forward the gradient to to forward the gradient to nextnext nodenode
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy 42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
42 The same average available energy problem42 The same average available energy problem
additional MAC field to record the lowest available energyadditional MAC field to record the lowest available energy value on each pathvalue on each path
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
43 The relative energy table43 The relative energy table
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
5 Result5 Result RestrictionsRestrictions (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 destinationto destination (4)Thick arrows mean reinforced path(4)Thick arrows mean reinforced path
AssumptionAssumption1048698 1048698 (1)Events take place at the fixed area(1)Events take place at the fixed area1048698 1048698 (2)When set up gradient a node on the(2)When set up gradient a node on the gradient consumes 02 energygradient consumes 02 energy1048698 1048698 (3)Data transmission consumes 04(3)Data transmission consumes 04 energyenergy
2Introduction(1)2Introduction(1)
Broadcast Broadcast moreover sensor nodes are moreover sensor nodes are densely deployeddensely deployed (1)advantage WSN maintain high connectivity (1)advantage WSN maintain high connectivity (2)defect (2)defect generate numerous duplicategenerate numerous duplicate messagesmessages
Consequently to prevent duplicate messages to be propagatedConsequently to prevent duplicate messages to be propagatedall over network all over network
2Introduction(2)2Introduction(2)
Energy aware schemes can Energy aware schemes can improveimprove the the unbalanced distributionunbalanced distribution
EADD EADD (1)(1) resolve the resolve the reinforced path withoutreinforced path without comparisoncomparison (2) depends on each nodersquos available(2) depends on each nodersquos available energy to changes the nodersquosenergy to changes the nodersquos forwarding momentforwarding moment
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
3 Related work3 Related work31 Directed Diffusion31 Directed Diffusion
The routing protocols in WSN are divided into The routing protocols in WSN are divided into flatflat and and hierarchicalhierarchical routing protocol [1] routing protocol [1] (1) (1) flat routingflat routing every node can every node can equallyequally participate in routingparticipate in routing (2) (2) hierarchical routinghierarchical routing the network divided the network divided into into aa number of clustersnumber of clusters the the nodes located in the cluster nodes located in the cluster alwaysalways transmit the data through thetransmit the data through the head nodehead node
DD is one of the DD is one of the flat routingflat routing protocols protocols
1 21 2
33
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
32 An Energy Efficient Direct Diffusion Routing Protocol32 An Energy Efficient Direct Diffusion Routing Protocol
For DD For DD
(1) (1) maintain the minimum delay during a certainmaintain the minimum delay during a certain
period of timeperiod of time
(2) (2) donrsquot consider about the energy balancingdonrsquot consider about the energy balancing
to cause to cause decrease the network life cycledecrease the network life cycle
focus on following considerationsfocus 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
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
4 EADD Energy Aware Directed4 EADD Energy Aware DirectedDiffusionDiffusion
41 EADD41 EADD
Letrsquos assume that there are two gradient paths Letrsquos assume that there are two gradient paths (path X and path Y) which receive same interest(path X and path Y) which receive same interest
message from the sink nodemessage from the sink node
DD DD just reinforce the first path ( just reinforce the first path (fastest pathfastest path) as soon as) as soon as sink node set up first gradient path sink node set up first gradient path
EADD EADD path X and Y has different arrival time If a node path X and Y has different arrival time If a node has more available energy the node can has more available energy the node can get fasterget faster response timeresponse time
(1)EADD set up a gradient between source and destination(1)EADD set up a gradient between source and destination the nodes on gradient should the nodes on gradient should wait until calculated time passwait until calculated time pass overover (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 should fix appointed timefix appointed time to forward the gradient to to forward the gradient to nextnext nodenode
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy 42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
42 The same average available energy problem42 The same average available energy problem
additional MAC field to record the lowest available energyadditional MAC field to record the lowest available energy value on each pathvalue on each path
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
43 The relative energy table43 The relative energy table
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
5 Result5 Result RestrictionsRestrictions (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 destinationto destination (4)Thick arrows mean reinforced path(4)Thick arrows mean reinforced path
AssumptionAssumption1048698 1048698 (1)Events take place at the fixed area(1)Events take place at the fixed area1048698 1048698 (2)When set up gradient a node on the(2)When set up gradient a node on the gradient consumes 02 energygradient consumes 02 energy1048698 1048698 (3)Data transmission consumes 04(3)Data transmission consumes 04 energyenergy
2Introduction(2)2Introduction(2)
Energy aware schemes can Energy aware schemes can improveimprove the the unbalanced distributionunbalanced distribution
EADD EADD (1)(1) resolve the resolve the reinforced path withoutreinforced path without comparisoncomparison (2) depends on each nodersquos available(2) depends on each nodersquos available energy to changes the nodersquosenergy to changes the nodersquos forwarding momentforwarding moment
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
3 Related work3 Related work31 Directed Diffusion31 Directed Diffusion
The routing protocols in WSN are divided into The routing protocols in WSN are divided into flatflat and and hierarchicalhierarchical routing protocol [1] routing protocol [1] (1) (1) flat routingflat routing every node can every node can equallyequally participate in routingparticipate in routing (2) (2) hierarchical routinghierarchical routing the network divided the network divided into into aa number of clustersnumber of clusters the the nodes located in the cluster nodes located in the cluster alwaysalways transmit the data through thetransmit the data through the head nodehead node
DD is one of the DD is one of the flat routingflat routing protocols protocols
1 21 2
33
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
32 An Energy Efficient Direct Diffusion Routing Protocol32 An Energy Efficient Direct Diffusion Routing Protocol
For DD For DD
(1) (1) maintain the minimum delay during a certainmaintain the minimum delay during a certain
period of timeperiod of time
(2) (2) donrsquot consider about the energy balancingdonrsquot consider about the energy balancing
to cause to cause decrease the network life cycledecrease the network life cycle
focus on following considerationsfocus 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
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
4 EADD Energy Aware Directed4 EADD Energy Aware DirectedDiffusionDiffusion
41 EADD41 EADD
Letrsquos assume that there are two gradient paths Letrsquos assume that there are two gradient paths (path X and path Y) which receive same interest(path X and path Y) which receive same interest
message from the sink nodemessage from the sink node
DD DD just reinforce the first path ( just reinforce the first path (fastest pathfastest path) as soon as) as soon as sink node set up first gradient path sink node set up first gradient path
EADD EADD path X and Y has different arrival time If a node path X and Y has different arrival time If a node has more available energy the node can has more available energy the node can get fasterget faster response timeresponse time
(1)EADD set up a gradient between source and destination(1)EADD set up a gradient between source and destination the nodes on gradient should the nodes on gradient should wait until calculated time passwait until calculated time pass overover (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 should fix appointed timefix appointed time to forward the gradient to to forward the gradient to nextnext nodenode
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy 42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
42 The same average available energy problem42 The same average available energy problem
additional MAC field to record the lowest available energyadditional MAC field to record the lowest available energy value on each pathvalue on each path
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
43 The relative energy table43 The relative energy table
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
5 Result5 Result RestrictionsRestrictions (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 destinationto destination (4)Thick arrows mean reinforced path(4)Thick arrows mean reinforced path
AssumptionAssumption1048698 1048698 (1)Events take place at the fixed area(1)Events take place at the fixed area1048698 1048698 (2)When set up gradient a node on the(2)When set up gradient a node on the gradient consumes 02 energygradient consumes 02 energy1048698 1048698 (3)Data transmission consumes 04(3)Data transmission consumes 04 energyenergy
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
3 Related work3 Related work31 Directed Diffusion31 Directed Diffusion
The routing protocols in WSN are divided into The routing protocols in WSN are divided into flatflat and and hierarchicalhierarchical routing protocol [1] routing protocol [1] (1) (1) flat routingflat routing every node can every node can equallyequally participate in routingparticipate in routing (2) (2) hierarchical routinghierarchical routing the network divided the network divided into into aa number of clustersnumber of clusters the the nodes located in the cluster nodes located in the cluster alwaysalways transmit the data through thetransmit the data through the head nodehead node
DD is one of the DD is one of the flat routingflat routing protocols protocols
1 21 2
33
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
32 An Energy Efficient Direct Diffusion Routing Protocol32 An Energy Efficient Direct Diffusion Routing Protocol
For DD For DD
(1) (1) maintain the minimum delay during a certainmaintain the minimum delay during a certain
period of timeperiod of time
(2) (2) donrsquot consider about the energy balancingdonrsquot consider about the energy balancing
to cause to cause decrease the network life cycledecrease the network life cycle
focus on following considerationsfocus 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
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
4 EADD Energy Aware Directed4 EADD Energy Aware DirectedDiffusionDiffusion
41 EADD41 EADD
Letrsquos assume that there are two gradient paths Letrsquos assume that there are two gradient paths (path X and path Y) which receive same interest(path X and path Y) which receive same interest
message from the sink nodemessage from the sink node
DD DD just reinforce the first path ( just reinforce the first path (fastest pathfastest path) as soon as) as soon as sink node set up first gradient path sink node set up first gradient path
EADD EADD path X and Y has different arrival time If a node path X and Y has different arrival time If a node has more available energy the node can has more available energy the node can get fasterget faster response timeresponse time
(1)EADD set up a gradient between source and destination(1)EADD set up a gradient between source and destination the nodes on gradient should the nodes on gradient should wait until calculated time passwait until calculated time pass overover (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 should fix appointed timefix appointed time to forward the gradient to to forward the gradient to nextnext nodenode
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy 42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
42 The same average available energy problem42 The same average available energy problem
additional MAC field to record the lowest available energyadditional MAC field to record the lowest available energy value on each pathvalue on each path
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
43 The relative energy table43 The relative energy table
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
5 Result5 Result RestrictionsRestrictions (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 destinationto destination (4)Thick arrows mean reinforced path(4)Thick arrows mean reinforced path
AssumptionAssumption1048698 1048698 (1)Events take place at the fixed area(1)Events take place at the fixed area1048698 1048698 (2)When set up gradient a node on the(2)When set up gradient a node on the gradient consumes 02 energygradient consumes 02 energy1048698 1048698 (3)Data transmission consumes 04(3)Data transmission consumes 04 energyenergy
3 Related work3 Related work31 Directed Diffusion31 Directed Diffusion
The routing protocols in WSN are divided into The routing protocols in WSN are divided into flatflat and and hierarchicalhierarchical routing protocol [1] routing protocol [1] (1) (1) flat routingflat routing every node can every node can equallyequally participate in routingparticipate in routing (2) (2) hierarchical routinghierarchical routing the network divided the network divided into into aa number of clustersnumber of clusters the the nodes located in the cluster nodes located in the cluster alwaysalways transmit the data through thetransmit the data through the head nodehead node
DD is one of the DD is one of the flat routingflat routing protocols protocols
1 21 2
33
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
32 An Energy Efficient Direct Diffusion Routing Protocol32 An Energy Efficient Direct Diffusion Routing Protocol
For DD For DD
(1) (1) maintain the minimum delay during a certainmaintain the minimum delay during a certain
period of timeperiod of time
(2) (2) donrsquot consider about the energy balancingdonrsquot consider about the energy balancing
to cause to cause decrease the network life cycledecrease the network life cycle
focus on following considerationsfocus 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
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
4 EADD Energy Aware Directed4 EADD Energy Aware DirectedDiffusionDiffusion
41 EADD41 EADD
Letrsquos assume that there are two gradient paths Letrsquos assume that there are two gradient paths (path X and path Y) which receive same interest(path X and path Y) which receive same interest
message from the sink nodemessage from the sink node
DD DD just reinforce the first path ( just reinforce the first path (fastest pathfastest path) as soon as) as soon as sink node set up first gradient path sink node set up first gradient path
EADD EADD path X and Y has different arrival time If a node path X and Y has different arrival time If a node has more available energy the node can has more available energy the node can get fasterget faster response timeresponse time
(1)EADD set up a gradient between source and destination(1)EADD set up a gradient between source and destination the nodes on gradient should the nodes on gradient should wait until calculated time passwait until calculated time pass overover (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 should fix appointed timefix appointed time to forward the gradient to to forward the gradient to nextnext nodenode
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy 42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
42 The same average available energy problem42 The same average available energy problem
additional MAC field to record the lowest available energyadditional MAC field to record the lowest available energy value on each pathvalue on each path
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
43 The relative energy table43 The relative energy table
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
5 Result5 Result RestrictionsRestrictions (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 destinationto destination (4)Thick arrows mean reinforced path(4)Thick arrows mean reinforced path
AssumptionAssumption1048698 1048698 (1)Events take place at the fixed area(1)Events take place at the fixed area1048698 1048698 (2)When set up gradient a node on the(2)When set up gradient a node on the gradient consumes 02 energygradient consumes 02 energy1048698 1048698 (3)Data transmission consumes 04(3)Data transmission consumes 04 energyenergy
1 21 2
33
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
32 An Energy Efficient Direct Diffusion Routing Protocol32 An Energy Efficient Direct Diffusion Routing Protocol
For DD For DD
(1) (1) maintain the minimum delay during a certainmaintain the minimum delay during a certain
period of timeperiod of time
(2) (2) donrsquot consider about the energy balancingdonrsquot consider about the energy balancing
to cause to cause decrease the network life cycledecrease the network life cycle
focus on following considerationsfocus 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
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
4 EADD Energy Aware Directed4 EADD Energy Aware DirectedDiffusionDiffusion
41 EADD41 EADD
Letrsquos assume that there are two gradient paths Letrsquos assume that there are two gradient paths (path X and path Y) which receive same interest(path X and path Y) which receive same interest
message from the sink nodemessage from the sink node
DD DD just reinforce the first path ( just reinforce the first path (fastest pathfastest path) as soon as) as soon as sink node set up first gradient path sink node set up first gradient path
EADD EADD path X and Y has different arrival time If a node path X and Y has different arrival time If a node has more available energy the node can has more available energy the node can get fasterget faster response timeresponse time
(1)EADD set up a gradient between source and destination(1)EADD set up a gradient between source and destination the nodes on gradient should the nodes on gradient should wait until calculated time passwait until calculated time pass overover (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 should fix appointed timefix appointed time to forward the gradient to to forward the gradient to nextnext nodenode
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy 42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
42 The same average available energy problem42 The same average available energy problem
additional MAC field to record the lowest available energyadditional MAC field to record the lowest available energy value on each pathvalue on each path
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
43 The relative energy table43 The relative energy table
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
5 Result5 Result RestrictionsRestrictions (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 destinationto destination (4)Thick arrows mean reinforced path(4)Thick arrows mean reinforced path
AssumptionAssumption1048698 1048698 (1)Events take place at the fixed area(1)Events take place at the fixed area1048698 1048698 (2)When set up gradient a node on the(2)When set up gradient a node on the gradient consumes 02 energygradient consumes 02 energy1048698 1048698 (3)Data transmission consumes 04(3)Data transmission consumes 04 energyenergy
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
32 An Energy Efficient Direct Diffusion Routing Protocol32 An Energy Efficient Direct Diffusion Routing Protocol
For DD For DD
(1) (1) maintain the minimum delay during a certainmaintain the minimum delay during a certain
period of timeperiod of time
(2) (2) donrsquot consider about the energy balancingdonrsquot consider about the energy balancing
to cause to cause decrease the network life cycledecrease the network life cycle
focus on following considerationsfocus 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
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
4 EADD Energy Aware Directed4 EADD Energy Aware DirectedDiffusionDiffusion
41 EADD41 EADD
Letrsquos assume that there are two gradient paths Letrsquos assume that there are two gradient paths (path X and path Y) which receive same interest(path X and path Y) which receive same interest
message from the sink nodemessage from the sink node
DD DD just reinforce the first path ( just reinforce the first path (fastest pathfastest path) as soon as) as soon as sink node set up first gradient path sink node set up first gradient path
EADD EADD path X and Y has different arrival time If a node path X and Y has different arrival time If a node has more available energy the node can has more available energy the node can get fasterget faster response timeresponse time
(1)EADD set up a gradient between source and destination(1)EADD set up a gradient between source and destination the nodes on gradient should the nodes on gradient should wait until calculated time passwait until calculated time pass overover (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 should fix appointed timefix appointed time to forward the gradient to to forward the gradient to nextnext nodenode
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy 42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
42 The same average available energy problem42 The same average available energy problem
additional MAC field to record the lowest available energyadditional MAC field to record the lowest available energy value on each pathvalue on each path
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
43 The relative energy table43 The relative energy table
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
5 Result5 Result RestrictionsRestrictions (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 destinationto destination (4)Thick arrows mean reinforced path(4)Thick arrows mean reinforced path
AssumptionAssumption1048698 1048698 (1)Events take place at the fixed area(1)Events take place at the fixed area1048698 1048698 (2)When set up gradient a node on the(2)When set up gradient a node on the gradient consumes 02 energygradient consumes 02 energy1048698 1048698 (3)Data transmission consumes 04(3)Data transmission consumes 04 energyenergy
32 An Energy Efficient Direct Diffusion Routing Protocol32 An Energy Efficient Direct Diffusion Routing Protocol
For DD For DD
(1) (1) maintain the minimum delay during a certainmaintain the minimum delay during a certain
period of timeperiod of time
(2) (2) donrsquot consider about the energy balancingdonrsquot consider about the energy balancing
to cause to cause decrease the network life cycledecrease the network life cycle
focus on following considerationsfocus 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
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
4 EADD Energy Aware Directed4 EADD Energy Aware DirectedDiffusionDiffusion
41 EADD41 EADD
Letrsquos assume that there are two gradient paths Letrsquos assume that there are two gradient paths (path X and path Y) which receive same interest(path X and path Y) which receive same interest
message from the sink nodemessage from the sink node
DD DD just reinforce the first path ( just reinforce the first path (fastest pathfastest path) as soon as) as soon as sink node set up first gradient path sink node set up first gradient path
EADD EADD path X and Y has different arrival time If a node path X and Y has different arrival time If a node has more available energy the node can has more available energy the node can get fasterget faster response timeresponse time
(1)EADD set up a gradient between source and destination(1)EADD set up a gradient between source and destination the nodes on gradient should the nodes on gradient should wait until calculated time passwait until calculated time pass overover (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 should fix appointed timefix appointed time to forward the gradient to to forward the gradient to nextnext nodenode
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy 42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
42 The same average available energy problem42 The same average available energy problem
additional MAC field to record the lowest available energyadditional MAC field to record the lowest available energy value on each pathvalue on each path
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
43 The relative energy table43 The relative energy table
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
5 Result5 Result RestrictionsRestrictions (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 destinationto destination (4)Thick arrows mean reinforced path(4)Thick arrows mean reinforced path
AssumptionAssumption1048698 1048698 (1)Events take place at the fixed area(1)Events take place at the fixed area1048698 1048698 (2)When set up gradient a node on the(2)When set up gradient a node on the gradient consumes 02 energygradient consumes 02 energy1048698 1048698 (3)Data transmission consumes 04(3)Data transmission consumes 04 energyenergy
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
4 EADD Energy Aware Directed4 EADD Energy Aware DirectedDiffusionDiffusion
41 EADD41 EADD
Letrsquos assume that there are two gradient paths Letrsquos assume that there are two gradient paths (path X and path Y) which receive same interest(path X and path Y) which receive same interest
message from the sink nodemessage from the sink node
DD DD just reinforce the first path ( just reinforce the first path (fastest pathfastest path) as soon as) as soon as sink node set up first gradient path sink node set up first gradient path
EADD EADD path X and Y has different arrival time If a node path X and Y has different arrival time If a node has more available energy the node can has more available energy the node can get fasterget faster response timeresponse time
(1)EADD set up a gradient between source and destination(1)EADD set up a gradient between source and destination the nodes on gradient should the nodes on gradient should wait until calculated time passwait until calculated time pass overover (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 should fix appointed timefix appointed time to forward the gradient to to forward the gradient to nextnext nodenode
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy 42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
42 The same average available energy problem42 The same average available energy problem
additional MAC field to record the lowest available energyadditional MAC field to record the lowest available energy value on each pathvalue on each path
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
43 The relative energy table43 The relative energy table
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
5 Result5 Result RestrictionsRestrictions (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 destinationto destination (4)Thick arrows mean reinforced path(4)Thick arrows mean reinforced path
AssumptionAssumption1048698 1048698 (1)Events take place at the fixed area(1)Events take place at the fixed area1048698 1048698 (2)When set up gradient a node on the(2)When set up gradient a node on the gradient consumes 02 energygradient consumes 02 energy1048698 1048698 (3)Data transmission consumes 04(3)Data transmission consumes 04 energyenergy
4 EADD Energy Aware Directed4 EADD Energy Aware DirectedDiffusionDiffusion
41 EADD41 EADD
Letrsquos assume that there are two gradient paths Letrsquos assume that there are two gradient paths (path X and path Y) which receive same interest(path X and path Y) which receive same interest
message from the sink nodemessage from the sink node
DD DD just reinforce the first path ( just reinforce the first path (fastest pathfastest path) as soon as) as soon as sink node set up first gradient path sink node set up first gradient path
EADD EADD path X and Y has different arrival time If a node path X and Y has different arrival time If a node has more available energy the node can has more available energy the node can get fasterget faster response timeresponse time
(1)EADD set up a gradient between source and destination(1)EADD set up a gradient between source and destination the nodes on gradient should the nodes on gradient should wait until calculated time passwait until calculated time pass overover (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 should fix appointed timefix appointed time to forward the gradient to to forward the gradient to nextnext nodenode
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy 42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
42 The same average available energy problem42 The same average available energy problem
additional MAC field to record the lowest available energyadditional MAC field to record the lowest available energy value on each pathvalue on each path
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
43 The relative energy table43 The relative energy table
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
5 Result5 Result RestrictionsRestrictions (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 destinationto destination (4)Thick arrows mean reinforced path(4)Thick arrows mean reinforced path
AssumptionAssumption1048698 1048698 (1)Events take place at the fixed area(1)Events take place at the fixed area1048698 1048698 (2)When set up gradient a node on the(2)When set up gradient a node on the gradient consumes 02 energygradient consumes 02 energy1048698 1048698 (3)Data transmission consumes 04(3)Data transmission consumes 04 energyenergy
DD DD just reinforce the first path ( just reinforce the first path (fastest pathfastest path) as soon as) as soon as sink node set up first gradient path sink node set up first gradient path
EADD EADD path X and Y has different arrival time If a node path X and Y has different arrival time If a node has more available energy the node can has more available energy the node can get fasterget faster response timeresponse time
(1)EADD set up a gradient between source and destination(1)EADD set up a gradient between source and destination the nodes on gradient should the nodes on gradient should wait until calculated time passwait until calculated time pass overover (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 should fix appointed timefix appointed time to forward the gradient to to forward the gradient to nextnext nodenode
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy 42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
42 The same average available energy problem42 The same average available energy problem
additional MAC field to record the lowest available energyadditional MAC field to record the lowest available energy value on each pathvalue on each path
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
43 The relative energy table43 The relative energy table
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
5 Result5 Result RestrictionsRestrictions (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 destinationto destination (4)Thick arrows mean reinforced path(4)Thick arrows mean reinforced path
AssumptionAssumption1048698 1048698 (1)Events take place at the fixed area(1)Events take place at the fixed area1048698 1048698 (2)When set up gradient a node on the(2)When set up gradient a node on the gradient consumes 02 energygradient consumes 02 energy1048698 1048698 (3)Data transmission consumes 04(3)Data transmission consumes 04 energyenergy
(1)EADD set up a gradient between source and destination(1)EADD set up a gradient between source and destination the nodes on gradient should the nodes on gradient should wait until calculated time passwait until calculated time pass overover (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 should fix appointed timefix appointed time to forward the gradient to to forward the gradient to nextnext nodenode
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy 42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
42 The same average available energy problem42 The same average available energy problem
additional MAC field to record the lowest available energyadditional MAC field to record the lowest available energy value on each pathvalue on each path
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
43 The relative energy table43 The relative energy table
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
5 Result5 Result RestrictionsRestrictions (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 destinationto destination (4)Thick arrows mean reinforced path(4)Thick arrows mean reinforced path
AssumptionAssumption1048698 1048698 (1)Events take place at the fixed area(1)Events take place at the fixed area1048698 1048698 (2)When set up gradient a node on the(2)When set up gradient a node on the gradient consumes 02 energygradient consumes 02 energy1048698 1048698 (3)Data transmission consumes 04(3)Data transmission consumes 04 energyenergy
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy 42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
42 The same average available energy problem42 The same average available energy problem
additional MAC field to record the lowest available energyadditional MAC field to record the lowest available energy value on each pathvalue on each path
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
43 The relative energy table43 The relative energy table
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
5 Result5 Result RestrictionsRestrictions (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 destinationto destination (4)Thick arrows mean reinforced path(4)Thick arrows mean reinforced path
AssumptionAssumption1048698 1048698 (1)Events take place at the fixed area(1)Events take place at the fixed area1048698 1048698 (2)When set up gradient a node on the(2)When set up gradient a node on the gradient consumes 02 energygradient consumes 02 energy1048698 1048698 (3)Data transmission consumes 04(3)Data transmission consumes 04 energyenergy
42 The same average available energy problem42 The same average available energy problem
additional MAC field to record the lowest available energyadditional MAC field to record the lowest available energy value on each pathvalue on each path
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
43 The relative energy table43 The relative energy table
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
5 Result5 Result RestrictionsRestrictions (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 destinationto destination (4)Thick arrows mean reinforced path(4)Thick arrows mean reinforced path
AssumptionAssumption1048698 1048698 (1)Events take place at the fixed area(1)Events take place at the fixed area1048698 1048698 (2)When set up gradient a node on the(2)When set up gradient a node on the gradient consumes 02 energygradient consumes 02 energy1048698 1048698 (3)Data transmission consumes 04(3)Data transmission consumes 04 energyenergy
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
43 The relative energy table43 The relative energy table
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
5 Result5 Result RestrictionsRestrictions (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 destinationto destination (4)Thick arrows mean reinforced path(4)Thick arrows mean reinforced path
AssumptionAssumption1048698 1048698 (1)Events take place at the fixed area(1)Events take place at the fixed area1048698 1048698 (2)When set up gradient a node on the(2)When set up gradient a node on the gradient consumes 02 energygradient consumes 02 energy1048698 1048698 (3)Data transmission consumes 04(3)Data transmission consumes 04 energyenergy
43 The relative energy table43 The relative energy table
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
5 Result5 Result RestrictionsRestrictions (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 destinationto destination (4)Thick arrows mean reinforced path(4)Thick arrows mean reinforced path
AssumptionAssumption1048698 1048698 (1)Events take place at the fixed area(1)Events take place at the fixed area1048698 1048698 (2)When set up gradient a node on the(2)When set up gradient a node on the gradient consumes 02 energygradient consumes 02 energy1048698 1048698 (3)Data transmission consumes 04(3)Data transmission consumes 04 energyenergy
OutlineOutline 11AbstractAbstract 22IntroductionIntroduction 33Related workRelated work 31 Directed Diffusion31 Directed Diffusion 32 An Energy Efficient Direct Diffusion Routing32 An Energy Efficient Direct Diffusion Routing ProtocolProtocol 4 EADD Energy Aware Directed Diffusion4 EADD Energy Aware Directed Diffusion 41 EADD41 EADD 42 The same average available energy42 The same average available energy problemproblem 43 The relative energy table43 The relative energy table 5 Result5 Result
5 Result5 Result RestrictionsRestrictions (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 destinationto destination (4)Thick arrows mean reinforced path(4)Thick arrows mean reinforced path
AssumptionAssumption1048698 1048698 (1)Events take place at the fixed area(1)Events take place at the fixed area1048698 1048698 (2)When set up gradient a node on the(2)When set up gradient a node on the gradient consumes 02 energygradient consumes 02 energy1048698 1048698 (3)Data transmission consumes 04(3)Data transmission consumes 04 energyenergy
5 Result5 Result RestrictionsRestrictions (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 destinationto destination (4)Thick arrows mean reinforced path(4)Thick arrows mean reinforced path
AssumptionAssumption1048698 1048698 (1)Events take place at the fixed area(1)Events take place at the fixed area1048698 1048698 (2)When set up gradient a node on the(2)When set up gradient a node on the gradient consumes 02 energygradient consumes 02 energy1048698 1048698 (3)Data transmission consumes 04(3)Data transmission consumes 04 energyenergy
