A note on uniform power connectivity in the physical signal to interference plus noise (SINR) model
In this paper, we study the connectivity problem for wireless networks under the physical signal to interference plus noise ratio (SINR) model. Given a set of radio transmitters distributed in some area, we seek to build a directed strongly connected ...
Near-optimal radio use for wireless network synchronization
In this paper, we consider the model of communication where wireless devices can either switch their radios off to save energy (and hence, can neither send nor receive messages), or switch their radios on and engage in communication. The problem has ...
Monitoring churn in wireless networks
Wireless networks often experience a significant amount of churn, i.e. the arrival and departure of nodes, and often it is necessary to keep all nodes informed about all other nodes in the network. In this paper, we propose a distributed algorithm for ...
Virtual raw anchor coordinates: A new localization paradigm
A wide range of applications in wireless sensor networks rely on the location information of the sensing nodes. However, traditional localization techniques are dependent on hardware that is sometimes unavailable (e.g. GPS), or on sophisticated virtual ...
Improved local algorithms for spanner construction
Let S be a set of n points in the plane, let E be the complete Euclidean graph whose point set is S, and let G be the Delaunay triangulation of S. We present a very simple local algorithm that, given G, constructs a subgraph of G of degree at most 11 ...
Energy efficient alert in single-hop networks of extremely weak devices
We present an alert algorithm for single-hop radio networks with polylogarithmic time complexity and sublogarithmic energy complexity. Our algorithm works correctly with high probability regardless of the number of stations that try to broadcast an ...
From key predistribution to key redistribution
One of crucial disadvantages of key predistribution schemes for ad hoc networks is that if devices A and B use a shared key K to determine their session keys, then any adversarial device that holds K can impersonate A against B (or vice versa). Also, ...
Improved approximation algorithms for maximum lifetime problems in wireless networks
A wireless ad-hoc network consists of a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is reduced after each transmission, depending on the transmission distance. One of ...
Self-Localization based on Ambient Signals
We present an approach for the localization of passive nodes in a communication network using ambient radio or sound signals. In our settings, the communication nodes have unknown positions. They do not emit signals for localization and exchange only ...