Performance analysis of a cooperative flow game algorithm in ad hoc networks and a comparison to Dijkstra's algorithm

,Serap Ergün,Gerhard Wilhelm Weber,Tuncay Aydoǧan,,Poznan University Of Technology, Faculty Of Engineering Management, Poznan, Poland ,Sirma Zeynep Alparslan Gök

doi:10.3934/jimo.2018086

Abstract

The aim of this study is to provide a mathematical framework for studying node cooperation, and to define strategies leading to optimal node behaviour in ad hoc networks. In this study we show time performances of three different methods, namely, Dijkstra's algorithm, Dijkstra's algorithm with battery times and cooperative flow game algorithm constructed from a flow network model. There are two main outcomes of this study regarding the shortest path problem which is that of finding a path of minimum length between two distinct vertices in a network. The first one finds out which method gives better results in terms of time while finding the shortest path, the second one considers the battery life of wireless devices on the network to determine the remaining nodes on the network. Further, optimization performances of the methods are examined in finding the shortest path problem. The study shows that the battery times play an important role in network routing and more devices provided to keep the network. To view the time performance analysis of the methods MATLAB is used. Also, considering the cooperation between the nodes, it is envisaged that using cooperative game theory brings a new approach to network traffic engineering and routing methods.

Highlights

Wireless networks are considered necessary for the support of emerging services with their increasing requirements and are characterized by a distributed, dynamic, self-organizing architecture
We compare Dijkstra’s algorithm, Dijkstra’s algorithm with battery times and cooperative flow game algorithm constructed from flow network model in an ad hoc network in Section 4, and we devote this section to give simulation results
We try to show the performances of three different methods in an ad hoc network within the shortest path problem

Summary

Introduction

Wireless networks are considered necessary for the support of emerging services with their increasing requirements and are characterized by a distributed, dynamic, self-organizing architecture. These wireless networks are categorized according to their specific characteristics. Typical examples are ad hoc, mesh, sensor, cognitive radio networks, etc. An ad hoc network is a wireless network without any fixed infrastructure or centralized control. The operation of the network is based on cooperation. The terminals in the network cooperate and relay the traffic of each other with inter-terminals [27].

Objectives

Methods

Findings

Conclusion