TOPOLOGY DESIGN FOR CONTINGENCY CELLULAR NETWORK - PowerPoint PPT Presentation

Loading...

PPT – TOPOLOGY DESIGN FOR CONTINGENCY CELLULAR NETWORK PowerPoint presentation | free to download - id: 6e5ccc-NmIxN



Loading


The Adobe Flash plugin is needed to view this content

Get the plugin now

View by Category
About This Presentation
Title:

TOPOLOGY DESIGN FOR CONTINGENCY CELLULAR NETWORK

Description:

Title: Topology Design For Contingency Celluler NetworkContingency Cellular Network Author: Catherine Last modified by: catherine Created Date: 5/6/2008 2:00:36 PM – PowerPoint PPT presentation

Number of Views:61
Avg rating:3.0/5.0
Slides: 73
Provided by: Cathe172
Category:

less

Write a Comment
User Comments (0)
Transcript and Presenter's Notes

Title: TOPOLOGY DESIGN FOR CONTINGENCY CELLULAR NETWORK


1
TOPOLOGY DESIGN FOR CONTINGENCY CELLULAR NETWORK
  • ??????????????

???? ??? ?? ??? ??? ?? 2011.5.25
2
Outline
  • Introduction
  • ?????????
  • ????????????
  • Related work
  • ?????????
  • ?????????
  • Contingency Cellular Network (CCN)
  • Concept
  • Component
  • Procedure

3
Outline
  • Topology Design for CCN
  • Concept
  • Model with depth bounded
  • Model with hop concern
  • Evaluation
  • Conclusion future work

4
INTRODUCTION
5
????????
  • ??????
  • ????

Event Event Date Dead
North-East Japan Earthquake Tsunami 03/11/2011 15,069
QingHai, China Earthquake 04/14/2010 1706
Chile Earthquake 02/27/2010 800
Port-au-Prince, Haiti Earthquake 01/13/2010 230,000
SiChuan, China Earthquake 05/12/2008 69,227
Katrina, US Hurricane 08/23/2005 1,836
Chi-Chi, Taiwan Earthquake 09/21/1999 2,415
North-East Japan ?????? ???????????
??2011?5?16?(JST)
6
?????????
  • ????
  • ????
  • ?????
  • ????
  • ???????

7
?????????
  • ????????
  • ????
  • ????????
  • ??????????

8
Golden 72 Hours
  • ??72??????
  • ????????????
  • ?????????
  • ????
  • ??????
  • ???????

9
????????????
  • ???????
  • ???????????
  • ????
  • ??????
  • ??????????

10
????????????
  • ???????????
  • ???
  • ??????
  • ???-?????(MSC)
  • ????????
  • ????????
  • 921??
  • ??????15?,????????
  • 88??
  • ????????3302?
  • ??????????1800?
  • 550?????????????

???? NCC ??????????????
11
????
  • ?????????
  • ??????
  • ???????????
  • ?????????????
  • ??????
  • ????????
  • ?????
  • ???????????
  • ????
  • ??????

12
  • ????????????
  • ????
  • ??????????
  • ??????????????
  • ??????
  • ??????????
  • ????
  • ??
  • ??????

13
RELATED WORK
14
??????????
  • golden 72 hrs??,????
  • ??????
  • ???????
  • ????????
  • ????????
  • ???????????
  • ??
  • ????
  • ????????
  • ????
  • ????
  • ??????????

15
????????
  • Walkie-Talkie
  • ?????
  • Pros.
  • without infrastructure
  • Convenient
  • high reliability
  • Cons.
  • low popularity
  • ????
  • 7?-240?
  • 14?-1052?

???? NCC News 09?? p.2-p.5
16
????????
  • Amateur Radio
  • Ham Radio, ?????
  • Long range wireless communication system
  • Pros.
  • without infrastructure
  • high reliability
  • Cons.
  • low popularity
  • low mobility
  • ????
  • ??? ???radio station????
  • ??? ???10?radio station

???? NCC ?????????
17
????????
  • Mobile Base Stations for cell phones
  • ???????
  • Pros.
  • ??????
  • ?????????
  • Cons.
  • ?????????????
  • ???????????
  • ???????????????
  • ?? 18?
  • ?? 11?
  • ?? 8?

???? ????
18
????????
  • Specialized Emergency Communication Systems
  • ?????????
  • Pros.
  • ????????
  • Cons.
  • ?????????????
  • ????????
  • ??
  • ?????
  • Project 25

19
????????
  • MANET
  • ???????????????????????
  • Pros.
  • Without infrastructure
  • ??????????
  • ??????????
  • ??????
  • ?????,????
  • Cons.
  • ???????
  • ??????????????????
  • ??????
  • P2PNET

20
??????????
???? ?? ??
Walkie-Talkie convenient reliable low popularity
Amature Radio reliable low popularity
Emergency Mobile Base Stations for cell phones reliable for emergency use too few too expensive too heavy
Specialized Emergency Communication Systems reliable for emergency use too expensive need special training
MANET convenient no special training power supply popularity
21
CONTINGENCY CELLULAR NETWORK
22
Contingency Cellular Network
  • ?????????, CCN
  • ????????????
  • ??????
  • ??????
  • ????????????
  • ????????????

23
CONTINGENCY CELLULAR NETWORK
  • ??2G?3G??????
  • ??????
  • ???????
  • ???
  • ??????
  • ????????,?????
  • ??????topology,?????
  • ????????
  • ????
  • ????
  • ?line-of-sight??
  • ?????
  • ??????????
  • ?????

24
CONTINGENCY CELLULAR NETWORK
  • ???
  • ?????????
  • ???
  • ???????
  • ???????
  • ???????????
  • ??
  • ??????
  • ????????
  • ????

25
CONTINGENCY CELLULAR NETWORK
  • ?????
  • ??????
  • ???WiFi
  • Microwave
  • ???
  • ??
  • ECModule

26
CONTINGENCY CELLULAR NETWORK
  • ??????
  • Emergency Communication Module (ECModule)
  • Processor
  • Admission control
  • Data forwarding
  • Intranet communication
  • Wireless Communication Modules
  • Interface to Base Station

27
CONTINGENCY CELLULAR NETWORK
  • ECModule ???
  • ????????
  • ?????????
  • Hop relay
  • ??????????

28
CONTINGENCY CELLULAR NETWORK
  • CCN framework

29
CONTINGENCY CELLULAR NETWORK
  • CCN????

30
CONTINGENCY CELLULAR NETWORK
  • CCN????

31
CONTINGENCY CELLULAR NETWORK
  • CCN????

32
CONTINGENCY CELLULAR NETWORK
  • CCN????

33
CONTINGENCY CELLULAR NETWORK
  • CCN????

34
CONTINGENCY CELLULAR NETWORK
  • Research issues
  • ??????
  • ??????????
  • ?????????
  • ??????
  • ????
  • ?????????
  • ?????????
  • ??????
  • ??????
  • Multi-hop relay
  • ???????Channel??
  • ????????????

35
CONTINGENCY CELLULAR NETWORK
  • Research issues (Con.)
  • Priority-based ????
  • ?????????????
  • ???????????
  • Intranet??
  • ???????????
  • ?????????
  • ???????
  • Ex. ???????????
  • Interface??
  • ECModule????????
  • Protocol??

36
TOPOLOGY DESIGN FOR CCN
37
TOPOLOGY DESIGN FOR CCN
  • ??????????
  • Multi-hop relay
  • ???????
  • Topology design?????
  • ????
  • ????
  • ????

38
TOPOLOGY DESIGN FOR CCN
  • ????
  • ?????
  • ?????
  • partition
  • ?????????
  • ?????
  • ?????

39
TOPOLOGY DESIGN FOR CCN
  • 2-link ????
  • 3-link ????

40
TOPOLOGY DESIGN FOR CCN
  • CCN forwarding tree

41
TOPOLOGY DESIGN FOR CCN
  • ??(ECModule)??
  • ???????????
  • ????????
  • Ex. ??
  • ??????
  • ????
  • ??profit??
  • profit function
  • ????
  • ?????????
  • Relay hop??????

42
MODEL WITH BOUNDED DEPTH
-PROBLEM DEFINITION
  • Optimize
  • ??????,?CCN????????????
  • ??forwarding tree?depth
  • ??????
  • ??????
  • ??????

Without depth constraint
With depth constraint3
43
MODEL WITH BOUNDED DEPTH
-PROBLEM DEFINITION
  • Given a graph, G(V, E), where

44
MODEL WITH BOUNDED DEPTH
-PROBLEM DEFINITION
  • Our problem is to find a CCN forwarding tree,
    where
  • Such that
  • Maximize
  • Subject to

45
MODEL WITH BOUNDED DEPTH
-PROBLEM DEFINITION
  • K-maximum spanning tree problem with bounded
    depth (K-MaxSTBD)
  • K-maximum spanning tree
  • Bounded depth
  • NP-Complete problem

46
MODEL WITH BOUNDED DEPTH
-NP-COMPLETENESS
  • K-minimum spanning tree (K-MST)
  • K-Cardinality Tree (KCT)
  • ??n?node?graph?
  • ????????K???spanning tree
  • Edge-weighted
  • NP-hardness
  • M. Fischetti, H.W. Hamacher, K. Joernsten, F.
    Maffioli, Weighted k-cardinality trees
    complexity and polyhedral structure, Networks 24
    (1994) 1121.
  • Node-weighted
  • NP-Completeness
  • U. Faigle, W. Kern, Computational complexity
    of some maximum average weight problems with
    precedence constraints, Operations Research, Vol.
    42 No.4 (1994) 688693.

47
MODEL WITH BOUNDED DEPTH
-NP-COMPLETENESS
  • Minimum spanning tree
  • ?????????
  • ????
  • Prims algorithm
  • Kruskals algorithm
  • Maximum spanning tree
  • ?node weight???(????)
  • ?minimum spanning tree
  • ??node weight?????(????)
  • Polynomial time??????

48
MODEL WITH BOUNDED DEPTH
-NP-COMPLETENESS
  • ??????????
  • min. spanning tree max. spanning tree
  • K-Min. Spanning Tree K-Max. Spanning Tree

49
MODEL WITH BOUNDED DEPTH
-NP-COMPLETENESS
  • K-MaxST
  • K-MaxSTBD
  • G(V,E)
  • VV, EE, KK
  • depth bound
  • DK
  • G(V,E), K

Reduce
50
MODEL WITH BOUNDED DEPTH
-SOLUTION
  • Bounded depth tree building algorithm (BDTBA)
  • Greedy strategy

51
MODEL WITH BOUNDED DEPTH
-SOLUTION
  • BDTBA Example 1
  • of resource (K) 5
  • Node weight 15
  • B (bound)3
  • Total profit 14

52
MODEL WITH BOUNDED DEPTH
-SOLUTION
  • Brute Force Example 1
  • of resource (K) 5
  • Node weight 15
  • B (bound)3
  • Total profit 15

53
MODEL WITH BOUNDED DEPTH
-SOLUTION
  • BDTBA Example 2
  • of resource (K) 5
  • Node weight 15
  • B (bound)3
  • Total profit 14

54
MODEL WITH BOUNDED DEPTH
-SOLUTION
  • Brute Force Example 2
  • of resource (K) 5
  • Node weight 15
  • B (bound)3
  • Total profit 14

55
MODEL WITH HOP CONCERN
-PROBLEM DEFINITION
  • Optimize
  • ??????,?CCN????????????
  • ??relay hop?
  • ??????
  • ??????
  • ??????

Max relay hop count 4
Max relay hop count 6
56
MODEL WITH HOP CONCERN
-PROBLEM DEFINITION
  • Given a graph, G(V, E), where

57
MODEL WITH HOP CONCERN
-PROBLEM DEFINITION
  • Our problem is to find a CCN forwarding tree,
    where
  • Such that
  • Maximize
  • Subject to

58
MODEL WITH HOP CONCERN
-SOLUTION
  • Hop-concern tree building algorithm (HCTBA)
  • Greedy strategy

59
MODEL WITH HOP CONCERN
-SOLUTION
  • HCTBA Example 1
  • of resource (K) 5
  • Node weight 15
  • Total Count Profit 9
  • Total Node Profit 13
  • Tree Depth 2

60
MODEL WITH HOP CONCERN
-SOLUTION
  • HCTBA Example 2
  • of resource (K) 5
  • Node weight 15
  • Total Node Profit 12
  • Total Count Profit 65/6
  • Tree Depth 3

61
EVALUATION
62
EVALUATION
  • Graph nodes
  • 10 nodes
  • 20 nodes
  • 30 nodes
  • ?10?test cases
  • ?????K(tree size), B(depth bound)
  • ??
  • Total profit
  • Computing time
  • Tree depth

63
EVALUATION
  • Experiment 1.
  • 10 nodes graph
  • 10 different graphs
  • K 5
  • B 3

64
EVALUATION
  • Experiment 1.
  • 10 nodes graph
  • 10 different graphs
  • K 5
  • B 3

65
EVALUATION
  • Experiment 1.
  • 10 nodes graph
  • 10 different graphs
  • K 5
  • B 3

66
EVALUATION
  • Experiment 2.
  • 10 nodes graph
  • 10 different graphs
  • K 8
  • B 3

67
EVALUATION
  • Experiment 2.
  • 10 nodes graph
  • 10 different graphs
  • K 8
  • B 3

68
EVALUATION
  • Experiment 2.
  • 10 nodes graph
  • 10 different graphs
  • K 8
  • B 3

69
EVALUATION
70
EVALUATION
71
CONCLUSION AND FUTURE WORK
  • CCN?????
  • ????????
  • ???????????
  • CCN?????
  • ???????????
  • ?????????????
  • ???????????
  • Topology Design for CCN
  • ????CCN?????????
  • ??optimization model
  • ??heuristic solution

72
CONCLUSION AND FUTURE WORK
  • Future Work
  • ??????
  • ??????
  • Priority-based ????
  • Intranet??
  • Interface??
  • ?????
  • ?????
About PowerShow.com