Assign ranges in general ad-hoc networks

Authors:
Janka Chlebíková;Deshi Ye;Hu Zhang
Affiliations:
Faculty of Mathematics, Physics and Informatics, Comenius University, Mlynská dolina, Bratislava, Slovakia;Department of Mathematics, Zhejiang University, Hangzhou, China;Department of Computing and Software, McMaster University, Hamilton, ON, Canada
Venue:
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Year:
2005

Citing 10
Cited 1

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Packet-radio routing

Routing in communications networks
New approximation techniques for some ordering problems

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Power consumption in packet radio networks

Theoretical Computer Science
Steiner points in tree metrics don't (really) help

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function

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
The minimum broadcast range assignment problem on linear multi-hop wireless networks

Theoretical Computer Science
Probabilistic approximation of metric spaces and its algorithmic applications

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science

Recent advances on approximation algorithms for minimum energy range assignment problems in ad-hoc wireless networks

CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the Minimum Range Assignment problem in static ad-hoc networks with arbitrary structure, where the transmission distances can violate triangle inequality. We consider two versions of the Minimum Range Assignment problem, where the communication graph has to fulfill either the h-strong connectivity condition (Min-Range(h-SC)) or the h-broadcast condition (Min-Range(h-B)). Both homogeneous and non-homogeneous cases are studied. By approximating arbitrary edge-weighted graphs by paths, we present probabilistic O(log n)-approximation algorithms for Min-Range(h-SC) and Min-Range(h-B), which improves the previous best ratios O(log n loglog n) and O(n2log n loglog n), respectively [21]. The result for Min-Range(h-B) matches the lower bound [20] for the case that triangle inequality for transmission distance holds (which is a special case of our model). Furthermore, we show that if the network fulfils certain property and the distance power gradient α is sufficiently small, the approximation ratio is improved to O((loglog n)α).