Minimum Power Energy Spanners in Wireless Ad Hoc Networks

Abu-Affash, A. Karim; Aschner, Rom; Carmi, Paz; Katz, Matthew J.

doi:10.1109/infcom.2010.5462068

Cited by 11 publications

(8 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is somewhat surprising, since many variations on sparse geometric spanners have been studied, including spanners of low degree [6,19,36], spanners of low weight [14,24,26], spanners of low diameter [8,9], planar spanners [5,21,23,29], spanners of low chromatic number [13], fault-tolerant spanners [2,22,31,32], low-power spanners [4,34,37], kinetic spanners [1,3], angle-constrained spanners [20], and combinations of these [7,10,15,16,17,18]. The closest related work is that on fault-tolerant spanners [2,22,31,32], but r-fault-tolerance is analogous to the traditional definition of r-connectivity in graph theory and suffers the same shortcoming: every r-fault-tolerant spanner has Ω(rn) edges.…”

Section: Introductionmentioning

confidence: 99%

Robust geometric spanners

Bose

Dujmović

Morin

et al. 2013

Proceedings of the Twenty-Ninth Annual Symposium on Computational Geometry

View full text Add to dashboard Cite

Highly connected and yet sparse graphs (such as expanders or graphs of high treewidth) are fundamental, widely applicable and extensively studied combinatorial objects. We initiate the study of such highly connected graphs that are, in addition, geometric spanners. We define a property of spanners called robustness. Informally, when one removes a few vertices from a robust spanner, this harms only a small number of other vertices. We show that robust spanners must have a superlinear number of edges, even in one dimension. On the positive side, we give constructions, for any dimension, of robust spanners with a near-linear number of edges.

show abstract

Section: Introductionmentioning

confidence: 99%

Robust geometric spanners

Bose

Dujmović

Morin

et al. 2013

Proceedings of the Twenty-Ninth Annual Symposium on Computational Geometry

View full text Add to dashboard Cite

show abstract

“…Additional references may be found [Peleg 2000;Cohen 1998; Thorup and Zwick 2005;Eppstein 2000;Abu-Affash et al 2010].…”

Section: Notationmentioning

confidence: 99%

Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics

Shpungin

Segal

2013

ACM Trans. Sen. Netw.

View full text Add to dashboard Cite

We study the problem of spanner construction in wireless ad-hoc networks through power assignments under two spanner models-distance and energy. In particular, we are interested in asymmetric power assignments so that the induced communication graph holds good distance and energy stretch factors simultaneously. In addition, we consider the following optimization objectives: low total energy consumption, low interference level, low hopdiameter, and high network lifetime.Two node deployment scenarios are studied: random and deterministic. For n random nodes distributed uniformly and independently in a unit square, we present several power assignments with varying construction-time complexities. The results are based on various geometric properties of random points and shortest path tree constructions. Due to the probabilistic nature of this scenario, the probability of our results converges to one as the number of network nodes, n, increases. For the deterministic case, we present two power assignments with nontrivial bounds. These are established in addition to shortcut edges that satisfy desired threshold stretch. 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. Our power assignments, in addition, try optimizing additional network properties, such as network lifetime, interference, and hop diameter. ACM Reference Format:Shpungin, H. and Segal, M. 2013. Improved multicriteria spanners for ad-hoc networks under energy and distance metrics.

show abstract

“…Abu-Affash et al [3] studied the minimal energy spanner problem, they proved that for any constant t > 1, one can compute in O(n 2 log n) time a planar energy-t-spanner G , such that the cost of power assignment c(p) implied by G is at most 2(1 + 2/(t − 1)) × c(p * ), where p * is a minimum-cost power assignment.…”

Section: Related Workmentioning

confidence: 99%

“…Due to limited power sources, the idea of energy-t-spanner becomes an important design consideration in ad hoc networks. Much effort has been devoted to finding a power assignment that the induced graph is energy-t-spanner [1][2][3].…”

Section: Introductionmentioning

confidence: 99%

Interference-Aware Fault-Tolerant Energy Spanner in Wireless Ad Hoc Networks

Wang

Long

2012

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Power assignment in wireless ad hoc networks is an important issue of topology control which assigns power for each wireless node so that the induced communication graph satisfies some desired properties such as the connectivity and the energy spanner. In this paper, we study the problem of power assignment in order that its induced communication graph meets the following properties: (1) it is an energy-t-spanner which is energy efficient; (2) it is k-fault resistant which can withstand up to k − 1 node failures where k 1; (3) the interference is minimal. We propose algorithms to address this problem. Both the theoretic analysis and the simulations in the paper prove that our algorithms can induce a k-fault resistant energy spanner and furthermore the interference is minimized. To the best of our knowledge, this is the first paper to study the power assignment problem simultaneously considering spanner properties, the fault tolerance, and the interference reduction.

show abstract

Minimum Power Energy Spanners in Wireless Ad Hoc Networks

Cited by 11 publications

References 19 publications

Robust geometric spanners

Robust geometric spanners

Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics

Interference-Aware Fault-Tolerant Energy Spanner in Wireless Ad Hoc Networks

Contact Info

Product

Resources

About