連豊力臺灣大學：電機工程學研究所蔡克欣Tsai, Ko-HsinKo-HsinTsai2007-11-262018-07-062007-11-262018-07-062007http://ntur.lib.ntu.edu.tw//handle/246246/53034一個移動式無線感測網路乃是整合了大量移動式感測點與無線網路所形成之環境監控或探索系統，而在這樣的整合型系統中，如何有效的協調無線通訊、感測、和移動等機制就成了一個很重要的課題。 當移動式無線感測網路在執行一個環境監控任務時，如果每一個感測點都以同樣的速率傳送感測到的資料回基地台，則替比較多感測點做繞徑的感測點，將很容易發生資料擁塞的問題，且當在特定的區域有事件發生而需要傳送大量的資料時，整個網路的使用效率將大幅度降低，這樣的問題也許可以透過改變網路的架構或通訊協定的方式來改善，但效果十分有限。 本論文，提出了一個以分散式架構為主的移動演算法，此演算法的目的在於如何根據每一個感測點需要的傳輸量，有效的分配通道傳輸容量，而因為兩個無線傳輸端點的通道傳輸容量與距離大約是呈現一個反比的關係，此演算法便根據此一關係，以設計人工作用力的方式讓每個感測點移動到最適合的位置，同時平均地分散整個網路感測點數目的密度，並且增加其總感測涵蓋區域。 此論文最後利用MATLAB軟體做模擬，並根據模擬的結果，包括平均值、標準差、涵蓋區域範圍和收斂度評估此演算法的效能和穩定度。A mobile wireless sensor network (MWSN) is the combination of a large number of mobile sensor nodes and a wireless network. An effective coordination of communicaiton, sensing and moving is an important issue in an MWSN. When a MWSN is processing a moritoring task, it is assumed that every node transmit the sensing data to a base station in the same rate. Then, the network will easily make a congestion problem at the node routing for larger data. In addtion, if there is a event occurred at some specialized area, the usage of whole network will be largely decrease. This problem may can be overcame by the adjustment of network architecture or protocol, but the effect is limited. This paper proposes a distributed moving algorithm for redeploying these mobile sensor nodes. The functional goal of this algorithm is to adaptively allocate the channel capacity based on the amount of the sensing rate at each node, as well as to dynamically spread these nodes for increasing the coverage area and related utility. A simulation platform using MATLAB is also presented, and related statistical results including mean, standard deviation, coverage and convergence are used to illustrate the performance of the proposed algorithm.摘要 I ABSTRACT III CONTENTS V LIST OF FIGURES VII LIST OF TABLE XI CHAPTER 1 1 INTRODUCTION 1 1.1 Motivation 1 1.2 Contribution of This Thesis 5 1.3 Organization of This Thesis 6 CHAPTER 2 9 LITERATURE SURVEY AND BACKGROUND 9 2.1 Moving Algorithms for Mobile Wireless Sensor Network9 2.2 Localization and Distance Measurement 11 2.3 Topology Control 12 2.4 Zigbee Based on IEEE 802.15.4 13 2.5 Background Knowledge for MWSN 14 2.5.1 Shannon’s Channel Capacity Formula 14 2.5.2 Routing 18 2.5.3 Throughput 22 CHAPTER 3 27 PROBLEM FORMULATION 27 3.1 Problem Description 28 3.2 MWSN Model 29 3.3 Performance Index 30 CHAPTER 4 33 ALGORITHM ARCHITECTURE 33 4.1 Initial Preparation and Fundamental Definitions 35 4.2 Artificial Force for Inner Nodes 38 4.3 Artificial Force for Terminal Nodes 41 4.4 Artificial Force towards Events 43 4.5 Relationships between the Artificial Forces 44 4.6 Stopping Criteria 46 4.7 Maximal Achievable Capacity 47 CHAPTER 5 51 SIMULATION STUDY 51 5.1 Artificial Force for Inner Nodes 52 5.2 Three Convergence Modes for Terminal Nodes 55 5.3 Fundamental Simulation with N=50 56 5.3.1 Mode 1 58 5.3.2 Mode 2 61 5.3.3 Mode 3 63 5.4 Simulation with Time Variation 69 5.6 Add Stop Criterion 75 CHAPTER 6 79 CONCLUSION AND FUTURE WORKS 79 6.1 Conclusion 79 6.2 Future Works 80 REFERENCES 81927599 bytesapplication/pdfen-US移動式感測網路無線感測網路人造位能場重新部屬演算法mobile sensor networkwireless sensor networkartificial forcerepdeployment algorithm[SDGs]SDG11thesishttp://ntur.lib.ntu.edu.tw/bitstream/246246/53034/1/ntu-96-R94921069-1.pdf