Dynamic Master selection in wireless networks

D.C. Dimitrova (Editor), Maurits de Graaf, K.C.H. Blom (Editor), Nirvana Meratnia (Editor)

Research output: Contribution to conferencePaperAcademic

13 Downloads (Pure)


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
Number of pages6
Publication statusPublished - 27 Sep 2011
Event3rd Wireless World Workshop, W3 2011 - Enschede, Netherlands
Duration: 27 Sep 201127 Sep 2011
Conference number: 3


Workshop3rd Wireless World Workshop, W3 2011
Abbreviated titleW3 2011


  • IR-79781

Cite this