Optimal Relay Location for Resource-limited Energy-efficient Wireless Communication

In the design of wireless networks, techniques for improving energy efficiency and extending network lifetime have great importance, particularly for defense and civil/rescue applications where resupplying transmitters with new batteries is not feasible. In this paper we study a method for improving...

Full description

Saved in:
Bibliographic Details
Published in:Journal of global optimization 2006-11, Vol.36 (3), p.391-399
Main Authors: Cardei, Ionut, Cardei, Mihaela, Wang, Lusheng, Xu, Baogang, Du, Ding-Zhu
Format: Article
Language:English
Subjects:
Algorithms
Approximation
Computer science
Connectivity
Energy efficiency
Graphs
Operations research
Optimization
Sensors
Studies
Traffic congestion
Wireless communications
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:In the design of wireless networks, techniques for improving energy efficiency and extending network lifetime have great importance, particularly for defense and civil/rescue applications where resupplying transmitters with new batteries is not feasible. In this paper we study a method for improving the lifetime of wireless networks by minimizing the length of the longest edge in the interconnecting tree by deploying additional relay nodes at specific locations. This optimization problem, known as the Bottleneck Steiner Tree Problem (BSTP), asks to find a Steiner tree for n terminals with at most k Steiner points such that the length of the longest edge in the tree is minimized. We present a ratio- 3 squared plus element of polynomial time approximation algorithm for BSTP, where element of is an arbitrary positive number. [PUBLICATION ABSTRACT]
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-006-9017-0