跳到主要內容

臺灣博碩士論文加值系統

(3.236.110.106) 您好!臺灣時間:2021/07/24 05:21
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:陳志展
研究生(外文):Chih-Chan Chen
論文名稱:隨意網路下付費機制為基底之路徑選擇演算法
論文名稱(外文):Routing Path Selection Algorithm Based On Price Mechanism In Ad-Hoc Network
指導教授:李宗南李宗南引用關係
指導教授(外文):Chung-nan Lee
學位類別:碩士
校院名稱:國立中山大學
系所名稱:資訊工程學系研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2004
畢業學年度:92
語文別:英文
論文頁數:27
中文關鍵詞:隨意網路付費機制路徑選擇
外文關鍵詞:Routing SelectionAd HocPrice Mechanism
相關次數:
  • 被引用被引用:0
  • 點閱點閱:84
  • 評分評分:
  • 下載下載:11
  • 收藏至我的研究室書目清單書目收藏:0
在隨意網路中,每一個無線設備,它傳送封包的距離是有限。所以當一個無線設備要傳送封包至遠方目地的無線設備,是需要其他作為中繼點的無線設備幫助,才能將封包傳送至目地。但是每一個無線設備所擁有的資源是有限制的。因此,中繼點沒有從中獲得任何利益的情況下,它們並不需要也不願意浪費自己本身的資源,去協助其它使用者傳送封包。在本篇論文中,我們提出將付費機制應用於隨意式無線網路路徑選擇的演算法。這方法使得每個中繼點可以藉由傳送其他使用者的封包而獲得一些利益,且可以選擇適當的路徑來傳送封包。此外,在跟其它演算法做比較,我們所提出的演算法也可以獲得較佳的中斷率與較低成本的付出。
In ad hoc network, one needs other nodes to relay data packets. But resources in each node are limited. Therefore, these nodes may not relay other’s data packet without getting any benefit. In this paper, a routing path selecting algorithm based on price mechanism is proposed. It helps nodes to get some benefits by relaying others’ data packets. Moreover, the algorithm we proposed selects a routing path with less payment and more resources. Simulation results show that the drop rate, block rate and the cost of routing paths are reduced compared to the competing algorithms.
1. Introduction 1
1.1 Routing protocols 1
1.2 Price mechanism 4
2. The purposed algorithm 5
2.1 Evaluation function 6
2.1.1 Bandwidth support 6
2.1.2 Traffic load distribution 8
2.1.3 Power consumption 14
2.2 Cost function 17
2.3 Objective function 17
3. Simulation 20
4. Conclusions 25
References 26
[1] M.S. Jian, C.C. Chen, C.N. Lee, “Ad Hoc On-Demand Resource Management Using Improved Rank-Based Fitness Assignment”, in Proc. of the 6th international symposium on WPMC, vol. 2, pp.256-258, Oct., 2003.
[2] Y. Qiu, P. Marbach, “Bandwidth allocation in ad hoc networks: a price-based approach”, in Proc. of the INFOCOM 2003, 22th Annual Joint Conf. of the IEEE Computer and Communications Societies, vol. 2, pp.797-807, April, 2003.
[3] L. Buttyan, J.P. Hubaux, “Nuglets: a virtual currency to stimulate cooperation in self-organizing mobile ad hoc networks”, Tech. Rep, DCS/2001/001, Swiss Federal Institute of Technology, Jan., 2001.
[4] X. Zhang, L. Jacob, “Adapting zone routing protocol for heterogeneous scenarios in ad hoc networks”, in Proc. of the International Conf. on Parallel Processing 2003, pp.341-348, Oct., 2003.
[5] C.E. Perkins, P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers”, in Proc. of the ACM SIGCOMM’94, vol. 24, no. 4, pp.234-244, Oct., 1994.
[6] J. Broch, D.A. Maltz, D.B. Johnson, Y.C. Hu, J. Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols”, in Proc. of the ACM/IEEE MOBICOM’98, pp.85-97, Oct., 1998.
[7] P. Johansson, T. Larsson, N. Hedman, B. Mielczarek, M. Degermark, “Scenario-based Performance Analysis of Routing Protocols for Mobile Ad-hoc Networks”, in Proc. of the ACM/IEEE MOBICOM’99, pp.195-206, Aug., 1999.
[8] D.B. Johnson, D.A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networking”, in Mobile Computing, pp.153-181,1996.
[9] C.E. Perkins, E.M. Royer, “Ad Hoc On-Demand Distance Vector Routing”, in Proc. of the IEEE WMCSA’99, pp.90-100, Feb., 1999.
[10] Z.J. Haas, M.R. Pearlman, P. Samar, “The Zone Routing Protocol (ZRP) for Ad Hoc Networks”, draft-ietf-manet-zone-zrp-04.txt, Internet-Draft, IETF, Aug., 2002.
[11] Z.J. Haas, M.R. Pearlman, P. Samar, “The Intrazone Routing Protocol (IARP) for Ad Hoc Networks”, draft-ietf-manet-zone-iarp-02.txt, Internet-Draft, IETF, July, 2002.
[12] Z.J. Haas, M.R. Pearlman, P. Samar, “The Interzone Routing Protocol (IERP) for Ad Hoc Networks”, draft-ietf-manet-zone-ierp-02.txt, Internet-Draft, IETF, July, 2002.
[13] D. Turgut, B. Turgut, S.K. Das, R. Elmasri, “Balancing loads in mobile ad hoc networks”, in Proc. of the 10th International Conf. on Telecommunications 2003, vol. 1, pp.490-495, Feb., 2003.
[14] I.S. Hwang, C.C. Yeh, C.Y. Wang, “Link stability, loading balance and power control based multi-path routing (SBPMR) algorithm in ad hoc wireless networks”, in Proc. of the 10th International Conf. on Telecommunications 2003, vol. 1, pp.406-413, Feb., 2003.
[15] N. Milanovic, M. Malek, A. Davidson, V. Milutinovic, “Routing and security in mobile ad hoc networks”, Computer, vol. 37, pp.61-65, Feb., 2004.
[16] D.B. Johnson, D.A. Maltz, Y.C. Hu, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR)”, IETF Mobile Ad Hoc Networks Working Group, Internet Draft, work in progress, Apr., 2003.
[17] C.E. Perkins, E.M. Belding-Royer, S.R. Das, “Ad Hoc On-Demand Distance Vector (AODV) Routing”, IETF Mobile Ad Hoc Networks Working Group, Internet Draft, work in progress, Feb., 2003.
[18] M.S. Jian, P.L. Wu, C.N. Lee, “On-demand flow regulated routing for ad-hoc wireless network”, in Proc. of the 5th international symposium on WPMC, vol. 2, pp.242-246, Oct., 2002.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top