1 / 36

Hipercom project presentation Massively dense ad hoc networks

Hipercom project presentation Massively dense ad hoc networks. Paul Mühlethaler Evaluation seminar. Massively dense ad hoc networks. DTN. Routing in extremely mobile networks . G. Allard, P. Jacquet, B. Mans. DHT-OLSR. E. Baccelli, Thomas Zahn

mikaia
Télécharger la présentation

Hipercom project presentation Massively dense 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. Hipercom project presentationMassively dense ad hoc networks Paul Mühlethaler Evaluation seminar

  2. Massively dense ad hoc networks DTN. Routing in extremely mobile networks . G. Allard, P. Jacquet, B. Mans. DHT-OLSR. E. Baccelli, Thomas Zahn FSR. Fish Eye OLSR Scaling Properties. C. Adjih, E. Baccelli, P. Jacquet, G. Rodolakis Geometry of information propagation in massively dense Ad hoc Networks. P. Jacquet Control of mobile ad hoc networks. P. Jacquet An Aloha Protocol for Multihop Mobile Wireless Networks. F. Baccelli, B. Blaszczyszyn, P. Muhlethaler On the Performance of Time-Space Opportunistic Routing in Multihop Mobile Ad Hoc F. Baccelli, B. Blaszczyszyn, P. Mühlethaler

  3. Massively dense ad hoc networks Control overhead Throughput Scaling Routing Mobility DTN. Routing in extremely mobile networks . G. Allard, P. Jacquet, B. Mans. DHT-OLSR. E Baccelli, Thomas Zahn FSR. Fish Eye OLSR Scaling Properties. C. Adjih, E. Baccelli, P. Jacquet, G. Rodolakis Geometry of information propagation in massively dense Ad hoc Networks. P. Jacquet Control of mobile ad hoc networks. P. Jacquet An Aloha Protocol for Multihop Mobile Wireless Networks. F. Baccelli, B. Blaszczyszyn, P. Muhlethaler On the Performance of Time-Space Opportunistic Routing in Multihop Mobile Ad Hoc. F. Baccelli, B. Blaszczyszyn, P. Mühlethaler

  4. Massively dense ad hoc networks Opportunistic routing Scaling of a multihop ad hoc network Gupta et Kumar result and throughput in a CSMA network Opportunistic routing Slotted Aloha and opportunistic routing Comparison of opportunistic routing and shortest path routing

  5. Scaling of a multihop ad hoc network Opportunistic routing and spatial reuse (state of the art) Maximum probability of successful … Nelson, Kleinrock 83 Optimal transmission ranges for randomly... Takagi, Kleinrock 84 Stability properties of slotted Aloha with multipacket … Ghez, Verdu Schwartz 88. BTMA. Deng Haas 98 MACA-BI. Talucci Gerla 97 …. Capacity of wireless networks. Gupta and Kumar. 00 Throughput optimization in CSMA multihop… Mühlethaler , Najid 04 Comparison between Aloha and CSMA in multihop…Mühlethaler et al 04

  6. Scaling of a multihop ad hoc network Opportunistic routing and spatial reuse (state of the art) Geographic routing for wireless … Karp 00 Exor : opportunistic multi-hop routing for … Biswas Morris 05

  7. Scaling of a multihop ad hoc networkPropagation and physical model Propagation : Physical model :

  8. Scaling of a multihop ad hoc networkTraffic model and network throughput Random source and destination in the network. One measures the total throughput of the network

  9. Scaling of a multihop ad hoc networkEffect of a transmission In the capture model a transmission within a given radius “consumes” a “disk” in the space

  10. Scaling of multihop ad hoc network Gupta et Kumar (IT 2000): Throughput of a multihop ad hoc network Network area S, n number of nodes, r(n) transmission radius, W throughput of the communication medium simultaneous transmission leading to a throughput L number of hops towards the destination : Total network throughput r(n) for a random topology r(n) for a regular topology

  11. Scaling of a CSMA multihop network Fixed carrier sense threshold. Total network throughput The throughput does not scale with the network density (or equivalently with the number of network nodes)

  12. Scaling a multihop ad hoc network The constructive part of the Gupta and Kumar result [IT00] does not allow one to easily build an implementable protocol to reach this bound The difficulty lies in the dynamic tuning of the neighborhood A way to carry out this tuning is to use an ‘opportunistic routing’

  13. Reaching the Gupta and Kumar bound Geographic routing

  14. Geographic routing – Opportunistic routing Opportunistic routing- -> auto election of the relay

  15. Geographic routing – Opportunistic routing Opportunistic routing - -> relay self election

  16. Geographic routing – Opportunistic routing Opportunistic routing - -> relay self election

  17. Geographic routing – Opportunistic routing • Opportunistic routing can be used with various access schemes • These access schemes can be : • Controlled access scheme : TDMA, reservation based scheme • Random access : Aloha, CSMA …

  18. Slotted Aloha with opportunistic routing Scaling reached with the opportunistic routing and a slotted Aloha At each slot, the probability of transmission is p.

  19. Slotted Aloha with opportunistic routing The progress towards the destination can be estimated

  20. Slotted Aloha with opportunistic routing The spatial density of the progress is : p* (which maximizes ) does not depend on l. Slotted Aloha with opportunistic routing offers the scaling foreseen by the Gupta and Kumar paper.

  21. Slotted Aloha with opportunistic routing Why is the analysis possible? Transmitters in an Aloha protocol are still a Poisson process (and receivers are still a Poisson process) The Laplace Transform of the shot noise of a Poisson process is known

  22. Distribution of the signal created by a Poisson process Random reception areas in random fields

  23. Comparison of opportunistic routing with shortest path routing (Slotted Aloha as MAC scheme) Example of the packets’ routes from the source to the destination node M1 signal power law decay M3 signal power law + fadding exponentiel

  24. Comparison of opportunistic routing with shortest path routing (Slotted Aloha as MAC scheme) Optimisation of the shortest path routing Better delay obtained with the shortest transmission range Constraint on the connexity of the graph Better delay obtained for R = 140 m

  25. Comparison of opportunistic routing with shortest path routing (Slotted Aloha as MAC scheme) End-to-end delay of a priority packet (always at the top of nodes’ queue)

  26. Comparison of opportunistic routing with shortest path routing (Slotted Aloha as MAC scheme) End-to-end delay improvement versus decay b

  27. Comparison of opportunistic routing with shortest path routing (Slotted Aloha as MAC scheme) End-to-end delay of a priority packet (imperfect knowledge of node’s location)

  28. Comparison of opportunistic routing with shortest path routing (Slotted Aloha as MAC scheme) Mean number of hops

  29. Comparison of opportunistic routing with shortest path routing (Slotted Aloha as MAC scheme) Mean delay per hop

  30. Comparison of opportunistic routing with shortest path routing (Slotted Aloha as MAC scheme) Delay as a function of l (or n equivalently)

  31. Opportunistic routing – On going works A better knowledge of opportunistic routing • Lack of precision in nodes’ position • Variation in the exact algorithm • Mixing opportunistic routing with other access protocols e.g. CSMA, etc. • Practical issues Applications • Potential applications in VANETs • Opportunistic routing and multicast traffic

  32. Space capacity paradox with a real network Throughput gain Fisheye OLSR Basic OLSR

  33. capacity gain with mobility throughput increase factor delivery delay power law speed

  34. Conclusion HiPERCOM has produced several contributions concerning the scaling of ad hoc networks. The common points of these contributions are : • Multihop ad hoc networks, • Routing, • Mobility, • Optimization of the throughput.

  35. Comparison of opportunistic routing with shortest path routing (CSMA scheme) End-to-end delay of a priority packet (always at the top of nodes’ queue)

  36. Focus on new results Scaling in massively dense wireless networks OLSR equation Fisheye equation Fisheye with mobility R R

More Related