Publications-Theses

題名 隨意網路中以價格機制為基礎之效率路徑選擇演算法
Efficient Routing Path Selection Algorithm based on Pricing Mechanism in Ad Hoc Networks
作者 林建圻
貢獻者 蔡子傑
Tsai,Tzu-Chieh
林建圻
關鍵詞 隨意網路
定價
路由
日期 2006
上傳時間 17-Sep-2009 13:58:01 (UTC+8)
摘要 隨著行動通訊技術日漸進步,隨意網路具備不需要事先建設基礎設施、使用者可以自由移動等特性,未來將很有發展潛力。隨意網路亦具有多跳接的特性,通常都必須由別人幫忙轉送封包到達目的地端。想要使隨意網路能夠普及化,必須提供一個良好的動機,讓隨意網路中的使用者彼此互相合作,願意互相幫忙轉送封包。我們根據參考的論文所提出來的虛擬貨幣交易網路,分析網路資源數量與價錢的關係,提出了一個合理的定價機制。同時也結合隨意網路移動的特性,讓使用者選擇效率較高的路由來傳遞封包。最後我們提出了一個簡單的路由協議,結合了價格機制,而能應用於隨意網路中。實驗結果顯示我們的路由協議能夠提昇整體的網路效能。使用此價格機制結合我們提出的路由協議對使用者而言也是最具經濟效益的。
In military and rescue applications of mobile ad hoc networks, all the nodes belong to the same authority. Therefore, they are motivated to cooperate in order to support the basic functions of the network. However, the nodes are not willing to forward packets for the benefits of other nodes in civilian applications on mobile ad hoc networks. In view of this, we adopt the “pay for service” model of cooperation, and propose a pricing mechanism combined with routing protocol. The scheme considers users’ benefits and interference effect in wireless networks, and can distribute traffic load more evenly to improve network performance. The simulation results show that our algorithm outperforms other routing protocols. Using our pricing mechanism and routing protocol at the same time can achieve more economical efficiency.
參考文獻 [1] Z. J. Haas et al., “Guest Editorial”, IEEE Journal on Selected Areas in Communications, Special Issue on Wireless Networks, Vol. 17, No. 8, pp. 1329-1332, August 1999.
[2] Satyabrata Chakrabarti and Amitabh Mishra, “QoS Issues in Ad Hoc Wireless Networks”, IEEE Communications Magazine, Vol. 39, No. 2, pp. 142-148, February 2001.
[3] Buttyan, L. and Hubaux, J.P., “Enforcing Service Availability in Mobile Ad-Hoc WANs”, IEEE/ACM Workshop on Mobile Ad Hoc Networking and Computing, August 2000
[4] M. Conti, E. Gregori, and G. Maselli, "Cooperation Issues in Mobile Ad Hoc Networks", IEEE ICDCS Workshops, Tokyo, Japan, March 2004.
[5] Buttyan, L. and Hubaux, J.P., “Stimulating Cooperation in Self-organizing Mobile Ad Hoc Networks” ACM/Kluwer Mobile Networks and Applications, vol. 8, no. 5, pp.579-592, October 2003.
[6] A. Pfitzmann, B. Pfitzmann and M. Waidner, “Trusting mobile user devices and security modules”, IEEE Computer, February 1997
[7] Zhong, S., Yang, R., Chen, J., “Sprite : A Simple, Cheat- Proof, Credit-Based System for Mobile Ad-hoc Networks”, IEEE INFOCOM 2003, San Francisco, March, 2003.
[8] Crowcroft, J., Gibbens, R., Kelly, F., and Ostring, S., " Modelling incentives for collaboration in Mobile Ad Hoc Networks", Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), March 2003.
[9] S. Marti, T. Giuli, K. Lai, and M. Baker, “Mitigating Routing Misbehavior in Mobile Ad Hoc Networks”, in Proceedings of the Sixth annual ACM/IEEE International Conference on Mobile Computing and Networking, pp.255–265, 2000.
[10] Charles E. Perkins and Pravin Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile computers”, in Proceedings of the SIGCOMM ’94 Conference on Communications Architectures, Protocols and Applications, pp. 234-244, August 1994. A revised version of the paper is available from http://www.cs.umd.edu/projects/mcml/papers/Sigcomm94.ps.
[11] Padmini Misra, “Routing Protocols for Ad Hoc Mobile Wireless Networks”, http://www.cse.ohio-state.edu/~jain/cis788-99/adhoc_routing/index.html, 1999.
[12] Josh Broch, David A. Maltz, David B. Johnson, Yih-Chun Hu and Jorjeta Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols”, in Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom ’98), Dallas, Texas, USA. October 25 – 30, 1998.
[13] Charles E. Perkins, Elizabeth M. Royer and Samir R. Das, “Ad Hoc On-Demand Distance Vector (AODV) Routing”, IETF RFC3561, http://www.ietf.org/rfc/rfc3561.txt, July 2003.
[14] David B. Johnson, Davis A. Maltz and Yih-Chun Hu, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR)”, IETF Internet-Draft, http://www.ietf.org/internet-drafts/draft-ietf-manet-dsr-10.txt, July 2004.
[15] 周大慶、沈大白、張大成、敬永康、柯瓊鳳, “風險管理新標竿-風險值理論與應用”, 台北:智勝文化事業有限公司
[16] http://www.isi.edu/nsnam/ns/
描述 碩士
國立政治大學
資訊科學學系
93753016
95
資料來源 http://thesis.lib.nccu.edu.tw/record/#G0093753016
資料類型 thesis
dc.contributor.advisor 蔡子傑zh_TW
dc.contributor.advisor Tsai,Tzu-Chiehen_US
dc.contributor.author (Authors) 林建圻zh_TW
dc.creator (作者) 林建圻zh_TW
dc.date (日期) 2006en_US
dc.date.accessioned 17-Sep-2009 13:58:01 (UTC+8)-
dc.date.available 17-Sep-2009 13:58:01 (UTC+8)-
dc.date.issued (上傳時間) 17-Sep-2009 13:58:01 (UTC+8)-
dc.identifier (Other Identifiers) G0093753016en_US
dc.identifier.uri (URI) https://nccur.lib.nccu.edu.tw/handle/140.119/32656-
dc.description (描述) 碩士zh_TW
dc.description (描述) 國立政治大學zh_TW
dc.description (描述) 資訊科學學系zh_TW
dc.description (描述) 93753016zh_TW
dc.description (描述) 95zh_TW
dc.description.abstract (摘要) 隨著行動通訊技術日漸進步,隨意網路具備不需要事先建設基礎設施、使用者可以自由移動等特性,未來將很有發展潛力。隨意網路亦具有多跳接的特性,通常都必須由別人幫忙轉送封包到達目的地端。想要使隨意網路能夠普及化,必須提供一個良好的動機,讓隨意網路中的使用者彼此互相合作,願意互相幫忙轉送封包。我們根據參考的論文所提出來的虛擬貨幣交易網路,分析網路資源數量與價錢的關係,提出了一個合理的定價機制。同時也結合隨意網路移動的特性,讓使用者選擇效率較高的路由來傳遞封包。最後我們提出了一個簡單的路由協議,結合了價格機制,而能應用於隨意網路中。實驗結果顯示我們的路由協議能夠提昇整體的網路效能。使用此價格機制結合我們提出的路由協議對使用者而言也是最具經濟效益的。zh_TW
dc.description.abstract (摘要) In military and rescue applications of mobile ad hoc networks, all the nodes belong to the same authority. Therefore, they are motivated to cooperate in order to support the basic functions of the network. However, the nodes are not willing to forward packets for the benefits of other nodes in civilian applications on mobile ad hoc networks. In view of this, we adopt the “pay for service” model of cooperation, and propose a pricing mechanism combined with routing protocol. The scheme considers users’ benefits and interference effect in wireless networks, and can distribute traffic load more evenly to improve network performance. The simulation results show that our algorithm outperforms other routing protocols. Using our pricing mechanism and routing protocol at the same time can achieve more economical efficiency.en_US
dc.description.tableofcontents CHAPTER 1 Introduction 1
1.1. Background 2
1.1.1. Mobile Ad Hoc Networks 2
1.1.2. Currency Exchange Network 4
1.2. Motivation 5
1.3. Organization 6
CHAPTER 2 Related Work 7
2.1. Pricing Based Scheme 7
2.2. Reputation Based Scheme 10
2.3. Routing 10
2.1.1 Table Driven Routing Protocol: DSDV [10] 10
2.1.2 Ad Hoc On-Demand Routing Protocol: AODV [13] 12
2.1.3 Dynamic Source Routing Protocol [14] 13
CHAPTER 3 PRICING MECHANISM 17
3.1. Bandwidth Price 17
3.2. Interference Price 20
3.3. Congestion Price 21
3.4. Price Function 22
CHAPTER 4 User Mobility 24
CHAPTER 5 Efficient Routing Path 27
CHAPTER 6 Ad Hoc On Demand Pricing Routing Protocol 32
CHAPTER 7 Simulation Model and Results Analysis 36
7.1. Performance Metrics 36
7.2. Scenarios and Results 37
7.2.1. 5x5 grid topology – no background traffic, no mobility 37
7.2.2. 4x4 grid topology – has background traffic, no mobility 42
7.2.3. Random topology 46
CHAPTER 8 Conclusion and Future Work 51
zh_TW
dc.format.extent 46866 bytes-
dc.format.extent 11815 bytes-
dc.format.extent 66236 bytes-
dc.format.extent 18027 bytes-
dc.format.extent 46104 bytes-
dc.format.extent 133502 bytes-
dc.format.extent 241918 bytes-
dc.format.extent 157191 bytes-
dc.format.extent 92916 bytes-
dc.format.extent 119862 bytes-
dc.format.extent 89948 bytes-
dc.format.extent 13216 bytes-
dc.format.extent 45497 bytes-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.language.iso en_US-
dc.source.uri (資料來源) http://thesis.lib.nccu.edu.tw/record/#G0093753016en_US
dc.subject (關鍵詞) 隨意網路zh_TW
dc.subject (關鍵詞) 定價zh_TW
dc.subject (關鍵詞) 路由zh_TW
dc.title (題名) 隨意網路中以價格機制為基礎之效率路徑選擇演算法zh_TW
dc.title (題名) Efficient Routing Path Selection Algorithm based on Pricing Mechanism in Ad Hoc Networksen_US
dc.type (資料類型) thesisen
dc.relation.reference (參考文獻) [1] Z. J. Haas et al., “Guest Editorial”, IEEE Journal on Selected Areas in Communications, Special Issue on Wireless Networks, Vol. 17, No. 8, pp. 1329-1332, August 1999.zh_TW
dc.relation.reference (參考文獻) [2] Satyabrata Chakrabarti and Amitabh Mishra, “QoS Issues in Ad Hoc Wireless Networks”, IEEE Communications Magazine, Vol. 39, No. 2, pp. 142-148, February 2001.zh_TW
dc.relation.reference (參考文獻) [3] Buttyan, L. and Hubaux, J.P., “Enforcing Service Availability in Mobile Ad-Hoc WANs”, IEEE/ACM Workshop on Mobile Ad Hoc Networking and Computing, August 2000zh_TW
dc.relation.reference (參考文獻) [4] M. Conti, E. Gregori, and G. Maselli, "Cooperation Issues in Mobile Ad Hoc Networks", IEEE ICDCS Workshops, Tokyo, Japan, March 2004.zh_TW
dc.relation.reference (參考文獻) [5] Buttyan, L. and Hubaux, J.P., “Stimulating Cooperation in Self-organizing Mobile Ad Hoc Networks” ACM/Kluwer Mobile Networks and Applications, vol. 8, no. 5, pp.579-592, October 2003.zh_TW
dc.relation.reference (參考文獻) [6] A. Pfitzmann, B. Pfitzmann and M. Waidner, “Trusting mobile user devices and security modules”, IEEE Computer, February 1997zh_TW
dc.relation.reference (參考文獻) [7] Zhong, S., Yang, R., Chen, J., “Sprite : A Simple, Cheat- Proof, Credit-Based System for Mobile Ad-hoc Networks”, IEEE INFOCOM 2003, San Francisco, March, 2003.zh_TW
dc.relation.reference (參考文獻) [8] Crowcroft, J., Gibbens, R., Kelly, F., and Ostring, S., " Modelling incentives for collaboration in Mobile Ad Hoc Networks", Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), March 2003.zh_TW
dc.relation.reference (參考文獻) [9] S. Marti, T. Giuli, K. Lai, and M. Baker, “Mitigating Routing Misbehavior in Mobile Ad Hoc Networks”, in Proceedings of the Sixth annual ACM/IEEE International Conference on Mobile Computing and Networking, pp.255–265, 2000.zh_TW
dc.relation.reference (參考文獻) [10] Charles E. Perkins and Pravin Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile computers”, in Proceedings of the SIGCOMM ’94 Conference on Communications Architectures, Protocols and Applications, pp. 234-244, August 1994. A revised version of the paper is available from http://www.cs.umd.edu/projects/mcml/papers/Sigcomm94.ps.zh_TW
dc.relation.reference (參考文獻) [11] Padmini Misra, “Routing Protocols for Ad Hoc Mobile Wireless Networks”, http://www.cse.ohio-state.edu/~jain/cis788-99/adhoc_routing/index.html, 1999.zh_TW
dc.relation.reference (參考文獻) [12] Josh Broch, David A. Maltz, David B. Johnson, Yih-Chun Hu and Jorjeta Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols”, in Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom ’98), Dallas, Texas, USA. October 25 – 30, 1998.zh_TW
dc.relation.reference (參考文獻) [13] Charles E. Perkins, Elizabeth M. Royer and Samir R. Das, “Ad Hoc On-Demand Distance Vector (AODV) Routing”, IETF RFC3561, http://www.ietf.org/rfc/rfc3561.txt, July 2003.zh_TW
dc.relation.reference (參考文獻) [14] David B. Johnson, Davis A. Maltz and Yih-Chun Hu, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR)”, IETF Internet-Draft, http://www.ietf.org/internet-drafts/draft-ietf-manet-dsr-10.txt, July 2004.zh_TW
dc.relation.reference (參考文獻) [15] 周大慶、沈大白、張大成、敬永康、柯瓊鳳, “風險管理新標竿-風險值理論與應用”, 台北:智勝文化事業有限公司zh_TW
dc.relation.reference (參考文獻) [16] http://www.isi.edu/nsnam/ns/zh_TW