Efficient and Stable Routing Algorithm Based on User Mobility and Node Density in Urban Vehicular Network

Vehicular ad hoc networks (VANETs) are considered an emerging technology in the industrial and educational fields. This technology is essential in the deployment of the intelligent transportation system, which is targeted to improve safety and efficiency of traffic. The implementation of VANETs can be effectively executed by transmitting data among vehicles with the use of multiple hops. However, the intrinsic characteristics of VANETs, such as its dynamic network topology and intermittent connectivity, limit data delivery. One particular challenge of this network is the possibility that the contributing node may only remain in the network for a limited time. Hence, to prevent data loss from that node, the information must reach the destination node via multi-hop routing techniques. An appropriate, efficient, and stable routing algorithm must be developed for various VANET applications to address the issues of dynamic topology and intermittent connectivity. Therefore, this paper proposes a novel routing algorithm called efficient and stable routing algorithm based on user mobility and node density (ESRA-MD). The proposed algorithm can adapt to significant changes that may occur in the urban vehicular environment. This algorithm works by selecting an optimal route on the basis of hop count and link duration for delivering data from source to destination, thereby satisfying various quality of service considerations. The validity of the proposed algorithm is investigated by its comparison with ARP-QD protocol, which works on the mechanism of optimal route finding in VANETs in urban environments. Simulation results reveal that the proposed ESRA-MD algorithm shows remarkable improvement in terms of delivery ratio, delivery delay, and communication overhead

Algorithms for stable clustering in vanets (vehicular ad hoc networks)

Σημείωση: διατίθεται συμπληρωματικό υλικό σε ξεχωριστό αρχείο

Adoption of vehicular ad hoc networking protocols by networked robots

This paper focuses on the utilization of wireless networking in the robotics domain. Many researchers have already equipped their robots with wireless communication capabilities, stimulated by the observation that multi-robot systems tend to have several advantages over their single-robot counterparts. Typically, this integration of wireless communication is tackled in a quite pragmatic manner, only a few authors presented novel Robotic Ad Hoc Network (RANET) protocols that were designed specifically with robotic use cases in mind. This is in sharp contrast with the domain of vehicular ad hoc networks (VANET). This observation is the starting point of this paper. If the results of previous efforts focusing on VANET protocols could be reused in the RANET domain, this could lead to rapid progress in the field of networked robots. To investigate this possibility, this paper provides a thorough overview of the related work in the domain of robotic and vehicular ad hoc networks. Based on this information, an exhaustive list of requirements is defined for both types. It is concluded that the most significant difference lies in the fact that VANET protocols are oriented towards low throughput messaging, while RANET protocols have to support high throughput media streaming as well. Although not always with equal importance, all other defined requirements are valid for both protocols. This leads to the conclusion that cross-fertilization between them is an appealing approach for future RANET research. To support such developments, this paper concludes with the definition of an appropriate working plan

Fixed Cluster Based Cluster Head Selection Algorithm in Vehicular Adhoc Network

The emergence of Vehicular Adhoc Networks (VANETs) is expected support variety of applications for driver assistance, traffic efficiency and road safety. For proper transmission of messages in VANET, one of the proposed solutions is dividing the network into clusters and then selecting a cluster head (CH) in each cluster. This can decrease the communication overhead between road side units (RSUs) and other components of VANETs, because instead of every node communicating with RSU, only CH communicates with RSU and relays relevant messages. In clustering, an important step is the selection of CH. In this thesis, we implemented vehicle to vehicle (V2V), cluster head to road side unit and road side unit to trusted authority authentication for the clustered network. We also presented a heuristic algorithm for selecting a suitable vehicle as the cluster head in a cluster. For the selection of head vehicle, we used weighted fitness values based on three parameters; trust value, position from the cluster boundary and absolute relative average speed. Simulation results indicate that the proposed approach can lead to improvements in terms of QoS metrics like delay, throughput and packet delivery ratio