Search

Abstract: In this paper scheduling communications in data gathering networks is analyzed. We study collecting information by a set of sensors, each of which stores the data in its memory buffer and then passes them to a base station. The network lifetime ends as soon as the first node is out of memory. We use a divisible load model to propose a communication scheduling algorithm that maximizes the system lifetime, and hence, the total amount of gathered information. The influence of the sensor communication rates on the obtained schedules is exposed in a series of computational experiments. [Copyright &y& Elsevier]

Abstract: Let γ(P m □ C n ) denote the domination number of the cylindrical grid graph formed by the Cartesian product of the graphs P m , the path of length m, m ⩾2 and the graph C n , the cycle of length n, n ⩾3. In this paper, methods to find the domination numbers of graphs of the form P m □ C n with n ⩾3 and m =2, 3 and 4 are proposed. Moreover, bounds on domination numbers of the graphs P 5 □ C n , n ⩾3 are found. The methods that are used to prove that results readily lead to algorithms for finding minimum dominating sets of the above mentioned graphs. [ABSTRACT FROM AUTHOR]