We study an NP-hard problem motivated by energy-efficiently maintaining the connectivity of
a symmetric wireless sensor communication network. Given an edge-weighted n n-vertex …

With the capabilities to monitor their surrounding environment and deliver data using radio
signals, Wireless Sensor Networks (WSNs) have found applications in various areas …

In this paper, we study the Antenna Orientation (AO) problem concerning symmetric
connectivity in Directional Wireless Sensor Networks. We are given a set of nodes each of …

Motivated by application to wireless sensor networks, we study the following problem. We
are given a set S of wireless sensor nodes, given as a set of points in the two-dimensional …

Abstract Given a wireless Ad-Hoc network modeled as a unit disk graph U in the plane, we
present a localized distributed algorithm that constructs a bounded degree planar power …

Motivated by applications to wireless sensor networks, we study the following problem. We
are given a set S of wireless sensor nodes, given as a multiset of points in a normed space …

The problem of computing a connected network with minimum interference is a fundamental
problem in wireless sensor networks. Several models of interference have been studied in …

In this paper, we study the problem of computing a spanning tree of a given undirected disk
graph such that the radius of the tree is minimized subject to a given degree constraint Δ⁎ …

In this paper, we investigate the Antenna Orientation (AO) and Antenna Orientation and
Power Assignment (AOPA) problems concerning symmetric connectivity in Directional …