Energy efficient networking via dynamic relay node selection in wireless networks

Mobile wireless ad hoc 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...

Full description

Saved in:
Bibliographic Details
Published in:Ad hoc networks 2013-05, Vol.11 (3), p.1193-1201
Main Author: de Graaf, Maurits
Format: Article
Language:English
Subjects:
Ad hoc networks
Applied sciences
Average case analysis
Broadcasting
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Dynamics
Exact sciences and technology
Network lifetime
Networks
Optimization
Radiocommunications
Random graphs
Relay
Relaying
Software
Telecommunications
Telecommunications and information theory
Wireless networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Mobile wireless ad hoc 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 preliminary analysis of such a ‘dynamic master selection’ algorithm, comparing relaying to direct routing.
ISSN:1570-8705
1570-8713
DOI:10.1016/j.adhoc.2013.01.003