Skip to main content
Log in

Switching to Directional Antennas with Constant Increase in Radius and Hop Distance

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

For any angle α<2π, we show that any connected communication graph that is induced by a set P of n transceivers using omni-directional antennas of radius 1, can be replaced by a strongly connected communication graph, in which each transceiver in P is equipped with a directional antenna of angle α and radius r dir, for some constant r dir=r dir(α). Moreover, the new communication graph is a c-spanner of the original graph, for some constant c=c(α), with respect to number of hops.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Ackerman, E., Gelander, T., Pinchasi, R.: Ice-creams and wedge graphs. Comput. Geom. Theory Appl. 46(3), 213–218 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  2. Ben-Moshe, B., Carmi, P., Chaitman, L., Katz, M.J., Morgenstern, G., Stein, Y.: Direction assignment in wireless networks. In: Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG’10), pp. 39–42 (2010)

    Google Scholar 

  3. Bhattacharya, B., Hu, Y., Shi, Q., Kranakis, E., Krizanc, D.: Sensor network connectivity with multiple directional antennae of a given angular sum. In: Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing (IPDPS’09), pp. 1–11 (2009)

    Chapter  Google Scholar 

  4. Bose, P., Guibas, L., Lubiw, A., Overmars, M., Souvaine, D., Urrutia, J.: The floodlight problem. Int. J. Comput. Geom. Appl. 7(1/2), 153–163 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  5. Caragiannis, I., Kaklamanis, C., Kranakis, E., Krizanc, D., Wiese, A.: Communication in wireless networks with directional antennas. In: Proceedings of the 20th Symposium on Parallelism in Algorithms and Architectures (SPAA’08), pp. 344–351 (2008)

    Google Scholar 

  6. Carmi, P., Katz, M.J., Lotker, Z., Rosén, A.: Connectivity guarantees for wireless networks with directional antennas. Comput. Geom. Theory Appl. 44(9), 477–485 (2011)

    Article  MATH  Google Scholar 

  7. Damian, M., Flatland, R.: Spanning properties of graphs induced by directional antennas. In: Electronic Proceedings of the 20th Fall Workshop on Computational Geometry, Stony Brook, NY (2010)

    Google Scholar 

  8. Dobrev, S., Kranakis, E., Krizanc, E., Morales, O., Opatrny, J., Stacho, L.: Strong connectivity in sensor networks with given number of directional antennae of bounded angle. In: Proceedings of the 4th International Conference on Combinatorial Optimization and Applications (COCOA’10), Part II. LNCS, vol. 6509, pp. 72–86 (2010)

    Chapter  Google Scholar 

  9. Kranakis, E., Krizanc, D., Morales, O.: Maintaining connectivity in sensor networks using directional antennae. In: Nikoletseas, S., Rolim, J. (eds.) Theoretical Aspects of Distributed Computing in Sensor Networks, Part 2, pp. 59–84. Springer, Berlin (2011). ISBN 978-3-642-14848-4

    Chapter  Google Scholar 

  10. Mietzner, J., Schober, R., Lampe, L., Gerstacker, W.H., Hoeher, P.A.: Multiple-antenna techniques for wireless communications—a comprehensive literature survey. IEEE Commun. Surv. Tutor. 11(2), 87–105 (2009)

    Article  Google Scholar 

  11. van Nijnatten, F.: Range assignment with directional antennas. Master’s thesis, Technische Universiteit Eindhoven (2008)

Download references

Acknowledgements

Many thanks to the Fields Institute for financial support, and to the participants at the Fields Institute Workshop on Discrete and Computational Geometry, Ottawa, December 2010, for helpful discussions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Matthew J. Katz.

Additional information

A preliminary version of this paper appeared in the Proceedings of the 2011 Algorithms and Data Structures Symposium, LNCS 6844.

Bose’s and Maheshwari’s research is partially supported by NSERC. Carmi’s research is partially supported by grant 2240-2100.6/2009 from the German Israeli Foundation for scientific research and development (GIF). Damian’s research is partially supported by NSF grant 1218814. Katz’s research is partially supported by grant 1045/10 from the Israel Science Foundation, and by the Israel Ministry of Industry, Trade and Labor (consortium CORNET).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bose, P., Carmi, P., Damian, M. et al. Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. Algorithmica 69, 397–409 (2014). https://doi.org/10.1007/s00453-012-9739-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-012-9739-y

Keywords

Navigation