跳到主要內容

臺灣博碩士論文加值系統

(3.235.185.78) 您好!臺灣時間:2021/07/29 23:21
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:顏健峰
研究生(外文):Chien-Feng Yen
論文名稱:無線感測網路中利用線性拓樸應用於移動性資料收集端之研究
論文名稱(外文):A Study of Linear Topology for Mobile-Sink Wireless Sensor Networks
指導教授:陳忠信陳忠信引用關係
指導教授(外文):Jong-Shin Chen
學位類別:碩士
校院名稱:朝陽科技大學
系所名稱:網路與通訊研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2009
畢業學年度:97
語文別:中文
論文頁數:58
中文關鍵詞:路由機制線性拓樸移動性的資料收集端無線感測網路
外文關鍵詞:routingmobile sinklinear topologyWireless sensor networks
相關次數:
  • 被引用被引用:0
  • 點閱點閱:182
  • 評分評分:
  • 下載下載:22
  • 收藏至我的研究室書目清單書目收藏:0
現行的無線感測網路的繞路研究中大都著眼於感測器節點與資料收集端都是固定不會移動的,這對於在現實情況中的很多應用是不合適的。無線感測網路中具有感測節點和資料收集端二種,感測器節點一經過部署之後應任務需求就不具移動,但是資料收集端卻可能會隨著使用者的移動而不斷地改變其地理位置。大多數的研究卻沒辦法支援資料收集端的移動性。有鑑於此,本研究中提出了利用線性拓樸的拓樸機制,此機制將感測節點以隨機、距離與能源三種不同的因素排列成線性的拓樸架構。此架構不會因資料收集端移動而需重新建立拓樸架構,因此其架構非常適合具移動性資料收集端。而在模擬的結果也顯示線性拓樸比樹狀拓樸的性能來的好。
A wireless sensor network contains a sink node and sensor nodes. Recent research on wireless sensor networks mainly focused on the sensor nodes and the sink are all fixed and immobile which is impractical for the uses of applications. In fact, sensor nodes are fixed and immobile after it set for tasks. With the growth development of mobile hosts, a sink that has the property of mobility can acquire more efficiency. However, the previous studies mostly focused on the fixed sink. This study present a routing mechanism can support the mobility of the sink. The mechanism considers the randomization, distance among sensor nodes and remain-energy to form a linear topology. The topology is unnecessary to construct when the sink changes its location. Therefore this topology is to suit mobile sink. The simulation results that demonstrate the mechanism present better performance than the tree topology can confirm the mechanism is efficient.

摘要.......................................................................................................IV
Abstract ..................................................................................................V
誌謝.......................................................................................................VI
圖目錄...................................................................................................IX
表目錄...................................................................................................XI
第一章 前言...........................................................................................1
1.1 研究背景......................................................................................1
1.2 研究動機及目的...........................................................................2
1.3 論文架構......................................................................................9
第二章 相關工作.................................................................................10
2.1 無線感測網路.............................................................................10
2.2 相關路由協定.............................................................................14
2.3 資料融合....................................................................................15
2.4 漢米爾頓迴路.............................................................................16
2.5 無線感測節點傳輸範圍對漢米爾頓路徑之影響......................23
第三章 線性拓樸應用於無線感測網路..............................................34
3.1 線性拓樸建構.............................................................................34
3.2 資料繞送....................................................................................38
VIII
3.3 能源模式....................................................................................39
第四章 系統模擬與效能分析..............................................................43
4.1 模擬架構....................................................................................43
4.2 模擬數據....................................................................................46
4.2.1 線性拓樸與樹狀拓樸之比較..............................................47
4.2.2 線性拓樸演算法之比較......................................................49
第五章 結論和未來工作......................................................................53
參考文獻...............................................................................................55






















IX
圖目錄

圖1.1 LEACH路由協定........................................................................5
圖1.2 PEGASIS 路由協定......................................................................7
圖2.1 無線感測網路架構....................................................................12
圖2.2 感測器硬體構造及功能............................................................12
圖2.3 漢米爾頓迴路............................................................................18
圖2.4 線性拓樸下的繞路問題............................................................20
圖2.5 漢米爾頓迴路............................................................................22
圖2.6 漢米爾頓路徑............................................................................23
圖2.7 無線感測網路部署範圍............................................................24
圖2.8 漢米爾頓路徑連接邊數............................................................24
圖2.9 漢米爾頓路徑............................................................................26
圖2.10 漢米爾頓路徑..........................................................................26
圖2.11 漢米爾頓路徑..........................................................................27
圖2.12 無線感測網路部署範圍..........................................................28
圖2.13 節點連結邊數..........................................................................28
圖2.14 無線感測網路部署範圍..........................................................30
圖2.15 節點連結邊數..........................................................................31
圖2.16 漢米爾頓路徑..........................................................................32
X
圖2.17漢米爾頓路徑...........................................................................32
圖3.1 線性拓樸演算法........................................................................35
圖3.2 線性拓樸演算法流程圖............................................................37
圖3.3 感測網路節點部署圖................................................................37
圖3.4 線性拓樸資料傳遞過程............................................................39
圖4.1 部署節點...................................................................................43
圖4.2 形成線性拓樸............................................................................44
圖4.3 具移動性資料收集端移動........................................................44
圖4.4 資料傳遞...................................................................................45
圖4.5 移動性的資料收集端................................................................46
圖4.6 線性拓樸與樹狀拓樸之比較....................................................48
圖4.7 三種演算法對節點存活時間之影響.........................................49
圖4.8 節點廣播範圍之影響................................................................50
圖4.9 隨機移動下節點存活時間........................................................51
圖4.10 四周移動下節點存活時間......................................................52
圖4.11 中心移動下節點存活時間......................................................52
XI
表目錄

表4.1 模擬參數值...............................................................................47
[1]A. Abbasi and M. Younis, “A survey on clustering algorithms for wireless sensor networks,” IEEE Proc. Of Computer Communications, Vol. 30, pp. 2826-2841, June 2007.
[2]M. I. Abd-El-Barr and M. A. M. Youssef, “Wireless Sensor Networks - part I: topology and design issues,” IEEE Conference on Electrical and Computer Engineering, pp. 1165-1168, May 2005.
[3]A. Garg and M. Hanmandlu, “An Energy-Aware Adaptive Clustering Protocol for Sensor Networks,” Fourth International Conference on Intelligent Sensing and Information Processing (ICISIP), pp. 23-30, Dec. 2006.
[4]B. Yanzhong, N. Jianwei, S. Limin, H. F. Wei, and Y. Sun, “Moving Schemes for Mobile Sinks in Wireless Sensor Networks,” IEEE International on Performance, Computing, and Communications Conference (IPCCC), pp. 101-108, April 2007.
[5]C. Schurgers and M. B. Srivastava, “Energy Efficient Routing in Wireless Sensor Networks,” IEEE Proc. of MILCOM Communications for Network-Centric Operations: Creating the Information Force, Vol. 1, pp. 357-361, Oct. 2001.
[6]C. Zhou and B. Krishnamachari, “Localized Topology Generation Mechanisms for Wireless Sensor Networks,” IEEE Proc. of Global Telecommunications Conference, Vol. 3, pp. 1269-1273, Dec. 2003.
[7]D. Culler, D. Estrin and M. Srivastava, “Guest Editors'' Introduction: Overview of Sensor Networks,” IEEE Transactions on Computer, Vol. 37, Issue 8, pp. 41- 49, Aug. 2004.
[8]D. Mandalat, F. Dait and X. D. C. Yout, “Load Balance and Energy Efficient Data Gathering in Wireless Sensor Networks,” IEEE International Conference on Mobile Ad-hoc and Sensor Systems, pp. 586-591, Oct. 2006.
[9]E. Ekici, G. Yaoyao and D. Bozdag, “Mobility Based Communication in Wireless Sensor Networks,” IEEE Communications Magazine, Vol. 44, pp. 56-62, July 2006.
[10]E. J. Duarte-Melo and M. Liu, “Analysis of Energy Consumption and Lifetime of Heterogeneous Wireless Sensor Networks,” IEEE Proc. of Global Telecommunication Conference, pp. 21-25, Nov. 2002.
[11]H. Kang, X. L. Li and P. J. Moran, “Power-Aware Markov Chain Based Tracking Approach for Wireless Sensor Networks,” IEEE Wireless Communications and Networking Conference, pp. 4209-4214, March 2007.
[12]H. Luo, Y. H. Liu and S. K. Das, “Routing Correlated Data in Wireless Sensor Networks: A Survey,” IEEE Transactions on Network, Vol. 21, Issue 6, pp. 40-47, Dec. 2007.
[13]H. Sabbineni and K. Chakrabarty, “Location-Aided Flooding: An Energy-Efficient Data Dissemination Protocol for Wireless Sensor Networks,” IEEE Transactions on Computers, Vol. 54, pp.36-46, January 2005.
[14]I. F. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cayirci, “A Survey on Sensor Network,” IEEE Communications Magazine, Vol. 40, pp. 102-114, Aug. 2002.
[15]J. N. Al-karaki and A. E. Kamal, “Routing Techniques in Wireless Sensor Networks: A Survey,” IEEE Transactions on Wireless Communications, Vol. 11, pp. 1284-1536, Dec. 2004.
[16]J. Zhu and S. Papavassiliou, “On the Energy-Efficient Organization and the Lifetime of Multi-hop Sensor Networks,” IEEE Communications Letters, Vol. 7, No. 11, pp. 537-539, Nov. 2003.
[17]K. Sohrabi, J. Gao, V. Ailawadhi and G. J. Pottie, “Protocols for Self-Organization of A Wireless Sensor Network,” IEEE Personal Communications, Vol. 7, pp. 16-27, Oct. 2000.
[18]L. Evers, P. J. M. Havinga, J. Kuper, M. E. M. Lijding and N. Meratnia, “Sensor Scheme: Supply Chain Management Automation using Wireless Sensor Networks,” IEEE Conference on Emerging Technologies and Factory Automation, pp. 448-455, Sept. 2007.
[19]L. H. Yen, M. Z. Cai, Y. M. Cheng and P.Y. Yang, “Minimizing energy expense for chain-based data gathering in wireless sensor networks,” Proceedings of the Second European Workshop on Wireless Sensor Networks, pp. 312-320, Jan. 2005.
[20]M. Gatzianas and L. Georgiadis, “A Distributed Algorithm for Maximum Lifetime Routing in Sensor Networks with Mobile Sink,” IEEE Transactions on Wireless Communications, Vol. 7, pp. 984-994, March 2008.
[21]O. Vernet and L. Markenzon, “Hamiltonian problems for reducible flowgraphs,” IEEE Proc. of Computer Science Society, pp.264-267, Nov.1997.
[22]O. Younis, and S. Fahmy, “HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks,” IEEE Transactions on Mobile Computing, Vol. 3, pp. 366-379, Dec. 2004.
[23]R. S. Chang and C. J. Kuo, “An energy efficient routing mechanism for wireless sensor networks,” IEEE Proc. on International Conference on Advanced Information Networking and Applications, Vol. 2, pp. 5, April 2006.
[24]S. D. Muruganathan, D. C. F. Ma, R. I. Bhasin and A. O. Fapojuwo, “A Centralized Energy-Efficient Routing Protocol for Wireless Sensor Networks,” IEEE Communication Magazine, Vol. 43, No. 3, pp. 8-13, March 2005.
[25]S. Lindsey, and C. S. Raghavendra, “PEGASIS: Power-efficient gathering in sensor information systems,” IEEE Proceedings on Aerospace Conference, Vol. 3, pp. 1125-1130, March 2002.
[26]W. Heinzelman, “Application-Specific Protocol Architectures for Wireless Networks,” Ph. D. thesis, Massachusetts Institute of Technology, June 2000.
[27]W. Heinzelman, A. Chandrakasan and H. Balakrishnan, “Energy-Efficient Communication Protocols for Wireless Microsensor Networks (LEACH),” IEEE Proc. of the 33rd Hawaii International Conference on Systems Science, Vol. 8, pp. 3005-3014, January 2000.
[28]Y. C. Chang, Z. S. Lin and J. L. Chen, “Cluster based self-organization management protocols for wireless sensor networks,” IEEE Transactions on Consumer Electronics, Vol. 52, pp. 75-80, Feb. 2006.
[29]V. Grebinski and G. Kucherov, “Optimal query bounds for reconstructing a Hamiltonian cycle in complete graphs,” IEEE Proc. of Theory of Computing and Systems, pp.166-173, June 1997.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
無相關期刊