Conference Paper

Towards Optimal Rate Allocation for Data Aggregation in Wireless Sensor Networks

DOI: 10.1145/2107502.2107528 Conference: Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011
Source: DBLP

ABSTRACT This paper aims at achieving optimal rate allocation for data aggregation in wireless sensor networks. We first formulate this rate allocation problem as a network utility maximization problem. Due to its non-convexity, we take a couple of variable substitutions on the original problem and transform it into an approximate problem, which is convex. We then apply duality theory to decompose this approximate problem into a rate control subproblem and a scheduling subproblem. Based on this decomposition, a distributed algorithm for joint rate control and scheduling is designed, and proved to approach arbitrarily close to the optimum of the approximate problem. Finally, we show that our approximate solution can achieve near-optimal performance through both theoretical analysis and simulations.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Due to the resource limitations, efficient multimedia transmission is still a challenging problem in Wireless Sensor Networks (WSNs). To achieve this goal, provisioning the required rate and quality of video stream along with limitations of sensor nodes should be considered. The Scalable Video Coding (SVC) is an efficient approach to support the graceful quality reduction and scalability of multimedia application thus we adopt it to encode video streams. In this paper, both Network Utility Maximization (NUM) and utility proportional optimization for scalable multimedia transmission in WSNs are addressed. Link congestion and energy scarcity of sensor nodes are considered as the constraints in optimization problems. To depict the characteristics of these applications accurately, staircase utility function is adopted. The non-concavity of utility function leads to the non-convex problem. To deal with the non-convexity of the problem, an approximation of the utility function is used. Finally, we propose two distributed algorithm to allocate the resources properly by solving NUM and utility proportional problems in energy-constraints WSNs. The simulation results in different scenarios show the efficiency and proper rate of convergence of our proposed algorithms.
  • [Show abstract] [Hide abstract]
    ABSTRACT: Conventional resource allocation schemes for single-purpose WSNs are unable to capture the dynamicity of network and/or application specifications. This compels us to design mechanisms that support multi-purpose mission-oriented WSNs, where several missions with different characteristics coexist in an integrated WSN. The paper aims to propose an efficient temporal-aware resource allocation mechanism for mission-oriented WSNs. Furthermore, our design supports minimum sum-rate demand guarantee for active sessions of each mission. We use contention graph notion to analytically model the interference in our underlying WSN. Moreover, in-network processing operators play important role in our design scheme. Using a time-variant mission-oriented WSN model, we formulate our resource allocation problem as a dynamic network utility maximization problem, which aims to maximize a hybrid mix of an aggregated objective function of missions’ utilities and energy consumption, considering capacity, interference and sum-rate demand constraints. Finally, using dual decomposition method, we solve the problem and propose a distributed temporal-aware algorithm called TARC-SD that optimally allocates the shared bandwidth to the sources. The conducted experiments indicate that the TARC-SD algorithm achieves higher network utilization and wider feasible scenarios compared to conventional time-invariant schemes.
    Computer Communications 03/2015; 59. DOI:10.1016/j.comcom.2015.01.009 · 1.35 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Various dynamic data driven applications systems (DDDAS) such as battlefield monitoring, and autonomic control and management of swarms of UAVs often leverage multiple heterogeneous sensors, where the importance of a subset of sensors may increase or decrease due to the change in the execution environment. This may require adaptation of the sampling rate of different sensors accordingly. However, current solutions for optimal rate allocation do not consider the importance (or criticality) metric of sensors, which can cause the algorithms to ignore critical nodes altogether. In this paper, we address this challenge by developing a centralized algorithm that attempts to maximize the overall quality of information for the whole network given the utility functions and the importance rankings of sensor nodes. We also present a threshold based heuristic that may help system administrators to tune the algorithm to prevent omission of highly important nodes at critical times. Extensive evaluation of our algorithm in simulation for various scenarios shows that it can quickly adapt the sampling rate in response to the changed importance of sensor nodes.
    MILCOM 2013, San Diego, USA; 11/2013

Full-text (2 Sources)

Available from
May 27, 2014