Improved multi-criteria spanners for ad-hoc networks under energy and distance metrics

Authors:
Michael Segal;Hanan Shpungin
Affiliations:
Dept. of Communication Systems Engineering, Ben-Gurion University of the Negev, Beer-Sheva, Israel;Dept. of Computer Science, University of Calgary, Calgary, AB, Canada
Venue:
INFOCOM'10 Proceedings of the 29th conference on Information communications
Year:
2010

Citing 17
Cited 1

There is a planar graph almost as good as the complete graph

SCG '86 Proceedings of the second annual symposium on Computational geometry
A sparse graph almost as good as the complete graph on points in K dimensions

Discrete & Computational Geometry
New sparseness results on graph spanners

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Classes of graphs which approximate the complete Euclidean graph

Discrete & Computational Geometry
On sparse spanners of weighted graphs

Discrete & Computational Geometry
Wireless information networks

Wireless information networks
Power consumption in packet radio networks

Theoretical Computer Science
Distributed computing: a locality-sensitive approach

Distributed computing: a locality-sensitive approach
Does topology control reduce interference?

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Approximate distance oracles

Journal of the ACM (JACM)
Algorithmic aspects of topology control problems for ad hoc networks

Mobile Networks and Applications
Reducing interference in ad hoc networks through topology control

DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Fault-Tolerant Power Assignment and Backbone in Wireless Networks

PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Computing a minimum-dilation spanning tree is NP-hard

CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Asymptotic critical total power for k-connectivity of wireless networks

IEEE/ACM Transactions on Networking (TON)
Computing geometric minimum-dilation graphs is NP-hard

GD'06 Proceedings of the 14th international conference on Graph drawing
On spanners of geometric graphs

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory

Robust geometric spanners

Proceedings of the twenty-ninth annual symposium on Computational geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the problem of topology control in random wireless ad-hoc networks through power assignment for n nodes uniformly distributed in a unit square. In particular, we are interested in asymmetric power assignments so that the induced communication graph has a good distance and energy stretch simultaneously, with additional optimization objectives: both minimizing the total energy consumption, interference level, hop-diameter, and maximizing the network lifetime. We present several power assignments with varying construction time complexity. The probability of our results converges to one as the number of network nodes, n, increases. To the best of our knowledge, these are the first results for spanner construction in wireless ad-hoc networks with provable bounds for both, energy and distance, metrics simultaneously.