(3.237.20.246) 您好!臺灣時間:2021/04/15 10:07
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:吳婉綺
研究生(外文):Wan-chi Wu
論文名稱:在無線感測網路中適應性之資料中心的儲存方法
論文名稱(外文):ADAPTIVE DATA-CENTRIC STORAGE SCHEMES IN WIRELESS SENSOR NETWORKS
指導教授:廖文華廖文華引用關係
指導教授(外文):Wen-hwa Liao
學位類別:碩士
校院名稱:大同大學
系所名稱:資訊經營學系(所)
學門:商業及管理學門
學類:一般商業學類
論文種類:學術論文
論文出版年:2007
畢業學年度:95
語文別:英文
論文頁數:39
中文關鍵詞:無線感測網路熱點資料儲存
外文關鍵詞:sensor networkshotspotdata storage
相關次數:
  • 被引用被引用:0
  • 點閱點閱:108
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
無線感測網路裡,經過一段時間就會產生大量的數據資料,目前以資料為中心的資料儲存方法利用一些對映的方式,將資料儲存到特定節點,由於網路中資料分佈不平均,使得某些感測節點儲存大量的資料,並且使得這些感測節點成為熱點,造成這些感測節點快速的將其能源耗盡。我們提出一個障眼法應用在兩種網路架構上,用來解決感測節點儲存空間不足的問題,另外,我們提出了一個多層次的門檻值的方法,使得節點的資源能夠公平的被使用,我們的方法能夠將資料分散到不同的感測節點儲存,並且使得感測節點的資源運用能夠達到負載平衡;實驗的部份顯示出我們的方法能夠提高資料品質以及避免儲存熱點的發生。
Over a period of time, a sensor network can generate large amounts of data. Several data-centric storage (DCS) techniques exploit some different methods of mapping events to storage nodes. However, most of them fail to deal with storage memory space due to high percentage of the load is assigned to a relatively small portion of the sensor nodes. Hence, the resources of these storage nodes may deplete quickly. In this paper, we propose a cover-up scheme based on two kinds of network architectures to solve the memory space full problem. The cover-up scheme can adjust the number of storage nodes dynamically. In order to achieve load balancing among sensor nodes in the sensor network fairly, we propose another scheme, called multi-threshold levels. Our schemes can spread storage into different sensor nodes and achieve load balancing among sensor nodes in a wide sensor network. Simulations have shown that the scheme can enhance the quality of data and avoid hotspot of the storage while there are a vast number of the events in a sensor network.
CONTENTS vi
CHAPTER 1 INTRODUCTION 1
CHAPTER 2 RELATED WORK 4
CHAPTER 3 A COVER-UP SCHEME AND MULTI-THRESHOLD LEVELS 7
3.1 BASIC IDEA 7
3.2 A COVER-UP SCHEME BASED ON FACE ARCHITECTURE 8
3.2.1 SYSTEM MODEL 8
3.2.2 PACKET TYPES 9
3.2.3 STORE THE EVENTS 11
3.2.4 RETRIEVE THE EVENTS 14
3.3 A COVER-UP SCHEME BASED ON GRID ARCHITECTURE WITH MULTI-THRESHOLD LEVEL 17
3.3.1 SYSTEM MODEL 17
3.3.2 PACKET TYPES 19
3.3.3 STORE THE EVENTS 20
3.3.4 A COVER-UP SCHEME BASED ON GRID ARCHITECTURE WITH MULTI-THRESHOLD LEVELS AND VIRTUAL GRID EXTENDING 24
3.3.5 RETRIEVAL THE EVENT 27
CHAPTER 4 SIMULATION RESULTS 29
4.1 TOTAL ENERGY CONSUMPTIONS 30
4.2 THE HOTSPOT STORAGE SPACE 31
4.3 THE AVERAGE OF STORAGE SPACE 32
4.4 THE STANDARD DEVIATION OF STORAGE SPACE 33
4.5 THE QUALITY OF DATA 35
CHAPTER 5 CONCLUSTION 36
BIBLIOGRAPHY 37
[1]M. Aly, N. Morsillo, P. K. Chrysanthis, and K. Pruhs, “Zone Sharing: A Hot-Spots Decomposition Scheme for Data-Centric Storage in Sensor Networks,” Proceeding of the International Conference Workshop on Data management for sensor networks, Aug. 2005.
[2]T. Arampatzis, J. Lygeros and S. Manesis, “A Survey of Applications of Wireless Sensors and Wireless Sensor Networks,” Proceedings of the 13th Mediterranean Conference on Control and Automation Limassol, Cyprus, June 27-29, 2005.
[3]N. Bulusu, J. Heidemann, and D. Estrin, “GPS-Less Low Cost Outdoor Localization for Wireless Sensor Networks,” Proceedings of IEEE Personal Communications Magazine, Vol. 7, No. 5, pp. 28-34 Otc. 2000.
[4]D. Culler, D. Estrin, and M. Srivastava, “Overview of Sensor Networks,” Proceeding of the IEEE Computer Society, Aug. 2004.
[5]A. Deshpande, C. Guestrin, S. R. Madden, J. M. Hellerstein, and W. Hong, “Model-driven Data Acquisition in Sensor Networks,” Proceedings of VLDS, Aug. 2004.
[6]W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energy-Efficient Communication Protocol for Wireless Microsensor Networks,” Proceedings of the 33rd International Conference on System Sciences (HICSS), Jan. 2000.
[7]J. Hightower, G. Boriello and R. Want, “SpotON: An Indoor 3D Location Sensing Technology Based on RF Signal Strength,” University of Washington CSE Report #2000-02-02, Feb.2000.
[8]Q. Huang, S. Bhattacharya, C. Lu, and G. C. Roman, “FAR: Face-Aware Routing for Mobicast in Large-Scale Sensor Networks,” ACM Transactions on Sensor. Networks, Vol. 1, No. 2, Nov. 2005.
[9]B. Karp, and H. T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,” Proceedings of the Annual ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom 2000), Bostonn, MA, USA, Aug. 2000.
[10]T. N. Le, W. Yu, X. Bai, and D. Xuan, “A Dynamic Geographic Hash Table for Data Centric Storage in Sensor Networks,” Proceedings of Wireless Communications and Networking Conference (WCNC), 2006.
[11]J. Li, J. Jannotti, D. DeCounto, D. Karger, and R. Morris, “A scalable Location Service for Geographic Ad-Hoc Routing,” Proceedings of the Annual ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom 2000), Bostonn, MA, USA, Aug. 2000.
[12]W. H. Liao, Y. C. Tseng, and J. P. Sheu, "GRID: A Fully Location-Aware Routing Protocol for Mobile Ad Hoc Networks," Telecommunication Systems, Vol. 18, No. 1, 2001, pp. 37-60.
[13]X. Li, Y. J. Kim, R. Govidan, and W. Hong, “Multi-dimensional Range Queries in Sensor Networks,” Proceedings of the International Conference on Embedded networked sensor systems, Nov. 2003.
[14]A. Nasipuri and K. Li, “A Directionality Based Location Discovery Scheme for Wireless Sensor Networks,” Proceedings of the First ACM international Workshop on Wireless Sensor Networks and Applications, Sep.r 2002.
[15]S. Ratnasamy, D. Estrin, R. Govindan, B. Karp, S. Shenker, Y. Li, and F Yu, “Data-Centric Storage in Sensornets,” Proceedings of the First Workshop on Sensor Networks and Applications (WSNA), 2002.
[16]S. Ratnasamy, B. Karp, Y. Li, F. Yu, R .Govindan, S. Shenker, and D. Estrin, “A Geographic Hash Table for Data-Centric Storage,” Proceedings of the First ACM International Workshop on Wireless Sensor Networks and Applications, 2002.
[17]R. Tamishetty, L. H. Ngoh, and P. H. Keng, “An Efficient Resiliency Scheme for Data Centric Storage in Wireless Sensor Networks,” Proceedings of the Vehicular Technology Conference, Sept. 2004.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
1. 王業立,1995,〈單記非讓渡投票制的政治影響:我國民意代表選舉制度的探討〉,《選舉研究》,第2卷,第1期,頁147-166。
2. 江大樹,1999,〈單一選區制的政治影響評估〉,政策月刊,第42期,頁2-4。
3. 吳明上,2003,〈日本眾議院選舉改革之探討:小選舉區比例代表並立制〉,《問題與研究》,第42卷,第2期,頁79-95。
4. 吳東野,1999.5,〈我國立法院全國不分區委員制度之研究〉,《選舉研究》,第6卷,第1期,頁143-174。
5. 林繼文,1999,〈單一選區兩票制與選舉制度改革〉,《新世紀智庫論壇》,第6卷,頁77-93。
6. 張世賢、黃澤銘與黃積聖,1996,〈1996年日本眾議院議員選舉之研究〉,《中國行政評論》,第6卷,第1期,頁143-145。
7. 傅恆德,1999,〈第四屆立法委員選舉後的省思:立法改革芻議〉,《政策月刊》,第42期,頁13-15。
8. 彭天豪,1999,〈立法委員選舉制度改革之比較研究〉,《立法院院聞》,第27卷,第2期,頁8-10。
9. 游清鑫,2000,〈競選策略的個案研究:1988年民進黨台北市南區立法委員選舉的探討〉,《選舉研究》,第6卷,第2期,頁163-190。
10. 黃德福,1990,〈選舉、地方派系與政治轉型:七十八年三項公職人員選舉之省思〉,《中山社會科學季刊》,第5卷,第1期,頁84-96。
11. 趙永茂,2001,〈新政黨政治形勢對台灣地方派系政治的衝擊:彰化縣與高雄縣個案及一般變動趨勢分析〉,《政治科學論叢》,第14期,頁153-182。
12. 劉瑞華,2001.12,〈新制度主義:返回大理論或經濟學帝國主義政治學?〉,《政治學報》,第32期,頁209-225。
13. 蔡學儀,2002,〈國會改造之選舉方案比較〉,《選舉研究》,第9卷,第2期,頁117-150。
14. 謝相慶,2000,〈日本眾議院新選舉制度及其政治效應—以1996年選舉為例〉,《選舉研究》,第6卷,第2期,頁45-87。
 
系統版面圖檔 系統版面圖檔