a quorum-based robust and efficient routing protocol for mobile ad-hoc network yi-chen yang graduate...

A Quorum-Based Robust and Efficient Routing Protocol

for Mobile Ad-Hoc Network

Yi-Chen YangGraduate School of Mathematical Sciences

Aletheia University

Yi-Chen Yang

Outline

Introduction QRERP

Ideas Phases Maintenance

Simulation Conclusion

Yi-Chen Yang

Introduction - Ad-Hoc Networks

Characteristics Infrastructureless mobile network No fixed routers No base stations No stable topology

Applications Battlefield Disaster areas

Yi-Chen Yang

Introduction - Motivation

Routing Protocol Delay Control overhead Mobility

21

5

7

2

3

14

6

15

20

8

10

24

13

18

22

25

26

4

9

11

23

16

19

1

17

27 28

29

30

31

32

33

34 35

36

3738

40

42

43

44

45

39

41

12

Yi-Chen Yang

Introduction - Goal

QRERP

EfficientEfficient•Less control overhead•Backup route

RobustRobust•Mobility management •Route maintenance

Yi-Chen Yang

Introduction - Basic Concept

Matrix representation of routing table Why??

Row/Col 10 52 34 14 70

10 - 1 1 1 0

52 1 - 1 1 0

34 1 1 - 0 0

14 1 1 0 - 1

70 0 0 0 1 -

10

52

14

34

70

Row/Col 10 52 34 14 70

10 - 52 34 14 14

52 10 - 34 14 14

34 10 52 - 52 10

14 10 52 10 - 70

70 14 14 14 14 -

Matrix representation routing tableOrdinary routing table

•Single path •Multiple pathMatrix

Quorum

Yi-Chen Yang

Path A

Path B

Path C

Introduction - Basic Concept

Quorum mechanism of routing protocol Why Quorum??

ef d

b

a

c

Quorum- Based Routing protocol

e

f

d

ba

c

Ordinary Cluster-Based routing protocol

•No fault tolerance

•No load balance

•Fault tolerance

•Load balance

•Data consensus

a

b c

fd e

Coterie Tree

Matrix

Quorum

Yi-Chen Yang

QRERP - Ideals

Matrix representation Backup route

Local matrix operation Less control overhead

Quorum scheme Mobility management

Yi-Chen Yang

QRERP - Matrix Representation

Row/Col 10 52 34 14 70

10 - 1 1 1 0

52 1 - 1 1 0

34 1 1 - 0 0

14 1 1 0 - 1

70 0 0 0 1 -

10

52

14

34

70

Yi-Chen Yang


Host Adjacency Matrix (HAM) HAM 為一 n 階對稱方陣 , 且對角線均為 0 Dn : 表裝置之編號 , 且 n 為自然數 HAM (i,j) : 矩陣中第 i 列第 j 行個元素 , 且

Row/Col D1 D2 ... Dn-1 Dn

D1 - 1 ... 1 0

D2 1 - ... 1 0

… ... ... - ... ...

Dn-1 1 1 ... - 1

Dn 0 0 ... 1 -

HAM (i,j) = 1 Device i 至 j 有 Link　 0 Device i 至 j 沒有 Link

Yi-Chen Yang


HAM packet format

For example:

N D1~Dn D[1]~D[k]

Row/Col 14 75 60

14 - 1 1

75 1 - 0

60 1 0 -

3 14,75,60 110

Yi-Chen Yang


Vectorization 假設 A 為一 n 階方陣 , 因為對稱矩陣 , 故只記錄其上三角形共 [n(n+1)]/2 個元素 , 並依序對映至 D(1: [n(n

+1)]/2) 一個 n 階上三角形矩陣其元素對映到 D 陣列為 :

aij = D[k] 其中 k=n(i-1)-[i(i-1)]/2+j-i For example:

a34 ->D[6]k=4(3-1)-[3(3-1)]/2+4-3=6

- a12 a13 a14

0 - a23 a24

0 0 - a34

0 0 0 -

Yi-Chen Yang

QRERP - Local Matrix Operation

HAMk

在矩陣中，從 device i 到 j 距離 k 步有 aij條 path 可到達

10 52 34 14 70

10 - 1 1 1 0

52 1 - 1 1 0

34 1 1 - 1 0

14 1 1 1 - 1

70 0 0 0 1 -

10 52 34 14 70

10 - 2 2 2 1

52 2 - 2 2 1

34 2 2 - 2 1

14 2 2 2 - 0

70 1 1 1 0 -

10 52 34 14 70

10 - 1 1 1 0

52 1 - 1 1 0

34 1 1 - 1 0

14 1 1 1 - 1

70 0 0 0 1 -

10

52

14

34

70

=

Yi-Chen Yang

QRERP - Quorum Scheme

Coterie Let U={a, b, c,…} denote the set of N nodes in

the system. C is a coterie under U iff

G C => ( G≠Ø and G U ). (Intersection property) : G,HC => G H ≠Ø. (Minimality) : G,HC => G H.

Yi-Chen Yang


Application U={a, b, c, d, e, f} C={{a, c, f} {a, b, d} {d, e, f}}

ef d

b

a

c

Data A

Data B

Data CRead Quorum

Write Quorum

Yi-Chen Yang


Coterie Tree

a

b c

fd e

{a, b, d} {a, b, e} {a, c, f} all node are available

{d, e, f } node a, b and c are unavailable

{b, d, f} {b, e, f} node a and c are unavailable

{d, e, c, f} node a and b are unavailable{a, b, d, f} {a, b, e, f } node c is unavailable{a, d, e, c, f } node b is unavailable{b, d, c, f} {b, e, c, f} node a is unavailable

Yi-Chen Yang

QRERP - Phases Initialization Phase

Coterie Tree Construction Route Discovery Phase

Matrix Operation Quorum Scheme Gateway Approach

Route Reply Phase HAM Distribution

Data Transmission Phase Link Break

Yi-Chen Yang

QRERP - Initialization Phase

Coterie Tree Construction

21

5

7

2

3

14

6

15

20

8

1024

13

18

22

25

26

4

9

11

23

16

19

1

17

27 28

29

30

3132

33

34 35

36

3738

41

42

43

44

45

39

40

12

Yi-Chen Yang


Coterie Tree Construction (set d=2)

34 35

36

3738

39

40

28

Yi-Chen Yang



34 35

36

3738

39

40

28

-000010040

0-11000039

01-0100038

010-100037

0011-11036

10001-1035

000011-134

0000001-28

4039383736353428Row/Col

-000010040

0-11000039

01-0100038

010-100037

0011-11036

10001-1035

000011-134

0000001-28

4039383736353428Row/Col

28

34 35

393836 37

40

28

34 35

393836 37

40Coterie Tree 36

Yi-Chen Yang



Member

Gateway

Generator

Gateway

21

5

7

2

3

14

6

15

20

8

10

24

13

18

22

25

26

4

9

11

23

16

19

1

17

27 28

29

30

31

32

33

34 35

36

3738

42

43

44

45

39

12

41

40

Yi-Chen Yang

QRERP - Route Discovery Phase

Case 1 (Local Matrix Operation)

21

5

7

2

3

14

6

15

20

8

10

24

13

18

22

25

26

4

9

11

23

16

19

1

17

27 28

29

30

31

32

33

34 35

36

3738

41

42

43

44

45

39

40

12

Member

Gateway

Generator40

39

-000010040

0-11000039

01-0100038

010-100037

0011-11036

10001-1035

000011-134

0000001-28

4039383736353428Row/Col

-000010040

0-11000039

01-0100038

010-100037

0011-11036

10001-1035

000011-134

0000001-28

4039383736353428Row/Col

Yi-Chen Yang


Case 2 (Quorum Scheme)

Node 40 select {28, 34, 36, 40} according to the Coterie Tree 36, and

multicast to node 28, 34, 36 for getting the path of

destination 12.

28

34 35

393836 37

40

28

34 35

393836 37

40Coterie Tree 36

28

34

36

4021

5

7

2

3

14

6

15

20

8

10

24

13

18

22

25

26

4

9

11

23

16

19

1

17

27 28

29

30

31

32

33

34 35

36

3738

41

42

43

44

45

39

40

12

Member

Gateway

Generator

40

12 Source

Yi-Chen Yang


Case 3 (Gateway Approach)

MemberGatewayGenerator

Node 40 ask gateway 28, 22, 26 for getting the path

of destination 41.

21

5

7

2

3

14

6

15

20

8

10

24

13

18

22

25

26

4

9

11

23

16

19

1

17

27 28

29

30

31

32

33

34 35

36

3738

40

42

43

44

45

39

41

12

Yi-Chen Yang

QRERP - Route Reply Phase

Distribute the HAM


21

5

7

2

3

14

6

15

20

8

10

24

13

18

22

25

26

4

9

11

23

16

19

1

17

27 28

29

30

31

32

33

34 35

36

3738

40

42

43

44

45

39

41

12

-00001000000041

0-1000000000040

01-100000000035

001-00100000034

0000-1010000032

10001-000000029

000100-00100028

0000100-1000026

00000001-010025

000000100-00124

0000000010-1022

00000000001-110

000000000101-8

4140353432292826252422108Row/Col

-00001000000041

0-1000000000040

01-100000000035

001-00100000034

0000-1010000032

10001-000000029

000100-00100028

0000100-1000026

00000001-010025

000000100-00124

0000000010-1022

00000000001-110

000000000101-8

4140353432292826252422108Row/Col

Node 41, 26, 22, 28 distribute this HAM.

Yi-Chen Yang


Distribute the HAM


21

5

7

2

3

14

6

15

20

8

10

24

13

18

22

25

26

4

9

11

23

16

19

1

17

27 28

29

30

31

32

33

34 35

36

3738

40

42

43

44

45

39

41

12

Yi-Chen Yang


Distribute the HAM

28

34 35

393836 37

40

28

34 35

393836 37

40Coterie Tree 36

28

35

39

For example: Node 28 select {28, 35, 39}

according to the Coterie Tree 36, and multicast

HAM of the path to node 35, 39.

34 35

36

3738

39

40

28

Yi-Chen Yang

QRERP - Data Transmission Phase

Node 40 transmission to node 41


21

5

7

2

3

14

6

15

20

8

10

24

13

18

22

25

26

4

9

11

23

16

19

1

17

27 28

29

30

31

32

33

34 35

36

3738

40

42

43

44

45

39

41

12

Yi-Chen Yang

QRERP - Data Transmission Phase

Node 40 transmission to node 41


21

5

7

2

3

14

6

15

20

8

10

24

13

18

22

25

26

4

9

11

23

16

19

1

17

27 28

29

30

31

32

33

34 35

36

3738

40

42

43

44

45

39

41

12

Enter Route Discovery Phase

Yi-Chen Yang

QRERP - Maintenance Node Join

Graph Maintenance Coterie Tree Maintenance

Node Leave Graph Maintenance Coterie Tree Maintenance

Yi-Chen Yang

QRERP - Node Join

Node Join

21

5

7

2

3

14

6

15

20

8

10

24

13

18

22

25

26

4

9

11

23

16

19

1

17

27 28

29

30

31

32

33

34 35

36

3738

72

42

43

44

45

39

12

41

40


1. Node 72 broadcast and no device ack

2. Node 72 join Coterie Tree 36

Yi-Chen Yang

QRERP - Node Join

Coterie Tree maintenance

72

Join28

34 35

36 37 3938

40

Yi-Chen Yang

QRERP - Node Join


7272

28

34 35

36 37 3938

40

Yi-Chen Yang

QRERP - Node Leave

Node Leave

21

5

7

2

3

14

6

15

20

8

1024

13

18

22

25

26

4

9

11

23

16

19

17

27 28

29

30

3132

33

34

40

36

3738

1

42

43

44

45

39

12

41Node 1 Leave

For node 41:1.Deletes node 1 from table2.Informs node 45 to change its own

location in Coterie Tree 29


35

Yi-Chen Yang

QRERP - Node Leave


1

7 13

19 23 2926

31 32 4541

Yi-Chen Yang

QRERP - Node Leave


1

Leave

7 13

19 23 2926

31 32 4541

Yi-Chen Yang

QRERP - Node Leave


Node 45 •Step1.

•To select set {7, 13, 19, 23, 26, 31, 45} and copy their data7 13

19 23 2926

31 32 4541

•Step2.•To change location

Yi-Chen Yang

QRERP - Node Leave


•Step 3.•Broadcast all member this change.

7 13

19 23 2926

31 32

45

41

Node 45 •Step1.

•To select set {7, 13, 19, 23, 26, 31, 45} and copy their data

•Step2.•To change location

Yi-Chen Yang

Conclusion

QRERP Matrix representation Local matrix operation Quorum scheme

Advantages Backup routes Less control overhead Mobility management Route maintenance

Thank You!!

a quorum-based robust and efficient routing protocol for mobile ad-hoc network yi-chen yang graduate...

Documents