Delay-Aware Routing based on Game Theory in Vehicular Wireless Networks

博士 === 國立臺中教育大學 === 資訊工程學系 === 101 === In vehicular ad-hoc networks (VANET), the network topology changes rapidly because node moves at high speed, which may easily cause wireless connection intermittent. So far, the major method of packet transmission in VANET is via broadcasts. However, the broadc...

Full description

Bibliographic Details
Main Authors: Jian-Hao Su, 蘇建豪
Other Authors: Tsan-Pin Wang
Format: Others
Language:zh-TW
Published: 2013
Online Access:http://ndltd.ncl.edu.tw/handle/40156448927987582542
Description
Summary:博士 === 國立臺中教育大學 === 資訊工程學系 === 101 === In vehicular ad-hoc networks (VANET), the network topology changes rapidly because node moves at high speed, which may easily cause wireless connection intermittent. So far, the major method of packet transmission in VANET is via broadcasts. However, the broadcast commonly caused packets entering on particular nodes, which may result in heavy congestion and delay. To solve this problem, a suitable routing method is necessary. Also there may be selfish nodes in the wireless environment, which actually bring down the overall performance. The goal of this thesis aims to solve the route selection and selfish behavior problem in VANET. We propose Delay-aware Routing based on Game-Theory (DARGT) to find out an applicable path for packet delivery and to reduce the transmission delay. We also propose the Delay- utility function to calculate the total path cost. The selfish behavior in wireless environment can result in serious performance degradation due to the lack of cooperation. In order to solve selfish node problem, we present a forwarding game. By giving nodes a trust value as reward, we expected that utility exchange can encourage the node to cooperation. Finally, we used NS2 network simulator to perform the experiment. Simulation results indicated that DARGT can efficiently arrest the selfish behavior of nodes. Furthermore, DARGT can also reduce the packet transmission delay in vehicular wireless networks. In vehicular ad-hoc networks (VANET), the network topology changes rapidly because node moves at high speed, which may easily cause wireless connection intermittent. So far, the major method of packet transmission in VANET is via broadcasts. However, the broadcast commonly caused packets entering on particular nodes, which may result in heavy congestion and delay. To solve this problem, a suitable routing method is necessary. Also there may be selfish nodes in the wireless environment, which actually bring down the overall performance. The goal of this thesis aims to solve the route selection and selfish behavior problem in VANET. We propose Delay-aware Routing based on Game-Theory (DARGT) to find out an applicable path for packet delivery and to reduce the transmission delay. We also propose the Delay- utility function to calculate the total path cost. The selfish behavior in wireless environment can result in serious performance degradation due to the lack of cooperation. In order to solve selfish node problem, we present a forwarding game. By giving nodes a trust value as reward, we expected that utility exchange can encourage the node to cooperation. Finally, we used NS2 network simulator to perform the experiment. Simulation results indicated that DARGT can efficiently arrest the selfish behavior of nodes. Furthermore, DARGT can also reduce the packet transmission delay in vehicular wireless networks.