Strong connectivity of sensor networks with double antennae

Authors:
Mohsen Eftekhari Hesari;Evangelos Kranakis;Fraser MacQuarie;Oscar Morales-Ponce;Lata Narayanan
Affiliations:
Department of Computer Science and Software Engineering, Concordia University, Montreal, Quebec, Canada;School of Computer Science, Carleton University, Ottawa, Canada;School of Computer Science, Carleton University, Ottawa, Canada;School of Computer Science, Carleton University, Ottawa, Canada;Department of Computer Science and Software Engineering, Concordia University, Montreal, Quebec, Canada
Venue:
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Year:
2012

Citing 10
Cited 1

Mobile communications

Mobile communications
Introduction to algorithms

Introduction to algorithms
How is the capacity of ad hoc networks improved with directional antennas?

Wireless Networks
Computational Geometry: Algorithms and Applications

Computational Geometry: Algorithms and Applications
Communication in wireless networks with directional antennas

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Strong connectivity in sensor networks with given number of directional antennae of bounded angle

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Switching to directional antennas with constant increase in radius and hop distance

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Directional versus omnidirectional antennas for energy consumption and k-connectivity of networks of sensors

OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
The capacity of wireless networks

IEEE Transactions on Information Theory
Guaranteed performance heuristics for the bottleneck travelling salesman problem

Operations Research Letters

Approximation algorithms for the antenna orientation problem

FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

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 φπ/3, we show that the problem is NP-complete to approximate within a factor $\sqrt{3}$. For φ≥π/2, we give an algorithm to orient the antennae so that the resulting network has a stretch factor of at most 4 compared to the underlying unit disk graph.