We consider a 3D antenna orientation problem for maintaining connectivity of a wireless
network in 3D space using only directional antennae. Sensors are located at points in 3D …

We analyze various critical transmitting/sensing ranges for connectivity and coverage in
three-dimensional sensor networks. As in other large-scale complex systems, many global …

Let P be a set of points in the plane, representing transceivers equipped with a directional
antenna of angle α and range r. The coverage area of the antenna at point p is a circular …

Given a set of points Q in the plane, define the r2-Disk Graph, Q (r), as a generalized version
of the Unit Disk Graph: the vertices of the graph is Q and there is an edge between two …

We study a problem of energy-efficiently connecting a symmetric wireless communication
network: given an n-vertex graph with edge weights, find a connected spanning subgraph of …

We study the problem of maintaining connectivity in a wireless network where the network
nodes are equipped with directional antennas. Nodes correspond to points on the plane and …

This paper addresses the problem of finding an orientation and a minimum radius for
directional antennas of a fixed angle placed at the points of a planar set S, that induce a …

We give an algorithm for constructing a connected spanning subgraphs (panner) of a
wireless network modelled as a unit disk graph with nodes of irregular transmission ranges …

We consider a wireless sensor network in which each sensor is able to transmit within a disk
of radius one. We show with elementary techniques that there exists a constant c such that if …

Let S be a set of points in the plane, such that the unit disk graph with vertex set S is
connected. We address the problem of finding orientations and a minimum radius for …