본문바로가기

자료 카테고리

전체 1
도서자료 0
학위논문 1
연속간행물·학술기사 0
멀티미디어 0
동영상 0
국회자료 0
특화자료 0

도서 앰블럼

전체 (0)
일반도서 (0)
E-BOOK (0)
고서 (0)
세미나자료 (0)
웹자료 (0)
전체 (1)
학위논문 (1)
전체 (0)
국내기사 (0)
국외기사 (0)
학술지·잡지 (0)
신문 (0)
전자저널 (0)
전체 (0)
오디오자료 (0)
전자매체 (0)
마이크로폼자료 (0)
지도/기타자료 (0)
전체 (0)
동영상자료 (0)
전체 (0)
외국법률번역DB (0)
국회회의록 (0)
국회의안정보 (0)
전체 (0)
표·그림DB (0)
지식공유 (0)

도서 앰블럼

전체 1
국내공공정책정보
국외공공정책정보
국회자료
전체 ()
정부기관 ()
지방자치단체 ()
공공기관 ()
싱크탱크 ()
국제기구 ()
전체 ()
정부기관 ()
의회기관 ()
싱크탱크 ()
국제기구 ()
전체 ()
국회의원정책자료 ()
입법기관자료 ()

검색결과

검색결과 (전체 1건)

검색결과제한

열기
논문명/저자명
An Efficient network partition handling scheme for group membership service in mobile Ad hoc networks = MANET 환경에서의 그룹 멤버쉽 서비스를 위한 효율적인 네트워크 분할 핸들링 기법 / 남덕윤 인기도
발행사항
대전 : 한국정보통신대학교 대학원, 2006.8
청구기호
TD 621.384 ㄴ185e
형태사항
x, 93 p. ; 26 cm
자료실
전자자료
제어번호
KDMT1200686758
주기사항
학위논문(박사) -- 한국정보통신대학교 대학원, Engineering, 2006.8
원문
미리보기

목차보기더보기

Title page

Abstract

Contents

Chapter 1 Introduction 14

1.1 Motivation 14

1.2 Problem Statement 15

Background : View change in a group membership service 15

Link failures due to mobility 16

Capricious view changes 18

1.3 Contribution 22

1.4 Dissertation Organization 25

Chapter 2 Related Works 26

2.1 Group Membership Service 26

System Model 26

Issues in the Group Membership Service 27

2.2 Group Communication in MANETs 29

Proximity layer approach 29

Safe distance approach 31

Localized group membership service 33

2.3 Virtual Grid in MANETs 35

Grid Location Service 35

Geographical Adaptive Fidelity 36

Chapter 3 Network Partition Handling Scheme for Group Membership Service 38

3.1 Reachability Estimation 39

3.1.1 Virtual Grid 39

3.1.2 Dwell Time and Reachable Duration Map 41

3.1.3 Consistency among reachable duration maps of each member 44

3.1.4 Example : Reachable duration map 45

3.2 Network Partition Unit 46

3.2.1 Contiguous Region 46

3.2.2 Group Maintenance based on Network Partition Unit 49

Three types of coordinators 51

Region-coordinator (R-coordinator) 53

A contiguous-region-coordinator (C-coordinator) 53

Coordinator election 54

R-coordinator update 54

C-coordinator update 55

3.3 Group Management for Members' Participation 59

3.3.1 Group construction 59

3.3.2 Member join 61

3.3.3 Member leave 65

3.4 Group Management for Members' Mobility 66

3.4.1 Group partition 68

3.4.2 Group merging 70

Chapter 4 Implementation 73

4.1 System Overview 73

4.1.1 System architecture 73

4.1.2 Main data structures 74

4.2 Functionality details 77

4.2.1 RD calculation module 78

4.2.2 RDmap construction module 80

4.2.3 Reachability change detection module 81

4.2.4 Coordinator election module 82

4.2.5 Other modules 83

Chapter 5 Performance Evaluation 85

5.1 Simulation Environment 85

5.2 Result and Analysis 86

5.2.1 Reachability 86

Query accuracy probability 86

Result 87

5.2.2 Network partition handling 92

Chapter 6 Conclusions 95

6.1 Summary 95

6.2 Directions for Future Research 97

국문요약 98

References 101

Acknowledgement 107

Table 2.1 : Group communication issues according to environments. 27

Table 3.1 : Main Symbols and Descriptions. 41

Table 3.2 : Notations and Descriptions used in the hierarchical group maintenance. 52

Table 5.1 : Confidence intervals for the number of view changes in the random way point model 93

Figure 1.1 : View change procedure, when member m4 is disconnected from the group. 15

Figure 1.2 : Periodical messages m0 and m00 are meaningless for detecting a reachability change, if nodes p and q are located within the transmission range of each other even if they are moving 17

Figure 1.3 : One group is partitioned into two subgroups, when node m6 moves out the transmission range of node m5. 18

Figure 1.4 : Blocking time increases due to the cascading view estimation. 20

Figure 1.5 : Conceptual layer in the reachability estimation scheme. 23

Figure 1.6 : Example: Three contiguous-regions. 24

Figure 2.1 : Architecture for group membership service in mobile networks. 30

Figure 2.2 : Example of Safe distance approach. 32

Figure 2.3 : Architecture for Localized group membership service. 33

Figure 3.1 : Positions and region indices of nodes i, m, k, and j. 40

Figure 3.2 : Node information for reachability estimation. 41

Figure 3.3 : Problems in basic dissemination policy. 44

Figure 3.4 : Reachable duration map from node a, RDmap(a). 45

Figure 3.5 : A single contiguous region in a group. 47

Figure 3.6 : Multiple contiguous regions in a group. 48

Figure 3.7 : Hierarchical structure for group maintenance 51

Figure 3.8 : Example 1 : C-coordinator election procedure when a single subgroup under one c-coordinator is divided into multiple subgroups. 55

Figure 3.9 : Example 2 : C-coordinator election procedure when multiple subgroups are merged into one subgroup. 58

Figure 3.10 : Group construction and member join as an r-coordinator. 60

Figure 3.11 : Member join as a c-coordinator. 63

Figure 3.12 : Member join as a normal member. 64

Figure 3.13 : Group partition procedure. 67

Figure 3.14 : Group merging procedure. 71

Figure 4.1 : System Architecture. 74

Figure 5.1 : Simulated terrain for the obstacle mobility model. 86

Figure 5.2 : Query accuracy probability. 87

Figure 5.3 : Simulation results for the reachability estimation scheme in the obstacle mobility (OM) model. 89

Figure 5.4 : The QAPs with the same number of messages under the random way point (RWP) model. 90

Figure 5.5 : The QAPs with the same number of messages under the obstacle mobility (OM) model. 90

Figure 5.6 : Enhancement of random way point and obstacle mobility models. 91

Figure 5.7 : The number of view changes with confidence intervals in the random way point model. (Confidence probability=0.98) 94

권호기사보기

권호기사 목록 테이블로 기사명, 저자명, 페이지, 원문, 기사목차 순으로 되어있습니다.
기사명 저자명 페이지 원문 기사목차
연속간행물 팝업 열기 연속간행물 팝업 열기