臺灣博碩士論文加值系統

在無線隨意網路的拓樸控制研究中, 通常都是假設在靜態環境下進行, 顯然這樣的假設不合理。 在本篇論文中使用了一個以r鄰居圖(r-neighborhood graph)為主的拓樸控制機制, 理論上此機制可以讓各節點因應網路的狀態而作適當的調整, 所以能在移動性的環境中仍然有效率地節省能源。 而本篇論文透過模擬實驗的方式來分析以及驗證此機制的可行性, 模擬的結果顯示所提出的機制可有效的節省能源的利用。

第一章 簡介…………………………………………………………………………..4
1.1拓樸控制的簡介……………………………………………………………..4
1.2符號簡介……………………………………………………………………..5
第二章 相關研究……………………………………………………………………..7
2.1局部架構……………………………………………………………………..7
2.2移動性的拓樸控制研究……………………………………………………..9
第三章 r鄰居圖的探討……..………………………………………………………11
3.1 r鄰居圖(The r-neighborhood graph)……………………………………….11
3.1.1 RNG、GG 和 的關係…………………………………………12
3.1.2 r在無線隨意網路上的調整………………………………………...14
3.2 一般的r鄰居圖(The general r-neighborhood graph)……………………..14
3.3 變動的r鄰居圖(The variant r-neighborhood graph)………………………15
3.3.1 r在VNG中的調整…………………………………………………15
3.4 r隔絕區域和r轉達區域(The r-enclosed region and the r-relaying region)……………………………………………………………………...16
第四章 實驗…………………………………………………………………………19
4.1 的模擬………………………………………………………………..19
4.1.1 網路層的模擬………………………………………………………19
4.1.2 媒介存取控制層的模擬……………………………………………20
4.1.3 實體層的模擬………………………………………………………20
4.1.4 其他模擬細節………………………………………………………23
4.2 實驗環境設定……………………………………………………………...26
4.3 實驗結果……………………………………………………………….......27
4.3.1 r與資料流量和廣播流量的關係…………………………………...27
4.3.2 在移動環境中找到最佳的r值…………………………………….29
4.3.3 r值和縮減功率的關係……………………………………………...30
4.3.4 NG0、NG0.5、NG1和VNG的比較……………………………....31
第五章 結論……………………………………..………………………………..…33
參考文獻…………………………………………..………………………………....34

[1] L. Feeney, “An energy-consumption model for performance analysis of routing protocols for mobile ad hoc networks”, ACM Journal of Mobile Networks and Applications, vol. 3, no. 6, pp. 239-249, 2001

[2] R. Ramanathan, and R. R-Hain, ”Topology Control of Multihop Wireless Networks using Transmit Power Adjustment”, In Proc. of the IEEE Computer and Communications Societies, vol. 2, pp. 404-413, 2000

[3] J. Liu and B. Li, “MobileGrid : Capacity-aware Topology Control in Mobile Ad Hoc Networks”, IEEE Eleventh International Conference, pp. 570-574,2002

[4] S. C. Wang, D. S. L. Wei , and S. Y. Kuo, ”SPT-Based Power-Efficient Topology Control For Wireless Ad Hoc Networks”, IEEE Military Communications Conference, vol. 3, pp. 1483-1490, 2004

[5] A . A. K. Jeng and R. H. Jan, “The r-Neighborhood Graph: A Novel Structure for Topology Control in Wireless Ad Hoc Networks”, IEEE Transactions on Parallel and Distributed Systems, 2005 (SCI, EI)

[6] J. Wu and F. Dai, “Mobility-Sensitive Topology Control in Mobile Ad Hoc Networks”, Proceeding of the 18th International Parallel and Distributed Processing Symposium, pp. 28-38, 2004

[7] R. Wattenhofer and A. Zollinger, “XTC: A practical topology control for ad-hoc networks”, In Proc. of the 18th Parallel and Distributed Processing Symposium, pp. 26-30, 2004
[8] X. Y. Li, P. J. Wan, and Y. Wang, “Power efficient and sparse spanner for wireless ad hoc networks”, IEEE International Conference on Computer Communicationsand Networks, pp. 564-567, 2001

[9] W. H. Lee and T. H. Meng, “A lower power GPS receiver architecture”, Global Telecommunications conference, vol. 11, pp. 153-157, 1999

[10] P. Santi , “Topology Control in Wireless Ad Hoc and Sensor Networks”, John Wiley & Sons, Ltd, 2005

[11] G. T. Toussaint, “The relative neighborhood graph of a finite planar set”, Pattern Recognition, vol. 12, no. 4, pp. 261-268, 1980

[12] K. R. Gabriel and R. R. Sokal, ”A new statistical approach to geographic variation analysis”, Systematic Zoology, vol 18, pp. 259-278, 1969

[13] A. C. C. Yao, “On constructing minimum spanning trees in k-dimensional spaces and related problems”, SIAM Journal of Computing, vol. 11, pp. 721-736, 1982

[14] V. Rodoplu and T. Meng, “Minimum energy mobile wireless networks”,IEEE Journal of Selected Area in Communications,pp1333-1344,1999

[15] K. Fall and K. Varadhan,”The ns manual”,The VINT Project,UCB, LBL, USC/ISI and Xerox PARC,http://www.isi.edu/nsnam/ns/doc/,2002

[16] C. E. Perins and P. Bhagwat, “Highly dynamic destination-sequenced
distance vector (DSDV) for mobile computers”, ACM Special Interest Group on
Data Communications, pp. 234–244, 1994