博碩士論文 93522029 詳細資訊




以作者查詢圖書館館藏 以作者查詢臺灣博碩士 以作者查詢全國書目 勘誤回報 、線上人數:32 、訪客IP:3.145.89.48
姓名 林皇甫(Huang-Fu Lin)  查詢紙本館藏   畢業系所 資訊工程學系
論文名稱 在無線感測網路中有效利用電量之覆蓋保存協定
(Coverage Preserving Protocol with Energy Efficient in Wireless Sensor Networks)
相關論文
★ 無線行動隨建即連網路上之廣播與繞徑問題★ 熱門電影的高效能廣播演算法
★ 無線行動隨建即連網路上之媒體存取問題★ 使用功率調整來增加多節點封包無線網路
★ 在無線行動隨建即用網路下Geocast 之設計與實做經驗★ 一個適用於熱門隨選視訊服務之快速排程廣播策略
★ 應用數位浮水印技術於影像之智慧財產權保護與認證★ 在寬頻分碼多重擷取技術上分配及再分配多重正交可變展頻係數碼
★ 無線行動隨建即連網路上之廣播排程協定★ 在無線行動隨建即連網路下支援即時多媒體傳送的媒介存取協定
★ 以樹狀結構為基礎的Scatternet建構協定★ 在無線感應器網路中具有省電機制並且採用對角線路徑的方向性擴散
★ 隨意型無線網路上一個具有能量保存的GRID繞徑協定★ 在無線感應器網路中具有省電機制的傳輸協定
★ 隨意型無線網路上一個具有能量保存以及平衡的繞徑協定★ 環形藍芽網路:一個藍芽通訊網路的新拓樸及其繞徑協定
檔案 [Endnote RIS 格式]    [Bibtex 格式]    [相關文章]   [文章引用]   [完整記錄]   [館藏目錄]   [檢視]  [下載]
  1. 本電子論文使用權限為同意立即開放。
  2. 已達開放權限電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。
  3. 請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。

摘要(中) 在無線感測網路中為了滿足指定的感測工作,覆蓋問題是個很典型的問題。一般而言,感測覆蓋代表著一個區域能被感測器監測得多好的程度。在本篇論文中,我們提出一個有效利用電量的覆蓋保存協定同時能夠維持整個感測區域充分地被覆蓋。在我們提出的協定中,我們嘗試找出最小工作的節點集合以達到最節省電量的目的,我們將他模組化為一個最小集合覆蓋的問題並以一種貪婪的演算法去解決它。另外,我們延伸基本的協定令其能滿足多重覆蓋問題和機率覆蓋問題,機率覆蓋問題是能實際反應在感測網路中真實的應用,基於機率偵測模型,在監控區域中的任意點在任何時間內至少要被一個節點所感測在一個由應用所指定的信賴機率下。模擬結果顯示我們提出的協定比起之前文獻確實能達到較好的效能和顯著地減少電量的耗費。另外,模擬結果也顯示,在給定的信賴機率下,我們可以執行我們的機率覆蓋保存協定並尋找出最佳答案來解決機率覆蓋問題。
摘要(英) Coverage is a typical problem in wireless sensor networks to fulfill the issued sensing tasks. In general, sensing coverage represents how well an area is monitored by sensors. In this thesis, we propose an energy-efficient coverage preserving protocol while maintaining the sensing field sufficiently covered. In our proposed protocol, we try to select minimal active set of sensor nodes to reach mostly energy conservation while maintain the complete area coverage. We model it as a minimum-set-cover problem and solve it by a heuristic greedy algorithm. Besides, we extend our basic protocol to satisfy k-coverage requirement and probabilistic coverage problem which is more realistic to reflect physical applications of sensor networks. Based on the probabilistic sensor detection model, any point anytime in the monitoring region is sensed by at least one node is no lower than a confidence probability which is specified by the applications. Simulation results have shown that our proposed protocols achieve better performance and decrease the energy expenditure noticeably than the previous works. Moreover, Simulation result has also demonstrated that we can execute our coverage preserving protocol to find out the best solution to solve the probabilistic coverage problem when the confidence probability is given.
關鍵字(中) ★ 電量節省
★ 機率覆蓋問題
★ 無線感測網路
★ 覆蓋問題
關鍵字(英) ★ energy conservation
★ probabilistic coverage problem
★ wireless sensor networks
★ Coverage problem
論文目次 Chapter 1 Introduction........................1
Chapter 2 Related Work........................4
Chapter 3 Basic Protocol Design..............10
3.1 Our Design Goals and Assumptions..........10
3.2 Problem Formulation.......................12
3.3 Basic Coverage Preserving Protocol........15
Chapter 4 Enhanced Protocol Design...........20
4.1 Release of Assumptions....................20
4.2 Multiple Coverage Problem.................22
4.3 Probabilistic Coverage Problem............25
Chapter 5 Simulation Results.................31
Chapter 6 Conclusion and Future work.........38
References....................................39
參考文獻 [1] A. Cerpa and D. Estrin, “ASCENT: Adaptive Self-Configuring Sensor Networks Topologies,” in Proceedings of Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), June 2002.
[2] A. Cerpa, J. Elson, D. Estrin, L. Girod, M. Hamilton and J.Zhao, “Habitat Monitoring: Application Driver for Wireless Communications Technology,” in ACM Special Interest Group on Data Communications (SIGCOMM), Costa Rica, April 2001.
[3] A. Mainwaring, D. Culler, J. Polastre, R. Szewczyk, and J. Anderson. “Wireless Sensor Networks for Habitat Monitoring,” in ACM International Workshop on Wireless Sensor Networks and Applications (WSNA), pp. 88-97, 2002.
[4] A. Savvides, C.-C. Han, and M. B. Strivastava, “Dynamic fine-grained localization in ad-hoc networks of sensors,” in International Conference on Mobile Computing and Networking (MobiCom), pp.166-179, 2001.
[5] B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, “SPAN: an Energy Efficient Coordination Algorithm for Topology Maintenance in Ad-hoc Wireless Networks,” in International Conference on Mobile Computing and Networking (MobiCom), Rome, Italy, July 2001.
[6] B. Krishnamachari and S.S. Iyengar, “Distributed Bayesian Algorithms for Fault-Tolerant Event Region Detection in Wireless Sensor Networks,” IEEE Transactions on Computers, Vol.53, No.3, pp.241- 250, Mar. 2004.
[7] B. Liu, P. Brass, O. Dousse, P. Nain, and Don Towsley, “Mobility Improves Coverage of Sensor Networks,” in Proceedings of the 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), NY, USA, 2005.
[8] C.-F. Huang and Y.-C. Tseng, “The Coverage Problem in a Wireless Sensor Network,” in ACM International Workshop on Wireless Sensor Networks and Applications (WSNA), pp.115-121, New York, 2003.
[9] D. Estrin, R. Govindan, J. Heidemann and S. Kumar, “Next Century Challenges: Scalable Coordination in Sensor Networks,” in International Conference on Mobile Computing and Networking (MobiCom), Washington, Aug. 1999.
[10] D. Nicules and B. Nath, “Ad-hoc Positioning System (APS) Using AoA,” in Proceedings of 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 2003.
[11] D. Tian and N. D. Georganas, “A Coverage-Preserving Node Scheduling Scheme for Large Wireless Sensor Networks,” in ACM International Workshop on Wireless Sensor Networks and Applications (WSNA), Sep. 2002.
[12] F. Ye, G. Zhong, S. Lu, and L. Zhang, “PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks,” in Proceedings of International Conference on Distributed Computing Systems (ICDCS), 2003.
[13] G. Veltri, Q. Huang, G. Qu, and M. Potkonjak, “Minimum and Maximal Exposure Path Algorithms for Wireless Embedded Sensor Networks,” in ACM International Conference on Embedded Networked Sensor Systems (SenSys), 2003.
[14] G. Wang, G. Cao, and T. L. Porta, “Movement-Assisted Sensor Deployment,” in Proceedings of Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), June 2004.
[15] H. Ozgur Sanli and H. Cam, “Energy Efficient Differentiable Coverage Service Protocols for Wireless Sensor Networks”, in Proceedings of IEEE International Conference on Pervasive Computing and Communications (PerCom), pp.406-410, 2005.
[16] H. Zhang and J. C. Hou, “Maintaining Sensing Coverage and Connectivity in Large Sensor Networks,’ Journal on Wireless Ad Hoc and Sensor Networks, vol.1, no. 1-2, pp.89-123, Jan. 2005.
[17] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cayirci, “Wireless Sensor Networks: A Survey,” Computer Networks, Vol.38, pp.393-422, Mar. 2002
[18] JAVA JDK 5.0, Sun, Inc., http://java.sun.com/j2se/1.5.0/download.jsp[19] J. Chang and L. Tassiulas, “Energy Conserving Routing in Wireless Ad-hoc Networks,” in Proceedings of Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 2000.
[20] J. Kahn, R. Katz, and K. Pister, “Next Century Challenges: Mobile Networking for Smart Dust,” in International Conference on Mobile Computing and Networking (MobiCom), August 1999.
[21] J. Jiang and W. Dou, “A Coverage-Preserving Density Control Algorithm for Wireless Sensor Networks,” in International Conference on AD-HOC Networks & Wireless (ADHOC-NOW), pp.42–55, July 2004.
[22] K. Kar and S. Banerjee, “Node Placement for Connected Coverage in Sensor Networks,” in Proceedings of Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), Sophia Antipolis, France, Mar. 2003.
[23] Matlab, The MathWorks, Inc., http://www.mathworks.com/[24] Mica Mote, Crossbow, Inc., http://www.xbow.com/Products/products.htm[25] M. Cardei and D.-Z. Du, “Improving Wireless Sensor Network Lifetime through Power Aware Organization,” in ACM Wireless Networks, Vol.11, No.3, pp.333-340, May 2005.
[26] M. Cardei and J. Wu, “Energy-Efficient Coverage Problems in Wireless Ad Hoc Sensor Networks,” Journal of Computer Communications on Sensor Networks, 2004.
[27] M. Cardei, M. Thai, Y. Li, and W. Wu, “Energy-Efficient Target Coverage in Wireless Sensor Networks,” in Proceedings of Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), Mar. 2005.
[28] R. Wattenhofer, L. Li, P. Bahl, and Y. Wang, “Distributed Topology Control for Power Efficient Operation in Multihop Wireless Ad Hoc Networks”, in Proceedings of Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 2001.
[29] S. Archana, B. S. Manoj, and C. Siva Ram Murthy, “Dynamic Coverage Maintenance Algorithms for Sensor Networks with Limited Mobility,” in Proceedings 3rd Annual IEEE International Conference on Pervasive Computing and Communications (PerCom), Hawaii, Mar. 2005.
[30] S. Meguerdichian, F. Koushanfar, G. Qu, and M. Potkonjak. “Exposure in Wireless Ad-hoc Sensor Networks,” in International Conference on Mobile Computing and Networking (MobiCom), pp.139-150, Rome, Italy, 2001.
[31] S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. Srivastava, “Coverage Problems in Wireless Ad-Hoc Sensor Networks,” in Proceedings of Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pp.1380-1387, 2001.
[32] S. S. Dhillon and K. Chakrabarty, “Sensor Placement for Effective Coverage and Surveillance in Distributed Sensor Networks,” in Proceedings of IEEE Wireless Communications and Networking Conference (WCNC), 2003.
[33] S. S. Dhillon, K. Chakrabarty, and S. S. Iyengar, “Sensor Placement for Grid Coverage Under Imprecise Detections,” in Proceedings of International Conference on Information Fusion, pp.1581-1587, 2002.
[34] S. Shakkottai, R. Srikant and N. Shroff, “Unreliable Sensor Grids: Coverage, Connectivity and Diameter,” in Proceedings of Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), San Francisco, CA, Apr. 2003.
[35] S. Yang, F. Dai, M. Cardei, and J. Wu, “On Multiple Point Coverage in Wireless Sensor Networks,” in Proceedings of the 2nd IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS), Nov. 2005.
[36] S. Kumar, Ten H. Lai, and A. Arora, “Barrier Coverage With Wireless Sensors,” in Proceedings of the 7th Annual International Conference on Mobile Computing and Networking (MobiCom), pp.284-298, Cologne, Germany, 2005.
[37] S. Megerian, F. Koushanfar, M. Potkonjak, and M. B. Srivastava, “Worst and Best-Case Coverage in Sensor Networks,” IEEE Transactions on Mobile Computing, Vol.4, No.1, pp.84-92, Feb. 2005.
[38] TinyOS, UC Berkeley, http://www.tinyos.net/[39] T. H. Cormen, R. L. Rivest, C. E. Leiserson, and C. Stein, “Introduction to Algorithms,” MIT Press, 2001.
[40] T. Yan, T. He, and J. A. Stankovic. “Differentiated Surveillance for Sensor Networks,” in ACM International Conference on Embedded Networked Sensor Systems (SenSys), pp.51-62, 2003.
[41] X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, and C. Gill, “Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks,” in ACM International Conference on Embedded Networked Sensor Systems (SenSys), pp.28-39, 2003.
[42] X. Bai, S. Kumar, Z. Yun, D. Xuan, and Ten H. Lai, “Deploying Wireless Sensors to Achieve Both Coverage and Connectivity,” in Proceedings of the 7th International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), Florence, Italy, 2006.
[43] Y. Xu, J. Heidemann, and D. Estrin, “Adaptive Energy-Conserving Routing for Multihop Ad Hoc Networks,” Tech. Report 527, USC/Information Sciences Institute, Oct. 2000.
[44] Y. Xu, J. Heidemann, and D. Estrin, “Geography-Informed Energy Conservation for Ad Hoc Routing,” in International Conference on Mobile Computing and Networking (MobiCom), Rome, Italy, July 2001.
[45] Y. Zou and K. Chakrabarty, “Sensor Deployment and Target Localization Based on Virtual Forces,” in Proceedings of Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 2003.
[46] Y. Zou and K. Chakrabarty, “Uncertainty-Aware and Coverage-Oriented Deployment for Sensor Networks,” in ACM Journal Parallel and Distributed Computing, Vol.64, pp.788-798, 2004.
[47] Y.-C. Wang, C.-C. Hu, and Y.-C. Tseng, “Efficient Deployment Algorithms for Ensuring Coverage and Connectivity of Wireless Sensor Networks,” in IEEE Wireless Internet Conference (WICON), Budapest, Hungary, 2005.
指導教授 許健平(Jang-Ping Sheu) 審核日期 2006-7-21
推文 facebook   plurk   twitter   funp   google   live   udn   HD   myshare   reddit   netvibes   friend   youpush   delicious   baidu   
網路書籤 Google bookmarks   del.icio.us   hemidemi   myshare   

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明