CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Scalable Back-Bone-Assisted Hop Greedy Routing for VANET’s City Environments (SBHG)

by Rajani Thite, A. K. Bongale
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 96 - Number 17
Year of Publication: 2014
Authors: Rajani Thite, A. K. Bongale
10.5120/16889-6912

Rajani Thite, A. K. Bongale . Scalable Back-Bone-Assisted Hop Greedy Routing for VANET’s City Environments (SBHG). International Journal of Computer Applications. 96, 17 ( June 2014), 36-40. DOI=10.5120/16889-6912

@article{ 10.5120/16889-6912,
author = { Rajani Thite, A. K. Bongale },
title = { Scalable Back-Bone-Assisted Hop Greedy Routing for VANET’s City Environments (SBHG) },
journal = { International Journal of Computer Applications },
issue_date = { June 2014 },
volume = { 96 },
number = { 17 },
month = { June },
year = { 2014 },
issn = { 0975-8887 },
pages = { 36-40 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume96/number17/16889-6912/ },
doi = { 10.5120/16889-6912 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:22:02.476742+05:30
%A Rajani Thite
%A A. K. Bongale
%T Scalable Back-Bone-Assisted Hop Greedy Routing for VANET’s City Environments (SBHG)
%J International Journal of Computer Applications
%@ 0975-8887
%V 96
%N 17
%P 36-40
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Vehicle Area Networks play very crucial role in variety of applications, such as Co-operative driving, Information sharing, other added services like Navigation, internet access etc. A lot more research is required in the optimal routing, sensing the vehicles, safely messages to be broadcasted etc. To reach to the destination flooding like technologies are unreliable in sparse regions so shortest path algorithms has been used such algorithms can cause higher hop count. On-Demand routing protocols are used by mobile nodes in an ad hoc network. It offers quick adaptation to self-motivated link conditions, low processing and Network utilization, memory overhead, and which determines unicast routes to destinations within the ad hoc network. But path generated by these protocols may deviate far from the optimal because mobile nodes and no knowledge of current topology which causes higher hop counts. In this paper we proposed self-healing and optimizing routing techniques for VANETs which improves routing optimality by monitoring routing ways continuously and changes the path which is optimal and causes less hop count.

References
  1. J. Bernsern and D. Manivannan, "Unicast routing protocols for vehicular ad hoc networks: A critical comparison and classification," Pervasive Mob. Comput. , vol. 5, no. 1, pp. 1–18, Feb. 2009.
  2. M. M. Artimy, W. Robertson, and W. J. Phillips, "Connectivity in inter-vehicle ad hoc networks," in Proc. IEEE CCECE, May 2004,pp. 293–298
  3. Pratap Kumar Sahu, Eric Hsiao-Kuang Wu, Member, IEEE, JagrutiSahoo, and Mario Gerla, Member, IEEE, "BAHG: Back-Bone-Assisted Hop Greedy Routing for VANET' City Environments", IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, VOL. 14, NO. 1, MARCH 2013.
  4. P. K. Sahu, E. H. Wu, J. Sahoo, and M. Gerla, "DDOR: Destination discovery oriented routing in highway/freeway VANETs," in SpringerTelecommun. Syst. ––Special Issue Vehicular Communications, Networks, Applications, 2010, pp. 1–18.
  5. Q. Yang, A. Lim, S. Li, J. Fang, and P. Agrawal, "ACAR: Adaptive connectivity aware routing for vehicular ad hoc networks in city scenarios," Mob. Netw. Appl. , vol. 15, no. 1, pp. 36–60, Feb. 2010.
  6. G. Liu, B. S. Lee, B. C. Seet, C. H. Foh, K. J. Wong, and K. K. Lee, "A routing strategy for metropolis vehicular communications," in Proc. ICOIN, LNCS, Aug. 2004, pp. 134–143.
  7. M. Jerbi, S. M. Senouci, T. Rasheed, and Y. Ghamri-Doudane, "Towards efficient geographic routing in urban vehicular networks," IEEE Trans. Veh. Technol. , vol. 58, no. 9, pp. 5048–5059, Nov. 2009.
  8. V. Naumov and T. R. Gross, "Connectivity-aware routing (CAR) in vehicular ad hoc networks," in Proc. IEEE INFOCOMM, 2007, pp. 1919–1927.
  9. B. Karp and H. T. Kung, "GPSR: Greedy perimeter stateless routing for wireless networks," in Proc. ACM MOBICOM, 2000, pp. 243–254.
  10. C. Lochert, M. Mauve, H. Füßler, and H. Hartenstein, "Geographic routing in city scenarios," ACM SIGMOBILE Mobile Comput. Commun. Rev. , vol. 9, no. 1, pp. 69–72, Jan. 2005.
  11. W. Kieß, H. Füßler, and J. Widmer, "Hierarchical location service for mobile ad-hoc networks," ACM SIGMOBILE Mob. Comput. Commun. Rev. , vol. 8, no. 4, pp. 47–58, Oct. 2004.
  12. J. Li, J. Jannotti, D. S. J. De Couto, D. R. Karger, and R. Morris, "A scalable location service for geographic ad hoc routing," in Proc. ACMMOBICOM, 2000, pp. 120–130.
  13. P. K. Sahu, E. H. Wu, J. Sahoo, and M. Gerla, "DDOR: Destination discovery oriented routing in highway/freeway VANETs," in SpringerTelecommun. Syst. ––Special Issue Vehicular Communications, Networks, Applications, 2010, pp. 1–18.
  14. K. C. Lee, J. Häerri, U. Lee, and M. Gerla, "Enhanced perimeter routing for geographic forwarding protocols in urban vehicular scenarios," in Proc. IEEE GlobeCom Workshops, 2007, pp. 1–10.
  15. Chao Gui and PrasantMohapatra, 'SHORT: Delf-Healing and Optimizing Routing Techniques for Mobile Ad Hoc Networks June 03Bowman, M. , Debray, S. K. , and Peterson, L. L. 1993. Reasoning about naming systems.
Index Terms

Computer Science
Information Sciences

Keywords

Distance Vector Routing Algorithm in VANET

Powered by PhDFocusTM