Earticle

초록

영어

Geographic routing exerts geographic information to select the next-hop along the route to the destination. Greedy forwarding is a geographic routing mechanism that uses geographical location information of nodes and the distance of each node to the destination, to select next-hop node that achieve the most positive movement to the destination. Where greedy forwarding is not possible, it can be said a void occurred. In this case, if there is no an alternative mechanism, packets are easily removed. Hence a void-handling technique is need to continue routing and recovery greedy forwarding. There is a possibility of void in all types of wireless networks including vehicular ad hoc network (VANET). In this article we introduce void problem and present a survey on varied void-handling techniques which are suitable for VANET networks. At the end, we provide a comparative survey of these techniques based on some important features that are effective on the network performance.

목차

Abstract
 1. Introduction
 2. Basic Concepts and Description of Problem
 3. Void handling Techniques
  3.1. Planar-graph-based Techniques
  3.2. Geometric Techniques
  3.3. Flooding based Techniques
  3.4 .Cost-based Techniques
  3.5. Heuristic Techniques
  3.6. Virtual Destination based Technique
 4. Brief Comparison
 5. Conclusions
 References

키워드

저자

• Sanaz Parvin [ Department of Computer Engineering, Yazd University, Yazd, Iran ]
• Dr. Mehdi Agha Sarram [ Department of Computer Engineering, Yazd University, Yazd, Iran ]
• Dr. Ghasem Mirjalily [ Department of Electrical Engineering, Yazd University, Yazd, Iran ]
• Dr. Fazlollah Adibnia [ Department of Computer Engineering, Yazd University, Yazd, Iran ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Grid and Distributed Computing

• 간기

  격월간

• pISSN

  2005-4262

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605