Energy-Efficient Wireless Network Design

Authors:
Ioannis Caragiannis;Christos Kaklamanis;Panagiotis Kanellopoulos
Affiliations:
Research Academic Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, 26500 Rio, Greece;Research Academic Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, 26500 Rio, Greece;Research Academic Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, 26500 Rio, Greece
Venue:
Theory of Computing Systems
Year:
2006

Citing 0
Cited 10

Communication in wireless networks with directional antennas

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
On the complexity of minimizing interference in ad-hoc and sensor networks

Theoretical Computer Science
On the complexity of the regenerator placement problem in optical networks

Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
On minimum power connectivity problems

Journal of Discrete Algorithms
On minimum power connectivity problems

ESA'07 Proceedings of the 15th annual European conference on Algorithms
Approximating minimum power covers of intersecting families and directed edge-connectivity problems

Theoretical Computer Science
Connectivity guarantees for wireless networks with directional antennas

Computational Geometry: Theory and Applications
On the complexity of the regenerator placement problem in optical networks

IEEE/ACM Transactions on Networking (TON)
An exponential improvement on the MST heuristic for minimum energy broadcasting in ad hoc wireless networks

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
An exponential improvement on the MST heuristic for minimum energy broadcasting in ad hoc wireless networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A crucial issue in wireless networks is to support efficiently communication patterns that are typical in traditional (wired) networks. These include broadcasting, multicasting, and gossiping (all-to-all communication). In this work we study such problems in static ad hoc networks. Since, in ad hoc networks, energy is a scarce resource, the important engineering question to be solved is to guarantee a desired communication pattern minimizing the total energy consumption. Motivated by this question, we study a series of wireless network design problems and present new approximation algorithms and inapproximability results.