ARPN journal of engineering and applied sciences, 2015
Recent research studies prove that contention-based forwarding (CBF) algorithms are preferable in... more Recent research studies prove that contention-based forwarding (CBF) algorithms are preferable in highlydynamic vehicular environments. CBF algorithms are beaconless, whereas position-based algorithms rely on periodic beacon information to make forwarding decisions. Considering the store-carry-forward paradigm of delay-tolerant networks, which relies on mobility of vehicles to deliver packets when next forwarding vehicle is unreachable, we proposed a new recovery strategy and enhanced the CBF algorithm to tackle the network disconnection problem that frequently occurs in vehicular wireless networks. This enhanced CBF with a store-carry-forward capability is referred to as CBF-SCF algorithm. The algorithm was simulated, and the results indicate that CBF-SCF outperforms normal CBF in terms of packet delivery ratio and routing overhead.
Abstract Routing in vehicular ad hoc networks (VANETs) is one of the challenging issues that has ... more Abstract Routing in vehicular ad hoc networks (VANETs) is one of the challenging issues that has received more attention in recent literature. Research results show that contention-based forwarding protocols are more scalable and more resilient to high mobility of vehicles and rapid topology changes compared with topology-based and position-based routing protocols. In such forwarding protocols, the best next-hop node is elected based on a contention timer value that is assigned to each next-hop candidate. The design of an efficient contention timer function is an important part of such forwarding protocols. In this paper, first we introduce a new contention timer function based on two criteria that take greediness and link stability into account, greediness for selecting the shortest path and link stability for reducing communications over lossy links. Then we apply the contention timer function to an existing contention-based forwarding algorithm to make it mobility-aware. The optimized algorithm is referred to as MACBF algorithm. Simulation results show that MACBF can improve packet delivery ratio, average end-to-end delay and routing overhead in highly mobile highway scenarios.
Vehicular Ad hoc Networks are emerging class of Mobile Ad hoc Networks that provide wireless comm... more Vehicular Ad hoc Networks are emerging class of Mobile Ad hoc Networks that provide wireless communication between vehicles with no need for any fixed infrastructure. It is proven that in highly dynamic vehicular environments beaconless position-based forwarding algorithms are more suitable than the algorithms that use periodic beacon information in their forwarding decisions. However, data packet broadcasting in forwarding mechanism of these algorithms leads to packet duplications in both forwarding area and the destination node and consequently increases the network overhead and wastes available bandwidth. In this paper we propose a new beaconless forwarding algorithm called CBBPF in which data packets are not broadcasted to the neighbors to avoid duplication. The simulative performance evaluation results in highway scenarios show that CBBPF operates properly in terms of packet delivery ratio and average end-to-end delay.
Abstract Routing in vehicular ad hoc networks (VANETs) is one of the challenging issues that has ... more Abstract Routing in vehicular ad hoc networks (VANETs) is one of the challenging issues that has received more attention in recent literature. Research results show that contention-based forwarding protocols are more scalable and more resilient to high mobility of vehicles and rapid topology changes compared with topology-based and position-based routing protocols. In such forwarding protocols, the best next-hop node is elected based on a contention timer value that is assigned to each next-hop candidate. The design of an efficient contention timer function is an important part of such forwarding protocols. In this paper, first we introduce a new contention timer function based on two criteria that take greediness and link stability into account, greediness for selecting the shortest path and link stability for reducing communications over lossy links. Then we apply the contention timer function to an existing contention-based forwarding algorithm to make it mobility-aware. The optimized algorithm is referred to as MACBF algorithm. Simulation results show that MACBF can improve packet delivery ratio, average end-to-end delay and routing overhead in highly mobile highway scenarios.
Recent research studies prove that contention-based forwarding (CBF) algorithms are preferable in... more Recent research studies prove that contention-based forwarding (CBF) algorithms are preferable in highly- dynamic vehicular environments. CBF algorithms are beaconless, whereas position-based algorithms rely on periodic beacon information to make forwarding decisions. Considering the store-carry-forward paradigm of delay-tolerant networks, which relies on mobility of vehicles to deliver packets when next forwarding vehicle is unreachable, we proposed a new recovery strategy and enhanced the CBF algorithm to tackle the network disconnection problem that frequently occurs in vehicular wireless networks. This enhanced CBF with a store-carry-forward capability is referred to as CBF-SCF algorithm. The algorithm was simulated, and the results indicate that CBF-SCF outperforms normal CBF in terms of packet delivery ratio and routing overhead.
Vehicular Ad Hoc Networks (VANETs) are self-organizing, self-healing networks that provide wirele... more Vehicular Ad Hoc Networks (VANETs) are self-organizing, self-healing networks that provide wireless communication among vehicles and roadside equipment. Providing safety and comfort for drivers and passengers is a promising goal of these networks. Designing an appropriate routing protocol according to the network application is one of the essential requirements for implementing a successful vehicular network. In this paper, we report the results of a study on routing protocols related to vehicular applications and their communication needs. In general, all VANET communications can be implemented by either unicast or multicast routing protocols. The results of the study showed that multicast protocols, including geocast and mobility-based routing, are more promising than others for fulfilling the application requirements and, consequently, more research of these protocols is needed.
ARPN journal of engineering and applied sciences, 2015
Recent research studies prove that contention-based forwarding (CBF) algorithms are preferable in... more Recent research studies prove that contention-based forwarding (CBF) algorithms are preferable in highlydynamic vehicular environments. CBF algorithms are beaconless, whereas position-based algorithms rely on periodic beacon information to make forwarding decisions. Considering the store-carry-forward paradigm of delay-tolerant networks, which relies on mobility of vehicles to deliver packets when next forwarding vehicle is unreachable, we proposed a new recovery strategy and enhanced the CBF algorithm to tackle the network disconnection problem that frequently occurs in vehicular wireless networks. This enhanced CBF with a store-carry-forward capability is referred to as CBF-SCF algorithm. The algorithm was simulated, and the results indicate that CBF-SCF outperforms normal CBF in terms of packet delivery ratio and routing overhead.
Abstract Routing in vehicular ad hoc networks (VANETs) is one of the challenging issues that has ... more Abstract Routing in vehicular ad hoc networks (VANETs) is one of the challenging issues that has received more attention in recent literature. Research results show that contention-based forwarding protocols are more scalable and more resilient to high mobility of vehicles and rapid topology changes compared with topology-based and position-based routing protocols. In such forwarding protocols, the best next-hop node is elected based on a contention timer value that is assigned to each next-hop candidate. The design of an efficient contention timer function is an important part of such forwarding protocols. In this paper, first we introduce a new contention timer function based on two criteria that take greediness and link stability into account, greediness for selecting the shortest path and link stability for reducing communications over lossy links. Then we apply the contention timer function to an existing contention-based forwarding algorithm to make it mobility-aware. The optimized algorithm is referred to as MACBF algorithm. Simulation results show that MACBF can improve packet delivery ratio, average end-to-end delay and routing overhead in highly mobile highway scenarios.
Vehicular Ad hoc Networks are emerging class of Mobile Ad hoc Networks that provide wireless comm... more Vehicular Ad hoc Networks are emerging class of Mobile Ad hoc Networks that provide wireless communication between vehicles with no need for any fixed infrastructure. It is proven that in highly dynamic vehicular environments beaconless position-based forwarding algorithms are more suitable than the algorithms that use periodic beacon information in their forwarding decisions. However, data packet broadcasting in forwarding mechanism of these algorithms leads to packet duplications in both forwarding area and the destination node and consequently increases the network overhead and wastes available bandwidth. In this paper we propose a new beaconless forwarding algorithm called CBBPF in which data packets are not broadcasted to the neighbors to avoid duplication. The simulative performance evaluation results in highway scenarios show that CBBPF operates properly in terms of packet delivery ratio and average end-to-end delay.
Abstract Routing in vehicular ad hoc networks (VANETs) is one of the challenging issues that has ... more Abstract Routing in vehicular ad hoc networks (VANETs) is one of the challenging issues that has received more attention in recent literature. Research results show that contention-based forwarding protocols are more scalable and more resilient to high mobility of vehicles and rapid topology changes compared with topology-based and position-based routing protocols. In such forwarding protocols, the best next-hop node is elected based on a contention timer value that is assigned to each next-hop candidate. The design of an efficient contention timer function is an important part of such forwarding protocols. In this paper, first we introduce a new contention timer function based on two criteria that take greediness and link stability into account, greediness for selecting the shortest path and link stability for reducing communications over lossy links. Then we apply the contention timer function to an existing contention-based forwarding algorithm to make it mobility-aware. The optimized algorithm is referred to as MACBF algorithm. Simulation results show that MACBF can improve packet delivery ratio, average end-to-end delay and routing overhead in highly mobile highway scenarios.
Recent research studies prove that contention-based forwarding (CBF) algorithms are preferable in... more Recent research studies prove that contention-based forwarding (CBF) algorithms are preferable in highly- dynamic vehicular environments. CBF algorithms are beaconless, whereas position-based algorithms rely on periodic beacon information to make forwarding decisions. Considering the store-carry-forward paradigm of delay-tolerant networks, which relies on mobility of vehicles to deliver packets when next forwarding vehicle is unreachable, we proposed a new recovery strategy and enhanced the CBF algorithm to tackle the network disconnection problem that frequently occurs in vehicular wireless networks. This enhanced CBF with a store-carry-forward capability is referred to as CBF-SCF algorithm. The algorithm was simulated, and the results indicate that CBF-SCF outperforms normal CBF in terms of packet delivery ratio and routing overhead.
Vehicular Ad Hoc Networks (VANETs) are self-organizing, self-healing networks that provide wirele... more Vehicular Ad Hoc Networks (VANETs) are self-organizing, self-healing networks that provide wireless communication among vehicles and roadside equipment. Providing safety and comfort for drivers and passengers is a promising goal of these networks. Designing an appropriate routing protocol according to the network application is one of the essential requirements for implementing a successful vehicular network. In this paper, we report the results of a study on routing protocols related to vehicular applications and their communication needs. In general, all VANET communications can be implemented by either unicast or multicast routing protocols. The results of the study showed that multicast protocols, including geocast and mobility-based routing, are more promising than others for fulfilling the application requirements and, consequently, more research of these protocols is needed.
Uploads
Papers