SlideServe
Télécharger Obtenir Pro
Menu
Accueil Pro
Préférences
ApparenceLight Aide et commentaires
© SlideServe · v2026

Manycast: Exploring the Space Between Anycast and Multicast in Ad Hoc Networks

waseem avatar
waseem
25 diapositives · 405 Views · Oct 04, 2014

This paper investigates the concept of manycast and its relevance in ad hoc networks, highlighting its distinctions from both anycast and multicast. It outlines various applications, including NTP and sensor networks, and defines manycast services, focusing on service quality and routing techniques. Through experimental simulations, the authors demonstrate the effectiveness of manycast routing in communication, emphasizing its implementation at the network layer. The findings advocate for simple routing solutions, particularly the Scoped-Flood method, to optimize network performance.

#manycast: exploring the space between anycast and multicast in ad hoc networks #manycast: exploring the space between anycast and multicast in ad hoc networks ppt #powerpoint #presentation
Manycast: Exploring the Space Between Anycast and Multicast in Ad Hoc Networks - slide 1
01 / 25Manycast: Exploring the Space Between Anycast and Multicast in Ad Hoc Networks
1 / 17

Télécharger la présentation

Manycast: Exploring the Space Between Anycast and Multicast in Ad Hoc Networks
Une image / un lien ci-dessous est fourni (tel quel) pour télécharger la présentation

Politique de téléchargement : le contenu du site vous est fourni TEL QUEL pour votre information et votre usage personnel ; il ne peut être vendu, concédé sous licence ni partagé sur d’autres sites sans l’accord de son auteur.Le contenu vous est fourni TEL QUEL, pour votre information et votre usage personnel uniquement. Téléchargez la présentation en cliquant sur ce lien. Lors du téléchargement, si vous ne parvenez pas à télécharger une présentation, l’éditeur a peut-être supprimé le fichier de son serveur.Pendant le téléchargement, si vous ne parvenez pas à obtenir une présentation, le fichier a peut-être été supprimé par l’éditeur.

F I N

Plus de contenu associé

Transcription de la présentation

  1. Manycast: Exploring the Space Between Anycast andMulticast in Ad Hoc Networks Casey Carter Seung Yi Prashant Ratanchandani Robin Kravets Department of Computer Science University of Illinois, Urbana-Champaign ACM-Mobihoc-2003

  2. Outline • Introuduction • Applications • Defining a manycast service • Service quality • Manycast routing • Experiment

  3. Introuduction • Ad hoc need server replication • Anycast delivers each transmission to a closest single member. • Anycast and multicast are special cases of manycast communication. • Manycast routing in application layer or network layer.

  4. Applications • NTP (Network Time Protocol): a client wish to locate the three best/nearest servers with which to synchronize its clock. • ITTC (Intrusion Tolerance via Threshold Cryptography): each server knows only a small part of the secret key. • Sensor Network • Averaging over the 50 closest temperature sensors.

  5. Defining a manycast service • Manycast like multicast and anycast. • Long-term communication can use manycast to discover k servers. • It be contacted using unicast communication. • Join a source-specific multicast group.

  6. Service quality • 1-to-k communication is k times more likely to fail than is 1-to-1. • If client wants to contact with k servers, it need send out K requests. • K > k

  7. Manycast routing • Vocabulary • There two phase: • discovery phase: The source has no knowledge about the network and the targets of a transmission. • delivery phase : The source has previously discovered something about the topology of network. • m: servers ;n: nodes; k: targets

  8. Manycast routing

  9. Manycast routing DSR: Discovery phase: 1 request + 27 relay + 1 response + 2 forward = 31 transmission Delivery phase: 1 request + 2 relay + 1 response + 2 forward = 6 transmission N=28 M=11

  10. Manycast routing • Application layer (11 +1) requests + 27*(11+1) relay + 2*11 responses + 26 forwards = 384 total transmissions N=28 M=11

  11. Manycast routing • Idealized 1 requests + 1 relay + 3 response+ 1 forwards = 6 total transmissions k=3

  12. Manycast routing • Flood 1 requests + 27 relay + 11 response+ 13 forwards = 52 total transmissions k=3

  13. Manycast routing • Scoped-Flood 1 requests + 5 relay + 7 response+ 5 forwards = 18 total transmissions k=3

  14. Manycast routing • Unicast 3 requests + 1 relay + 3 response+ 1 forwards = 8 total transmissions K=3

  15. Manycast routing • SGM & SGMB SGM: 2 requests +1 relay + 3 response+1 forwards = 7 total transmissions SGMB: 1 requests +1 relay + 3 response+1 forwards = 6 total transmissions (= Idealized) K=3

  16. Manycast routing • Multicast Based • Multicast 1 requests + 7 relay + 11 response+ 13 forwards = 32 total transmissions

  17. Manycast routing • Multicast Based • Scoped-Multicast 1 requests + 4 relay + 7 response + 5 forwards = 17 total transmissions

  18. Experiment • AODV:Flood, Scoped-Flood,Unicast, SGM and SGMB • ADMR for multicast • For the TTL-scoped delivery mechanisms, add a method to AODV’s route table for determining the smallest TTL that will reach K server.

  19. Experiment • Simulation Study • N=150nodes ; m=30servers • 1000*1000meter square • IEEE 802.11 • 2Mbps data rate • Speed 0-10 m/s ; pause time of 10 sec. • During 600 sec. • Each client send out 10 request.

  20. Experiment • Simple Traffic

  21. Experiment • Complex traffic

  22. Experiment • Reliability by K

  23. Experiment • Varying m

  24. Conclusions • Manycast is viable and necessarily must be implemented at the network layer. • Simple approaches are best • Scoped-Flood “heals” routes within scope.

  25. END