ABSTRACT

Let G = (V,E) be a graph which models a set of wireless devices (nodes V) that can communicate by means of multiple radio interfaces , according to activating the common interface rule at each node. Every Interface can be modeled as the (Edges E). A connection is satisfied (activated) between any two nodes in the network if each pair of node at least has a single wireless interface in common. In general, every node holds a subset of all possible k interfaces. Such networks are known as multi-interface networks. In such networks, we study and analyze the basic problem called Cheapest Paths. Shortest path problem is a well known concept in graphtheory. Standard shortest or the cheapest path algorithm such as the Distributed Bellman-Ford Algorithm were used to determine the cheapest path in the multi-interface scenario.