適用於無線隨意網路中以關節點為基礎的分散式拓樸控制方法

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：115

、訪客IP：18.118.144.98

姓名

蕭吉森(Chi-sen Hsiao) 查詢紙本館藏

畢業系所

資訊工程學系在職專班

論文名稱

適用於無線隨意網路中以關節點為基礎的分散式拓樸控制方法
(Distributed Topology Control for Wireless Ad Hoc Networks Using Articulation Points)

相關論文

★ 具多重樹狀結構之可靠性群播傳輸	★ Dynamic Overlay Construction for Mobile Target Detection in Wireless Sensor Networks
★ 在嵌入式行動裝置上設計與開發跨平台Widget	★ 在 ARM 架構之嵌入式系統上實作輕量化的手持多媒體播放裝置圖形使用者介面函式庫
★ 基於網路行動裝置所設計可擴展的服務品質感知GStreamer模組	★ 針對行動網路裝置開發可擴展且跨平台之GSM/HSDPA引擎
★ 於單晶片多媒體裝置進行有效率之多格式解碼管理	★ IMS客戶端設計與即時通訊模組研發：個人資訊交換模組與即時訊息模組實作
★ 在可攜式多媒體裝置上實作人性化的嵌入式小螢幕網頁瀏覽器	★ 以IMS為基礎之及時語音影像通話引擎的實作:使用開放原始碼程式庫
★ 電子書嵌入式開發: 客制化下載服務實作, 資料儲存管理設計	★ 於數位機上盒實現有效率訊框參照處理與多媒體詮釋資料感知的播放器設計
★ 具數位安全性的電子書開發：有效率的更新模組與資料庫實作	★ 適用於異質無線寬頻系統的新世代IMS客戶端軟體研發
★ 在可攜式數位機上盒上設計並實作重配置的圖形使用者介面	★ Friendly GUI design and possibility support for E-book Reader based Android client

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

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

摘要(中)

一個具有高度密集節點的無線隨意網路雖然提供了封包路由強大的連通性，但同時也增加了節點之間互相干擾的機率，進而造成節點能量的快速損耗。為了解決這個問題，拓樸控制的目的在於最佳化無線隨意網路中所有節點的傳輸功率，並保持網路的連通性，減少能源浪費，提高網路的吞吐量。
在此篇論文中，我們提出了一種在無線隨意網路中以少量的傳輸成本就可以有效地節省功率損耗的一種部分分散式的拓樸控制方法，稱為Articulation Points based Topology Control (APTC)。不同於其他現有的拓撲控制協議，APTC指定關節點作為起始點，並以此建構出最小成本樹來達到網路連通性以及節省能源的目的。實驗結果表明，不論是在功率損耗、網路吞吐量和訊息開銷上，APTC皆優於其他現有的拓樸控制方法。

摘要(英)

A wireless ad hoc network with a high average node degree offers a strong connectivity for packet routing, but at the same time increases the probability of interference between nodes and results in rapid depletion of node energy. To remedy this issue, topology control aims at optimizing transmission power for all nodes in a wireless ad hoc network to maintain the connectivity of the network, decrease the energy wastage, and increase the network throughput. In this paper, we propose a partial localized topology control algorithm, namely Articulation Points based Topology Control (APTC), which effectively save power consumption in a wireless ad hoc network with a low ommunication overhead. Unlike the other existing topology control protocols, APTC designates articulation points to be initiators and builds a tree of minimum spanning trees to achieve both network connectivity and power saving. The simulation results demonstrate the superior of APTC over the existing topology control algorithms in terms of power consumption, network throughput, and communication overhead.

關鍵字(中)

★ 拓樸控制
★ 關節點

關鍵字(英)

★ Topology Control
★ Articulation Point

論文目次

摘要 ............................................................. i
Abstract ....................................................... ii
Table of Contents ............................................. iii
List of Figures ................................................. v
List of Tables ................................................. vi
Chapter 1. Introduction ......................................... 1
Chapter 2. Literature Review .................................... 5
2.1 Location-based Topology Control . . . . . . . . . . . 5
2.2 Direction-based Topology Control . . . . . . . . . . . 7
2.3 Neighborhood-based Topology Control . . . . . . . . 8
Chapter 3. Preliminary ......................................... 11
3.1 Definitions . . . . . . . . . . . . . . . . . . . . . . . 11
3.1.1 Algorithms for Identifying Articulation Points . . . . 12
Chapter 4. Articulation Points-based Topology Control .......... 14
Chapter 5. Analysis ............................................ 21
Chapter 6. Performance Evaluation .............................. 23
6.1 Simulation Configuration . . . . . . . . . . . . . . . 23
6.2 Simulation Results . . . . . . . . . . . . . . . . . . . 26
Chapter 7. Conclusion and Future Work .......................... 31
Reference ...................................................... 32

參考文獻

[1] R. Sarkar and Jie Gao. Differential forms for target tracking and aggregate queries in distributed networks. Networking, IEEE/ACM Transactions on, 21(4):1159-1172, Aug 2013.
[2] C. Buragohain, D. Agrawal, and S. Suri. Distributed navigation algorithms for sensor networks. In INFOCOM 2006. 25th IEEE International Conference on Computer Communications. Proceedings, pages 1-10, April 2006.
[3] P. Corke, T. Wark, R. Jurdak, Wen Hu, P. Valencia, and D. Moore. Environmental wireless sensor networks. Proceedings of the IEEE, 98(11):1903-1917, Nov 2010.
[4] K. Sanzgiri, B. Dahill, B.N. Levine, C. Shields, and E.M. Belding Royer. A secure routing protocol for ad hoc networks. In Network Protocols, 2002. Proceedings. 10th IEEE International Conference on, pages 78-87, Nov 2002.
[5] V. Devarapalli and D. Sidhu. Mzr: a multicast protocol for mobile ad hoc networks. In Communications, 2001. ICC 2001. IEEE International Conference on, volume 3, pages 886-891 vol.3, 2001.
[6] Wenbin Li, Junguo Zhang, Junmei Zhang, Zhifeng Xia, and Guozhu Wang. The monitoring of host computer for forest fire detection system based on wireless sensor network. In Wireless Communications, Networking and Mobile Computing, 2009. WiCom ′09. 5th International Conference on, pages 1-4, Sept 2009.
[7] N. Li, J.C. Hou, and Lui Sha. Design and analysis of an mst-based topology control algorithm. In INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies, volume 3, pages 1702-1712 vol.3, March 2003.
[8] Wenzhong Guo, Jong-Hyuk Park, L.T. Yang, A.V. Vasilakos, Naixue Xiong, and Guolong Chen. Design and analysis of a mstbased topology control scheme with pso for wireless sensor networks. In Services Computing Conference (APSCC), 2011 IEEE Asia-Pacific, pages 360-367, Dec 2011.
[9] Mo Li, Yu Weng, Peng-Jun Wan, Wen-Zhan Song, and O. Frieder. Localized low-weight graph and its applications in wireless ad hoc networks. In INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, volume 1, pages -442, March 2004.
[10] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein. Introduction To Algorithms. MIT Press, 2001.
[11] Li Li, Joseph Y. Halpern, P. Bahl, Yi-Min Wang, and R. Wattenhofer. A cone-based distributed topology-control algorithm for wireless multi-hop networks. Networking, IEEE/ACM Transactionson, 13(1):147-159, Feb 2005.
[12] Zhuochuan Huang and Chien-Chung Shen. Topology control with directional power intensity for ad hoc networks. In Wireless Communications and Networking Conference, 2004. WCNC. 2004 IEEE, volume 1, pages 604-609 Vol.1, March 2004.
[13] Harish Sethu and T. Gerety. A distributed topology control algorithm in the presence of multipath propagation. In Mobile and Ubiquitous Systems: Networking Services, 2007. MobiQuitous 2007. Fourth Annual International Conference on, pages 1-8, Aug 2007.
[14] K.J. Krizman, T.E. Biedka, and T.S. Rappaport. Wireless position location: fundamentals, implementation strategies, and sources of error. In Vehicular Technology Conference, 1997, IEEE 47th, volume 2, pages 919-923 vol.2, May 1997.
[15] R. Wattenhofer and A. Zollinger. Xtc: a practical topology control algorithm for ad-hoc networks. In Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International, pages 216-, April 2004.
[16] I. Schweizer, M.Wagner, D. Bradler, M. Muhlhauser, and T. Strufe. ktc - robust and adaptive wireless ad-hoc topology control. InComputer Communications and Networks (ICCCN), 2012 21st International Conference on, pages 1-9, July 2012.
[17] A.A. Jeng and Rong-Hong Jan. The r-neighborhood graph: An adjustable structure for topology control in wireless ad hoc networks. Parallel and Distributed Systems, IEEE Transactions on, 18(4):536-549, April 2007.
[18] Xiaomei Liu, Li Xiao, Andrew Kreling, and Yunhao Liu. Optimizing overlay topology by reducing cut vertices. In Proceedings of the 2006 International Workshop on Network and Operating Systems Support for Digital Audio and Video, NOSSDAV ′06, pages 17:1-17:6, New York, NY, USA, 2006. ACM.
[19] Yuan He, Hao Ren, Yunhao Liu, and Baijian Yang. On the reliability of large-scale distributed systems a topological view. 2013 42nd International Conference on Parallel Processing, 0:165-172, 2008.
[20] Min-Te Sun, Eric Hsiao-Kuang Wu, Chi-Sen Hsiao, and Ching-Hsiang Chu. Effective real-time detection of critical connectivity for reliable wireless networks.
[21] B. Bollobas. Modern Graph Theory. Graduate Texts in Mathematics. Springer New York, 1998.
[22] John Hopcroft and Robert Tarjan. Algorithm 447: Efficient algorithms for graph manipulation. Commun. ACM, 16(6):372-378, June 1973.
[23] Seth Pettie and Vijaya Ramachandran. An optimal minimum spanning tree algorithm. J. ACM, 49(1):16-34, 2002.
[24] R. C. Prim. Shortest connection networks and some generalizations. The Bell Systems Technical Journal, 36(6):1389-1401, 1957.

指導教授

吳曉光、孫敏德

審核日期

2014-7-18

推文