English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

This paper examines the problem of assigning a transmission power to everynode of a wireless sensor network. The goal is to minimize the total powerconsumption while ensuring that the resulting communication graph is connected.We focus on a restricted version of this Range Assignment (RA) problem in whichthere are two different power levels. We only consider symmetrical transmissionlinks to allow easy integration with low level wireless protocols thattypically require bidirectional communication between two neighboring nodes. Weintroduce a parameterized polynomial time approximation algorithm with aperformance ratio arbitrarily close to $\pi^2/6$. Additionally, we give analmost linear time approximation algorithm with a tight quality bound of $7/4$.

Minimum Power Range Assignment for Symmetric Connectivity in Sensor Networks with two Power Levels