Dynamic master selection in wireless networks

Research output: Book/ReportReportProfessional

26 Downloads (Pure)


Abstract. Mobile wireless networks 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 dynamic relay set consisting of a single node (the ‘master’), can be regarded as a special case, providing lower bounds to the optimal lifetime in the general setting. This paper provides a first analysis of a ‘dynamic master selection’ algorithm.
Original languageUndefined
Place of PublicationEnschede
PublisherUniversity of Twente, Department of Applied Mathematics
Number of pages7
Publication statusPublished - Dec 2011

Publication series

NameMemorandum / Department of Applied Mathematics
PublisherUniversity of Twente, Department of Applied Mathematics
ISSN (Print)1874-4850
ISSN (Electronic)1874-4850


  • Sensor Networks
  • Energy minimisation
  • Wireless
  • EWI-20963
  • IR-78961
  • METIS-281628

Cite this