Jiazi Yi, Eddy Cizeron, Salima Hamma, Benot Parrein, Pascal Lesage - - PowerPoint PPT Presentation

▶
jiazi yi eddy cizeron salima hamma beno t parrein pascal
SMART_READER_LITE
LIVE PREVIEW

Jiazi Yi, Eddy Cizeron, Salima Hamma, Benot Parrein, Pascal Lesage - - PowerPoint PPT Presentation

Mar 06, 2023 48 likes •320 views

Jiazi Yi, Eddy Cizeron, Salima Hamma, Benot Parrein, Pascal Lesage l ECOLE POLYTECHNIQUE DE LUNIVERSITE DE NANTES, FRANCE Institut de Recherche en Communications et en Cyberntique de Nantes SE SE curit des RE seaux it d RE AD

slide-1
SLIDE 1

Jiazi Yi, Eddy Cizeron, Salima Hamma, î l Benoît Parrein, Pascal Lesage ECOLE POLYTECHNIQUE DE L’UNIVERSITE DE NANTES, FRANCE

slide-2
SLIDE 2

Institut de Recherche en Communications et en Cybernétique de Nantes

SE ité d RE SEcurité des REseaux AD hoc & MOjette

Laboratoire SIC, Université de Poitier THALES Communications

jiazi.yi@univ-nantes.fr 2

slide-3
SLIDE 3

Topology Sensing Topology Sensing Route Computation Route Computation Route Recovery Multiple Description Coding

I l t ti i Li

Implementation in Linux

jiazi.yi@univ-nantes.fr 3

slide-4
SLIDE 4

Based on OLSR Based on OLSR

  • Link Sensing
  • Neighbor Detection

HELLO

Neighbor Detection

  • Topology Discovery

Modified TC Message

TC

Modified TC Message

  • OLSR: Links with MPR
  • MP-OLSR: Links with all neighbors

g

jiazi.yi@univ-nantes.fr 4

slide-5
SLIDE 5

Topology Sensing Topology Sensing Route Computation Route Computation Route Recovery Multiple Description Coding

MP OLSR i l t ti i

MP-OLSR implementation in

Linux Linux

jiazi.yi@univ-nantes.fr 5

slide-6
SLIDE 6

Dijkstra(G n) Dijkstra(G,n)

  • Standard Dijkstra

algorithm algorithm

ci(e)

  • The cost of link e in ith

e cost o e iteration

fp(e), fe(e)

fp( ), fe( )

  • Cost function

Source Routing

jiazi.yi@univ-nantes.fr 6

slide-7
SLIDE 7

jiazi.yi@univ-nantes.fr 7

slide-8
SLIDE 8

fe fe fp(e) = 3e fp f fp fe fp( ) fe(e) = 2e fp

jiazi.yi@univ-nantes.fr 8

slide-9
SLIDE 9

jiazi.yi@univ-nantes.fr 9

slide-10
SLIDE 10

f (e) = 2e fp(e) 2e fe(e) = e fp(e) = 2e f ( ) 1 5 fe(e) = 1.5e

jiazi.yi@univ-nantes.fr 10

slide-11
SLIDE 11

fp(e) = 2e fe(e) = 2e

3 paths 10 paths

jiazi.yi@univ-nantes.fr 11

slide-12
SLIDE 12

Topology Sensing Topology Sensing Route Computation Route Computation Route Recovery Multiple Description Coding

MP OLSR i l t ti i

MP-OLSR implementation in

Linux Linux

jiazi.yi@univ-nantes.fr 12

slide-13
SLIDE 13

The problems of source routing The problems of source routing

  • Topology information in the source node is out of

date date

  • Changes of topology during data transmission

Route recovery

  • At the intermediate node, before heading the

packet to the next hop, check if the next hop is in the neighbor set

  • If the next hop in the source route is not the

neighbor anymore recompute the route neighbor anymore, recompute the route

jiazi.yi@univ-nantes.fr 13

slide-14
SLIDE 14

jiazi.yi@univ-nantes.fr 14

slide-15
SLIDE 15

Network Simulator 2 Network Simulator 2 50 nodes, 1000×1000m square, 30 CBR

sources 512byte 10 packets/s sources, 512byte, 10 packets/s,

Two ray ground reflection model

d l

Tested Protocols

  • Original OLSR: UM-OLSR

h l k l f db k

  • OLSR with link layer feedback
  • SR-MPOLSR: pure source routing

RE MPOLSR ti ith t

  • RE-MPOLSR: source routing with route recovery

Cost function for MP-OLSR: fp(c) = fe(c) = 2c, 3 paths

jiazi.yi@univ-nantes.fr 15

slide-16
SLIDE 16

jiazi.yi@univ-nantes.fr 16

slide-17
SLIDE 17

Queue delay Queue delay + Propagation Propagation delay

jiazi.yi@univ-nantes.fr 17

slide-18
SLIDE 18

Topology Sensing Topology Sensing Route Computation Route Computation Route Recovery Multiple Description Coding

jiazi.yi@univ-nantes.fr 18

slide-19
SLIDE 19

Path 1 Coding Decoding Path 2 Coding Decoding h Path 3

Sender Receiver

jiazi.yi@univ-nantes.fr 19

slide-20
SLIDE 20

jiazi.yi@univ-nantes.fr 20

slide-21
SLIDE 21

jiazi.yi@univ-nantes.fr 21

slide-22
SLIDE 22

100 nodes 100 nodes 4 paths used. 2

packets in 4 to packets in 4 to reconstruct the

  • riginal packet
  • riginal packet

jiazi.yi@univ-nantes.fr 22

slide-23
SLIDE 23

Allocate the redundancy according to the info Allocate the redundancy according to the info

from:

  • Physical Layer
  • Physical Layer

Link quality based on Bit Error Rate

  • Network Layer

y

FIFO buffer

  • Application Layer

Expected quality of image and video at the decoding stage

jiazi.yi@univ-nantes.fr 23

slide-24
SLIDE 24

jiazi.yi@univ-nantes.fr 24

slide-25
SLIDE 25

Proposed a multipath routing protocol based Proposed a multipath routing protocol based

  • n OLSR. The multipath protocol with route

recovery could improve the performance of recovery could improve the performance of the network

MDC is applied in MP-OLSR and the MDC is applied in MP OLSR, and the

redundancy allocation is also studied.

jiazi.yi@univ-nantes.fr 25

slide-26
SLIDE 26

Multipath routing based on OLSRv2 Multipath routing based on OLSRv2 Optimize the path selection and redundancy

allocation allocation

Quality of service of video and image

transmission in the network transmission in the network

jiazi.yi@univ-nantes.fr 26

slide-27
SLIDE 27

Thank you ! y

Jiazi Yi jiazi.yi@univ-nantes.fr IRCCyN-IVC ECOLE POLYTECHNIQUE DE L'UNIVERSITE DE NANTES Q Rue Christian Pauc, La Chantrerie, BP 50609 44306 NANTES, Cedex, FRANCE

jiazi.yi@univ-nantes.fr 27