A Distributed Composite Multiple Criteria Routing Using Distance Vector

In this paper, we develop a distributed composite multiple criteria routing approach for wireless networks. Unlike wired networks, wireless network nodes contain limited energy for packet transmission, and link connections are unreliable. This necessitates consideration of other routing metrics in addition to latency to achieve optimal network operations. Current network routing algorithms consider only one criterion (e.g. latency, energy, etc.) as a routing metric. Routing criteria are usually conflicting and competing, i.e. one cannot find a route that minimizes total energy consumption, latency and bit error rate simultaneously. The purpose of this paper is to develop new routing methods that can optimize routing considering multiple criteria simultaneously and find the best compromise solution with respect to the user´s preferences. This paper illustrates one specific multiple criteria decision making (MCDM) method, namely, normalized weighted additive utility function (NWAUF) for solving multiple criteria routing. We first develop a global optimal multiple criteria solution. We then develop a distributed multiple criteria routing. We demonstrate that the distributed multiple criteria routing can obtain the global multiple criteria solution for selected network problems with reasonable computational time. Extensive simulation results are presented