Energy-Efficient Communication in Multi-interface Wireless Networks

Authors:
Stavros Athanassopoulos;Ioannis Caragiannis;Christos Kaklamanis;Evi Papaioannou
Affiliations:
Research Academic Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, Rio, Greece 26500;Research Academic Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, Rio, Greece 26500;Research Academic Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, Rio, Greece 26500;Research Academic Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, Rio, Greece 26500
Venue:
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Year:
2009

Citing 0
Cited 4

Minimizing the maximum duty for connectivity in multi-interface networks

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Min-max coverage in multi-interface networks

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Bandwidth constrained multi-interface networks

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Maximum matching in multi-interface networks

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study communication problems in wireless networks supporting multiple interfaces. In such networks, two nodes can communicate if they are close and share a common interface. The activation of each interface has a cost reflecting the energy consumed when a node uses this interface. We distinguish between the symmetric and non-symmetric case, depending on whether all nodes have the same activation cost for each interface or not. For the symmetric case, we present a (3/2 + 驴)---approximation algorithm for the problem of achieving connectivity with minimum activation cost, improving a previous bound of 2. For the non-symmetric case, we show that the connectivity problem is not approximable within a sublogarithmic factor in the number of nodes and present a logarithmic approximation algorithm for a more general problem that models group communication.