생몰정보
소속
직위
직업
활동분야
주기
서지
국회도서관 서비스 이용에 대한 안내를 해드립니다.
검색결과 (전체 1건)
원문 있는 자료 (1) 열기
원문 아이콘이 없는 경우 국회도서관 방문 시 책자로 이용 가능
목차보기더보기
Title page
Abstract
Contents
I. Introduction 11
1.1 Background 11
1.1.1 Wireless Mobile Ad Hoc Networks 11
1.1.2 Virtual Backbones 12
1.1.3 The Necessities of Virtual Backbones 13
1.2 Motivation 13
1.2.1 Design Considerations 13
1.2.2 Existing Approaches 14
1.2.3 More Message-Efficiency 16
1.2.4 Problem Statement 16
1.3 Contribution 19
1.4 Organization 20
II. Related Work 21
2.1 Introduction 21
2.2 Centralized CDS Construction 21
2.3 Distributed CDS Construction 25
2.3.1 Clustering Algorithm 25
2.3.2 Distributed Guha and Khuller Algorithm 26
2.3.3 MIS based CDS (MIS-CDS) Algorithm 27
A). Single Leader MIS-CDS Algorithm 27
B). Multiple Leader MIS-CDS algorithm 29
2.3.4 Other Algorithms 30
2.4 Summary 32
III. Proposed Algorithm 33
3.1 Modeling Mobile Ad Hoc Networks 33
3.1.1 Definitions 33
3.1.2 Modeling Related Properties 36
3.2 Assumptions 38
3.3 Description 39
3.3.1 Initial Configuration Phase 39
A). Construction Request Propagation Step 39
B). Regional Membership Exchange Step 43
3.3.2 Configuration Management Phase 47
A). Host Join 47
B). Host Leave 49
3.3.3 Mobility Handling in Initial Configuration Phase 52
3.3.4 Correctness 53
3.4 Complexity 55
3.4.1 Initial Configuration Phase 55
3.4.2 Configuration Management Phase 58
3.4.3 CDS based Algorithm 59
A). WCDS Construction Techniques 59
B). CDS Construction Techniques 60
3.5 Virtual Backbone Type 62
3.5.1 Connectivity among VB members 62
3.5.2 The Size of CDS 63
3.6 Applications 64
3.6.1 A Message-Efficient Mobility Management Scheme in MANET 64
A). Introduction 64
B). Algorithm Description 65
C). Complexity 67
D). Conclusion 67
3.6.2 An Energy-Efficient Path Finding Algorithm in Micrsosensor Networks 68
A). Introduction 68
B). Energy Consumption Equation 69
C). Algorithm Description 72
D). Complexity 79
E). Conclusion 81
IV. Performance Evaluation 82
4.1 Message-Efficiency in Mobile Ad Hoc Networks 82
4.1.1 Mobility Management Cost Analysis 82
4.1.2 Comparison 85
4.1.3 Conclusion 86
4.2 Energy-Efficiency in Microsensor Networks 89
4.2.1 Consumed Energy Analysis 89
A). Energy Consumption Analysis of Different Paths 89
B). Energy Consumption in Two Phases 91
4.2.2 Comparison 92
4.2.3 Conclusion 92
4.3 Comparisons with Other Similar Algorithms 95
4.3.1 Comparison with simple flooding based protocol 95
4.3.2 Comparison with group construction protocol 96
4.3.3 Comparison with the minimum-weight spanning tree 96
4.3.4 Comparison with the shortest path algorithm 96
4.4 Conclusion 96
V. Conclusion 97
5.1 Summary 97
5.2 Future Work 99
국문요약 100
References 102
Acknowledgements 108
Table 1. Membership and Reachable Host Set. 36
Table 2. Results of Multiple Initiators. 44
Table 3. Results of Regional Membership Exchanges. 45
Table 4. Complexity of Initial Configuration Phase. 57
Table 5. Complexity of Reconfiguration for Hosts Movements. 59
Table 6. Performance comparison for distributed CDS construction algorithms. 61
Table 7. Number of Messages for Movements. 85
Table 8. Mobility management cost comparison. 88
Figure 1. One instance of wireless mobile ad hoc networks. 11
Figure 2. A virtual backbone in wireless mobile ad hoc networks. 12
Figure 3. Possbile DSs. 15
Figure 4. One instance of virtual backbones in a given network. 18
Figure 5. An example of Guha s first algorithm. 22
Figure 6. An example of Guha s second algorithm. 23
Figure 7. Instability of the lowest ID clustering by joining lower ID node. 26
Figure 8. Illustrates the sequences of MIS-CDS algorithm. 28
Figure 9. An Initial Phase of Msssage-Optimal CDS Construction 29
Figure 10. Change of Node s Role in Message-Optimal CDS Construction 29
Figure 11. A Constructed Message-Optimal CDS 29
Figure 12. Examples of two pruning principles to eliminate redundant nodes 30
Figure 13. Dominating (absorbent) neighbor set of vertex u 31
Figure 14. Mobile ad hoc network modeling. 34
Figure 15. A sample connectivity graph. 35
Figure 16. GMST at t : (a), and t, (b), (c), and (d). 35
Figure 17. Possible STs (a), (b) and (c). 40
Figure 18. Poposed scheme. 42
Figure 19. Multiple initiators and corresponding regions. 44
Figure 20. Initial physical configuration (a) and two initiators (b), where y ] t. 45
Figure 21. Possible regions by two initiators after time y, where y ] t. 46
Figure 22. A host joins to the root. 48
Figure 23. A host joins to leaves and intermediate hosts. 48
Figure 24. A root host leaves. 49
Figure 25. A leaf host leaves. 50
Figure 26. Two intermediate hosts leave. 51
Figure 27. An instance of an energy efficient path by two phases. 73
Figure 28. An energy efficient path finding algorithm skeleton. 76
Figure 29. Proposed energy-efficient path finding algorithm. 77
Figure 30. Three typical topologies. 80
Figure 31. Total cost rate between MIS-CDS and proposed scheme by mobility rate ( ) and nodes in the transmission range (k). 87
Figure 32. Various links among three microsensors. 89
Figure 33. Randomly deployed microsensors. 93
Figure 34. Pb with μ (mobility) and λ (message arrival rate). 94
Figure 35. Total consumed energy to the nodes 1 to 29. 94
원문구축 및 2018년 이후 자료는 524호에서 직접 열람하십시요.
도서위치안내: / 서가번호:
우편복사 목록담기를 완료하였습니다.
* 표시는 필수사항 입니다.
* 주의: 국회도서관 이용자 모두에게 공유서재로 서비스 됩니다.
저장 되었습니다.
로그인을 하시려면 아이디와 비밀번호를 입력해주세요. 모바일 간편 열람증으로 입실한 경우 회원가입을 해야합니다.
공용 PC이므로 한번 더 로그인 해 주시기 바랍니다.
아이디 또는 비밀번호를 확인해주세요