1 / 18

Problems

ABC: A Simple Geographic Forwarding Scheme Capable of Bypassing Routing Holes in Wireless Sensor Networks Presented by : Anita Mohebi Dhruti Joshi Yueh -Shan Shih. Problems. Number of retransmissions

wilson
Télécharger la présentation

Problems

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. ABC: A Simple Geographic Forwarding Scheme Capable of Bypassing Routing Holes in Wireless Sensor NetworksPresented by : Anita MohebiDhruti JoshiYueh-Shan Shih

  2. Problems • Number of retransmissions • Delivery ratios • Average delays

  3. ABC Features • di : is a distance of node i to the optimal reception perimeter. • dop :Distance from D to the optimal reception perimeter dop= L-R

  4. Equations Equation 1 : Equation 2 : Equation 3 : Equation 4 :

  5. ABC Pseudo Code While message has not been received by destination node Find next relay node (Equation 3) If relay node is found (relay node is in zone 1 of the previous node; greedy forwarding ) Calculate the probability for node can transmit data (Equation 1) Else Find relay node (Equation 4) (not in zone 1 of the previous; bypassing) Mark relay node as an ingress node Start boundary recognition Calculate the probability the node can transmit (Equation 2) End While

  6. ABC Model To determine which relay node can successfully pass the message towards destination

  7. New approach for distance calculation l : Distance from S to D d1 : Distance form S to relay node d2 : Distance from relay node to line l (l is the straight line from S to D) d3 : Distance from D to relay node sx, the x coordinate for source node sy, the y coordinate for source node rx, the x coordinate for relay node ry, the y coordinate for relay node dx, the x coordinate for destination node dy, the y coordinate for destination node

  8. ABC Distance Formula Equation 1 Equation 2 Equation 3

  9. ACO Formula

  10. ACO Formula • The probability ant k at node i, selects the next node j ∈ Nik: Equation 1: f(xk(t))= 1/Ld Equation 2: pheromone evaporation Equation 3: pheromone update Equation 4: 10

  11. ACO Formula

  12. ACO Algorithm : When new message is not received : Initialize to small random values; Let t=0; Place nk ants on the original node; Repeat for each ant K=1…nk do //construct a path xk(t) xk(t) =ø ; repeat Select next node on the probabilitydefined in Equation1; Add link (i,j) to path xk(t); untildestination node has been reached; Remove all loops from xk(t); Calculate the path cost f(xk(t)) by using Equation 2; End for each link (i,j) of the graph do // pheromone evaporation ; 12

  13. ACO Algorithm Reduce the pheromone By using Equation 3 ; • end do for each ant k=1… xk(t) do for each link (i,j) of the Update by using Equation 4; • end • end until stopping condition is true; Return the path with smallest f(xk(t)) as the solution; end xk(t) 13

  14. Stopping Condition double maxP = 0.0; for(int k=1; k<antN+1; k++) { //construct paths from 1 to antN If(p1>maxP) MaxP = p1; } return maxP; // tell which path is best

  15. ACO Formula Equation4 Equation5 Equation6

  16. ABC Retransmission Formula • Sj: The stripes area (j refers to number of stripes within the broadcasting range) • k: The number of nodes in Sj strips area • Msj: Constant expected nodes in Sj • C : The cost • Probability for nodes in stripes Sj successfully relay the message will be: • Probability for nodes within broadcasting range successfully relay the message will be: Equation 7

  17. ACO-Based ABC pseudo code 1. While information is not received by destination 2. Try to find relay nodes with equation (1), (2), (3) 3. If ACO applicable 4. Apply ACO (4) 5. Evaporate pheromone (5) 6. Update pheromone (6) 7. Calculate the probability of success 8. transmission with equation (7) 9. End While

  18. Any Questions?

More Related