請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/36122完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 王勝德 | |
| dc.contributor.author | Siao-Wei Jhai | en |
| dc.contributor.author | 翟孝威 | zh_TW |
| dc.date.accessioned | 2021-06-13T07:51:50Z | - |
| dc.date.available | 2006-07-28 | |
| dc.date.copyright | 2005-07-28 | |
| dc.date.issued | 2005 | |
| dc.date.submitted | 2005-07-25 | |
| dc.identifier.citation | [1] C. Perkins and E. Royer, “Ad-hoc on-demand distance vector routing,' in Proceedings of 2nd IEEE Workshop on Mobile Computing Systems and Applications (WMCSA '99), pp. 90-100, 1999.
[2] D. Johnson and D. Maltz, “Ad-hoc on-demand distance vector routing,' in Mobile Computing (T. Imielinsinki and H. Korth, eds.), pp. 153-181, Kluwer Academic Publishers, 1996. [3] V. Park and M. Corson, “A highly adaptive distributed routing algorithm for mobile wireless networks,' in Proceedings of IEEE INFOCOM 97, vol. 3, pp. 1405-1413, 1997. [4] C. Perkins and P.Bhagwat, “Highly dynamic destination-sequenced distance-vector routing (dsdv) for mobile computers,' in Proceedings of ACM SIGCOMM 94, pp. 234-244, 1994. [5] K. Scott and N. Bambos, “Routing and channel assignment for low power transmission in pcs,' in Proceedings of 5th IEEE International Conference on Universal Personal Communications, vol. 2, pp. 498-502, 1996. [6] S. Singh, M. Woo, and C. Raghavendra, “Power-aware routing in mobile ad hoc networks,' in Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking, pp. 181-190, 1998. [7] C.-K. Toh, “Maximum battery life routing to support ubiquitous mobile computing in wireless ad hoc networks,' IEEE Communications Magazine, vol. 39, pp. 138-147, 2001. [8] X. Hou and D. Tipper, “Gossip-based sleep protocol (gsp) for energy efficient routing in wireless ad hoc networks,' in Proceedings of IEEE Wireless Communications and Networking Conference, vol. 3, pp. 1305-1310, 2004. [9] Y.-C. Tseng, C.-S. Hsu, and T.-Y. Hsieh, “Power-saving protocols for ieee 802.11-based multi-hop ad hoc networks,' in Proceedings of IEEE Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 1, pp. 200-209, 2002. [10] J.-R. Jiang, Y.-C. Tseng, C.-S. Hsu, and T.-H. Lai, “Quorum-based asynchronous power-saving protocols for ieee 802.11 ad hoc networks,' ACM Mobile Networks and Applications, vol. 10, pp. 169-181, 2005. [11] R. Zheng, J. C. Hou, and L. Sha, “Asynchronous wakeup for ad hoc networks,' in Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking & Computing, pp. 35-45, 2003. [12] B. Chena, K. Jamieson, H. Balakrishnan, and R. Morris, “Span: An energy-e cient coordination algorithm for topology maintenance in ad hoc wireless networks,' ACM Wireless Networks, vol. 8, pp. 481-494, 2002. [13] Y. Xu, J. Heidemann, and D. Estrin, “Geography-informed energy conservation for ad hoc routing,' in Proceedings of the 7th Annual International Conference on Mobile Computing and Networking, pp. 70-84, 2001. [14] J.-C. Lin, S.-N. Yang, and M.-S. Chern, “An efficient distributed algorithm for minimal connected dominating set problem,' in Tenth Annual International Phoenix Conference on Computers and Communications, pp. 204-210, 1991. [15] B. Das and V. Bharghavan, “Routing in ad-hoc networks using minimum connected dominating sets,' in IEEE International Conference on Communications, pp. 376-380, 1997. [16] J. Wu and H. Li, “On calculating connected dominating sets for efficient routing in ad hoc wireless networks,' in Third Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm., pp. 7-14, 1999. [17] J. Wu, “Extended dominating-set-based routing in ad hoc wireless networks with unidirectional links,' IEEE Communications Magazine, vol. 13, pp. 866-881, 2002. [18] F. Dai and J. Wu, “An extended localized algorithm for connected dominating set formation in ad hoc wireless networks,' IEEE Transactions on Parallel and Distributed Systems, vol. 15, pp. 908-920, 2004. [19] “Ns2 - network simulator,' in http://www.isi.edu/nsnam/ns/. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/36122 | - |
| dc.description.abstract | Power-saving is a critical issue in ad hoc networks since the nodes are energy-limited devices. This paper presents an energy-efficient routing protocol Enhanced Geographical Adaptive Fidelity, EGAF, for ad hoc networks. The EGAF protocol uses the concept of virtual grids, which are based the grid architecture of the geographical adaptive fidelity (GAF) protocol. GAF divides the whole network area into several identical square areas, called virtual grids; in each grid, there is only one node which needs to participate in forwarding packets. EGAF always keeps the nodes which are responsible for network routing near the center of each grid instead of whole area of each grid in GAF; hence the square size in EGAF is more flexible. Under the same transmission range, the square size in EGAF cab be bigger than the one in GAF. In other words, there are fewer squares in EGAF due to the bigger square size; this means that only fewer nodes need to be awake and more nodes can be asleep. Due to the higher ratio of the awake nodes to the asleep nodes, EGAF can improve network lifetime. The simulation results show that EGAF has better performance than GAF does. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-13T07:51:50Z (GMT). No. of bitstreams: 1 ntu-94-R92921090-1.pdf: 3209065 bytes, checksum: 3b965fd839583e86b3ddc341652090a2 (MD5) Previous issue date: 2005 | en |
| dc.description.tableofcontents | 1 Introduction 1
1.1 Overview............................1 1.2 Thesis Organization......................6 2 Related Work 7 2.1 Connected Dominating Set..................7 2.2 SPAN..............................9 2.3 GAF...............................10 3 Enhanced Geographical Adaptive Fidelity 13 3.1 Concept of EGAF.......................13 3.2 Node State Management....................17 3.3 Discovery States........................20 3.4 Active State...........................22 3.5 Sleeping State..........................23 4 Performance Evaluation 25 4.1 Network Lifetime........................29 4.2 Packet Delivery Ratio.....................34 4.3 Packet End-to-End Delay...................36 4.4 Network Lifetime vs. Node Density..............39 5 Conclusion 41 | |
| dc.language.iso | en | |
| dc.subject | 虛擬網格 | zh_TW |
| dc.subject | 無線隨意網路 | zh_TW |
| dc.subject | 能源節省 | zh_TW |
| dc.subject | 睡眠 | zh_TW |
| dc.subject | 連結支配集合 | zh_TW |
| dc.subject | sleep | en |
| dc.subject | virtual grid | en |
| dc.subject | connected dominating set | en |
| dc.subject | ad hoc network | en |
| dc.subject | power saving | en |
| dc.title | 在無線隨意網路使用虛擬網格之能源節省機制 | zh_TW |
| dc.title | A Power Saving Mechanism Using Virtual Grids in Wireless Ad Hoc Networks | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 93-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 林宗男,陳省隆 | |
| dc.subject.keyword | 無線隨意網路,能源節省,睡眠,連結支配集合,虛擬網格, | zh_TW |
| dc.subject.keyword | ad hoc network,power saving,sleep,connected dominating set,virtual grid, | en |
| dc.relation.page | 46 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2005-07-25 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 電機工程學研究所 | zh_TW |
| 顯示於系所單位： | 電機工程學系 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-94-1.pdf 未授權公開取用 | 3.13 MB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。