博碩士論文 965202075 詳細資訊




以作者查詢圖書館館藏 以作者查詢臺灣博碩士 以作者查詢全國書目 勘誤回報 、線上人數:10 、訪客IP:3.234.254.115
姓名 黃種國(Chung-kuo Huang)  查詢紙本館藏   畢業系所 資訊工程學系
論文名稱 在無線感測網路環境下的流量平衡資料收集與無碰撞排程協定
(Load-Balanced and Collision-Free Scheduling Protocol for Data Collection in Wireless Sensor Networks)
相關論文
★ 基於OP-TEE的可信應用程式軟體生態系統★ 在低軌道衛星無線通訊中的CSI預測方法
★ 為多流量低軌道衛星系統提出的動態換手策略★ 基於Trustzone的智慧型設備語音隱私保護系統
★ 一種減輕LEO衛星網路干擾的方案★ TruzGPS:基於TrustZone的位置隱私權保護系統
★ 無線行動隨建即連網路上之廣播與繞徑問題★ 熱門電影的高效能廣播演算法
★ 無線行動隨建即連網路上之媒體存取問題★ 使用功率調整來增加多節點封包無線網路
★ 在無線行動隨建即用網路下Geocast 之設計與實做經驗★ 一個適用於熱門隨選視訊服務之快速排程廣播策略
★ 應用數位浮水印技術於影像之智慧財產權保護與認證★ 在寬頻分碼多重擷取技術上分配及再分配多重正交可變展頻係數碼
★ 無線行動隨建即連網路上之廣播排程協定★ 在無線行動隨建即連網路下支援即時多媒體傳送的媒介存取協定
檔案 [Endnote RIS 格式]    [Bibtex 格式]    [相關文章]   [文章引用]   [完整記錄]   [館藏目錄]   [檢視]  [下載]
  1. 本電子論文使用權限為同意立即開放。
  2. 已達開放權限電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。
  3. 請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。

摘要(中) 在靜態無線感測網路中,如何達成有效的週期性資料收集並延長網路生命週
期已經成為一個重要的研究議題。在這篇文章中,我們提出一個分散式k 流量平衡樹的方法來延長週期性資料收集的網路生命週期。一棵 k 流量平衡樹是指在一個網路中任兩個非葉節點的小孩個數差距不會超過k。我們讓每個節點在挑選父母的時候,會以目前擁有的小孩數以及其鄰居節點個數最少的節點為優先挑選者,來避免任兩個非葉節點的小孩個數差距超過k。此外,為了避免在無線資料傳輸下可能產生的封包碰撞,我們提出一個以分時傳送為基礎的分散式傳輸排程方法。模擬結果顯示我們的方法不但能延長網路生命週期且讓因為排程產生的整體時槽使用時間趨近於集中式方法所產生的整體時槽使用時間。
摘要(英) In static wireless sensor networks, it is an important research issue to achieve effectively periodic data collection and prolong the network lifetime. In this thesis, a distributed k-load-balanced tree scheme is proposed to prolong the network lifetime for periodic data collection. A k-load-balanced tree is a tree that the difference of the number of children of each two non-leaf nodes in a network is less than k. Each node chooses the node with the least current number of children and number of neighbor as parent for avoiding that the difference of the number of children of each two non-leaf nodes in a network is more than k. Furthermore, based on the k-load-balanced tree, a distributed TDMA-based scheduling scheme is proposed to avoid packet collisions in wireless data transmissions. The simulation results show that our scheme can prolong the network lifetime and the network delay time is close to the result of centralized method.
關鍵字(中) ★ 流量平衡
★ 資料收集
★ 分時傳送
★ 無線感測網路
關鍵字(英) ★ Load-balanced
★ data collection
★ time division multiple access (TDMA)
★ wireless sensor networks (WSNs)
論文目次 Chapter 1 Introduction ............................................................................. 1 
Chapter 2 Preliminary .............................................................................. 4 
2.1 Related works .................................................................................................. 4 
2.2 System model .................................................................................................. 7 
Chapter 3 Protocol Description ............................................................. 10 
3.1 Tree-construction Phase ................................................................................. 10 
3.2 TDMA-scheduling Phase............................................................................... 19
Chapter 4 Simulation Results ................................................................ 28
4.1 The maximum number of children of nodes in the network .......................... 29 
4.2 The total number of non-leaf nodes in the network ....................................... 31
4.3 The difference of maximum and minimum number of children of nodes ..... 33
4.4 The maximum number of time slot of nodes in the network ......................... 35
4.5 The number of transmitted packets ................................................................ 37
Chapter 5 Conclusions ........................................................................... 40 
Reference .............................................................................................. 42 
參考文獻 [1] The Precise Project, http://projectsprecise.com/
[2] The Network Simulator ns-2, http://www.isi.edu/nsnam/ns/
[3] V. Annamalai, S. Gupta and L. Schwiebert, “On tree-based convergecasting in wireless sensor networks,” in Proceedings of IEEE Wireless Communications and Networking (WCNC), vol. 13, pp. 1942-1947, March 2003.
[4] A. Barnawi, R. Hafez, “Performance of TDMA scheduling algorithms in the presence of data correlation in sensor networks,” in Proceedings of IEEE Electrical and Computer Engineering, pp. 675-680, May 2008.
[5] G. Caizzone, W. Erangoli, P. Giacomazzi and G. Verticale, “An enhanced GPSR routing algorithm for TDMA-based ad-hoc networks,” in Proceedings of the Global Telecommunications (GLOBECOM), pp. 2616-2621, December 2005.
[6] T. S. Chen, H.-W. Tsai and C. P. Chu, “Gathering-load-balanced tree protocol for wireless sensor networks,” in Proceedings of IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, vol. 2, pp. 8-13, June 2006.
[7] T. S. Chen, Y. S. Chang, H. W. Tsai and C. P. Chu, “Data aggregation for range query in wireless sensor networks,” in Proceedings of IEEE Wireless Communications and Networking (WCNC), pp. 4127-4132, March 2007.
[8] Y. Chen and E. Fleury, “A distributed policy scheduling for wireless sensor networks,” in Proceedings of IEEE Computer Communications (INFOCOM), pp. 1559-1567, May 2007.
[9] Z. h. Chen and A. Khokhar, “Self organization and energy efficient TDMA MAC protocol by wake up for wireless sensor networks,” in Proceedings of IEEE Sensor and Ad Hoc Communications and Networks (SECON), pp. 335-341, October 2004.
[10] M. Cheng and L. Yin, “Transmission scheduling in sensor networks via directed edge coloring,” in Proceedings of IEEE International Conference on Communications (ICC), pp. 3710-3715, June 2007.
[11] C. F. Chiasserini and M. Garetto, ”Modeling the Performance of Wireless Sensor Networks,” in Proceedings of IEEE Computer Communications (INFOCOM), vol. 1, pp. 1-12, March 2004.
[12] V. Cionca, T. Newe, and V. Dadarlat, “TDMA protocol requirements for wireless sensor networks,” in Proceedings of IEEE International Conference on Sensor Technologies and Applications (SENSORCOMM), pp. 30-35, Augest 2008.
[13] P. Djukic and S. Valaee, “Link scheduling for minimum delay in spatial re-use TDMA,” in Proceedings of IEEE Computer Communications (INFOCOM), pp. 28-36, May 2007.
[14] K. W. Fan, S. Liu and P. Sinha, “Dynamic forwarding over tree-on-DAG for scalable data aggregation in sensor networks,” IEEE Transactions on Mobile Computing, vol. 7, pp. 1271-1284, October 2008.
[15] Y. Fei, H. Yao and Z. S. Niu, “Sub cluster aided data collection in multihop wireless sensor networks,” in Proceedings of IEEE Wireless Communications and Networking (WCNC), pp. 3967-3971, March 2007.
[16] S. Gandham, M. Dawande and R. Prakash, “Link scheduling in sensor networks: distributed edge coloring revisited,” in Proceedings of IEEE Computer Communications (INFOCOM), vol. 4, pp. 2492-2501, March 2005.
[17] S. Gandham, Y. Zhang and Q. Huang, “Distributed minimal time convergecast scheduling in wireless sensor networks,” in Proceedings of IEEE Distributed Computing Systems (ICDCS), pp. 50-56, October 2006.
[18] X. Hao, Yi Kang and Y. Wang, “Geographical-based multihop clustering algorithm for distributed wireless sensor network,” in Proceedings of IEEE Intelligent Control and Automation (WCICA), pp. 3304-3309, June 2008.
[19] W. R. Heinzelman, A. Chandrakasan and H. Balakrishnan, “Energy-efficient communication protocol for wireless microsensor networks,” in Proceedings of the Hawaii International Conference on System Sciences (HICSS), January 2000.
[20] T. Herman, S. Pemmaraju and I. Pirwani, “Oriented edge colorings and link scheduling in sensor networks,” in Proceedings of IEEE International Conference on Communication System Software and Middleware (Comsware), pp. 1-6, 2006.
[21] F. Hu, C. May and C. Xiaojun, “Data aggregation in distributed sensor networks: Towards an adaptive timing control,” in Proceedings of IEEE International Conference on Information Technology (ITNG), pp. 256-261, April 2006.
[22] S. C. H. Huang, P.-J. Wan, C. T. Vu, Y. Li and F. Yao, “Nearly constant approximation for data aggregation scheduling in wireless sensor networks,” in Proceedings of IEEE Computer Communications (INFOCOM), pp. 366-372, May 2007.
[23] D. Hui and R. Han, “A node-centric load balancing algorithm for wireless sensor networks,” in Proceedings of the Global Telecommunications (GLOBECOM), vol. 1, pp. 548-552, December 2003.
[24] K. Jungsook, L. Jaehan, C. Pelczar and J. Byungtae, “RRMAC: a sensor network MAC for real time and reliable packet transmission,” in Proceedings of IEEE Symposium on Consumer Electronics (ISCE), pp. 1-4, April 2008.
[25] B. Lee, K. Park and R. Elmasri, “Energy balanced in-network aggregation using multiple trees in wireless sensor networks,” in Proceedings of IEEE Consumer Communications and Networking (CCNC), pp. 530-534, January 2007.
[26] H. Lee and A. Keshavarzian, “Towards energy-optimal and reliable data collection via collision-free scheduling in wireless sensor networks,” in Proceedings of IEEE Computer Communications (INFOCOM), pp. 2029-2037, April 2008.
[27] S. Li, D. Qian, Y. Liu and J. Tong, “Adaptive distributed randomized TDMA scheduling for clustered wireless sensor networks,” in Proceedings of IEEE Wireless Communications, Networking and Mobile Computing (WiCom), pp. 2688-2691, September 2007.
[28] C. Liu, K. Wu and J. Pei, “A dynamic clustering and scheduling approach to energy saving in data collection from wireless sensor networks,” in Proceedings of IEEE Sensor and Ad Hoc Communications and Networks (SECON), pp. 374-385, September 2005.
[29] W. Lou and Y. Kwon, “H-SPREAD: a hybrid multipath scheme for secure and reliable data collection in wireless sensor networks,” IEEE Journal of Vehicular Technology, vol. 55, no. 4, pp. 1320-1330, July 2006.
[30] M. Medidi and Y. Y. Zhou, ”Extending lifetime with differential duty cycles in wireless sensor networks,” in Proceedings of the Global Telecommunications (GLOBECOM), pp. 1033-1037, November 2007.
[31] S. N. Parmar, S. Nandi and A. R. Chowdhury, “Power efficient and low latency MAC for wireless sensor networks,” in Proceedings of IEEE Sensor and Ad Hoc Communications and Networks (SECON), pp. 940-944, September 2006.
[32] A. Pourkabirian and A. T. Haghighat, “Energy-aware delay-constrained routing in wireless sensor networks,” in Proceedings of IEEE International Conference on Software, Telecommunications and Computer Networks, pp. 1-5, September 2007.
[33] I. Rhee, A. Warrier, J. Min and L. Xu. “DRAND: distributed randomized TDMA scheduling for wireless ad-hoc networks,” in Proceedings of ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 190-201, May 2006.
[34] I. Rhee, A. Warrier, M. Aia, J. Min and M. L. Sichitiu, “Z-MAC: a hybrid MAC for wireless sensor networks,” IEEE Journal of Networking , vol. 16, no. 3, pp. 511-524, June 2008.
[35] A. Silberstein and J. Yang, “Many-to-many aggregation for sensor networks,” in Proceedings of IEEE International Conference on Data Engineering (ICDE), pp. 986-995, April 2007.
[36] H. W. Tsai and T. S. Chen, “Minimal time and conflict-free schedule for convergecast in wireless sensor networks,” in Proceedings of IEEE International Conference on Communications (ICC), pp. 2808-2812, May 2008.
[37] S. M. Vahid and V. W. S. Wong, “Distributed maximum lifetime routing in wireless sensor networks based on regularization,” in Proceedings of the Global Telecommunications (GLOBECOM), pp.598-603, November 2007.
[38] N. C. Wang, P.-C. Yeh and Y. F. Huang, “An energy-aware data aggregation scheme for grid-based wireless sensor networks,” in Proceedings of ACM International Conference on Wireless Communications and Mobile Computing (IWCMC), pp. 487-492, 2007.
[39] Y. Wang and I. Henning, “A deterministic distributed TDMA scheduling algorithm for wireless sensor networks,” in Proceedings of IEEE Wireless Communications, Networking and Mobile Computing (WiCom), pp. 2759-2762, September 2007.
[40] D. Wei, H. A. Chan and K. V. N. Kameri, “Circular-layer algorithm for ad hoc sensor networks to balance power consumption,” in Proceedings of IEEE Sensor and Ad Hoc Communications and Networks (SECON), pp. 945-950 , September 2006.
指導教授 許健平、張貴雲
(Jang-Ping Sheu、Guey-Yun Chang)
審核日期 2009-7-31
推文 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聯絡  - 隱私權政策聲明