Computational geometry: an introduction
Computational geometry: an introduction
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Wireless information networks
Power consumption in packet radio networks
Theoretical Computer Science
Constructing minimum energy mobile wireless networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Symmetric Connectivity with Minimum Power Consumption in Radio Networks
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
On the power assignment problem in radio networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
A Parallel Local Search Algorithm for Euclidean Steiner Tree Problem
SNPD-SAWN '06 Proceedings of the Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
Parallelization of local search for Euclidean Steiner tree problem
Proceedings of the 44th annual Southeast regional conference
Range Assignment Approximation Based on Steiner Tree in Ad Hoc Wireless Networks
AINA '08 Proceedings of the 22nd International Conference on Advanced Information Networking and Applications
Transmitting Range Assignments Using Steiner Tree in Ad Hoc Wireless Networks
ITNG '08 Proceedings of the Fifth International Conference on Information Technology: New Generations
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
Multiagent based information dissemination in vehicular ad hoc networks
Mobile Information Systems
Voronoi-based multi-level range search in mobile navigation
Multimedia Tools and Applications
Hi-index | 0.00 |
This paper describes an efficient method for introducing relay nodes in the given communication graph. Our algorithm assigns transmitting ranges to the nodes such that the cost of range assignment function is minimal over all connecting range assignments in the graph. The main contribution of this paper is the O(N log N) algorithm to add relay nodes to the wireless communication network and 2-approximation to assign transmitting ranges to nodes (original and relay). It does not assume that communication graph to be a unit disk graph. The output of the algorithm is the minimal Steiner tree on the graph consists of terminal (original) nodes and relay (additional) nodes. The output of approximation is the range assignments to the nodes.