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 language | Undefined |
|---|---|
| Place of Publication | Enschede |
| Publisher | University of Twente, Department of Applied Mathematics |
| Number of pages | 7 |
| Publication status | Published - Dec 2011 |
Publication series
| Name | Memorandum / Department of Applied Mathematics |
|---|---|
| Publisher | University 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
Cite this
de Graaf, M. (2011). Dynamic master selection in wireless networks. (Memorandum / Department of Applied Mathematics; No. 1964). Enschede: University of Twente, Department of Applied Mathematics.