Dynamic Master selection in wireless networks

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

23 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 languageEnglish
Title of host publicationProceedings of the 3rd Wireless World Workshop (W3)
EditorsD.C. Dimitrova, K.C.H. Blom, N. Meratnia
Place of PublicationEnschede, the Netherlands
PublisherCentre for Telematics and Information Technology (CTIT)
Number of pages6
Publication statusPublished - 2011
Event3rd Wireless World Workshop, W3 2011 - Enschede, Netherlands
Duration: 27 Sep 201127 Sep 2011
Conference number: 3

Publication series

NameCTIT workshop proceedings series
VolumeWP 11-05
ISSN (Print)0929-0672


Workshop3rd Wireless World Workshop, W3 2011
Abbreviated titleW3 2011


Dive into the research topics of 'Dynamic Master selection in wireless networks'. Together they form a unique fingerprint.

Cite this