Directional versus omnidirectional antennas for energy consumption and k-connectivity of networks of sensors

Authors:
Evangelos Kranakis;Danny Krizanc;Eric Williams
Affiliations:
School of Computer Science, Carleton University, Ottawa, Ontario, Canada;Department of Mathematics and Computer Science, Wesleyan University, Middletown, CT;Department of Mathematics and Computer Science, Wesleyan University, Middletown, CT
Venue:
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Year:
2004

Citing 10
Cited 11

Randomized algorithms

Randomized algorithms
Next century challenges: scalable coordination in sensor networks

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Next century challenges: mobile networking for “Smart Dust”

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
On k-connectivity for a geometric random graph

Random Structures & Algorithms
On the performance of ad hoc networks with beamforming antennas

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Embedded Everywhere: A Research Agenda for Networked Systems of Embedded Computers

Embedded Everywhere: A Research Agenda for Networked Systems of Embedded Computers
An Integrated Architecture for Cooperative Sensing Networks

Computer
Smart Dust: Communicating with a Cubic-Millimeter Computer

Computer
Asymptotic critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
The Critical Transmitting Range for Connectivity in Mobile Ad Hoc Networks

IEEE Transactions on Mobile Computing

Alleviating path correlation using directional antenna in node-disjoint multipath routing for mobile ad hoc networks

IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
iMST: A bandwidth-guaranteed topology control algorithm for TDMA-based ad hoc networks with sectorized antennas

Computer Networks: The International Journal of Computer and Telecommunications Networking
Communication in wireless networks with directional antennas

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Collision-free path coloring with application to minimum-delay gathering in sensor networks

Discrete Applied Mathematics
Asymptotic connectivity in wireless ad hoc networks using directional antennas

IEEE/ACM Transactions on Networking (TON)
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
Connectivity guarantees for wireless networks with directional antennas

Computational Geometry: Theory and Applications
Securing sensor networks: A novel approach that combines encoding, uncorrelation and node disjoint transmission

Ad Hoc Networks
Strong orientations of planar graphs with bounded stretch factor

SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Strong connectivity of sensor networks with double antennae

SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Strongly connected orientations of plane graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A network is k-connected if it remains connected after the removal of any k–1 of its nodes. Assume that n sensors, modeled here as (omni)directional antennas, are dropped randomly and independently with the uniform distribution on the interior of a unit length segment or a unit square. We derive sufficient conditions on the beam width of directional antennas so that the energy consumption required to maintain k-connectivity of the resulting network of sensors is lower when using directional than when using omnidirectional antennas. Our theoretical bounds are shown by experiment to be accurate under most circumstances. For the case of directional antennae, we provide simple algorithms for setting up a k-connected network requiring low energy.