Centre for Telematics and Information Technology, University of Twente
Abstract
Mobile wireless communication systems often need to maximize their network lifetime (defined as the time until the first node runs out of energy). In the broadcast network lifetime problem, all nodes are sending broadcast traffic, and one asks for an assignment of transmit powers to nodes, and for sets of relay nodes so that the network lifetime is maximized. The selection of a relay set consisting of a single node (the ‘master’), can be regarded as a special case of this problem. We provide a mean value analysis of algorithms controlling the selection of a master node with the objective of maximizing the network lifetime. The results show that already for small networks simple algorithms can extend the average network lifetime considerably
