

Algorithm for Solving Cross Edge Problem by GEOCROSS Routing Protocol in VANET
Abstract
Keywords
References
Bilal Mustafa Umar Waqas Raja,” Issues of Routing in VANET”, Master thesis Computer Science Thesis no: MCS-2010-20 June 2010.
Surabhi Mahajan, Prof. Alka Jindal,” Security and Privacy in VANET to reduce Authentication Overhead for Rapid Roaming Networks”, 2010 International Journal of Computer Applications (0975 - 8887)Volume 1 – No. 20
S. Ni, Y. Tseng, Y. Chen, and J. Sheu, “The broadcast storm problem in a mobile ad hoc network,” in Proc. ACM Intern. Conf. on Mobile Comput. and Networking (MOBICOM), Seattle, USA, 1999, pp. 151–162.
Ozan Tonguz, Nawaporn Wisitpongphan, Fan Bai†, Priyantha Mudalige†, and Varsha Sadekar†,”Broadcasting in VANET”, in 978-1-4244-2026-1/08 (IEEE 2008).
G. Korkmaz, E. Ekici, F. Ozguner, and U. Ozguner, “Urban Multi-Hop Broadcast Protocol for Inter-Vehicle Communication Systems,” in Proc.of ACM Int‟l Workshop on Vehicular Ad hoc Networks, Philadelphia,USA, October 2004, pp. 76–85.
Mohamed Salah bouassida and M.Shawky,”A cooperative congestion control approach within vanets:formal verification & performance evaluation”, Hindaw publishing corporation, EURASIP journal on wireless communication and networking volume2010, article ID:712525,13 pages, doi: 10.11 55/2010/712525
Linyang, Jinhua Guo(Member IEEE) ,&ying whu, “Channel adaptive one hop broadcasting for vanets”,proceeding of the 11th international IEEE conference on intelligent transportation systems , Beijing, China, October 12-15,2008,1-4244-2112-1108,IEEE.
Xue Yang(University of Illinois at Urbana-Champaign),Jie Liu(Microsoft Research),Feng Zhao(Microsoft Research),Nitin H. Vaidya,” A Vehicle-to-Vehicle Communication Protocol for Cooperative Collision Warning”,University of Illinois at Urbana-Champaign.
Tarik Taleb†,1, Mitsuru Ochi†,2, Abbas Jamalipour‡,3, Nei Kato† ,2, and Yoshiaki Nemoto†,”An Efficient Vehicle-Heading Based Routing Protocol for VANET Networks”, 1-4244-0270-0/06/(2006 IEEE)
Perkins, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers”, in Proc. of ACM SIGCOMM 1994, London, UK, Aug. 1994, pp. 234-244.
Y.-J. Kim, R. Govindan, B. Karp, S. Shenker, Geographic routing made practical, in: NSDI‟05: Proceedings of the 2nd Conference on Symposium on Networked Systems Design & Implementation, Berkeley, CA, USA, USENIX Association, 2005, pp. 217–230.
Y.-J.K.R. Govindan, B. Karp, S. Shenker, Lazy cross-link removal for geographic routing, in: SenSys ‟06: Proceedings of the 4th International Conference on Embedded Networked Sensor Systems, New York, NY, USA, 2006, pp. 112–124.
Kevin C. Lee *, Pei-Chun Cheng, Mario Gerla,” GeoCross: A geographic routing protocol in the presence of loops in urban scenarios”, journal homepage: www.elsevier.com/locate/adhoc,published in 2010.
Karp et al., “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks”, MobiCom 2000.
K.R. Gabriel, R. Sokal, A new statistical approach to geographic variation analysis, systematic Zoology 18 (1969) 231-268.
G. Toussaint, “The relative neighbourhood graph of a finite planar set , Pattern recognition 12 (1980) 231-268
Priyanka, Amita Malik, C.C.Tripathi,”Junction cross link removal using GEOCROSS routing protocol in VANET”,Proceedings of International conference on smart technologies,Chennai,India,2011,978-1-4507-5567-2.
Refbacks
- There are currently no refbacks.

This work is licensed under a Creative Commons Attribution 3.0 License.