Polynomial time approximation scheme for t-latency bounded information propagation problem in heterogeneous wireless networks

Abstract

In a network sometimes we need to propagate information within a given time period t, which is called t-latency. Any node that accepts information from the other nodes will start transmitting that information if it satisfies the required conditions of the protocol that is in use. In a t-latency bounded information propagation problem, we need to find a minimal set of nodes that will start to transmit information initially so that the whole set of nodes can start transmitting within the given time period, t. In this paper we provide an approximation scheme for a t-latency bounded information propagation problem in heterogeneous wireless networks and we are the first to propose such scheme. We also derive the approximation ratio of our scheme and show that the ratio is bounded by a factor ε which is constant for a particular network.