The strong connectivity of a directed graph associated with the communication network
topology is crucial in ensuring the convergence of many distributed estimation/control …

Charger placement is an important problem in improving the quality of service in wireless
rechargeable sensor networks. This paper studies the problem of W ireless Ch A rger …

Graph augmentation problems are motivated by network design and have been studied
extensively in optimization. We consider augmentation problems over plane geometric …

Digital media manipulation has become easily performed at personal level with the rapidly
growth of Technology. Presenting an issue of protecting digital media integrity …

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 …

Connectivity in wireless sensor networks may be established using either omnidirectional or
directional antennae. The former radiate power uniformly in all directions while the latter …

Consider a set S of nodes in the plane such that the unit-disk graph G (S) spanning all
nodes is connected. Each node in S is equipped with a directional antenna with beam-width …

We consider the following Antenna Orientation Problem: Given a connected Unit Disk Graph
(UDG) formed by n identical omnidirectional sensors, what is the optimal range (or radius) …

What is the minimum angle α> 0 such that given any set of α-directional antennas (that is,
antennas each of which can communicate along a wedge of angle α), one can always …

We study the problem of connectivity in wireless networks in which each node uses a single
directional antenna. We consider the symmetric model of communication with directional …