Định tuyến nâng cao thông lượng mạng dựa trên nền tảng thiết kế xuyên lớp cho mạng adhoc

BË GIO DƯC V -O TO TR×ÍNG -I HÅC BCH KHOA H NËI NGUYN QUANG KHNH -ÀNH TUYN NNG CAO THặNG LìẹNG MNG DĩA TRN NN TNG THIT K XUYN LẻP CHO MNG ADHOC LUN N TIN S Kò THUT VIN THỈNG H NËI - 2019 BË GIO DƯC V -O TO TR×ÍNG -I HÅC BCH KHOA H NËI NGUYN QUANG KHNH -NH TUYN NNG CAO THặNG LìẹNG MNG DĩA TRN NN TNG THIT K XUYN LỴP CHO MNG ADHOC LUN N TIN S Kò THUT VIN THặNG Ng nh: Kò THUT VIN THặNG M số: 9520208 GIO VIN HìẻNG DN KHOA HÅC: PGS.TS NGUYN VN -ÙC H NËI - 2019 LÍI CAM -OAN Tỉi xin cam oan c¡c k¸t quÊ trẳnh b y luên Ăn "-nh tuyán nƠng cao thổng lữủng mÔng dỹa trản nãn tÊng thiát ká xuyản lợp cho mÔng adhoc" l cổng trẳnh nghiản cựu cừa tổi dữợi sỹ hữợng dăn cừa cĂn bở hữợng dăn Tổi xin cam kát rơng: CĂc kát quÊ luên Ăn ữủc thỹc hiằn thới gian nghiản cựu v thỹc hiằn luên Ăn tián s tÔi -Ôi hồc BĂch khoa H Nởi CĂc số liằu, kát quÊ trẳnh b y luªn ¡n l ho n to n trung thỹc v chữa ữủc cổng bố bĐt ký cổng trẳnh n o trữợc Ơy CĂc kát quÊ sỷ dửng tham khÊo ãu  ữủc trẵch dăn Ưy v theo óng quy ành H Nëi, ng y Gi¡o viản hữợng dăn khoa hồc PGS.TS Nguyạn Vôn -ực thĂng nôm 2019 TĂc giÊ Nguyạn Quang KhĂnh LI CM èN Luên Ăn tián s n y ữủc nghiản cựu sinh thỹc hiằn tÔi Bở mổn K thuêt thổng tin, Viằn -iằn tỷ viạn thổng, -Ôi hồc BĂch khoa H Nởi dữợi sỹ hữợng dăn khoa hồc cừa PGS.TS Nguyạn Vôn -ực Nghiản cựu sinh xin ữủc b y tọ lỏng biát ỡn sƠu sc ối vợi thƯy vã nh hữợng khoa hồc, ch dăn thỹc hiằn nhỳng nhiằm vử cƯn thiát cụng nhữ tÔo mồi iãu kiằn thuên lủi ã cổng trẳnh nghiản cựu n y ữủc ho n th nh Nghiản cựu sinh cụng xin trƠn trồng cÊm ỡn LÂnh Ôo trữớng -Ôi hồc BĂch Khoa H Nởi, Viằn - o tÔo Sau -Ôi hồc, Viằn -iằn tỷ viạn thổng, Bở mổn K thuêt thổng tin  tÔo iãu ki»n thuªn lđi º tëi ho n th nh nhi»m vử cừa mẳnh suốt quĂ trẳnh hồc têp v nghiản cựu Nghiản cựu sinh cụng xin trƠn trồng cÊm ỡn thƯy H Duyản Trung, Nguyạn Tián Hỏa, Viằn -iằn tỷ viạn thổng  hộ trủ quĂ trẳnh chnh sỷa luên Ăn Cuối cũng, tổi cụng b y lỏng biát ỡn án gia ẳnh, bÔn b  ừng hở v ëng vi»n gióp ï tỉi thíi gian l m luên Ăn H Nởi, ng y thĂng nôm 2019 TĂc gi£ Nguy¹n Quang Kh¡nh Mưc lưc MƯC LƯC DANH MÖC CC TØ VIT TT vi DANH MÖC HNH V viii DANH MÖC BNG xiii DANH MÖC CC KÞ HIU TON HÅC xiv GIỴI THIU LUN N Ch÷ìng NGHIN CÙU MNG ADHOC V THIT K XUYN LỴP 11 1.1 Tờng quan mÔng adhoc 11 1.1.1 KhĂi niằm mÔng adhoc 11 1.1.2 -c im mÔng adhoc 13 1.1.3 ng dửng cừa mÔng adhoc 14 1.1.4 -¡nh gi¡ cĂc vĐn ã hiằn tÔi cừa mÔng adhoc 15 1.2 Thi¸t k¸ phƠn lợp v xuyản lợp 16 1.2.1 Thiát ká phƠn lợp 18 Mỉ h¼nh OSI 18 Mỉ h¼nh TCP/IP 19 1.2.2 Thiát ká xuyản lợp 21 Tờng quan thiát ká xuyản lợp 21 -°c iºm thi¸t ká xuyản lợp 23 1.3 Kát luên chữỡng 23 i ii Ch÷ìng - XUT THUT TON -ÀNH TUYN KT HĐP VỴI THUT TON CP PHT KNH -ËNG DSA DÜA TRN NN TNG THIT K XUYN LỴP 25 2.1 Thuêt toĂn cĐp phĂt kảnh ëng DSA 25 2.1.1 VĐn ã nút ân, nút hiằn 25 VĐn ã nút ân 26 V§n · nót hi»n 26 Ph÷ìng ¡n khc phửc vĐn ã nút ân/nút hiằn 27 2.1.2 Thuêt toĂn cĐp phĂt kảnh ởng DSA 28 VĐn ã nhiạu çng k¶nh (CCI) 28 Cỡ chá cĐp phĂt kảnh dỹa trản tẵn hiằu bĂo bên 29 Thuêt toĂn cĐp phĂt k¶nh ëng DSA 30 2.2 -ã xuĐt thuêt toĂn nh tuyán kát hủp vợi thuêt toĂn cĐp phĂt kảnh ởng DSA dỹa trản nãn tÊng thiát ká xuyản lỵp giúa hai lỵp MAC+NET 35 2.2.1 Ma kát nối 35 2.2.2 Thuêt toĂn nh tuyán phƠn lỵp 36 2.2.3 Thuêt toĂn nh tuyán kát hủp vợi thuêt toĂn cĐp phĂt kảnh ởng DSA trản nãn tÊng thiát ká xuyản lợp giỳa hai lợp MAC+NET 37 -ành ngh¾a c¡c tham sè cõa thuªt to¡n 38 Mổ hẳnh cừa thuêt toĂn 39 Kàch b£n mæ phäng 40 2.2.4 -¡nh gi¡ k¸t qu£ 44 2.3 -ã xuĐt thuêt toĂn nh tuyán kát hủp vợi thuêt toĂn cĐp phĂt kảnh ởng DSA dỹa trản nãn tÊng thiát ká xuyản lợp giỳa hai lợp PHY+NET 48 2.3.1 Thuêt toĂn nh tuyán kát hủp vợi thuêt toĂn cĐp phĂt kảnh ởng DSA dỹa trản nãn tÊng thiát ká xuyản lợp giỳa hai lợp PHY+NET 48 -nh nghắa cĂc tham sè cõa thuªt to¡n 48 Mổ hẳnh cừa thuêt to¡n 49 Kàch b£n mæ phäng 50 2.3.2 -¡nh gi¡ k¸t qu£ 53 iii 2.4 -ã xuĐt thuêt toĂn nh tuyán kát hủp vợi thuêt toĂn cĐp phĂt kảnh ởng DSA dỹa trản nãn tÊng thiát ká xuyản lợp giỳa cĂc lợp PHY+MAC+NET 55 2.4.1 Thuêt toĂn nh tuyán kát hủp vợi thuêt toĂn cĐp phĂt kảnh ởng DSA dỹa trản nãn tÊng thiát ká xuyản lợp giỳa cĂc lợp PHY+MAC+NET 55 -nh nghắa cĂc tham số cõa thuªt to¡n 56 Mổ hẳnh cừa thuêt toĂn 56 Kàch b£n mæ phäng 59 2.4.2 -¡nh gi¡ k¸t qu£ 64 2.5 Kát luên chữỡng 70 Ch÷ìng -— XU—T THU—T TO—N -ÀNH TUY—N K—T HĐP VỴI THU—T TON TẩI ìU CặNG SUT PHT V TẩC -ậ TRUYN DÜA TRN NN TNG THIT K XUYN LỴP 72 3.1 nh hững cừa cổng suĐt phĂt, tốc truyãn án thổng lữủng mÔng 72 3.1.1 Mối quan hằ giỳa tốc truyãn v thổng lữủng mÔng 72 3.1.2 Mèi quan hằ giỳa cổng suĐt phĂt v thổng lữủng mÔng 73 Mèi quan hằ giỳa cổng suĐt phĂt, nhiạu v thổng lữủng l÷đng 73 Mèi quan h» giúa cỉng su§t ph¡t, t l» léi mÔng v thổng lữủng mÔng 73 3.1.3 Kát luên mèi quan h» giúa cỉng su§t ph¡t, tèc ë truy·n v thổng lữủng mÔng 73 3.2 -ã xuĐt thuêt toĂn tối ữu cổng suĐt phĂt v tốc truyãn tÔi lợp PHY 74 3.2.1 Phữỡng thực xĂc nh nút lƠn cên 74 3.2.2 -ã xuĐt mổ hẳnh Ănh giĂ ch số nhiạu IndexI 3.2.3 -· xu§t mỉ h¼nh ¡nh gi¡ ch¿ sè léi IndexF 3.2.4 Thuªt toĂn tối ữu cổng suĐt phĂt v tốc truyãn -ã xuĐt tẵnh ch số thổng lữủng hai nút liản kát trỹc tiáp -· xu§t thuêt toĂn tối ữu ch số thổng lữủng hai nút liản kát trỹc tiáp -ã xuĐt tẵnh ch số thổng l÷đng ÷íng truy·n 75 76 77 77 78 80 J3 Nguyen Quang Khanh, Nguyen Van Duc (2015) Research on the crosslayer protocol design base on Network coding to improve the performance of mulithop adhoc networks Journal of Science and Technology, The Uni-versity of Danang, Danang, Vietnam 5(90), pp.143-148 J4 Nguyen Quang Khanh,Nguyen Van Duc (2015) Research on the PHY, MAC, NETWORK cross-layer protocol design to improve the performance of mulithop adhoc networks Journal of Science and Technology, The Uni-versity of Danang, Danang, Vietnam 1(86), pp.118-123 126 T i li»u tham kh£o [1] Acharya, V (2008) TCP/IP and Distributed System Laxmi Publications [2] Alani, M M (2014) Guide to OSI and TCP/IP Models Springer [3] Alican.B, G and Efendi.N (2017) Public transport route planning: Modified dijkstra's algorithm In 2017 International Conference on Computer Science and Engineering (UBMK), pp 502  505 IEEE [4]Barbeau, M and E Kranakis (2007) Principles of Ad-hoc Networking John Wiley and Sons [5]Beasley, J S and P Nilkaew (2012) Networking Essentials Pearson Edu-cation [6] Bedell, P (2014) Cellular Networks: Design and Operation - A Real World Perspective Outskirts Press [7] Bernhard Korte, J V (2012) Combinatorial Optimization: Theory and Algorithms Springer Science and Business Media [8] Black, U D (1991) OSI: A Model for Computer Communications Standards Prentice-Hall [9]Blank, A G (2006) TCP/IP Foundations John Wiley and Sons [10] Bollobas, B (1979) York:Springer-Verlag Graph Theory, An Introductory Course New [11]Boukerche, A (2008) Algorithms and Protocols for Wireless and Mobile Ad Hoc Networks John Wiley and Sons [12] C Barrett, M D and A Marathe (2002) Charactering the interaction between routing and mac protocols in ad-hoc networks In MOBIHOC 2002 IEEE 127 128 [13] C Y Wong, R S C and Others (1999) Multiuser ofdm with adaptive subcarrier, bit, and power allocation In IEEE J Select Areas Commun , pp 1747  1758 IEEE [14] Chellappa, R and L Pan (2002) A case for cross layer design: The impact of physical layer properties on routing protocol performance in manets Technical report, University of Bologna [15] Chen, M (2007) Priority queues and dijkstra's algorithm Technical report, Computer Science Department, University of Texas at Austin [16]C.K.Toh (2012) Wireless Atm and Ad-Hoc Networks Protocols and Architectures Springer Science and Business Media [17] Cover, T M and J A Thomas (1991) Elements of Information Theory NewYork: Wiley [18]Dantzig, G.B, F and D.R (2018) On the max-flow min-cut theorem of networks RAND corporation [19]Dean, T (2009) Network+ Guide to Networks Cengage Learning [20] et al, V E (1999) An empirically based path loss model for wireless chan-nels in suburban environments IEEE J Select Areas Commun 17 (7), 1205  1211 [21] F A Tobagi, L K (1975) Packet switching in radio channels: Part ii - the hidden terminal problem in carrier sense multiple- access modes and the busy-tone solution IEEE Trans Commun COM-23 (12), 1417  1433 [22] F R Kschischang, B J F and H Loeliger (2001) Factor graphs and the sum-product algorithm IEEE Transactions on Information Theory 47 (2), 498  519 [23]Felice, M D (2008) Cross-Layer Optimizations in Multi-Hop Ad Hoc Networks Ph D thesis, University of Bologna [24] Forouzan, B (2009) TCP/IP Protocol Suite McGraw Hill Higher Educa-tion [25] Friis, H (1946) A note on a simple transmission formula In Proceedings of the IRE, pp 254  256 IEEE 129 [26] Garcia-Vidal, J (2007) Wireless Systems and Mobility in Next Generation Internet Springer Science and Business Media [27] G.Kulkarni and M.Srivastava (2002) Subcarrier and bit allocation strategies for ofdma based wireless ad hoc networks In IEEE GLOBECOM IEEE [28] Goldsmith, A (2005) Wireless Communications Cambridge University Press [29] H Lundgren, E N and C Tschudin (2002) Coping with communication gray zones in ieee 802.11b based ad hoc networks In WOWMOM '02 Proceed- ings of the 5th ACM international workshop on Wireless mobile multimedia , pp 49  55 ACM [30] Haas, Z J and J Deng (2002) Dual busy tone multiple access - a multiple access control scheme for ad hoc networks, IEEE Trans.Commun 50 (6), 975  985 [31]Hekmat, R (2006) Ad-hoc Networks: Fundamental Properties and Network Topologies Springer Science and Business Media [32] H.Haas, V and Others (2006) Interference aware medium access in cellular ofdma/tdd network In In proc of the IEEE International Conference on Communications IEEE [33] Hu, R Q and Y Qian (2013) Heterogeneous Cellular Networks John Wiley and Sons [34] Hura, G S and M Singhal (2001) Data and Computer Communications CRC Press [35] J Gross, I P and Others (2004) Throughput study for a dynamic ofdm-fdma system with inband signaling In VTC 2003Spring, pp 1787  1791 IEEE [36] Jang, J and K B Lee (January, 2003) Transmit power adaptation for multiuser ofdm systems IEEE J Select Areas Commun 21 (2), 171  178 [37] Jinyang Li, C B and Others (2001) Capacity of ad hoc wireless networks In MobiCom '01 Proceedings of the 7th annual international conference on Mobile computing and networking , pp 61  69 ACM 130 [38] Jonathan Loo, J L M and J H Ortiz (2016) Mobile Ad Hoc Networks: Current Status and Future Trends CRC Press [39] K Xu, M G and S Bae (2002) How effective is the ieee 802.11 rts/cts handshake in ad hoc networks In IEEE Global Telecommunications Conference, pp 72  76 ARRL [40] Karn, P (1990) Maca - a new channel access method for packet radio In ARRL/CRRL Amateur Radio 9th Computer Networking Conference , pp 134 140 ARRL [41] Kiản, N T (2008) -nh tuyán xuyản lợp mÔng khổng dƠy TÔp chẵ CNTT v TT 10 (1), 30  35 [42] Klaus Wehrle, M G and J Gross (2010) Modeling and Tools for Network Simulation Springer Science and Business Media [43] Koetter, R and M Medard (2003) An algebraic approach to network coding IEEE ACM Transactions on Networking 11 (5), 782  795 [44] Koetter, R and A Vardy (1999) Factor graphs, trellis formations, and generalized state realizations Technical report, Institute for Mathematics and Its Applications [45]Lammle, T (2017) TCP/IP John Wiley and Sons [46]Lawler, E (2012) Combinatorial Optimization: Networks and Matroids Courier Corporation [47] Li, G and H Liu (2003) Downlink dynamic resource allocation for multicell ofdma system In IEEE Vehicular Technology Conference (VTC 2003-Fall) , pp 1698  1702 IEEE [48] Li, S.-Y R and R.W.Yeung (1998) Network multicast flow via linear coding In Proc Int Symp Operations Research and its Applications , pp 197  211 IEEE [49] Li Yu, Wei Cheng, W W and F Xiong (2009) Practical network coding approach for multicast packet switching In 2009 Global Information Infras- tructure Symposium, pp  IEEE 131 [50] Little, D and john Shinder (2001) Computer Networking Essentials Cisco Press [51] M Conti, G M and G Turi (2004) Cross layering in mobile ad hoc network design Network Computer 37 (2), 48  51 [52]Matuschke, J (2014) Network flows and network design in theory and practice TU Berlin [53] Maxemchuk, N (1975) Dispersity Routing in Store-and-forward Networks [54] Mohapatra, P and S Krishnamurthy (2006) AD HOC NETWORKS: Tech-nologies and Protocols Springer Science and Business Media [55] Naseem, M and C Kumar (2013) Edsdv:efficient dsdv routing protocol for manet In 2013 IEEE International Conference on Computational Intelligence and Computing Research , pp  IEEE [56] N.Bisnik (2005) Protocol design for wireless ad hoc networks the crosslayer paradigm Technical report, ECSE Department [57] N.Chilamkurti, S.Zeadally, A and V.Sharma (2009) Cross-layer support for energy efficient routing in wireless sensor networks Journal of Sen- sors 2009 (1),  [58] Newman, M (2010) Networks: An Introduction Oxford University Press [59] Nguyạn Trung Kiản, H v C http://cdit.ptit.edu.vn/dinh-tuyen- xuyen-lop-trong-mang-mobile-wireless/ [60] Noto, M and H Sato (2000) A method for the shortest path search by extended dijkstra algorithm In Systems, Man, and Cybernetics, 2000 IEEE International Conference on , pp 2316  2320 ARRL [61] of Computer Scienceat CarnegieMellon University, T http://www.cs.cmu.edu [62] Olivier Bouchet, H S and Others (2010) Free-Space Optics: Propagation and Communication John Wiley and Sons S [63] Omiyi, P E and H Haas (2004) Improving time slot allocation in 4th gen-eration ofdm/tdma tdd radio access networks with innovative channel sensing In International Conference on Communications ICC'04 , pp 3133  3137 ICC 132 [64] P A Chou, Y W and K Jain (2003) Practical network coding In nual Allerton Conference on Communication, Control, and Computing 41st An- IEEE [65]Perkins, C E (2008) Ad Hoc Networking Addison-Wesley [66] Perkins, C E and P Bhagwat (1994) Highly dynamic destination- sequenced distance-vector routing (dsdv) for mobile computers In SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications, pp 234  244 ACM [67] Prasant Mohapatra, S K (2004) AD HOC NETWORKS: Technologies and Protocols Springer Science Business Media [68] Prehofer, C and C Bettstetter (2005) Self organization in communication networks: principles and design paradigms In IEEE Commun Mag, pp 78  85.IEEE [69] Qadri, M Y and S J Sangwine (2013) Multicore Technology: Architecture, Reconfiguration, and Modeling CRC Press [70] R Ahlswede, Ning Cai, S.-Y and R Yeung (2000) Network information flow IEEE Transactions on Information Theory 46 (4), 1204  1216 [71] R Braden, T F and M Handley (2002) From protocol stack to protocol heap role based architecture In HotNets 2002 IEEE [72] Raisinghani, V T and S Iyer (2004) Cross layer optimizations in wireless protocol stacks In Computer Communications IEEE [73]Rappaport, T S (1996) Wireless Communications: Principles and Prac- tice Prentice Hall [74] Regents of the SIGNET lab, U o P and D C L Europe http://telecom.dei.unipd.it/,http://www.docomoeurolabs.de/en/ [75] Risald, A E M and Suyoto (2017) Best routes selection using dijkstra and floyd-warshall algorithm In 2017 11th International Conference on Information and Communication Technology and System (ICTS) , pp 155  158 IEEE 133 [76] R.J Punnoose, P N and D Stancil (2000) Efficient simulation of ricean fading within a packet simulator In Vehicular Technology Conference, 2000 IEEE-VTS Fall VTC 2000 IEEE [77] Rohling, H and R.Grunheid (1997) Performance comparison of different multiple access schemes for the downlink of an ofdm communication system In 47th IEEE Vehicular Technology Conference , pp 1365  1369 IEEE [78] Russell, J and R Cohn (2012) Dijkstra's Algorithm Book on Demand [79] S Nithya, G A K and P Adhavan (2012) Destination-sequenced distance vector routing (dsdv) using clustering approach in mobile adhoc network In 2012 International Conference on Radar, Communication and Computing (ICRCC), pp 319  323 IEEE [80] S.-Y R Li, R W Y and N Cai (2003) Linear network coding IEEE Trans on Information Theory 49 (2) Sagduyu, Y E (2007) Medium access control and network coding for wireless information flows Ph D thesis, Faculty of the Graduate School of the [81] University of Maryland, College Park Said Broumi, Assia Bakal, M T and Others (2016) Applying dijkstra algorithm for solving neutrosophic shortest path problem In 2016 Interna- [82] tional Conference on Advanced Mechatronic Systems (ICAMechS) , pp 412  416 IEEE [83] Samuel Pierre, M B and E Kranakis (2003) Ad-Hoc, Mobile, and Wireless Networks Springer Science and Business Media [84] Schwartz, M (2005) Mobile Wireless Communications Cambridge Uni-versity Press [85]Seymour, P D (1975) Maroids, Hypergraphs and the Max.-flow Min.-cut Theorem University of Oxford [86]Sheikh, A U (2011) Wireless Communications: Theory and Techniques Springer Science and Business Media 134 [87] Sidharth Jaggi, Peter Sanders, P A C and Others (2005) Polynomial time algorithms for multicastnetwork code construction IEEE Transactions on Information Theory 51 (6), 1973  1981 [88] Sidharth Jaggi, Peter Sanders, P A C and Others (2010) Multiple de- scription coding and practical network coding for video multicast IEEE Signal Processing Letters 17 (3), 265  268 [89] Stallings, W (1990) Open Systems Interconnection (OSI) Model and OSI related Standards H.W Sams [90] Stefano Basagni, Marco Conti, S G and I Stojmenovic (2004) Mobile Ad Hoc Networking John Wiley and Sons [91] S.W.Kim and B Kim (2009) Ofdma based reliable multicast mac protocol for wireless adsshoc network ETRI Journal 31 (1), 114  120 [92] T Ho, R Koetter, M M and Others (2003) The benefits of coding over routing in a randomized setting In Information Theory, 2003 Proceedings IEEE International Symposium on IEEE [93] T Ho, M Medard, R K and Others (2006) A random linear network cod- ing approach to multicast IEEE Transactions on Information Theory 10 (52), 4413  4430 [94] T Melodia, M V and D Pompili (2005) The state of the art in cross layer design for wireless sensor networks In EuroNGI Workshops on Wireless and Mobility IEEE [95] T Yoo, E Setton, X Z and Others (2004) Cross layer design for video streaming over wireless ad hoc networks In MMPS 2004, pp 28  35 IEEE [96] V.-D Nguyen, H Hass, K K and Others (2009) Decentralized dynamic sub-carrier assignment for ofdma-based adhoc and cellular networks IEICE Trans E92-B (12), 3753  3764 [97] V D Nguyen, P E O and H Haas (2005) Decentralised dynamic chan-nel assignment for cellular ofdm/tdd networks In Proc 10th International OFDM-Workshop, pp 255  259 ARRL 135 [98] Van Duc Nguyen, H T N and T Pham (2009) Decentralized dynamic subchannel assignment for ofdma-based adhoc networks opperating in tdd mode In The 3rd International Conference on Ubiquitous Information Management and Communication (ICUIMC '09) , pp 511  516 IEEE [99] Van Duc NGUYEN, Harald HAAS, K K and Others (December, 2009) Decentralized dynamic sub-carrier assignment for ofdma-based adhoc and cel-lular networks IEICE TRANS COMMUN B92-B (12),  12 [100] V.Srivastava and M.Motani (2005) Cross layer design a survey and the road ahead IEEE Communication Magazine 43 (12), 1112  1119 [101] V.Venkataraman and J J Shynk (2004) Adaptive algorithms for ofdma wireless ad hoc networks with multiple antennas In Conference Record of the Thirty Eighth Asilomar Conference on Signals, Systems and Computers IEEE [102] Wee Yew Lee, Shaharuddin Salleh, B S and S Olariu (2000) Dynamic Source Routing (DSR) Protocol with Euclidean Effect in Mobile Ad Hoc Net- works Universiti Teknologi Malaysia Wei Song, W Z (2012) Interworking of Wireless LANs and Cellular Networks Springer Science and Business Media [103] [104] Wetteroth, D (2001) OSI Reference Model for Telecommunications Mc- Graw Hill Professional [105]Wisniewski, S (2005) Wireless and Cellular Networks Pearson/Prentice Hall [106] Yaghoobi, H (2004) Scalable ofdma physical layer in ieee 802.16 wireless man Intel Technology J (3), 201  212 [107]Yeung, R W (2008) Information Theory and Network Coding Springer Science and Business Media [108]Yu, J and X Zhang (2014) A cross-layer wireless sensor network energy-efficient communication protocol for real-time monitoring of the long-distance electric transmission lines Journal of Sensors 2014 (1),  13 136 [109] Z J Haas, L D (2002) Dual busy tone multiple access (dbtma)-a multiple access control scheme for ad hoc networks IEEE Transactions on Communi- cations 50 (6), 72  76 ... v ngo i nữợc Trong mÔng adhoc, nƠng cao thổng lữủng l mởt cĂc vĐn ã hộ trủ nƠng cao chĐt lữủng mÔng Mởt cĂc giÊi phĂp õng vai trỏ quan trồng nƠng cao thổng lữủng mÔng adhoc l viằc giÊi quyát... gi£i ph¡p hộ trủ nƠng cao thổng lữủng mÔng khổng dƠy nõi chung v mÔng adhoc nõi riảng TÔi Viằt Nam, mc dũ sỹ phĂt trin mÔng khổng dƠy cụng nhữ mÔng adhoc l rĐt lợn v vĐn ã nƠng cao thổng lữủng mÔng... xuyản lợp CĂc kát quÊ õng gõp lắnh vỹc nƠng cao thổng lữủng mÔng adhoc Kát luên, theo cĂc Ănh giĂ hữợng nghiản cựu trản, hộ trủ nƠng cao thổng lữủng mÔng adhoc, nghiản cựu sinh cõ th nghiản cựu