Minimum range assignment problem for two connectivity in wireless sensor networks

BS Panda, DP Shetty - … Conference on Distributed Computing and Internet …, 2014 - Springer
A wireless sensor network (WSN) is modeled as weighted directed graph, with each sensor
in the plane representing a vertex. The edges represent the link between two sensors. A cost …

A topology control algorithm with good spanner properties for wireless sensor networks

N Ababneh, A Viglas, S Selvakennedy… - 2010 8th Annual …, 2010 - ieeexplore.ieee.org
The main design challenge for wireless sensor network solutions is energy efficiency to
prolong the network operable lifetime. Since most energy is spent for radio communications …

Global connectivity from local geometric constraints for sensor networks with various wireless footprints

R d'Souza, D Galvin, C Moore, D Randall - Proceedings of the 5th …, 2006 - dl.acm.org
Adaptive power topology control (APTC) is a local algorithm for constructing a one-
parameter family of θ-graphs, where each node increases power until it has a neighbor in …

[PDF][PDF] Minimizing the maximum sender interference by deploying additional nodes in a wireless sensor network.

MP Lakshmi - Electronic Journal of Graph Theory & Applications, 2019 - academia.edu
Interference is one of the major challenges faced by communication networks. Since the
interference leads to packet loss, packet collision and data re-transmission, higher the …

[PDF][PDF] On the delaunay graph of a geometric graph

R Pinchasi, S Smorodinksy - ACM Symposium on Computational …, 2004 - Citeseer
In this paper we study proximity structures for geometric graphs. The study of these
structures was recently motivated by topology control for wireless networks [6, 7]. We obtain …

On spanners and lightweight spanners of geometric graphs

IA Kanj, L Perković, G Xia - SIAM Journal on Computing, 2010 - SIAM
We consider the problem of computing spanners of Euclidean and unit disk graphs
embedded in the two-dimensional Euclidean plane. We are particularly interested in …

Distributed planarization and local routing strategies in sensor networks

A Jarry, F Huc, P Leone, J Rolim - arXiv preprint arXiv:1107.5154, 2011 - arxiv.org
We present an algorithm which computes a planar 2-spanner from an Unit Disk Graph when
the node density is sufficient. The communication complexity in terms of number of node's …

[引用][C] Local algorithms for constructing approximate minimum spanning trees with applications to wireless sensor networks

M Khan, VSA Kumar, G Pandurangan - submitted to IEEE Transactions on Parallel …, 2005

Fault-tolerant design of wireless sensor networks with directional antennas

S Shirazipourazad, A Sen, S Bandyopadhyay - Pervasive and Mobile …, 2014 - Elsevier
A tree structure is often used in wireless sensor networks to deliver sensor data to a sink
node. Such a tree can be built using directional antennas as they offer considerable …

A parallel 2-approximation nc-algorithm for range assignment problem in packet radio networks

BK Bhatta, DP Shetty - Distributed Computing and Internet Technology: 9th …, 2013 - Springer
Given a set of sensors in a plane or in higher dimension, the strong minimum energy
topology problem is to assign transmission range to each of the sensor nodes, so as to …