Dynamic master selection in wireless networks
Graaf de, Maurits (2011) Dynamic master selection in wireless networks. [Report]
| PDF 98Kb |
| 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. |
| Item Type: | Report |
| Faculty: | Electrical Engineering, Mathematics and Computer Science (EEMCS) |
| Research Group: | |
| Link to this item: | http://purl.utwente.nl/publications/78961 |
| Publisher URL: | http://www.math.utwente.nl/publications |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Repository Staff Only: item control page
Metis ID: 281628

Show download statistics for this publication
Show download statistics for this publication