Dynamic master selection in wireless networks

Maurits de Graaf

Research output: Book/Report › Report › Professional

78 Downloads (Pure)

Abstract

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
Number of pages7
Publication statusPublished - Dec 2011

Publication series

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

Keywords

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

Access to Document

    • 1 Conference contribution

    • Dynamic Master selection in wireless networks

      de Graaf, M., 2011, Proceedings of the 3rd Wireless World Workshop (W3). Dimitrova, D. C., Blom, K. C. H. & Meratnia, N. (eds.). Enschede, the Netherlands: Centre for Telematics and Information Technology (CTIT), 6 p. (CTIT workshop proceedings series; vol. WP 11-05).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic

      Open Access
      File
      66 Downloads (Pure)

    Cite this