International Journal of Advance Computational Engineering and Networking (IJACEN)
.
Follow Us On :
current issues
Volume-10,Issue-11  ( Nov, 2022 )
Past issues
  1. Volume-10,Issue-10  ( Oct, 2022 )
  2. Volume-10,Issue-9  ( Sep, 2022 )
  3. Volume-10,Issue-8  ( Aug, 2022 )
  4. Volume-10,Issue-7  ( Jul, 2022 )
  5. Volume-10,Issue-6  ( Jun, 2022 )
  6. Volume-10,Issue-5  ( May, 2022 )
  7. Volume-10,Issue-4  ( Apr, 2022 )
  8. Volume-10,Issue-3  ( Mar, 2022 )
  9. Volume-10,Issue-2  ( Feb, 2022 )
  10. Volume-10,Issue-1  ( Jan, 2022 )

Statistics report
Feb. 2023
Submitted Papers : 80
Accepted Papers : 10
Rejected Papers : 70
Acc. Perc : 12%
Issue Published : 119
Paper Published : 1427
No. of Authors : 3631
  Journal Paper


Paper Title :
Back-Bone-Assisted Hop Greedy Routing In VANET

Author :Prajakta V. Ambekar, Digamber T. Bodake

Article Citation :Prajakta V. Ambekar ,Digamber T. Bodake , (2013 ) " Back-Bone-Assisted Hop Greedy Routing In VANET " , International Journal of Advance Computational Engineering and Networking (IJACEN) , pp. 01-08, Volume-1,Issue-7

Abstract : Using advanced wireless local area network technologies, vehicular ad hoc networks (VANETs) have become viable and valuable for their wide variety of novel applications, such as road safety, multimedia content sharing, commerce on wheels, etc. Multihop information dissemination in VANETs is constrained by the high mobility of vehicles and the frequent disconnections. Currently, geographic routing protocols are widely adopted for VANETs as they do not require route construction and route maintenance phases. Again, with connectivity awareness, they perform well in terms of reliable delivery. To obtain destination position, some protocols use flooding, which can be detrimental in city environments. Further, in the case of sparse and void regions, frequent use of the recovery strategy elevates hop count. Some geographic routing protocols adopt the minimum weighted algorithm based on distance or connectivity to select intermediate intersections. However, the shortest path or the path with higher connectivity may include numerous intermediate intersections. As a result, these protocols yield routing paths with higher hop count. In this paper, we propose a hop greedy routing scheme that yields a routing path with the minimum number of intermediate intersection nodes while taking connectivity into consideration. Moreover, we introduce back-bone nodes that play a key role in providing connectivity status around an intersection. Apart from this, by tracking the movement of source as well as destination, the back-bone nodes enable a packet to be forwarded in the changed direction. Simulation results signify the benefits of the proposed routing strategy in terms of high packet delivery ratio and shorter end-to-end delay.

Type : Research paper

Published : Volume-1,Issue-7


DOIONLINE NO - IJACEN-IRAJ-DOIONLINE-72   View Here

Copyright: © Institute of Research and Journals

| PDF |
Viewed - 31
| Published on 2014-01-18
   
   
IRAJ Other Journals
IJACEN updates
Paper Submission is open now for upcoming Issue.
The Conference World

JOURNAL SUPPORTED BY