無位置資訊無線感測網路之覆蓋及連通維持

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：13

、訪客IP：3.145.178.157

姓名

宋子民(Tzu-Ming Sung) 查詢紙本館藏

畢業系所

資訊工程學系

論文名稱

無位置資訊無線感測網路之覆蓋及連通維持
(Coverage and Connectivity Maintenance for Positionless Wireless Sensor Networks)

相關論文

★ 以IEEE 802.11為基礎行動隨意無線網路之混合式省電通訊協定	★ 以范諾圖為基礎的對等式網路虛擬環境相鄰節點一致性研究
★ 行動隨意網路可調適及可延展之位置服務協定	★ 同儕式網路虛擬環境高效率互動範圍群播
★ 巨量多人線上遊戲之同儕網路互動範圍語音交談	★ 基於范諾圖之同儕式網路虛擬環境狀態管理
★ 利用多變量分析之多人線上遊戲信任使用者選擇	★ 同儕網路虛擬環境3D串流同儕選擇策略
★ 一個使用802.11與RFID技術的無所不在導覽系統U-Guide之設計與實作	★ 同儕式三維資料串流
★ IM Finder: 透過即時通訊網路線上使用者找尋解答	★ 無位置資訊無線感測網路自走車有向天線導航與協調演算法
★ 多匯點無線感測網路省能及流量分散事件輪廓追蹤	★ 頻寬感知同儕式3D串流
★ 無線感測網路旋轉指向天線定位法	★ 網路虛擬環境多重伺服器動態負載平衡

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

在此論文中，我們針對無線感測網路提出一個新的密度控制演算法，儘量使得較少的感測器進入活躍狀態，以對一個指定的監視區域，達成連通的完整覆蓋；而其他未進入活躍狀態的節點則進入休眠狀態，以節省電力資源，達到增長感測網路生命週期的效果。不像其他相關的演算法，本篇論文所提演算法不依賴感測器的位置資訊，它只要求處於活躍狀態的感測器週期性的發送兩個不同傳送距離的信標訊號(beacon)，而接收到這些信標訊號的感測器便可依據信標訊號中的資訊決定應該處於活躍狀態或者是休眠狀態。當有任何處於活躍狀態節點電力用盡或者是故障的時候，處於休眠狀態的節點即可立即進入活躍狀態，接替其感測工作，因而達到容錯機制的功能。在具有足夠高密度(sufficiently high density)感測器及感測器無線傳輸距離大於等於2倍感測距離的假設情況下，所提演算法在最佳情況下可以達到最佳連通完整覆蓋。我們並執行模擬實驗，探討a參數與節點密度對演算法效能的影響，其中a ((1/√3) < a < 1) 為兩個信標訊號傳送距離的比值。這些模擬實驗數據，讓我們可以根據給定的感測器密度，設定適當的 a 值以便得到較佳的演算法效能。

摘要(英)

In this thesis, we propose a new density control algorithm for wireless sensor networks to keep as few as possible sensors in active state to achieve a connected coverage of a specific area of interest. Inactive sensors can turn off sensor modules to save energy for prolonging the network lifetime. Unlike other algorithms, the proposed algorithm does not rely on position information of sensors. It just requires each active sensor to send two beacons of distinct transmission ranges periodically. Sensors can then decide to stay in the active state or inactive state. When any active sensor runs out of energy or fails, one or more inactive sensors can switch to the active state to take over the surveillance responsibility. The proposed algorithm is thus of the capability of fault-tolerance. Under the assumption of sufficiently high density of sensors and the assumption of Rc > 2Rs, we show our algorithm can achieve optimal connected coverage in the best case, where Rc and Rs are the radio communication radius and the sensing radius of sensors, respectively. Furthermore, we perform simulation experiments to investigate the impact of the node density and the ratio a on algorithm performance, where a, (1/√3) < a < 1, is the ratio of the transmission ranges of the two beacons. By simulation results, we can set a to be proper values according to given node densities for better performance.

關鍵字(中)

★ 無線感測網路
★ 密度控制
★ 覆蓋
★ 連通
★ 節能
★ 容錯

關鍵字(英)

★ wireless sensor network
★ coverage
★ density control
★ power saving
★ connectivity
★ fault-tolerance

論文目次

中文提要 I
英文提要 II
目錄 III
圖目錄 IV
一、Introduction 1
二、Related Work 6
2-1 The Coverage Problem in 2D WSNs 6
2-2 The Coverage Problem in 3D WSNs 9
三、Problem Definition 13
3-1 Problem Formulation 13
3-2 Algorithm 14
3-2-1Background 14
3-2-2The Proposed Algorithm 18
四、Simulation Result 24
五、Conclusion and Future Work 31
六、Reference 32

參考文獻

[1] Ian F. Akyildiz, Weilian Su, Yogesh Sankarasubramaniam, and Erdal Cayirci, “A Survey on Sensor Networks”, IEEE Communications Magazine, pages 102-104, 2002
[2] A. Mainwaring, J. Polastre, R. Szewczyk, and D. Culler, “Wireless sensor networks for habitat monitoring,” Proc. of First ACM International Workshop on Wireless Workshop in Wireless Sensor Networks and Applications (WSNA 2002), August 2002
[3] B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, “Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks”, ACM/IEEE International Conference on Mobile Computing and Networking (2001) 85-96.
[4] Fan Ye, G. Zhong, J. Cheng, Songwu Lu and Lixia Zhang, “PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks”, Proc. of International Conference on Distributed Computing Systems, pages 28-37, May 2003
[5] J. Carle and D. Simplot-Ryl, “Energy-Efficient Area Monitoring by Sensor Networks”, IEEE Computer Magazine, pages 40-46, 2004
[6] Himanshu Gupta, Samir R. Das, Quinyi Gu, “Connect Sensor Cover: Self-Organization of Sensor Networks for Efficient Query Execution”, Proc. of ACM International Symposium on Mobile Ad Hoc Networking and Computing, pages 189-200, 2003
[7] S. Meguerdichian., F. Koushanfar., M. Potkonjak, Mani B. Srivastava, “Coverage Problems in Wireless Ad-hoc Sensor Networks”, IEEE INFOCOM, pages 1380-1387, 2001
[8] Xiaorui Wang, Guoliang Xing, Yuanfang Zhang, Chenyang Lu, Robert Pless, Christopher Gill, “Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks”, Proc. of International Conference of Embedded Networked Sensor Systems, pages 28-39, 2003
[9] Honghai Zhang and Jennifer C. Hou, “Maintaining Sensing Coverage and Connectivity in Large Sensor Networks”, Proc. of Int’l Workshop on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless and Peer-to-Peer Networks, 2004
[10] Zongheng Zhou, Samir Das, Himanshu Gupta, “Connected K-Coverage Problem in Sensor Networks”, IEEE Computer Communications and Networks, pages 373-378, 2004
[11] Rajagopal Iyengar, Koushik Kar, Suman Banerjee, “Low-coordination Topologies For Redundancy In Sensor Networks”, Proc. of ACM International Symposium on Mobile Ad Hoc Networking and Computing, pages 332-342, 2005
[12] Xiaole Bai, Santosh Kumar, Ziqiu Yun, Dong Xuan, Ten H. Lai, “Deploying Wireless Sensors to Achieve Both Coverage and Connectivity”, Proc. of the Seventh International Symposium on Mobile Ad Hoc Networking and Computing, 2006
[13] D. Tian and N.D. Georganas, “A Coverage-preserved Node Scheduling scheme for Large Wireless Sensor Networks,” Proceedings of First International Workshop on Wireless Sensor Networks and Applications (WSNA'02), Atlanta, USA, September 2002.
[14] F. Ye, G. Zhong, S. Lu, and L. Zhang, Energy, “Efficient Robust Sensing Coverage in Large Sensor Networks,” Technical Report UCLA (2002).
[15] Chi-Fu Huang , Yu-Chee Tseng, “The Coverage Problem in a Wireless Sensor Network”, Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications, September 19-19, 2003, San Diego, CA, USA
[16] R. Kershner, “The Number of Circles Covering A Set”, American Journal of Mathematics, pages 665-671, 1939
[17] X. Bai, S. Kumar, D. Xuan, Z. Yun, and T. Lai, “Deploying wireless sensors to achieve both coverage and connectivity,” In MobiHoc’06, Florence, Italy, May 2006.
[18] Xiaoyan Hong, M. Gerla, R. Bagrodia, P. Estabrook,T.J. Kwon, G. Pei, “The Mars Sensor Network: Efficient, Power Aware Communications,” in Proceedings of IEEE MILCOM 2001 , McLean, VA, Oct. 2001
[19] NASA Sensor Web Project , “ http://sensorwebs.jpl.nasa.gov ”
[20] P.J. Wan and C.W. Yi, “Coverage by Randomly Deployed Wireless Sensor Networks,” Proc. Fourth IEEE Int’l Symp. Network Computing and Applications, 2005.
[21] Y.-C. Tseng, C.-S. Hsu, and T.-Y. Hsieh, “Power-Saving Protocols for IEEE 802.11-Based Multi-Hop Ad Hoc Networks,” IEEE INFOCOM, 2002.
[22] Jehn-Ruey Jiang, Yu-Chee Tseng, Chih-Shun Hsu and Ten-Hwang Lai, “Quorum-based asynchronous power-saving protocols for IEEE 802.11 ad hoc networks,” ACM Journal on Mobile Networks and Applications, Feb. 2005.
[23] Huang CF, Tseng YC, “A survey of solutions to the coverage problems in wireless sensor networks,” Journal of Internet Technology, 2005, 6(1) : 1-8.
[24] Mohamed Younis, Poonam Munshi, Gaurav Gupta, Sameh M. Elsharkawy, “On Efficient Clustering of Wireless Sensor Networks,” Proceedings of the Second IEEE Workshop on Dependability and Security in Sensor Networks and Systems, 2006
[25] Chi-Fu Huang, Yu-Chee Tseng, Li-Chu Lo, “The Coverage Problem in Three-Dimensional Wireless Sensor Networks,” Proceeding of IEEE Globecom, 2004
[26] Mohamed K. Watfa, Sesh Commuri, “The 3-Dimensional Wireless Sensor Network Coverage Problem,” Networking, Sensing and Control, 2006. ICNSC '06. Proceedings of the 2006 IEEE
[27] Mohamed K. Watfa, Sesh Commuri, “An Energy Efficient 3-Dimansional Wireless Sensor Cover,” Consumer Communications and Networking Conference, 2006. CCNC 2006. 2006 3rd IEEE
[28] Mohamed K. Watfa, Sesh Commuri, “Optimal 3-Dimensional Sensor deployment Strategy,” Consumer Communications and Networking Conference, 2006. CCNC 2006. 2006 3rd IEEE
[29] Mohamed K. Watfa, Sesh Commuri, “Optimality Measures for Coverage in 3D Wireless Sensor Networks,” Wireless Pervasive Computing, 2006 1st International Symposium, 16-18 Jan. 2006
[30] Mohamed K. Watfa, Sesh Commuri, “Coverage Strategies in Wireless Sensor Networks,” International Journal of Distributed Sensor Networks , 2006
[31] S. Shakkottai, R. Srikant and N. Shroff, “Unreliable Sensor Grids: Coverage, Connectivity and Diameter,” Proc. IEEE INFOCOM, Mar. 2003
[32] http://en.wikipedia.org/wiki/Cubic_crystal_system Body Centered Cubic lattice (bcc lattice)
[33] LAN MAN Standards Committee of the IEEE Computer Society, IEEE Std 802.11-1999, “ Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications,” IEEE 1999
[34] J. H. Conway and N. J. A. Sloane, “Sphere Packings, Lattices and Groups,” Springer-Verlag, New York, 2nd ed, 1993
[35] Besprechung des Buchs von L.A. Seeber, “Untersuchungen uber die Eigenschaften der positiven ternaren quagratischen Formen usw,” Gottingcsche Gelehrte Anzeigen (1831, July 9) = Werke, II (1876), 188-196 [1]
[36] R. P. Bambah, “On lattice coverings by spheres,” PCPS 50 (1954), 203-208 [2, 4]

指導教授

江振瑞(Jehn-Ruey Jiang)

審核日期

2007-10-3

推文