Optimal Relay Location for Resource-Limited Energy-Efficient Wireless Communication
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Optimal Relay Location for Resource-Limited Energy-Efficient Wireless Communication
Published Date
2002-03-26
Publisher
Type
Report
Abstract
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 with deploying additional relay nodes.Let P={p1, ..., pn} be a set of n terminals in the Euclideanplane. For a positive integer k, the bottleneck Steinertree problem (BSTP) asks to find a Steiner tree with atmost k Steiner points such that the length of the longest edge in the tree is minimized. We give a ratio - sqrt(3) + e polynomial time approximation algorithm for BSTP, where e is an arbitrary positive number.Keywords:wireless networks, power efficient, approximation algorithms, Steiner tree, bottleneck Steiner tree.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Cardei, Ionut; Cardei, Mihaela; Wang, Lusheng; Xu, Baogang; Du, Ding-Zhu. (2002). Optimal Relay Location for Resource-Limited Energy-Efficient Wireless Communication. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215516.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.