Greedy intersection-mode routing strategy protocol for vehicular networks
In the recent years, the development of wireless network technology has been improved and there are so many researches undergoing in Vehicular Ad hoc Network. VANET has reached the greatest attention in the world. In VANET the velocity of carriers in the vehicle is high so it is very efficient to fo...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/33353/1/MahmoudAhmadSalemMFSKSM2012.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In the recent years, the development of wireless network technology has been improved and there are so many researches undergoing in Vehicular Ad hoc Network. VANET has reached the greatest attention in the world. In VANET the velocity of carriers in the vehicle is high so it is very efficient to forward data and there are so many researchers are planned to develop routing protocol. The proposed routing algorithm is used to simulate in the distributed environment. The main purposes of this routing strategy are designed and develop the sustainable routing with better efficiency and adaptability. This proposed scheme uses geographic position based routing protocol and in that position based routing we using GpsrJ+ algorithm and it is adopted by VANET technology. Due to development of countries the vehicle travel in non-ordered distribution, so we are using GPSR greedy mode to forward packets and this mode fails often and it needs recovery mode or perimeter mode. This GPSR greedy mode always fails and it is worth for forwarding packets. So the proposed enhanced GpsrJ+ mode overcomes the disadvantage of GPSR and GPCR. This proposed system gives good packet delivery ratio by simple modification of the process. This system uses greedy mode on straight roads and intersection mode on intersection and it works intelligently because it can identify the direction of node and it effectively find the shortest path of the destination to send data packets. Finally GprsJ+ does not need expensive planarization strategy and it reduces hop count effectively. The unnecessary hop count and routing overload are avoided in the enhanced proposed routing protocol. |
|---|