請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/42103完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 逄愛君(Ai-Chun Pang) | |
| dc.contributor.author | Wei-Ni Chu | en |
| dc.contributor.author | 朱韋妮 | zh_TW |
| dc.date.accessioned | 2021-06-15T00:46:51Z | - |
| dc.date.available | 2008-09-02 | |
| dc.date.copyright | 2008-09-02 | |
| dc.date.issued | 2008 | |
| dc.date.submitted | 2008-08-25 | |
| dc.identifier.citation | [1] ZigBee Alliance, “ZigBee Specifications”, Dec. 2006.
[2] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A Survey on Sensor Networks,” IEEE Comm. Magazine, vol. 40, pp. 102-114, Aug. 2002. [3] IEEE standard 802 Part 15.4: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications for Low-Rate Wireless Personal Area Networks (LR-WPANS), IEEE, 2003 [4] M.-S. Pan, Y.-C. Tseng, “The Orphan Problem in ZigBee-based Wireless Sensor Networks”, ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM), 2007. [5] P. Srisuresh and M. Holdrege, “IP Network Address Translator (NAT) Terminology and Considerations”, RFC 2663, Aug. 1999. [6] M. R. Garey and D. S. Johnson, Computers and Intractability－A Guide to the Theory of NP-Completeness. San Francisco. CA: Freeman, 1979. [7] A. A. Bertossi and M. A. Bonuccelli, “Code Assignment for Hidden Terminal Interference Avoidance in Multihop Packet Radio Networks”, IEEE/ACM Transactions on Networking, Aug. 1995. [8] L. Hu, “Distributed Code Assignments for CDMA Packet Radio Networks”, Proc. INFOCOM, Apr. 1991. [9] S. T. McCormick, “Optimal approximation of Sparse Hessians and its Equivalence to a Graph Coloring Problem”, Technical Report SOL 81-22, Dept. of Operations Research, Stanford University, 1981. [10] S. Ramanathan and E. L. Lloyd. “On the Complexity of Distance-2 Coloring”, IEEE International Conference on Computing and Information, 1992. [11] Ö. Johansson, “Simple Distributed delta+1-coloring of Graphs”, Information Processing Letters, 70, pp 229-232, 1999. [12] D. S. Johnson, “The NP-completeness Column: An Ongoing Guide.”, Journal of Algorithms, 1982. [13] L.-H. Yen and W.-T. Tai, “Flexible Address Configurations for Tree-Based ZigBee/IEEE 802.15.4 Wireless Networks”, International Conference on Advanced Information Networking and Application, 2008. [14] M.-S. Pan, H.-W. Fang, Y.-C. Liu, and Y.-C. Tseng, “Address Assignment and Routing Schemes for ZigBee-based Long-Thin Wireless Sensor Networks”, IEEE Vehicular Technology Conference (VTC), 2008. [15] R. Kawano and T. Miyazaki, “Distributed Coloring Algorithms for Wireless Sensor Networks and Its Applications”, IEEE International Conference on Computer and Information Technology, 2007. [16] J. Sun, Z. Wang, H. Wang, and X. Zhang, “Research on Routing Protocols Based on ZigBee Network” | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/42103 | - |
| dc.description.abstract | 無線感測網路的應用範圍越來越廣泛，舉凡像是環境偵測、建築物監控、和戰場上的偵測，都是無線感測網路可以應用的範圍。ZigBe是針對感測網路特性所設計的通訊協定，也是最有前景可以用來實現感測網路的平台。在ZigBee協定中，一個點如果可以從他的父節點取得一個網路位址，他就可以成功的加入這個網路。ZigBee針對網路中節點的位址，定義了一套利用三個參數來計算位址的分散式位址指定機制。這個機制藉由限定每一個節點下子點節點的數目，以及網路的深度，來加速位址的分配，但卻也因此造成了孤立點問題。在這篇論文中，我們提出了一個建構在NAT基礎上處理孤立點問題的解決方案。我們也討論NAT應用在ZigBee網路上所會有的一系列議題，其中包括私用位址指定的問題，並且提出了一個分散式的解決方法。我們也利用實驗的結果來驗證我們提出的方法應用在ZigBee網路上的效能評估。 | zh_TW |
| dc.description.abstract | Wireless sensor networks have emerged as a promising technology with various applications, such as environment surveillance, structure monitoring, and battlefield monitoring. ZigBee offers a promising platform for wireless sensor networks. In ZigBee, a node joins a network if it can obtain a free network address from a parent device. ZigBee defines a distributed address assignment scheme with three parameters to facilitate the assignment of addresses. This scheme restricts the device number and the network depth such that the orphan problem might occur. In this thesis, we propose a NAT-based solution to the orphan problem. Also, the private address assignment problem inside the NAT is discussed. This problem is proven NP-Complete and a distributed heuristic is proposed. Finally, the capability of the proposed solutions is shown by the simulation results. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-15T00:46:51Z (GMT). No. of bitstreams: 1 ntu-97-R95922074-1.pdf: 594443 bytes, checksum: 2cc3013a151a48c2dca33cb0d24006f4 (MD5) Previous issue date: 2008 | en |
| dc.description.tableofcontents | Acknowledgement i
Abstract iii List of Tables vi List of Figures vii 1 Introduction 1 2 Background 4 2.1 Overview of ZigBee 4 2.1.1 ZigBee Distributed Address Assignment 5 2.1.2 ZigBee Neighbor Table 7 2.2 NAT for IPv4 9 3 The Proposed Solution 11 3.1 NAPT for ZigBee 11 3.2 Intra-NAT address assignment 12 3.2.1 Problem Formulation 13 3.2.2 Computational Complexity 14 3.2.3 Distributed Heuristics 18 4 Performance Evaluation 20 5 Conclusions 24 Bibliography 25 | |
| dc.language.iso | en | |
| dc.subject | 孤立點 | zh_TW |
| dc.subject | 圖論 | zh_TW |
| dc.subject | 無線感測網路 | zh_TW |
| dc.subject | ZigBee | zh_TW |
| dc.subject | graph theory | en |
| dc.subject | orphan problem | en |
| dc.subject | ZigBee | en |
| dc.subject | wireless sensor networks | en |
| dc.title | 一個針對ZigBee感測網路之孤立點問題之解決方案 | zh_TW |
| dc.title | A Solution for the Orphan Problem in ZigBee-based Sensor Networks | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 96-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 劉邦鋒(Pang-Feng Liu),蔡慈真(Tzu-Jane Tsai) | |
| dc.subject.keyword | ZigBee,孤立點,無線感測網路,圖論, | zh_TW |
| dc.subject.keyword | ZigBee,orphan problem,wireless sensor networks,graph theory, | en |
| dc.relation.page | 26 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2008-08-25 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 資訊工程學研究所 | zh_TW |
| 顯示於系所單位： | 資訊工程學系 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-97-1.pdf 未授權公開取用 | 580.51 kB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。