Dynamic Master selection in wireless networks

Maurits de Graaf

doi:10.3990/2.268631049

Dynamic Master selection in wireless networks

Maurits de Graaf

Stochastic Operations Research

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

23 Downloads (Pure)

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	English
Title of host publication	Proceedings of the 3rd Wireless World Workshop (W3)
Editors	D.C. Dimitrova, K.C.H. Blom, N. Meratnia
Place of Publication	Enschede, the Netherlands
Publisher	Centre for Telematics and Information Technology (CTIT)
Number of pages	6
DOIs	https://doi.org/10.3990/2.268631049
Publication status	Published - 2011
Event	3rd Wireless World Workshop, W3 2011 - Enschede, Netherlands Duration: 27 Sep 2011 → 27 Sep 2011 Conference number: 3

Publication series

Name	CTIT workshop proceedings series
Publisher	CTIT
Volume	WP 11-05
ISSN (Print)	0929-0672

Workshop

Workshop	3rd Wireless World Workshop, W3 2011
Abbreviated title	W3 2011
Country/Territory	Netherlands
City	Enschede
Period	27/09/11 → 27/09/11

Access to Document

10.3990/2.268631049

Graaf11dynamicFinal published version, 184 KB

Cite this

@inproceedings{d63e08d525b8489692a18853ccdd3e33,

title = "Dynamic Master selection in wireless networks",

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 {\textquoteleft}master{\textquoteright}), 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 {\textquoteleft}dynamic master selection{\textquoteright} algorithm.",

author = "{de Graaf}, Maurits",

year = "2011",

doi = "10.3990/2.268631049",

language = "English",

series = "CTIT workshop proceedings series",

publisher = "Centre for Telematics and Information Technology (CTIT)",

editor = "D.C. Dimitrova and K.C.H. Blom and N. Meratnia",

booktitle = "Proceedings of the 3rd Wireless World Workshop (W3)",

address = "Netherlands",

note = "3rd Wireless World Workshop, W3 2011, W3 2011 ; Conference date: 27-09-2011 Through 27-09-2011",

}

de Graaf, M 2011, Dynamic Master selection in wireless networks. in DC Dimitrova, KCH Blom & N Meratnia (eds), Proceedings of the 3rd Wireless World Workshop (W3). CTIT workshop proceedings series, vol. WP 11-05, Centre for Telematics and Information Technology (CTIT), Enschede, the Netherlands, 3rd Wireless World Workshop, W3 2011, Enschede, Netherlands, 27/09/11. https://doi.org/10.3990/2.268631049

Dynamic Master selection in wireless networks. / de Graaf, Maurits.

Proceedings of the 3rd Wireless World Workshop (W3). ed. / D.C. Dimitrova; K.C.H. Blom; N. Meratnia. Enschede, the Netherlands : Centre for Telematics and Information Technology (CTIT), 2011. (CTIT workshop proceedings series; Vol. WP 11-05).

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

TY - GEN

T1 - Dynamic Master selection in wireless networks

AU - de Graaf, Maurits

N1 - Conference code: 3

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

U2 - 10.3990/2.268631049

DO - 10.3990/2.268631049

M3 - Conference contribution

T3 - CTIT workshop proceedings series

BT - Proceedings of the 3rd Wireless World Workshop (W3)

A2 - Dimitrova, D.C.

A2 - Blom, K.C.H.

A2 - Meratnia, N.

PB - Centre for Telematics and Information Technology (CTIT)

CY - Enschede, the Netherlands

T2 - 3rd Wireless World Workshop, W3 2011

Y2 - 27 September 2011 through 27 September 2011

ER -

Dynamic Master selection in wireless networks

Abstract

Publication series

Workshop

Access to Document

Fingerprint

Cite this