Sensor Networks Continue to Puzzle: Selected Open Problems

Locher, Thomas; Rickenbach, Pascal von; Wattenhofer, Roger

doi:10.1007/978-3-540-77444-0_3

Cited by 28 publications

(25 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Among others are proofs for scheduling in graph-based models [5,6], in the abstract SINR model in [7], and, recently, in the geometric SINR model for fixed power assignment by Goussevskaia et al [8]. The joint problem of scheduling and power assignment is still open in the geometric SINR model [9]. A variety of graph-based scheduling algorithms has been proposed and analyzed [10,11,12].…”

Section: Related Workmentioning

confidence: 99%

Link Scheduling in Local Interference Models

Katz

Völker

Wagner

2008

Algorithmic Aspects of Wireless Sensor Networks

View full text Add to dashboard Cite

Abstract.Choosing an appropriate interference model is crucial for link scheduling problems in sensor networks. While graph-based interference models allow for distributed and purely local coloring approaches which lead to many interesting results, a more realistic and widely agreed on model such as the signal-to-noise-plus-interference ratio (SINR) inherently makes scheduling radio transmission a non-local task, and thus impractical for the development of distributed and scalable scheduling protocols in sensor networks. In this work, we focus on interference models that are local in the sense that admissibility of transmissions only depends on local concurrent transmissions, and correct with respect to the geometric SINR model.In our analysis, we show lower bounds on the limitations that these restrictions impose an any such model as well as approximation results for greedy scheduling algorithms in a class of these models.

show abstract

Section: Related Workmentioning

confidence: 99%

Link Scheduling in Local Interference Models

Katz

Völker

Wagner

2008

Algorithmic Aspects of Wireless Sensor Networks

View full text Add to dashboard Cite

show abstract

“…Time synchronization can be energy-consuming since it involves wireless messages exchange, however, when achieved, it allows significant energy savings through network power management. In all, WSN synchronization remains amongst the most challenging open topics in WSN's [4]. In our previous work [5] we had introduced the existing tradeoff between time synchronization accuracy and synchronization energy, although we did not contemplate nodes' movement in our analysis.…”

Section: Introductionmentioning

confidence: 99%

On the Trade-off between Power Consumption and Time Synchronization Quality for Moving Targets under Large-Scale Fading Effects in Wireless Sensor Networks

Briff¹,

Vega²,

Lutenberg³

et al. 2013

View full text Add to dashboard Cite

In this work we find a lower bound on the energy required for synchronizing moving sensor nodes in a Wireless Sensor Network (WSN) affected by large-scale fading, based on clock estimation techniques. The energy required for synchronizing a WSN within a desired estimation error level is specified by both the transmit power and the required number of messages. In this paper we extend our previous work introducing nodes' movement and the average message delay in the total energy, including a comprehensive analysis on how the distance between nodes impacts on the energy and synchronization quality trade-off under large-scale fading effects.

show abstract

“…We prove in this paper that the transmission scheduling problem is also NP-hard for variable power levels. This setting has been described as an open problem in [5]. Indeed, it was unknown until now if there exists a tractable solution when the power levels of the interfering nodes are allowed to vary, despite the vast amount of attempts in the literature to solve the transmission scheduling problem in polynomial time.…”

Section: Introductionmentioning

confidence: 99%

Transmission Scheduling in Wireless Networks with SINR Constraints

Klerides¹,

Charalambous

2009

2009 Fifth International Conference on Networking and Services

View full text Add to dashboard Cite

Abstract-In this paper we study a joint transmission scheduling and power control problem that arises in wireless networks. The goal is to assign time slots (or channels) and transmitting powers to communication links such that all communication requests are processed correctly, specified Quality-of-Service (QoS) requirements are met, and the number of required time slots is minimized. The first main result proves that the problem, also known as the wireless scheduling problem, is NP-hard. We then solve a mixed-integer linear programming (MILP) formulation of the problem with Branch & Bound (B&B) and Cutting Plane (CP) approaches. We enhance the computational performance of these schemes with heuristic procedures that provide tighter upper and lower bounds. We close with an extensive computational study, which shows that despite the complexity of the problem, the proposed methodology scales to problems of nontrivial size. Our algorithms can therefore serve as a benchmark for the performance evaluation of heuristic or distributed algorithms that aim to find near-optimal solutions without information about the whole network.

show abstract

Sensor Networks Continue to Puzzle: Selected Open Problems

Cited by 28 publications

References 46 publications

Link Scheduling in Local Interference Models

Link Scheduling in Local Interference Models

On the Trade-off between Power Consumption and Time Synchronization Quality for Moving Targets under Large-Scale Fading Effects in Wireless Sensor Networks

Transmission Scheduling in Wireless Networks with SINR Constraints

Contact Info

Product

Resources

About