臺灣博碩士論文加值系統

由低成本、低耗電感測器(Sensor Node)構成的無線感測網路(Wireless Sensor Network)可以運作在感測區域(Sensing Field)以偵測與追蹤事件。本論文提出一個應用於無線異質型感測網路（Wireless Heterogeneous Sensor Network，WHSN）之事件偵測與追蹤演算法，稱為CoEDT。CoEDT的基本概念係由可以感測事件屬性的Sensor Node各自建立屬性異常的區域，再藉由這些Sensor Node之間的協同合作判斷鄰近區域是否發生事件，並選取適合的Sensor Nodes表示事件的範圍。CoEDT主要包含「Vicinity Triangulation」、「Event Detection」和「Border Node Determination」三個部分，其中前兩者的目的為事件的偵測，而第三個部分則是要追蹤事件。基本上，CoEDT是一個完全分散式的方法，除了可以透過不同種類Sensor Node間協同合作的特性完成事件的偵測，更能動態地追蹤事件的範圍。本論文的實驗結果顯示位於事件區域內的Sensor Node中，約有90%的Sensor Node可以被正確地判斷出位於事件的區域內，而CoEDT選出的邊界點（Border Node）亦能充分表現事件的範圍。

Wireless Sensor Networks (WSNs) formed by sensor nodes are operated on sensing field to detect and track events. The thesis proposes a collaborative protocol, called CoEDT, for event detection and tracking in Wireless Heterogeneous Sensor Networks (WHSNs). The main idea of CoEDT is for the same kind of sensor nodes to respectively construct the attribute region, collaborately determine whether the event occurs in the vicinity of the sensing region of different kinds of sensor nodes, and dynamically identify the event boundary via the border nodes. CoEDT comprises three major components, Vicinity Triangulation, Event Detection, and Border Node Determination. “Vicinity Triangulation” and “Event Detection” are used for the detection of events. “Border Node Determination” is exploited in tracking events. Basically, CoEDT is a fully distributed protocol for event detection and tracking. In CoEDT, event detection is achieved by means of all kinds of sensor nodes in the collaborative manner. Additionally, CoEDT is able to dynamically track the event via the suitable border nodes. The simulation results validate the performances of CoEDT in terms of the accuracy and fitness. Approximately 90% sensor nodes within the event region can be correctly identified. Besides, the border nodes identified by CoEDT can well reflect the event boundary.

第1章 前言 1
1.1. 研究背景 1
1.2. 研究動機與目的 2
1.3. 研究方法 3
1.4. 論文架構 5
第2章 文獻回顧 6
2.1. 事件偵測方法 6
2.2. 事件追蹤方法 10
2.3. 小結 13
第3章 背景知識 15
3.1. 網路架構、符號定義與名詞定義 15
3.2. COEDT演算法概述 17
第4章 事件偵測與追蹤演算法 24
4.1. VICINITY TRIANGULATION 25
4.2. EVENT DETERMINATION 37
4.3. BORDER NODE DETERMINATION 42
第5章 實驗與結果 45
5.1. 實驗設定 45
5.2. 實驗結果 48
第6章 結論與建議 56

圖目錄
圖一 事件成立的條件示意 圖....................16
圖二 COEDT相同屬性SENSOR NODES運作概念圖...........20
圖三 COEDT演算法概念圖.............................23
圖四 COECD演算法方塊圖.........25
圖五 ATR封包格式示意圖............................................................................................................26
圖六 SENSOR NODE 收到ATR封包運作概念圖............28
圖七 ALARM NODE建構VICINITY TRIANGULATION以判斷事件是否發生....................................31
圖八 判斷邏輯鄰居為三角形頂點之示意圖................33
圖九 ALARM NODE動態建構VICINITY TRIANGULATION....36
圖十 判斷事件是否成立示意圖.....................39
圖十一 EVT 封包格式...................40
圖十二 若一個ALARM NODE其所有構成三角形頂點的SENSOR NODES皆為 URGENT NODES，則本身亦為URGENT NODE...................42
圖十三 dµ示意圖.........................................48
圖十四 不同通訊半徑與URGENT NODES正確率的實驗結果........49
圖十五 不同通訊半徑與BORDER NODE平均距離誤差的實驗結果...51
圖十六 不同通訊半徑與BORDER NODES個數的實驗結果..........52
圖十七 不同SENSOR NODES個數與 URGENT NODES正確率的實驗結果.......................................................52
圖十八 不同SENSOR NODES個數與 BORDER NODES個數的實驗結果.54
圖十九 不同SENSOR NODES個數與 BORDER NODES平均距離的實驗結果.......................................................54

[1]F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A Survey on Sensor Networks,” IEEE Communications Magazine, vol. 40, no. 8, pp. 102-114, 2002.
[2]N. Bulusu, J. Heidemann, and D. Estrin, “GPS-less Low Cost Outdoor Localization for Very Small Devices,” IEEE Personal Communications Magazine, vol. 7, no. 5, pp. 28-34, 2000.
[3]W. Chen, J. C. Hou, and L. Sha, “Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Networks,” IEEE Transactions on Mobile Computing, vol. 3, no. 3, pp. 258-271, 2004.
[4]K. Chintalapudi and R. Govindan, “Localized Edge Detection in Sensor Fields,” Ad-Hoc Networks Journal, vol. 1, pp. 273-291, Sep. 2003.
[5]X. Cui, T. Hardin, R. Ragade, and A. Elmaghraby, “A Swarm-based Fuzzy Logic Control Mobile Sensor Network for Hazardous Contaminants Localization,” in Proceedings of the IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS), Oct. 2004, pp. 194-203.
[6]M. Ding, D.-H. Chen, A. Thaeler, and X.-Z. Cheng, “Fault-Tolerant Target Detection in Sensor Networks,” in Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC), Mar. 2005. pp, 2362-2368
[7]A. Galstyan, B. Krishnamachari , K. Lerman, and S. Pattem. “Distributed Online Localization in Sensor Networks Using a Moving Target,” in Proceedings of the ACM/IEEE International Symposium on Information Processing in Sensor Networks (IPSN), Apr. 2004. pp. 61-70.
[8]X. Ji and H. Zha, “Detection and Tracking Large Continuous Objects in Wireless Ad-Hoc Sensor Networks”, Technical Report, Departmentn of Computer Science and Engineering, Pennsylvania State University, 2003.
[9]X. Ji, H. Zha, J. J. Metzner, and G. Kesidis, “Dynamic Cluster Structure for Object Detection and Tracking in Wireless Ad-Hoc Sensor Networks,” in Proceedings of the IEEE International Conference on Communications (ICC), June 2004, pp. 3807-3811.
[10]J. M. Kahn, R. H. Katz, and K. S. J. Pister, “Next Century Challenges: Mobile Networking for Smart Dust,” in Proceedings of the ACM International Conference on Mobile Computing and Networking (MOBICOM), Mar. 1999, pp. 263-270.
[11]H. T. Kung and D. Vlah, “Efficient Location Tracking Using Sensor Networks,” in Proceedings of the IEEE Wireless and Communications and Networking Conference (WCNC), Mar. 2003, pp. 1954-1961.
[12]Q. Li, M. D. Rosa, and D. Rus, “Distributed Algorithms for Guiding Navigation across a Sensor Network,” in Proceedings of the ACM International Conference on Mobile Computing and Networking (MOBICOM), Sep. 2003, pp. 313-325.
[13]P.-K. Liao, M.-K. Chang and C.-C. Jay Kuo, “Distributed Edge Detection with Composite Hypothesis Test in Wireless Sensor Networks,” in Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM), Vol.1, Nov. 2004, pp. 129-133.
[14]R. Nowak and U. Mitra, “Boundary Estimation in Sensor Networks: Theory and Methods,” in Proceedings of the ACM/IEEE International Symposium on Information Processing in Sensor Networks (IPSN), Apr. 2003, pp. 1-16.
[15]Y.-C. Tseng, S.-P. Kuo, H.-W. Lee, and C.-F. Huang, “Location Tracking in a Wireless Sensor Network by Mobile Agents and Its Data Fusion Strategies,” Computer Journal, vol. 47, no. 4, pp. 448-460, 2004.
[16]URL: http://www.tinyos.net/
[17]A. D. Wood, J. A. Stankovic, and S. H. Son, “JAM: A Jammed-area Mapping Service for Sensor Networks,” in Proceedings of the IEEE Real-Time Systems Symposium (RTSS), Dec. 2003, pp. 286-297.
[18]Y. Xu and H. Qi, “Decentralized Reactive Clustering for Collaborative Processing in Sensor Networks,” in Proceedings of the IEEE International Conference on Parallel and Distributed Systems (ICPADS), July 2004, pp. 54-61.
[19]W. Zhang and G. Cao, “DCTC: Dynamic Convoy Tree-based Collaboration for Target Tracking in Sensor Networks,” IEEE Transactions on Wireless Communications, vol. 3, no. 5, pp. 1689-1701, 2004.
[20]W. Zhang and G. Cao, “Optimizing Tree Reconfiguration for Mobile Target Tracking in Sensor Networks,” in Proceedings of the Twenty-third Annual Joint Conference of the IEEE Computer and Communication Societies (INFOCOM), Mar. 2004, pp. 2434-2445.