Abstract
One of the most critical factors for lifetime and operability of ad-hoc and sensor networks is the limited amount of available energy. To this respect, minimizing the interference in the network has certainly a positive effect, since of the reduced number of conflicting transmissions. However, quite surprisingly, only few theoretical results are known about the possibility to maintain the interference low while at the same time guaranteeing certain network connectivity properties. In this paper, we give a contribution in this direction, and we study several network interference measures with respect to the symmetric connectivity, the strong connectivity, and the broadcast connectivity predicate.
In particular, we show that the probably most prominent interference problem, namely that of minimizing the maximum interference experienced by any node in the network, is hard to approximate within better than a logarithmic factor, unless NP admits slightly superpolynomial time algorithms, for any of the above connectivity predicates. On a positive side, we show that any approximation algorithm for the problem of minimizing the total range assigned to the nodes in order to guarantee any of the above connectivity predicates, can be transformed, by maintaining the approximation ratio, into an approximation algorithm for the problem of minimizing the total interference experienced by all the nodes in the network.
Work partially supported by the Research Project GRID.IT, funded by the Italian Ministry of Education, University and Research and by the European Union under IST FET Integrated Project 015964 AEOLUS and COST Action 293 GRAAL.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Burkhart, M., von Rickenbach, P., Wattenhofer, R., Zollinger, A.: Does topology control reduce interference? In: Proc. of the 5th ACM Int. Symp. on Mobile Ad Hoc Networking and Computing (MOBIHOC 2004), pp. 9–19 (2004)
Calinescu, G., Kapoor, S., Olshevsky, A., Zelikovsky, A.: Network lifetime and power assignment in ad hoc wireless networks. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 114–126. Springer, Heidelberg (2003)
Caragiannis, I., Kaklamanis, C., Kanellopolous, P.: Energy-efficient wireless network design. Theory of Computing Systems (to appear)
Cheriyan, J., Ravi, R.: Lecture Notes on Approximation Algorithms for Network Problems
Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: On the complexity of computing minimum energy consumption broadcast subgraphs. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 121–131. Springer, Heidelberg (2001)
Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM 45(4), 634–652 (1998)
Fussen, M., Wattenhofer, R., Zollinger, A.: On interference reduction in sensor networks, Technical report, ETH Zürich, Dept. of Computer Science (2004)
Jia, L., Rajaraman, R., Scheideler, C.: On local algorithms for topology control and routing in ad-hoc networks. In: Proc. of the 15th Symposium on Parallel Algorithms and Architectures (SPAA 2003), pp. 220–229 (2003)
Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theoretical Computer Science 243, 289–305 (2000)
Li, L., Halpern, J.Y., Bahl, P., Wang, Y.-M., Wattenhofer, R.: Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks. In: Proc. of the 20th Symp. on Principles of Distributed Computing (PODC 2001), pp. 264–273 (2001)
Li, N., Hou, J., Sha, L.: Design and analysis of an MST-based topology control algorithm. In: Proc. of the 22th IEEE Conf. on Computer Communications (INFOCOM 2003), pp. 1702–1712 (2003)
Li, X.-Y., Calinescu, G., Wan, P.-J.: Distributed construction of planar spanner and routing for ad-hoc networks. In: Proc. of the 20th IEEE Conf. on Computer Communications (INFOCOM 2001) (2002)
Liang, W.: Constructing minimum-energy broadcast trees in wireless ad-hoc networks. In: Proc. 3rd ACM Int. Symp. on Mobile ad-hoc Networking and Computing (MOBIHOC 2002), pp. 112–122 (2002)
Meyer auf der Heide, F., Schiundelhauer, C., Volbert, K., Grunewald, M.: Energy, congestion and dilatation in radio networks. In: Proc. of the 14th ACM Symp. on Parallel Algorithms and Architectures (SPAA 2002), pp. 230–237 (2002)
Moscibroda, T., Wattenhofer, R.: Minimizing interference in ad-hoc and sensor networks. In: Proc. of the Joint Workshop on Foundations of Mobile Computing (DIALM-POMC 2005), pp. 24–33 (2005)
Ramanathan, R., Hain, R.: Topology control of multihop wireless networks using transmit power adjustment. In: Proc. of the 19th IEEE Conf. on Computer Communications (INFOCOM 2000), pp. 404–413 (2000)
Rossi, G.: The Range Assignment Problem in Static Ad-Hoc Wireless Networks, Universitá di Roma “Tor Vergata”, Ph.D. Thesis (2003)
Von Rickenbach, P., Schmid, S., Wattenhofer, R., Zollinger, A.: A robust interference model for wireless ad-hoc networks. In: 5th International Workshop on Algorithms for Wireless, Mobile, Ad-hoc and Sensor Networks (WMAN 2005), Denver, Colorado, USA (April 2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bilò, D., Proietti, G. (2006). On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks. In: Nikoletseas, S.E., Rolim, J.D.P. (eds) Algorithmic Aspects of Wireless Sensor Networks. ALGOSENSORS 2006. Lecture Notes in Computer Science, vol 4240. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11963271_2
Download citation
DOI: https://doi.org/10.1007/11963271_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69085-6
Online ISBN: 978-3-540-69087-0
eBook Packages: Computer ScienceComputer Science (R0)