Dynamic Master selection in wireless networks

D.C. Dimitrova; Maurits de Graaf; K.C.H. Blom; Nirvana Meratnia

Dynamic Master selection in wireless networks

D.C. Dimitrova (Editor), Maurits de Graaf, K.C.H. Blom (Editor), Nirvana Meratnia (Editor)

Stochastic Operations Research

Research output: Contribution to conference › Paper › Academic

13 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	Undefined
Number of pages	6
Publication status	Published - 27 Sep 2011
Event	3rd Wireless World Workshop, W3 2011 - Enschede, Netherlands Duration: 27 Sep 2011 → 27 Sep 2011 Conference number: 3

Workshop

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

Keywords

IR-79781

Access to Document

Graaf11dynamic
open

Cite this

@conference{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.",

keywords = "IR-79781",

author = "D.C. Dimitrova and {de Graaf}, Maurits and K.C.H. Blom and Nirvana Meratnia",

year = "2011",

month = sep,

day = "27",

language = "Undefined",

note = "null ; Conference date: 27-09-2011 Through 27-09-2011",

}

TY - CONF

T1 - Dynamic Master selection in wireless networks

AU - de Graaf, Maurits

A2 - Dimitrova, D.C.

A2 - Blom, K.C.H.

A2 - Meratnia, Nirvana

N1 - Conference code: 3

PY - 2011/9/27

Y1 - 2011/9/27

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.

KW - IR-79781

M3 - Paper

Y2 - 27 September 2011 through 27 September 2011

ER -