STUDI KINERJA GREEDY PERIMETER STATELESS ROUTING BERBASIS OVERLAY NETWORK PADA VANET

GPSR merupakan protokol routing geografis yang bekerja menggunakan informasi lokasi node tetangga dan jangkauan transmisi ke lokasi node tujuan terdekat. Namun, GPSR tidak selalu menemukan rute yang optimal, karena tidak semua node yang terdekat dapat meneruskan paket menuju tujuan khususnya skenario lalu lintas padat dan banyak persimpangan. Kami mengusulkan route discovery protocol Dynamic Source Routing (DSR) untuk memastikan rute yang dikirimkan paket data memiliki availability yang tinggi. Selain itu kami juga mengusulkan konsep overlay network dengan menyimpan titik lokasi persimpangan yang dilalui pada saat proses route discovery sehingga proses pengiriman data nantinya dapat diandalakan dengan tidak terpaku pada intermediate node namun mengacu pada lokasi titik yang disimpan. Untuk memvalidasi usulan kami dengan membandingkan performa GPSR modifikasi dan GPSR konvensional seperti packet delivery ratio, end-to-end delay dan routing overhead pada scenario berbeda dengan memvariasikan jumlah node dan kecepatan node menggunakan simulator NS2. Hasil simulasi menunjukan pendekatan yang kami usulkan meningkatkan packet delivery ratio 11.25% dan mereduksi 197.08 paket routing overhead pada kecepatan 10 m/s.

[1]  M. Boussedjra,et al.  GPSR-L: Greedy perimeter stateless routing with lifetime for VANETS , 2008, 2008 8th International Conference on ITS Telecommunications.

[2]  S.A. Khan,et al.  Traffic estimation and real time prediction using adhoc networks , 2005, Proceedings of the IEEE Symposium on Emerging Technologies, 2005..

[3]  Gene Tsudik,et al.  SRDP: securing route discovery in DSR , 2005, The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services.

[4]  Mohammed Oumsis,et al.  Improvement of GPSR protocol by using future position estimation of participating nodes in vehicular ad-hoc Networks , 2016, 2016 International Conference on Wireless Networks and Mobile Communications (WINCOM).

[5]  Zhizhong Ding,et al.  An Improved GPSR Routing Strategy in VANET , 2012, 2012 8th International Conference on Wireless Communications, Networking and Mobile Computing.

[6]  Axel Krings,et al.  VANET clock synchronization for resilient DSRC safety applications , 2017, 2017 Resilience Week (RWS).

[7]  Priyanka G. Shinde,et al.  Traffic congestion detection with complex event processing in VANET , 2017, 2017 Fourteenth International Conference on Wireless and Optical Communications Networks (WOCN).

[8]  Jaime Galan Jimenez,et al.  Overview and Challenges of Overlay Networks: A Survey , 2011 .

[9]  Anchare V. Babu,et al.  Link Reliability Based Greedy Perimeter Stateless Routing for Vehicular Ad Hoc Networks , 2015 .

[10]  D. Djenouri,et al.  VANET's Mobility Models and Overtaking: An Overview , 2008, 2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications.

[11]  Uichin Lee,et al.  Enhanced Perimeter Routing for Geographic Forwarding Protocols in Urban Vehicular Scenarios , 2007, 2007 IEEE Globecom Workshops.

[12]  Brad Karp,et al.  GPSR : Greedy Perimeter Stateless Routing for Wireless , 2000, MobiCom 2000.

[13]  Pascal Lorenz,et al.  Weighted Probabilistic Next-Hop Forwarder Decision-Making in VANET Environments , 2016, 2016 IEEE Global Communications Conference (GLOBECOM).

[14]  Roberto Verdone,et al.  Intelligent transportation systems: the role of third-generation mobile radio networks , 2000, IEEE Commun. Mag..

[15]  Sudhir K. Routray,et al.  Ant Colony based Dynamic source routing for VANET , 2016, 2016 2nd International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT).

[16]  Subir Biswas,et al.  Vehicle-to-vehicle wireless communication protocols for enhancing highway traffic safety , 2006, IEEE Communications Magazine.

[17]  Teruaki Kitasuka,et al.  Performance Evaluation of AODV and AOMDV with Probabilistic Relay in VANET Environments , 2012, 2012 Third International Conference on Networking and Computing.