An initial analysis of packet function-aware extension to Dijkstra algorithm for wireless networks

Mustafa Arisoylu

doi:10.1186/s13638-016-0544-1

Abstract

In this paper, we promote the packet function (e.g., packet size) -aware extension of the Dijkstra algorithm (i.e., PFA_SPF) as a base algorithm where any routing protocol can evolve it and integrate it with appropriate routing metrics. In particular, we propose a generic algorithm for packet function-aware path setup for multi-hop networks. The algorithm is based on a generic and novel extension of the classical Dijkstra algorithm in which the cost of each link is a non-negative-valued function of packet parameter(s) (e.g., packet size) rather than a scalar value. The algorithm minimizes the sum of the cost functions (e.g., total transmission delay or total energy consumption) experienced by each packet (e.g., maximizing the throughput) from the source to the destination node. We did initial analysis based on simulation of the algorithm for various random multi-hop wireless networks (e.g., 802.11), utilizing realistic link delay models. Finally, we demonstrate the initial significant potential performance improvements of our algorithm over the existing prior art.

Highlights

Our method proposes an extended idea where the cooperative communications are performed based on a packet function in an optimal way
2.4 Our contribution In this paper, we have extended the classical Dijkstra algorithm considering the link costs/metrics are functions of packet and link parameters to minimize the total cost function
The algorithm proposed in this paper is a generic algorithm which works for any network as long as the cost functions of the links are non-negative valued. We devise such an algorithm and simulate the algorithm for packet size-aware path setup over a basic 802.11-based multi-hop wireless network model as an initial example and demonstrate the significant potential performance improvements of our algorithm over the existing prior art

Summary

Introduction

Multi-hop wireless and wired networks and associated protocols are widely used and studied for various applications for residential, military, and emergency networking [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74]. We devise such an algorithm and simulate the algorithm for packet size-aware path setup over a basic 802.11-based multi-hop wireless network model as an initial example and demonstrate the significant potential performance improvements of our algorithm over the existing prior art (i.e., minimum hop-based path selection and path optimized for 1500 bytes). Any routing protocol based on our extended version of Dijkstra algorithm (PFA_SPF) can decide on the cost metrics (e.g., it could be packet size-based delay or energy consumption) and add other dimensions to the cost (e.g., loss rate, channel state) and use an evolved version of the algorithm to be able to realize a dynamic and optimized path setup.

Detailed description of the algorithm Initialization:

Validation of the model

Findings

60 Nodes 80 Nodes