Strong connectivity of sensor networks with double antennae

5Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Inspired by the well-known Dipole and Yagi antennae we introduce and study a new theoretical model of directional antennae that we call double antennae. Given a set P of n sensors in the plane equipped with double antennae of angle φ and with dipole-like and Yagi-like antenna propagation patterns, we study the connectivity and stretch factor problems, namely finding the minimum range such that double antennae of that range can be oriented so as to guarantee strong connectivity or stretch factor of the resulting network. We introduce the new concepts of (2,φ)-connectivity and φ-angular range r φ (P) and use it to characterize the optimality of our algorithms. We prove that r φ (P) is a lower bound on the range required for strong connectivity and show how to compute r φ (P) in time polynomial in n. We give algorithms for orienting the antennae so as to attain strong connectivity using optimal range when φ ≥ 2π/3, and algorithms approximating the range for φ ≥ π/2. For φ

Cite

CITATION STYLE

APA

Eftekhari Hesari, M., Kranakis, E., MacQuarie, F., Morales-Ponce, O., & Narayanan, L. (2012). Strong connectivity of sensor networks with double antennae. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7355 LNCS, pp. 99–110). https://doi.org/10.1007/978-3-642-31104-8_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free