1 / 25

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

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

waseem
Download Presentation

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

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. 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

More Related