Joint sink mobility and routing to maximize the lifetime of wireless sensor networks: the case of constrained mobility

J Luo, JP Hubaux - IEEE/ACM transactions on networking, 2009 - ieeexplore.ieee.org
The longevity of wireless sensor networks (WSNs) is a major issue that impacts the
application of such networks. While communication protocols are striving to save energy by …

Distributed minimum dominating set approximations in restricted families of graphs

C Lenzen, YA Pignolet, R Wattenhofer - Distributed computing, 2013 - Springer
A dominating set is a subset of the nodes of a graph such that all nodes are in the set or
adjacent to a node in the set. A minimum dominating set approximation is a dominating set …

[图书][B] Algorithms for sensor and ad hoc networks: advanced lectures

D Wagner, R Wattenhofer - 2007 - books.google.com
Thousands of mini computers (comparable to a stick of chewing gum in size), equipped with
sensors, are deployed in some terrain or other. After activation thesensorsformaself …

Local approximation schemes for ad hoc and sensor networks

F Kuhn, T Nieberg, T Moscibroda… - Proceedings of the 2005 …, 2005 - dl.acm.org
We present two local approaches that yield polynomial-time approximation schemes (PTAS)
for the Maximum Independent Set and Minimum Dominating Set problem in unit disk graphs …

An adaptive partitioning scheme for sleep scheduling and topology control in wireless sensor networks

Y Ding, C Wang, L Xiao - IEEE Transactions on Parallel and …, 2008 - ieeexplore.ieee.org
This paper presents an adaptive partitioning scheme of sensor networks for node
scheduling and topology control with the aim of reducing energy consumption. Our scheme …

Near-optimal multicriteria spanner constructions in wireless ad hoc networks

H Shpungin, M Segal - IEEE/ACM Transactions on Networking, 2010 - ieeexplore.ieee.org
In this paper, we study asymmetric power assignments that induce a low-energy k-strongly
connected communication graph with spanner properties. We address two spanner models …

Collaborative topology control for many-to-one communications in wireless sensor networks

ZH Mir, YB Ko - IEEE Access, 2017 - ieeexplore.ieee.org
Topology control is relevant in wireless sensor network because of two reasons, namely
minimal sensor coverage and power constraints. The former condition is typically satisfied …

Distributed approximation of capacitated dominating sets

F Kuhn, T Moscibroda - Proceedings of the nineteenth annual ACM …, 2007 - dl.acm.org
We study local, distributed algorithms for the capacitated minimum dominating set
(CapMDS) problem, which arises in various distributed network applications. Given a …

Centdian computation in cactus graphs

B Ben-Moshe, A Dvir, M Segal, A Tamir - Journal of Graph Algorithms and …, 2012 - jgaa.info
This paper focuses on the centdian problem in a cactus network where a cactus network is a
connected undirected graph, and any two simple cycles in the graph have at most one node …

Theoretical bound and practical analysis of connected dominating set in ad hoc and sensor networks

A Vahdatpour, F Dabiri, M Moazeni… - … Symposium, DISC 2008 …, 2008 - Springer
Connected dominating set is widely used in wireless ad-hoc and sensor networks as a
routing and topology control backbone to improve the performance and increase the lifetime …