Topological Characteristic of Wireless Network

Transcription

1 Topological Chaacteistic of Wieless Netwok Its Application to Node Placement Algoithm Husnu Sane Naman 1

2 Outline Backgound Motivation Papes and Contibutions Fist Pape Second Pape Thid Pape Futue Woks Refeences 2

3 Backgound: Netwok Science Netwok Science : Studying of the theoetical foundations of netwok stuctue/dynamic behavio and its application to many fields. Examples of Topological Chaacteistics Degee Path Length Clusteing Coefficient 3

4 Backgound: Topological Chaacteistics Examples Dif. Netwok SMW Regula N Aveage Degee Aveage Path Length Clusteing Coefficient ( A study on Topological Chaacteistic of Wieless Senso Netwok Based on Complex Netwok, Ren Yueqing, Xu Lixin Measue Compaison of Diffeent Netwok ) 4

5 Backgound: Exta Chaacteistics Thee ae many othe topological chaacteistics Entopy Diamete Coveage Connectivity Biconnectivity Some of them only applicable to some netwoks Coveage 5

6 Motivation: Impotance of Topology Chaacteistics Pefomance of Potocol Diamete Bounds the maximum delay in message communication Connectivity Secuity Degee Data dissemination fom one pat of netwok to anothe Minimum size of connected component fo useful wok Highe degee means highe node connectivity Geneate moe ealistic topologies fo Simulations 6

7 Papes and Contibutions Topological Chaacteistics of Random Multihop Wieless Netwok by Keqin Li Analysis and Evaluation of Topological and Application Chaacteistics of Uneliable Mobile Wieless Ad-Hoc Netwok by Seda Cabuk, Nipoon Malhota, Longbi Lin, Sauabh Bagchi, and Ness Shoff NPART-Node Placement Algoithm fo Realistic Topologies in Wieless Netwok Simulation by Batislav Milic and Miaslow Malek 7

8 Fist Pape : Topological Chaacteistics of Random Multihop Wieless Netwok Related Woks: Ramanathan and Lyold: not abitay geneal gaph Sen and Houston: Point gaphs to epesent MWN Pape elated to this pape: Topology Contol of Multihop Wieless Netwoks (set the tansmission powe of node to satisfy cetain popety. ) Not much have been done until this pape Contibutions: Analyzing of topological popeties of andom wieless netwok. Can be useful fo eal application Fo example: Connectedness, Diamete fo powe efficiency 8

9 Analysis What is diffeent in Wieless? Random netwok in wieless is diffeent than nomal andom netwoks Connectivity : Depending on locations and distance among the nodes Topology Chaacteistics which ae studied: Degee, connectivity, diamete, bandwidth ( cutset, patition ) and biconnectivity ( fault toleance, two disjoint path ) Link pobability: Needed fo finding above chaacteistics 9

10 Link Pobability Inteested field, 1 unit 10

11 Link Pobability (Continue) Link pobability depends on the position whee we choose the fist node Inteested field, 1 unit 11

12 Link Pobability (Continue) Case1: Fist node inside the small squae, pobability = (1-2) 2 Vi Inteested field, 1 unit 12

13 Link Pobability (Continue) Choose vj: what is pobability vj in tansmission ange of vi? Vi Inteested field, 1 Unit 13

14 Link Pobability (Continue) pobability vj in tansmission ange of vi is π 2 Vi Inteested field, 1 Unit 14

15 Link Pobability (Continue) pobability vj in tansmission ange of vi while vi inside small squae is (1-2) 2 π 2 Vi Inteested field, 1 Unit 15

16 Link Pobability (Continue) Vi Case2: vi is located between small squae and big squae but not on cones Inteested field, 1 Unit 16

17 Link Pobability (Continue) x Vi Case2: vi is located between small squae and big squae but not on cones Inteested field, 1 Unit 17

18 Link Pobability (Continue) x 0 x, 1/2 Case2: vi is located between small squae and big squae but not on cones Inteested field, 1 Unit 18

19 Link Pobability (Continue) B x A Case 2: The aea of cicle unde AB segment -x a 19

20 Link Pobability (Continue) x1 x2 Case 3: vi on cones Inteested field, 1 Unit 20

21 Link Pobability (Continue) Case 3: The aea of cicle intesection with squaes The link pobability of vi has a link to vj 21

22 Effect of Link to Chaacteistics Expected Degee of nodes: 22

23 Effect of Link to Chaacteistics (Continue) Connectivity(afte 1000 simulated netwoks fo each and n values): n 23

24 Effect of Link to Chaacteistics (Continue) Diamete: 24

25 Effect of Link to Chaacteistics (Continue) Diamete: B 2 A 25

26 Effect of Link to Chaacteistics (Continue) Diamete: B 2 A 26

27 Effect of Link to Chaacteistics (Continue) Diamete Pob. 27

28 Effect of Link to Chaacteistics (Continue) Expected Bisection Width: 28

29 Conclusion of Fist Pape Useful implication in eal applications Powe save Pefomance Citics about this pape Why Unit Squae, it can be ectangle: 29

30 Conclusion of Fist Pape Useful implication in eal applications Powe save Pefomance Citics about this pape Why Unit Squae, it can be ectangle, pape can be impovable y x k Doubts about Fomula. l 30

31 Second Pape : Analysis and Evaluation of Topological and Application Chaacteistics of Uneliable Mobile Wieless Ad-Hoc Netwok 31

32 Second Pape Related Woks: Thee have been studies which have looked only one o two paametes in static envionment. Random node placement Stationay node failues Contibutions: Analyzing connectivity and coveage in mobile ad-hoc netwok with tansient and pemanent failue. Goal diected algoithms (Mean shift Clusteing -MSC, and Shift Neighbos Away - SNA) Desied Netwok based on chaacteistics/ satisfies some of them togethe 32

33 Second Pape Connectivity : max. pat coveed/ total aea Diamete: 4 Coveage: total disk cov./ total aea Degee : 5 33

34 Coveage Computation Simplification Disk coveage computation is ovehead By Conveting squae which gives lowe bound on coveage A node coves 2R Cell (i,j) is coveed by any adjacent 8 cells Coveage can be computed as numbe of coveed cell/ total numbe of cell 34

35 System Models Senso Netwok Each node has a sensing ange sepaate fom tansmission ange Moving any diection in two dimensional gid 35

36 Mobility Algoithm: Mean Shift Clusteing Algoithm Deceasing diamete Move node to the cente of neighbos K o less neighbos ae used fo pocess Coveage can be significantly small Used a Local Evaluation Function (LEF) fo coveage LEF = w1.sum of distance fom k neighbosw2.distance fom cente w1 and w2 can be adjusted depending on popety x 36

37 Mobility Algoithm: Shift Neighbos Away Algoithm Inceasing Coveage Pushing neighbos left to ight o top to bottom Global Evaluation function fo oll back 37

38 Mobility Algoithm: Global Evaluation Function It is needed fo whethe oll back is equied GEF =w1.connectivity + w2.coveeage w3.diamete GEF positive: accept othewise: oll back Roll back just atificial because the nodes pefom evaluation befoe movement. Geneal state cannot be know theefoe to detect it, find it appoximately, the potion of senso netwok should be used 38

39 Mobility Algoithm: Find Distance and Node Position ancho nodes Deducing location of all nodes Tiangulation d1 d2 d3 39

40 Mobility Algoithm: Location Detemination Hop-Teain and Refinement (Savaece and Rabaey) How many nodes away fom anchos Use this knowledge to detemine positions 40

41 Mobility Algoithm: Analysis of Coveage and Connectivity and Result Mapping mobility to stationay uneliable gid Impact of mobility Impact of Uneliability Result No significant diffeence between stationay case and Mobility ( Constant facto) Engineeing Heuistics to ensue connectivity and coveage 41

42 Expeiments: Without Failues 42

43 Expeiments: With Failues 43

44 Conclusion of Second Pape Effect of Node failue to Chaacteistic of Netwok Poposing algoithm fo node placement moe wisely Futue Wok can be about this pape. Obstacles Enegy efficiency of this algoithm Heteogeneous sensos 44

45 Thid Pape: NPART-Node Placement Algoithm fo Realistic Topologies in Wieless Netwok Simulation 45

46 Thid Pape Related Woks: Node placement algoithm in homogeneous nodes Bettestte (Unifom and Thinning), Lui and Haenggi intoduce some node placement algoithm, Onat and Stajmenovij, new idea (connected high pobability with degee (options) Contibutions: Obseving eality and ceating a netwok has same popeties Inceasing ealistic topologies 46

47 Model And Aimed Simulato Flexible Moe than one node distibution model Realistic Input eal, output netwok should have same popeties Random Ceating, andom 47

48 NPART Algoithm Inputs: Numbe of nodes, Output : Netwok Topology Algoithm: Initial node placement in (x, y) position Initial minx and maxx = x, and miny and maxy = y X coodinate simply placed in the ange of (minx-, maxx+), same fo y, (no need to pedefine geo.) Metic should be added depends on netwok needs 48

49 NPART Algoithm: Simulation (maxx+, maxy+) (maxx, maxy) (minx, miny) (minx+, miny+) 49

50 NPART Algoithm: Simulation (maxx, maxy) 0 (maxx+, maxy+) (minx, miny) (minx+, miny+) 50

51 NPART Algoithm: Simulation x 0 (maxx+, maxy+) (maxx, maxy) (minx, miny) (minx+, miny+) 51

52 NPART Algoithm: Simulation 1 (maxx, maxy) x 0 (maxx+, maxy+) 2 (minx, miny) 3 (minx+, miny+) 52

53 Metic Quality No univesal Metic Real measuement fom netwok Had (Heteogeneous, obstacles, fequency) Not toleable Aveage degee is not enough Degee is not enough to geneate moe ealistic one but it is easy, no need to deal with potocols. 53

54 Metic which is used by Authos Simila to Manhattan Metic 54

55 Metic which is used by Authos Simila to Manhattan Metic 55

56 Metic which is used by Authos Simila to Manhattan Metic 56

57 Metic which is used by Authos Simila to Manhattan Metic 57

58 Expeimental Result: Sample fom Belin netwok NPART without etiees NPART with 150 etiees 58

59 Expeimental Result (Continue): Degee distibution Simila to Real Belin and Leipzig Unifom has its own distibution Bidge (component) and Aticulation Point (Netwok) Distibution same but it ceates moe point than it supposed Unifom, only 1% of nodes is bidges an aticulation point Component size afte bidge emoval 59

60 Expeimental Result (Continue): Can be impoved by eliminating pendant links 60

61 Conclusion of Thid Pape New Simulation Model Realistic Futue Wok can be about this pape. Inceasing thoughput o finding some univesal metic 61

62 Futue Wok Can Be: 3D will be inteesting fo analyzing Topological Chaacteistics Poposing heteogeneous o Obstacle Goal Diven Algoithm 62

63 Questions 63

64 Refeences 1. Topological Chaacteistics of Random Multihop Wieless Netwok by Keqin Li 2. Analysis and Evaluation of Topological and Application Chaacteistics of Uneliable Mobile Wieless Ad-Hoc Netwok by Seda Cabuk, Nipoon Malhota, Longbi Lin, Sauabh Bagchi, and Ness Shoff 3. NPART-Node Placement Algoithm fo Realistic Topologies in Wieless Netwok Simulation by Batislav Milic and Miaslow Malek 4. A study on Topological Chaacteistic of Wieless Senso Netwok Based on Complex Netwok, Ren Yueqing, Xu Lixin 5. Robust Positioning Algoithms fo Distibuted Ad-Hoc Wieless Senso Netwoks by Chis Savaese, Jan Rabaey 6. Stategies and techniques fo node placement in wieless senso netwoks: A suvey by Mohamed Younis a, Kemal Akkaya 7. Netwok Science Theoy and Application by Ted G. Lewis 64

65 Additional Slides: Fomulas (Second Pape) 65

66 Additional Slides: Fomulas (Second Pape) 66

67 Additional Slides: Expeiments (Second Pape) 67

68 Additional slides : Npat Pseudo code 68

69 Why Do We Need? Connectivity - Data dissemination fom one pat of netwok to anothe - Minimum size of connected component fo useful wok Coveage - Can gathe data about popeties of coveed egion Diamete - Bounds the maximum delay in message communication - Impotant fo data dissemination envionments with eal time needs Degee - Highe degee means highe node connectivity - Highe node connectivity means highe esilience to node failues Bisection width - A paamete which effects communication bandwidth of netwok Biconnectivity - A popety elated to fault toleance and netwok obustness Entopy, Aveage path length, Cluste Coefficient 69