Computational Intelligence Inspired Data Delivery for Vehicle-to-Roadside Communications

We propose a vehicle-to-roadside communication protocol based on distributed clustering where a coalitional game approach is used to stimulate the vehicles to join a cluster, and a fuzzy logic algorithm is employed to generate stable clusters by considering multiple metrics of vehicle velocity, moving pattern, and signal qualities between vehicles. A reinforcement learning algorithm with game theory based reward allocation is employed to guide each vehicle to select the route that can maximize the whole network performance. The protocol is integrated with a multi-hop data delivery virtualization scheme that works on the top of the transport layer and provides high performance for multi-hop end-to-end data transmissions. We conduct realistic computer simulations to show the performance advantage of the protocol over other approaches

Survey on Congestion Detection and Control in Connected Vehicles

The dynamic nature of vehicular ad hoc network (VANET) induced by frequent topology changes and node mobility, imposes critical challenges for vehicular communications. Aggravated by the high volume of information dissemination among vehicles over limited bandwidth, the topological dynamics of VANET causes congestion in the communication channel, which is the primary cause of problems such as message drop, delay, and degraded quality of service. To mitigate these problems, congestion detection, and control techniques are needed to be incorporated in a vehicular network. Congestion control approaches can be either open-loop or closed loop based on pre-congestion or post congestion strategies. We present a general architecture of vehicular communication in urban and highway environment as well as a state-of-the-art survey of recent congestion detection and control techniques. We also identify the drawbacks of existing approaches and classify them according to different hierarchical schemes. Through an extensive literature review, we recommend solution approaches and future directions for handling congestion in vehicular communications

Time division multiple access scheduling strategies for emerging vehicular ad hoc network medium access control protocols: a survey

[EN] Vehicular ad hoc network (VANET) is an emerging and promising technology, which allows vehicles while moving on the road to communicate and share resources. These resources are aimed at improving traffic safety and providing comfort to drivers and passengers. The resources use applications that have to meet high reliability and delay constraints. However, to implement these applications, VANET relies on medium access control (MAC) protocol. Many approaches have been proposed in the literature using time division multiple access (TDMA) scheme to enhance the efficiency of MAC protocol. Nevertheless, this technique has encountered some challenges including access and merging collisions due to inefficient time slot allocation strategy and hidden terminal problem. Despite several attempts to study this class of protocol, issues such as channel access and time slot scheduling strategy have not been given much attention. In this paper, we have relatively examined the most prominent TDMA MAC protocols which were proposed in the literature from 2010 to 2018. These protocols were classified based on scheduling strategy and the technique adopted. Also, we have comparatively analyzed them based on different parameters and performance metrics used. Finally, some open issues are presented for future deployment.Tambawal, AB.; Noor, RM.; Salleh, R.; Chembe, C.; Anisi, MH.; Michael, O.; Lloret, J. (2019). Time division multiple access scheduling strategies for emerging vehicular ad hoc network medium access control protocols: a survey. Telecommunication Systems. 70(4):595-616. https://doi.org/10.1007/s11235-018-00542-8S59561670

Improved Road Segment-Based Geographical Routing Protocol for Vehicular Ad-hoc Networks

This research was funded by Bahria University, Islamabad Campus.Qureshi, KN.; Ul Islam, F.; Kaiwartya, O.; Kumar, A.; Lloret, J. (2020). Improved Road Segment-Based Geographical Routing Protocol for Vehicular Ad-hoc Networks. Electronics. 9(8):1-20. https://doi.org/10.3390/electronics9081248S1209

Distributed Adaptation Techniques for Connected Vehicles

In this PhD dissertation, we propose distributed adaptation mechanisms for connected vehicles to deal with the connectivity challenges. To understand the system behavior of the solutions for connected vehicles, we first need to characterize the operational environment. Therefore, we devised a large scale fading model for various link types, including point-to-point vehicular communications and multi-hop connected vehicles. We explored two small scale fading models to define the characteristics of multi-hop connected vehicles. Taking our research into multi-hop connected vehicles one step further, we propose selective information relaying to avoid message congestion due to redundant messages received by the relay vehicle. Results show that the proposed mechanism reduces messaging load by up to 75% without sacrificing environmental awareness. Once we define the channel characteristics, we propose a distributed congestion control algorithm to solve the messaging overhead on the channels as the next research interest of this dissertation. We propose a combined transmit power and message rate adaptation for connected vehicles. The proposed algorithm increases the environmental awareness and achieves the application requirements by considering highly dynamic network characteristics. Both power and rate adaptation mechanisms are performed jointly to avoid one result affecting the other negatively. Results prove that the proposed algorithm can increase awareness by 20% while keeping the channel load and interference at almost the same level as well as improve the average message rate by 18%. As the last step of this dissertation, distributed cooperative dynamic spectrum access technique is proposed to solve the channel overhead and the limited resources issues. The adaptive energy detection threshold, which is used to decide whether the channel is busy, is optimized in this work by using a computationally efficient numerical approach. Each vehicle evaluates the available channels by voting on the information received from one-hop neighbors. An interdisciplinary approach referred to as entropy-based weighting is used for defining the neighbor credibility. Once the vehicle accesses the channel, we propose a decision mechanism for channel switching that is inspired by the optimal flower selection process employed by bumblebees foraging. Experimental results show that by using the proposed distributed cooperative spectrum sensing mechanism, spectrum detection error converges to zero