本文的主要目的是用移動匯聚節(jié)點解決無線網(wǎng)絡(luò)所面臨的特殊挑戰(zhàn)。本文包含對兩個主要協(xié)議的四個主要貢獻(xiàn)。第一個協(xié)議是啟發(fā)式數(shù)據(jù)傳播HDD(Heuristic Data Dissemination)協(xié)議,第二個協(xié)議是面向匯聚節(jié)點的樹狀數(shù)據(jù)傳播 STDD(Sink-oriented Tree-based Data Dissemination)協(xié)議。本文對上述協(xié)議中的每個都有兩個貢獻(xiàn),因此本文共有四個貢獻(xiàn)。1.HDD協(xié)議HDD協(xié)議由下面兩個主要部分組成,即:雙環(huán)結(jié)構(gòu)和HDD模型。本文對HDD協(xié)議的第一個貢獻(xiàn)是雙環(huán)結(jié)構(gòu),我們解決了匯聚節(jié)點移動性頻繁更新位置的問題。此外,雙環(huán)結(jié)構(gòu)使傳感器節(jié)點和移動匯聚節(jié)點之間的交互更加便利,因此,得以延長網(wǎng)絡(luò)壽命。HDD協(xié)議的第二個組成部分是HDD模型,也就是本文對HDD協(xié)議的第二個貢獻(xiàn)。HDD協(xié)議解決了數(shù)據(jù)包傳輸延遲的問題,尤其是從源傳感器節(jié)點至移動匯聚節(jié)點的傳輸。HDD協(xié)議的主要思想是將整個數(shù)據(jù)路由當(dāng)做一個隨機(jī)過程,并在四個主要數(shù)值(方向值、傳輸距離、垂直距離和剩余能量)的控制下進(jìn)行數(shù)據(jù)前送。本文對HDD提出了許多算法來實現(xiàn)此目的,與現(xiàn)在最先進(jìn)的協(xié)議相比較,其結(jié)果也...

【文章頁數(shù)】：119 頁

【學(xué)位級別】：博士

【文章目錄】：
摘要
ABSTRACT
1 CHAPTER1 INTRODUCTION
    1.1 Introduction About WSNs
        1.1.1 WSN Applications
        1.1.2 WSN Challenges and Limitations
    1.2 Research Questions
    1.3 Thesis Contributions
    1.4 The Organization of the Thesis
2 CHAPTER 2 BACKGROUND
    2.1 Introduction
    2.2 Hierarchical Mobile Sink Protocols in WSN
        2.2.1 Area-based Approaches
        2.2.2 Grid-based Approaches
        2.2.3 Tree-based Approaches
        2.2.4 Cluster-based Approaches
    2.3 Tree Structures in Wirelesses Sensor Networks
    2.4 Summary
3 CHAPTER 3 THE DOUBLE RING
    3.1 The Problem Statement
    3.2 The Assumptions and Definitions
        3.2.1 Assumptins
        3.2.2 Definitions
    3.3 The Contributions of the Double Ring
    3.4 The Double Ring Construction
    3.5 Ring Head Election
    3.6 Data Operations in the Double Ring
        3.6.1 Internal Ring Data Operations
        3.6.2 Ring-Sink Data Operations
        3.6.3 Ring-Source Data Operations
    3.7 Summary
4 CHAPTER 4 THE HEURISTIC DATA DISSEMINATION HDD PROTOCOL
    4.1 Problem Statement
    4.2 The Main Contributions of HDD
    4.3 Traffic Patterns in HDD
    4.4 The Heuristic Data Dissemination(HDD)Model
        4.4.1 HDD Values
        4.4.2 The Heuristic Data Dissemination(HDD)Function
    4.5 Data Routing Paths in HDD
        4.5.1 Ring Paths
        4.5.2 Advertising Paths
        4.5.3 Source Query Paths
        4.5.4 Query-Response Paths
        4.5.5 Dissemination Paths
    4.6 Performance Evaluation
        4.6.1 The Simulation Settings
        4.6.2 The Simulation Results
    4.7 Summary
5 CHAPTER 5 TREE-BASED SOLUTIONS FOR MOBILE SINK WSNS
    5.1 Problem Statement
    5.2 The Definitions
    5.3 The Main Contributions of Chapter 5
    5.4 The Sink-oriented Tree-based Data Dissemination Protocol
        5.4.1 The Three Phases in STDD
        5.4.2 Communication Overhead in STDD
    5.5 Data Dissemination in STDD
        5.5.1 The Independent Paths
        5.5.2 The Merged Paths
    5.6 Data Dissemination in STDD
        5.6.1 The impact of the Number of Sinks
        5.6.2 The Sink Speed Impact
    5.7 Summary
6 CHAPTER 6 CONCLUSIONS AND FUTURE DIRECTIONS
    6.1 Contributions Revisited
    6.2 Future Directions
REFERENCES
ACKNOWLEDGEMENTS
PUBLISHED RESEARCH PAPERS



本文編號：4054209