跳到主要內容

臺灣博碩士論文加值系統

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

詳目顯示

我願授權國圖
: 
twitterline
研究生:蔣龍生
研究生(外文):Chiang, Lungsheng
論文名稱:在無線隨意網路中以矩形格狀法團為基礎之 流量感知省電機制
論文名稱(外文):Traffic Aware Power Saving Protocol based on Rectangular Grid Quorum in Wireless Ad Hoc Networks
指導教授:陳永昇陳永昇引用關係
指導教授(外文):Chen, Yeongsheng
口試委員:程榮祥游象甫
口試委員(外文):Cheng, RungshiangYu, Hsiangfu
口試日期:2012-07-12
學位類別:碩士
校院名稱:國立臺北教育大學
系所名稱:資訊科學系碩士班
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2013
畢業學年度:100
語文別:英文
論文頁數:41
中文關鍵詞:省電機制流量感知格狀法團無線隨意網路
外文關鍵詞:power savingtraffic aware protocolsgrid quorumad hoc networks
相關次數:
  • 被引用被引用:0
  • 點閱點閱:170
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
如何延長行動設備電池的有效時間已成為無線網路的環境下最重要的議題之一。在過去許多文獻中,已有許多省電機制被提出。而其中一常見的省電機制是建立於格狀法團(Grid Quorum)系統的基礎上。對於一個格狀法團省電機制而言,格框長度(Grid Size)對於睡眠的比例是一項很重要的因素。一個長度較大的格框長度,工作站可以得到較高的睡眠比來節省更多的電量,但相對的,如此也會導致鄰近節點發現時間過長的問題產生。為了解決這個難題,本論文提出一個在無線隨意網路中以矩形格狀法團(Rectangular Grid Quorum)為基礎之流量感知(Traffic Aware)省電機制。所提出之省電機制可根據前一個法團週期(Quorum Cycle)內的網路使用率,動態地調整格框的大小以有效地節省電能。此外,我們所提出的矩形格狀法團系統與之前所提出的方形格狀法團(Square Grid Quorum)系統相比,兩點之間相遇時間可被縮短。實驗結果顯示所提出的省電機制消耗了較少的能源、有效增加網路利用率並減少鄰近節點發現時間(Neighbor Discovery Time)。
Extending the battery life of portable devices has become one of the most important issues in wireless communication networks. Many power saving methods have been proposed. Among them, approaches based on grid quorum system are common. For a grid quorum based power saving protocol, the grid size is an important factor to the sleep ratio and the neighbor discovery time. A large grid size implies that a great deal of power can be reduced with high sleep ratio so as to conserve more energy, but, on the other hand, it will lead to long neighbor discovery time. To tackle this dilemma, this study proposed a rectangular grid quorum traffic aware power saving protocol for wireless ad hoc networks. The proposed protocol dynamically adjusts the grid size to effectively conserve power by considering the network utilization during its previous quorum cycle. Besides, with the proposed rectangular grid quorum system, the neighbor discovery time can be reduced as compared to the previous square grid quorum system. Simulation results show that the proposed approach consumes less energy, effectively increases the network utilization and reduces the neighbor discovery time.
摘要 i
Abstract ii
Table of Contents iii
List of Tables v
List of Figures vi
Chapter 1 Introduction 1
Chapter 2 Related Work 3
2.1 Synchronous Power Saving Protocols 3
2.2 Asynchronous Power Saving Protocols 6
(1)Dominating-awake-interval Protocol 6
(2)Periodically-fully-awake-interval Protocol 7
(3)Grid Quorum Power Saving Protocol 8
Chapter 3 Traffic Aware Power Saving Protocol Based on Rectangular Grid Quorum 12
3.1 Problem Statement 12
3.2 Rectangular Grid Quorum 14
3.3 Traffic Aware Power saving Protocol 17
(1) Light level 19
(2) Medium level 20
(3) Heavy level 21
Chapter 4 Performance Analysis 23
4.1 Simulation Environment 23
4.2 Simulation Results 24
(1) Sleep Ratio 25
(2) Power consumption 28
(3) Efficiency of awakeness 32
(4) Neighbor Discovery Time 35
Chapter 5 Conclusions 39
Reference 40
[1] I. S. 802.11g-2003, “Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications Amendment 4: Further Higher Date Rate Extension in the 2.4 GHz Band,” 2003.
[2] Y. C. Tseng, C. S. Hsu, and T. Y. Hsieh, “Power-saving protocols for IEEE 802.11-based multi-hop ad hoc networks,” Computer Networks, vol. 43, pp. 317-337, 2003.
[3] C. Suh, Y. B. Ko, and J. H. Kim, “Enhanced Power Saving for IEEE 802 . 11 WLAN with Dynamic Slot Allocation,” Mobile Ad-hoc and Sensor Networks, vol. 3794, pp. 498-507, 2005.
[4] C. H. Chen, “A Quorum-based Fault-tolerant Protocol for Mobility Agents in Mobile IP Networks,” Master Thesis, Department of Computer Science, National Taipei University of Education, 2007.
[5] G. Ricart and A. K. Agrawala, “An optimal algorithm for mutual exclusion in computer networks,” Communications of the ACM, vol. 24, no. 1, pp. 9-17, 1981.
[6] A. Kumar, “Hierarchical quorum consensus: a new algorithm for managing replicated data,” IEEE Transactions on Computers, vol. 40, no. 9, pp. 996-1004, 1991.
[7] D. Peleg and A. Wool, “Crumbling walls: a class of practical and efficient quorum systems,” Annual ACM Symposium on Principles of Distributed Computing, vol. 10, pp. 87-97, Feb. 1997.
[8] S. D. Lang and L. J. Mao, “A comparison of two torus-based k-coteries,” International Conference on Parallel and Distributed Systems, pp. 300-306.
[9] Y. C. Kuo and S. T. Huang, “A Geometric Approach for Constructing Coteries and k-Coteries,” IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 4, pp. 402-411, 1997.
[10] Y. T. Wu, Y. J. Chang, S. M. Yuan, and H. K. Chang, “A New Quorum-Based Replica Control Protocol,” Pacific Rim International Symposium on Fault-Tolerant Systems, pp. 116-121.
[11] Y. C. Tseng, J. R. Jiang, C. S. Hsu, and T. H. Lai, “Quorum-Based Asynchronous Power-Saving Protocols for IEEE 802 . 11 Ad Hoc Networks,” Mobile Networks and Applications, vol. 10, pp. 169-181, 2005.
[12] C. M. Chao, J. P. Sheu, and I. C. Chou, “An adaptive quorum-based energy conserving protocol for IEEE 802.11 ad hoc networks,” IEEE Transactions on Mobile Computing, vol. 5, no. 5, pp. 560-570, 2006.
[13] Y. S. Chen, M. K. Tsai, and L. S. Chiang, “Adaptive Traffic-Aware Power-Saving Protocol for IEEE 802.11 Ad Hoc Networks,” International Conference on Parallel and Distributed Systems, p. 866--871, 2011.
[14] L. M. Feeney and M. Nilsson, “Investigating the energy consumption of a wireless network interface in an ad hoc networking environment,” IEEE INFOCOM 2001, vol. 3, pp. 1548-1557, 2001.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top