以搜尋樹為基礎之無線感測網路繞徑演算法; Search-Tree-Based Routing Algorithm on Wireless Sensor Networks

NCU Institutional Repository > 資訊電機學院 > 資訊工程學系碩士在職專班 > 博碩士論文 > Item 987654321/8691

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/8691

题名:	以搜尋樹為基礎之無線感測網路繞徑演算法;Search-Tree-Based Routing Algorithm on Wireless Sensor Networks
作者:	許仲辰;Zhone-Chen Shu
贡献者:	資訊工程學系碩士在職專班
关键词:	資料源;感測器網路;搜尋樹;氾濫式傳輸;data source;sensor network;Search tree;flooding
日期:	2005-07-13
上传时间:	2009-09-22 11:33:03 (UTC+8)
出版者:	國立中央大學圖書館
摘要:	由於處理器、記憶裝置及無線電技術的進步，促使低成本、低功率，具有感測外在環境、無線通訊及計算能力的感測器誔生。這種感測器構成的網路能夠相互合作來感測外在環境中如溫度、光度、聲音等的一些特定現象。本篇論文提出一種以搜尋樹為基礎的繞徑演算法來達成有效率且即時的協同傳輸模式。一般在感測器網路的繞徑演算法，因為無法知道資料源的位置，在第一次傳送詢問資料的訊息給資料源通常以濫氾式傳輸將訊息送達資料源，資料源再於發送端及目的地間的感測器中建立位置資訊以供資料源將資料回傳時使用。本論文提出以搜尋樹為基礎的演算法，用以加強感測器網路定點即時傳輸的能力。首先，建立樹狀的感測器網路，再分配給每個感測器一個位址，把感測器網路建立成搜尋樹架構。使用這個樹狀架構及給定的位址資訊，感測器可以由自己的位址資訊決定訊息繞徑的下一站。本演算法不需於每次傳送訊息前在各感測器上建立位置相關的資訊，因此，每個感測器能夠更有效率地將訊息傳送到目的地。在模擬實驗中，本演算法在不同網路大小及傳輸工作量的表現都很優越。本演算法亦實作於自動停車系統上，此系統為基於感測器網路而設計之一種應用。 For the progress in processing, memory, and radio techniques, sensor nodes with the integration of sensing, wireless communication, and computation have been developed. The network of such nodes can be coordinated to sense specific environmental phenomena such as thermo, light, and sound, etc. In this paper, a routing algorithm based on search tree is proposed to achieve efficient and real-time coordination. In general, the routing algorithm for sensor networks sends first query message from the sender to the data source node by flooding, for the lack of the location of the data source. Once the data source receives a message from the sender, the location information is generated in the sensor nodes among the sender and the data source. The data source then sends back the data with the location information to the sender. The proposed routing algorithm is able to support real-time transmissions for sensor networks. First, the tree-based sensor network is constructed. Then, a unique address is assigned to each node to build the tree as search tree. With the search tree architecture and the address assignment, sensor nodes decide the next hop for a message by node’s address information. The proposed routing algorithm does not need to build up location information for each message transmission from the source node to the sender and thus messages can be delivered efficiently. In the simulation, the proposed algorithm performs well in both different network size and workload. The proposed algorithm is also implemented in the automatic parking system which is an application designed in sensor network.
显示于类别:	[資訊工程學系碩士在職專班 ] 博碩士論文

文件中的档案:

档案	大小	格式	浏览次数

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing

数据加载中.....