KHOA HOC CONG NGHE
S6 05/2020
Mot phuong phap dinh tuyen 6\a ly cho mang VANET trong he thong giao thong thong minh
• TS. VO T R U Q N G S O N - Trudng Dgi hgc Giao thong van tai
TOM TAT: Bai bao gidi thieu mgt phuang phap dinh tuyen dia ly chong tSc nghen moi trong m?ng VANET Phuong phap nay sd dgng thong tin ve huang di chuyen cua cac phuong tien nham lam tang hieu qua cua thu?f toan dmh tuyen Ket qua nghien cdu cd the ap dung cho cac bai toan truyen thdng gius cac phuong tien trong he thong giao thong thong mmh.
TL/ KHOA: Dinh tuyen d|a ly chong tac nghen, thong tin ve hudng di chuyen, mang VANET ABSTRACT: This paper mtroduces a new congestion-aware geographical routing method in Vehicular Ad hoc Networks (VANETs), The method uses information about the vehicle direction to increase the efficiency of the routing algorithm The research results can be applied to communication problems between vehicles m the Intelligent Transport Systems (ITS)
KEYWORDS: Congestion-aware geographical routing, information about the vehicle direction, VANET.
I.DATVANO^
Trong he thdng giao thdng thdng mmh (ITS), mang tijy bien gida eac phuong tien (VANET) ddng vai trd quan trgng trong viec truyen dd lieu gida eae xe (V2V) hoae gida xe vdi tram ben dUdng (V2l).Thuat toan dinh tuyen la mdt yeu td quan trong trong hoat ddng ciia mang VANET. Cd the chia cac thuat toan thanh hai nhdm la dinh tuyen theo do hinh mang (topo) va dinh tuyen theo vi trf dialy [1,2]. Da sd cac giao thdc dinh tuyen dang duoc ap dyng cho VANET deu dua tren yeu td dia ly [1].Tren the gidi da cd nhieu nghien edu ve loai gia thde dinh tuyen nay. Tuy nhien, mdi giao thdc dmh tuyen dia ly tren deu ed nhdng han che nhat dinh. Giao thde dinh tuyen GPSR [3] sd dung thdng tin ve vi tri cua cae bd djnh tuyen va dich den cua gdi tin de dua ra quyet dinh chuyen tiep va GPSR khdng phii hgp vdi dieu kien mat do giao thdng khdng ddng deu.Trong [4], cae tac gia da gidi thieu each thde dinh tuyen theo vi tri cd the dugc thue hien trong mdi trudng do th; ma khdng can gia dinh rang cac nut cd quyen truy cap vao mdt ban do toan eau tTnh. Tuy nhien, y tudng nut giao nhau trong nghien cdu nay la
mdt van de va khd de duy tri. Do dd, thuat toan nay chi phu hop vdi mdi trudng do thi. A-STAR trong [5] sddung thdng tin t d eac tuyen xe buyt trong cac do thi de xac dinh hudng ehuyen tiep eae gdi tin. Tuy nhien, co che nay cd the chgn dUOc tuyen khdng tdt nhat, dan den do tre cao. Giao thdc PDGR [6] thuc hien chuyen tiep cae gdi dd lieu dua tren dae tfnh di ehuyen hien tai va trong tuong lai cua phuong tien. PDGR da khdng xem xet ddn dae tinh t u nhien khdng tin cay eua kenh vd tuyen cung nhu viec ngat ket noi mpt nut mang gdi tin vdi cac nut lan can. Trong [7], cac tae gia da de xuat mdt giao thdc truyen dd lieu V2I de ehuyen tiep cae gdi tin mdt each hieu qua vdi dd tre thap. Giao thde nay tinh toan tren eae kenh vd tuyen gida cac phuong tien trong dieu kien ly tudng va dieu nay la khdng phu hgp vdi thUe te.
Diem ehung cua tat ca cac giao thdc djnh tuyen ndi tren la deu xem xet cac kenh vd tuyen trong dieu kien ly tudng ma khdng luu y den eac hien tUOng ehe khuat va cae loai fading khac nhau, Mdt giao thdc djnh tuyen dja ly nang cao cd ten la PGR dugc de xuat tai [8]. Giao thdc nay giup tang cudng ehien luoe ehuyen tiep cac gdi dd lieu thdng qua cac phUOng phap dU doan, lam giam sd nut trung gian ehuyen tiep cac gdi tin trong khi van duy tri dugc ty le chuyen gdi tin tdi dieh tuong ddi eao.Trong nhieu trUdng hop, viee dinh tuyen tai giao Id eua thuat toan nay khdng chpn dugc tuyen tdi Uu. Trong [9], eac tac gia da de xuat mdt giao thdc dinh tuyen AMGRP dUa tren viee xem xet, phan tieh nhieu tieu chi dinh tuyen nhusd lieu di ddng, tudi thp lien ket, mat dp nut va trang thai nut nhU la nhdng yeu td quan trgng de tinh toan djnh tuyen Tuy nhien, thuat toan nay chi ap dung ed hieu qua eho mdi trudng dd thi. Mdt thuat toan hUdng di ehuyen eho gtao thde GPSR da dUOe de xua't tai [10].
Thuat toan nay xem xet mdt each toan dien thdng tin vector van tdc va thdi gian het ban cua Hen ket de tinh toan hudng di chuyen.
Thuat toan nay ehi phu hgp vdi cac loai dich vu dugc dap dng theo kieu tuy theo kha nang (best effort) va vdi dieu kien mat do thap. Khac vdi cae nghien cdu neu tren, [1] da de xuat giao thde dinh tuyen SRR, trong do ket hgp logic md vdi dmh tuyen dia ly ddng thdi sd dung hudng va khoang each de xae dmh nut ke tiep thich hop nhat SRR eung sd dyng mdt co ehe tUu trd tam cae gdi dd lieu mdt khi mang hi mat ket ndi. Nghien edu nay khdng quan tam tdi hudng di chuyen tuong ddi gida nut hien tai va nut lan can. Dieu nay dan den quyet dinh lua ehgn nut trung gian thieu ehinh xac, tham ehi
96
CO the gay mat gdi tin khi nut trung gian di chuyen ra khdi vung phu sdng cua nut hien tai. Trong [2], cac tac gia eung de xuat giao thdc dinh tuyen dja ly CAGR dUa vao logic md tuong t u nhu [1], ddng thdi dUa them co che chong tac nghen cho cac nut trung gian vao he md. Tuong t y nhu SRR, CAGR cung khdng quan tam tdi hudng di chuyen tUong ddi gida ngudn va nut lan can.
d trong nudc, da cd mdt sd nghien cdu ve eac giao thdc djnh tuyen trong mang VANET. Cac nghien cdu nay chi tap trung vao viee danh gia, so sanh cac giao thdc da c d t d ket qua cua cac cdng trinh nghien cdu nUde ngoai ma khdng cd de xu^t giao thdc dinh tuyen dia ly mdi.
Cac de xuat giao thdc mdi deu tap trung vao cae giao thdc dUa tren do hinh mang. Trong [13], tac gia da de xuat mgt giao thdc djnh tuyen mdi cd ten la giao thUe dinh tuyen dua tren hUdng di ehuyen cua phuong tien (VHRP). VHRP lai la loai giao thdc dUa vao dd hinh mang.
Trong luan an tien sy [14], tae gia da nghien cdu de cai tien hieu nang giao thde djnh tuyen AODV va AOMDV trong mang MANET. AODV va AOMDV cung la hai giao thdcdua tren do hinh mang va cac nghien cdu nay cung ehi ap dung eho mang MANET ma khdng ap dung dugc cho VANET mdt each cd hieu qua.
Bai bao gidi thieu mot phuong phap djnh tuyen dia ly chdng tSe nghen mdi, dupe ggi la FDGR. FDGR sd dyng thdng tin ve hudng di chuyen cua cac phuong tien nham lam tang hieu qua cua thuat toan dmh tuyen.
Phan cdn lai cCia bai bao gdm ed eae phan sau: phan 2 gidi thieu thuat toan dinh tuyen FDGR, phan 3 md ta each thdc lya chon nut ke tiep, bao gdm ca he md dugc sd dung de tinh toan chi phi md nhSm quyet dinh hudng chuyen tiep gdi tin, ket qua md phdng dugc eho d phan 4 va cudi eung, phan 5 la ket luan.
2.THUATT0ANf)!NHTUYEN FDGR Mdt he thdng giao thdng thdng mmh hoan chinh bao gdm cac ket ndi truyen thdng: V2V (Vehicle-to- Vehiele),V2l(Vehicle-to-lnfrastructure)vaV2B(Vehicle- to-Business) (Hinh 2.1) [20]. VANET (Vehicular Ad-hoe Networks) la mdt loai mang LAN khdng day tuy bien dae biet ma trong do cac xe khi tham gia giao thdng dugc trang bj mdt thiet bi de thu/phat tin hieu vd tuyen de ket ndi V2V hoae V2I. Dae diem cua VANET la cac nut cd tfnh di dgng cao, nhieu loai toe do, cae dng dung ed tfnh chat thdi gian thUe va eac nut cd xu hudng di chuyen theo mgt hinh thdc cd td chdc nhu cac tuyen dudng.
X /^«^
^ ; - ^
Mpt giao thdc djnh tuyen quyet dmh each de hai nut mang trao doi thdng tin vdi nhau, nd bao gdm cac thu tyc thiet lap mdt tuyen dUdng, quyet djnh chuyen tiep va hanh ddng de duy tri tuyen dudng hoac khdi phuc t d su cd dinh tuyen. Djnh tuyen dia ly sd dyng thdng tin vj trf eac nut lan can thyc te de xac dinh tuyen chuyen tiep. Trong dinh tuyen dja ly, quyet dmh ehuyen tiep eua nut hien tai chu yeu dugc thUe hien dUa tren vi tri cua ndt dich cua gdi tin va vi trf eua eac nut lan can vdi nut hien tai. Phuong phap CAGR [2] la mdi quan tam dae biet cua nghien cdu nay vi giao thdc dugc de xuat cung sd dyng he md, thdng tin ve khoang each, thdng tin ve mdc dd chiem dung bd nhd dem de dua ra cac quyet dmh lua chon nut lan can lam nut ke tiep. Khac vdi CAGR [2], trong nghien cdu nay, mdttham sothdba duocdua vao he suy dien md de dua ra quyet djnh niit ke tiep.
Tham sd nay la hUdng ehuyen ddng tuong ddi gida nut hien tai va nut lan can. Ngoai ra, trong CAGR, khi vector khoing cached gia tri am, tdc la nut lan can khdng nam tren hudng t d nut hien tai tdi nut dich thl thuat toan vSn xem xet va tinh toan de quyet djnh cd chgn lam tram ke tiep hay khdng. Dieu nay dan den mat thdi gian tfnh toan va cd the chgn dugc nut ke tiep niim xa nut dieh hon so vdi nut hien tai, lam cho viec dinh tuyen bi lap lap lai gida hai nut va cudi cdng la gdi tin khdng den dieh duoc do het thdi gian TTL PhUOng phap FDGR duoe de xuat se khong xem xet den cae nut cd khoang each den nut dich Idn hon so vdi khoang each gida nut hien tai vdi nut dich. Cae bUdc thUe hien cua thuat toan FDGR duoe bieu dien tren Hinh 2.2. trong dd ddng gdp cua nghien cUu nay dugc the hien ben trong khdi hinh ddt net.
Hau het cac giao thde dmh tuyen sd dyng cac ban tin Hello nhu mdt each de mdt nut quang ba thdng tin den cac ndt khac trong pham vi cda nd [2]. Trong SRR [1], mdt phuong tien ed the cd duoe thdng tin vj tn va hudng di chuyen eda cae phuong tien khac d gan nd thdng qua eac gdi Hello dugc cac nut lan c^n phat mdt each dmh ky. Cac gdi nay ehda thdng tin dinh vi GPS va hudng di chuyen cua cac nut dd. Cae gdi Hello dugc eae phuong tien khac trong pham vi phu sdng cua nut phat thu duge [2]. Vdi ban tin Hello eua CAGR, ben canh thdng tin GPS, mdt niit cung se quang ba mUc do chiem dung bd nhd dem eiia nd. Dung lugng bd dem cd the dugc bieu dien bang ty le phan tram sd byte s3n diing trong bd nhd dem cua mdt nut so vdi tdng dung lugng cua bddem nhutrong [2,16]. (:;B£^
Hmh 2.1: Cic kit nii V2V, V2I va V2B trong ITS [20] Hinh 2.2: So do khoi eic bude xdly cua giao thuc FDCR
97
KHOA HOC CONG NGHE
So 05/2020
Vdi FDGR, khi mdt nut nao dd mang gdi tin (sau day ggi la nut hien tai), nd se tim kiem trong vung phu sdng cua nd eae nut lan can. Neu mat do luu thdng thap dan den khdng tim duge bat ky nut lan can nao, nd se xep hang gdi tin vao trong bd nhd dem va chd den khi cd ket noi vdi mgt nut lan can phu hgp se ehuyen tiep di.
Trong trUdng hop bg nhd dem khdng cdn chd trdng, gdi tin se bj huy va ket thuc qua trinh. Neu mat do luu thdng eao dan den cdthetimdUOeit nhat mdt nut lan can, nut hien tai se kiem tra xem lieu trong danh sach eac niit lan can cd nut dfch eua gdi tin hay khdng. Neu cd, nd chuyen tiep gdi tin den nut dich va ket thuc qua trinh.
Neu khdng tim thay nut dfeh, nut hien tai se tien hanh tim nut ke tiep phu hop nhat trong sd cac niit lan can de chuyen tiep gdi tin. Nut ke tiep phu hop nhat phai thda man hai dieu kien (1) cd khoang each tdi niit dich nhd hon khoang each t d nut hien tai tdi nut dich va (2} cd chi phf md Idn nhat trong sd cac nut lan can. Neu khdng tim dupe nut ke tiep, nut hien tai se xep hang gdi tin vao trong bd nhd dem va chd den khi cd ket ndi vdi mgt nut lan can phu hgp se chuyen tiep di. Trong trUdng hgp bd nhd dem khdng edn cho trdng, gdi tin se bi huy va ket thuc qua trinh. Neu tim duoc nut ke tiep, niit hien tai se ehuyen tiep gdi tin den nut ke tiep va tiep tue qua trinh.
Mdt luu y la khi mdt nut trung gian vda nhan duge gdi tin nd se kiem tra gia tn TTL cua gdi, neu gia tri nay vugt gia tri TTL cho trUde, gdi tin se bi huy va qua trinh ket thiie. Qua trinh nay se tiep tuc cho den khi ehuyen tiep gdi tdi dfch.
Trong viec lUa ehgn ndt ke tiep, FDGR sd dung ba sd lieu dau vao bao gdm: (1) vector khoang each cua niit hien tai vdi mdt niit lan can, ed tham chieu den vector ndi nut hien tai va nut dfch (2) ty le cdn trong cua bd nhd dem tai nut lan can va (3) dd bien thien khoang each gida nut hien tai vdi nut lan can cua thdi diem t^ vdi thdi diem t^ ^. Cd the thay, sd lieu dau vao thd ba cd lien quan den hudng di ehuyen tUOng ddi gida nut hien tai va nut lan can. Khi hai nut di ehuyen gan nhau hon, gia tri nay am, ngUgc lai la gia tr; duong.
3. Ll/A CHON NUT K^TI^P OE CHUYDN TI^P G O I TIN Nhuda de cap dtren, trong FDGR, nut ke tiep phii hop nhat dugc lya chgn phai thda man hai dieu kien:(1}
cd khoang each tdi ndt dfch nhd hOn khoang each t d nut hien tai tdi ndt dfeh va (2) cd chi phi md Idn nhat trong so cac nut lan can. Vdi dieu kien thd nhat, Hinh 3.1 bieu dien hai tinh hudng vevj trf eua niit lan can (niit N) so vdi vj trf cua nut hien tai (nut C) va nut dich (niit D). Trong tinh hudng a), gdc gida hai vector cwvacbldn han 90°, tdc la dd dai ND Idn hon dd dai CD nen khdng lUa ehgn N lam nut ke tiep eho dii chi cd mpt minh nut N trong tap lan can. NgUpc lai, trong trudng hop b), gdc nay nhd hon 90°, tdc la do dai ND nhd hon dp dai CD nen cd the lya chpn N lam nut ke tiep. Dieu kien t h d hai dugc thuc hien bang each tfnh gia trj chi phi md cho tat ca cac ndt lan can thda man dieu kien t h d nhat, sau dd lya chgn nut ed gia tri md cao nhat.
Hinh 3.1: Hai tinh hudng ve vi trf cda nut lan cin Hinh 3.2 bieu dien so do khdi cua he md ddng de tinh toan ehi phf md trong giao thdc FDGR. He nay dugc dat tai cac nut, hoat ddng tai nut hien tai C v^o thdi d i l m t^. Bien dau vao eiia he md la he so vector khoang each Fy^itJ [2], mdc do chiem dung bg nhd dem |3{tJ [2] va mdc do thay doi khoang each gida hai nut C va N gida hai thdi diem t^ va t^,, Ad,^(tJ. Bien dau ra cua he md 1^
chi phf md cho viec chuyen tiep gdi tin t d nut C den nut N, Cp(tJ. Gia tri Cp(tJ cang Idn thl chi phi cang tdt, C Cp(tJ cang be thl chi phf eang kem.
su^ dien tail
I
Co so luiil mij
Hinh 3.2: He suy dien md eda giao thdc djnh tuyen FOGR Trong he md nay, bd md hda chuyen doi gia trj tinh duge tai mdi dau vao F^JtJ, (3(tJ va Ad(.^{t^) thanh cac gia trj ngdn ngd tuong dng cda cac tap md. Ham thudc dugc lua chgn cho bien dau v^o F^|^(t^) ed dang tam giae vdi eac gia trj ngdn ngd cua cae bien dau vao cd dang: W^^ K^'> "^ igonfG;, khodng gida(KG). xa(X), chinh xdc(CX)} [2]. Cd the xem chi tiet v l hai bien ngdn ngd dau vao F^jj(t^) va 3(tJ tai [2]. GiS sdtai thdi diem t^, nut hien tai C ed tga do la (x^{tj, yj{t„)) va nut lan can N cd tpa dp la (x^(t^}, y^,(t„)). Khoang each gida hai nut C va N la tai cae thdi diem t^ va t^, dUOc cho bdi eac bieu thde (l)va(2):
dcA'.-,) - ^|{-A-^-^..i'.-J^iyA.)-y.{'.-,)f
(2)Mdc do thay doi khoang each gida hai nut gida hai thdi diem t v a t^, la:
^c.,iO = dc.,(f.)-dcA'.-,)
(3) Neu Ad^^(t^) > 0, hai ndt ed xu hudng ehuyen ddng ra xa nhau. NgUde lai, neu Ad^„(tJ < 0, hai niit cd xu hddng chuyen ddng gan nhau hon. Gia trj tuyet ddi cua Ad^^(t^) cang Idn thl tdc do chuyen ddng tuong ddi glQa hai ndt cang cao. Vdi b i n tin Hello eua FDGR, ben canh thdng tin GPS d thdi diem hien tai t„ va mUc dd einiem dung bd nhd dem cda nut nhu d [1] va [2], nut ciing se quang ba thdng tin GPS d thdi diem t^,. Can ed vao thdng tin GPS do eae nut lan can d thdi diem t^ va t ^ , , nut hien tai se tfnh dugc gia tri Ad^^{t j tUong dng vdi moi niit lan can va tU dd tfnh dugc gia tri chi phi md.Ham thude dugc lUa chgn cho bien dau vao Ad^^{tJ cd dang tam giac va hinh thang vdi cac gia tri ngdn ngd ed dang: U(Ad^^(t„)) = [Xa han. Khong doi. gan hon]. Bien
ngdn ngiJ dau ra Cp(tJ cd dang tam giac vdi cac gia trj ngdn ngd cd dang: U(Cp(tJ) = [Rdt kem, Kem, Chdp nhdn.
Tot, Rdt tot, Hodn hdo}.
Luat hop thanh md la co sd tri thdc cua he md, duoc dactrung bdi mdttapcactrinh bay ngdn ngUdUdi dang cac luat If-Then, theo dd cae luat nay md tli mdi quan he logic md gida cac bien ngdn ngd dau vao la ^^^{tj. P(t) va Adj.|^(t J vdi bien ngdn ngd dau ra Cp(t_^). Luat thd m cd dang sau:
ft.: iliF^UJis f;^(r„))and(/?('„)is^'"(r„)) aad(Adci,{lJis Arf"«(rJ)
Tlien(CV(/„) is C ; ( / J )
4 . K l T Q u A M d P H 6 N G
Ket qua nghien cdu dugc md phdng bang cdng cu M-file ket hgp vdi edng cu Fuzzy trong moi trudng M/ITMS. Tuyen dUdng md phdng bao gom ba doan ed hai lan xe ngUOc chieu nhau vdi kfch thudc vung md phdng la {1.000x3.000m) va ban kfnh doan dudng cong la 200m nhU duge bieu dien tren Hinh 4.1. Sd lugng phuong tien dUOc phan bd deu tren c l tuyen dudng va tren hai lan xe, trong dd sd luong nut nguon phat cac ban tin la 5 cung dUOc phan bd deu trong sd cae phuong tien da cd. Vdi moi nut, toe dd di chuyen la ngau nhien, phan bd deu t d 0 m/s den 25m/s; ban kfnh phu sdng la 200m; chu ky phat ban tin Hello la 01 giay; gia trj TTL la 10 va kfeh thudc bd nhd dem la 10 gdi tin. Qua trinh md phdng dupe thuc hien lap lai 250 lan vdi thdi gian cho moi lan md phdng la 160 giay; ket q u i md phdng chf xem xet 100 giay, t d giay thd 31 den giay thd 130 de tranh giai doan chuyen tiep. Thdng sd duoe sd dung de danh gia hoat ddng eua md hinh la ty le gdi tin tdi dfch, Ket qu^ md phdng ciia phUOng phap FDGR duge so sanh vdi ket qua eua phuong phap CAGR trong [2] de chdng td rSng eac de xuat cho hieu q u i djnh tuyen cao hon. Hinh 4.2 bieu dien ty le % gdi tin tdi dfch va thdi gian tdi dfch trung binh cua gdi tin trong hai thuat toan tuong dng vdi mat do phuong tien tang dan n x 4 0 , n - 1,2,3,4,5.
Hinh 4.1: Tuyin dudng trong md phdng
Hinh 4.2: Ty le gdi tin tdi dich va thdi gian tdi dich trung binh eua gdi tin theo mat dd phuong tien
So 05/2020 Ta thay rang, ty le nay cua phUOng phap FDGR ludn cao hon khoang gan 3% so vdi eua phuong phap CAGR, ehdng td rang FDGR cd hieu q u i dinh tuyen eao hon so vdi CAGR. Vdi thdi gian trung binh de gdi tin tdi dfch trong hai thuat toan FDGR va CAGR cung tUong dng vdi mat do phuong tien tang dan. Cd the thay riing, gia tri nay cua FDGR la Idn hon so vdi cua CAGR. Dieu nay la do trong FDGR, nhieu gdi tin bj hiiy khi khdng tiep tyc dmh tuyen duge, trong khi vdi FDGR, eac gdi tin nay tiep tyc dugc djnh tuyen nhUng phai chd lau hon tai eae nut, lam eho thdi gian tdi dich cua cac gdi nay tang len va ket qua la thdi gian trung binh de gdi tin tdi dich trong thuat toan FDGR cao hon so vdi trong thuat toan CAGR.
5. KET L U A N
Bai bao da gidi thieu mdt phuong phap djnh tuyen dja ly ehdng tac nghen mdi trong mang VANET, trong dd sd dyng thdng tin ve hudng di chuyen cua cae phuong tien nham lam tang hieu qua cua thuat toan djnh tuyen.
Ket qua md phdng ve t^ le gdi tin tdi dich eho thay rang, de xuat mdi nay cho ket q u i dinh tuyen hieu qua hon cac nghien cUu da cd trudc day.
Tai lieu tham khSo
[1]. Kayhan Zrar Ghaarfor {July 2012), Fuzzy logic-assisted geographical routing over vehicular ad hoc networks. Internatlonnal Journal of Innovative Computing, Information and Control, vol.8. Number 7{B).
[2]. Asst. Prof. Joel C. Delos Angeles, et al. (2015), Fuzzy Logic-Based Congestion-Aware Geographical Routing (CAGR) for Vehicular Ad-Hoc Networks (VANETs), APAMS.
[3]. Brad Karp, H. T Kung (2000), GPSR: Greedy Perimeter Stateless Routing for Wireless Networks. Proc.
Of the 2000 ACM International Conference on Mobile Computer and Netwwork, Boston, MA.
[4]. C. Lochert, et al. (2005), Geographic routing In city scenarios. ACM SIGMOBILE05, vol.9, no.l, pp.69-72.
[5]. B.C. Seet, et al. (May 9-14, 2004), A-STAR: A mobile ad hoc routing strategy for metropolis vehicular communications, in Proc. of the 3rd International IFIP- TC6 Networking Conference (Networking), pp.989'999.
[6]. Jiayu Gong, et al. (2007), Predictive Directional Greedy Routing In Vehicular Ad hoc Networks. 27th International Conference on Distributed Computing Systems Workshops (ICDCSW'07),Toronto, Canada.
[7]. B.Jarupan, et al. {2009), Location - and delay- aware cross-layer communication in v2imultihop vehicular networks. IEEE Communications Magazine, vol.47, no.l 1.
[8], Deling Huang, et al. (2016), Prediction-Based Geographic Routing over VANETs, Rev. Tec. Ing. Univ.
Zulia.vol.39,N''2, 157-164.
[9]. N.V. Dharani Kumari, et al. (2017), AMGRP:
AHP-based Multlmetric Geographical Routing Protocol for Urban environment of VANETs, Journal of King Saud University - Computer and Information Sciences.
[10].Vongpasith Phouthone, etal. (2017), Movement
KHOA HOC CONG NGHE
So 05/2020
Direction Algorithm for Geographic Routing Protocol in Vehicular Networks. International Journal of Advance Research, Ideas and Innovations in Technology, vol.3, Issue2, pp.1175-1183.
[11]. Anas Abu Taleb {2018), VANET Routing Protocols andArch/fecfures;/lnOi'erv/eiv, Journal of Computer Science.
[12]. Irshad Ahmed Abbasi, et al. (2018), A Review of Vehicle to Vehicle Communication Protocols for VANETs In the Urban Environment, Future Internet.
[13]. K. C. Lee, et al. (Oct. 2009), Survey of Routing Protocols in Vehicular Ad Hoc Networks, chapter in Advances in Vehicular Ad-Hoe Netw/orks: Developments and Challenges, M. Watfa, Ed., iGl Global.
[14]. Lee C.C. (1990), Fuzzy logic in control systems:
fuzzy logic controller, part I and II. IEEE Trans. On Syst., Man, and Cybern., 20, 2,404-435.
[15]. Li - Xi Wang (1995), A Course in Fuzzy Systems ang Control, Prentice-Hall, inc.
[16]. Multi-metric QoS Routing Based on Fuzzy Theory in Wireless Mesh Netvi/ork.
[17].T.S.Rappa port (1996), Wife/essCom/TJun/cat/ons;
Principles and Practice, 2nd Edition, Prentice Hall.
[18]. Nguyen Hd Ba H i i (2014), Nghien cdu giao thdc dinh tuyen dua tren hudng di chuyen cua phuang tien trin mgng VANET, Luan van Thae sy, Trudng Dai hpe Bach khoa TRHd Chf Minh.
[19]. Do Dinh CUdng (2017), Nghien cdu cat tien hieu nang giao thdc dinh tuyen AODV vd AOMDV trong mqng MANET, Luan an Tien sy, Hge vien Khoa hgc va Cdng nghe, Vien Han lam Khoa hge va Cdng nghe Viet Nam.
[20]. Andrea Tomatis, et al {2009), A Test Architecture for V-2-X Cooperative Systems Field Operational Tests, 9th International Conference on Intelligent Transport Systems Telecommunications, (ITST).
Ngdy nhin bai: 27/02/2020 Ngay chap nhan dang: 10/3/2020 NgUci phSn bien: TS. Mai Vinh DiT
TS. NguySn Van Binh
