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

Messhu-gata musen nettowaku ni okeru supekutoramu kenchi to MAC-so purotokoru ni kansuru kenkyu

制度:新 ; 報告番号:甲3458号 ; 学位の種類:博士(国際情報通信学) ; 授与年月日:2011/11/16 ; 早大学位記番号:新578