Incentive Based Node Cooperation in Vehicular Delay-Tolerant Networks

Abstract

The term delay-tolerant networking is created to describe and cover all types of long-delay, disconnected, disrupted or intermittently-connected networks and vehicular ad hoc network is one of delay-tolerant network application which used to enable services and applications by trusting their operation on cooperation between network nodes to share their network resource like a buffer, bandwidth, and energy, in the situation where end-to-end connectivity is not available. But due to the limitation of this network resource, the nodes on this network can be cooperative or non-cooperative, in non-cooperative network environment selfish nodes may receive bundles from other nodes and dropping them immediately after that for the intent of saving their resource. To come up with this problem the existing method which done by other researcher used incentive mechanism by considering the effort of network nodes in terms of time spent to cooperate, to manage those non-cooperative nodes was not good enough, so by considering it, this thesis proposed an efficient incentive-based node cooperation for a vehicular delay-tolerant network. The proposed solution used the concept of Pareto's principle to manage selfish nodes which are not proposed or used in the existing work. For the simulation, Opportunistic Network Environment Simulator is used. The proposed system is applied to the binary version of Spray-and-Wait routing protocol. The existing incentive approach and the proposed incentive approach has been evaluated, in addition, they were analyzed on three different metrics namely bundle delivery probability, bundle average delay and protocol overhead ratio. Consequently, across all the experiments the simulation results obtained in this thesis show that for the proposed routing approach, the bundle delivery probability is very high, low protocol overhead ratio and bundle average delay.