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


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.

Download full-text


Available from: Yong Yang
  • Source
    • "Among these works, [6] is the most related one to ours that target utility maximization for energy harvesting WSNs. However, [6] [21] [22] all assume specific utility functions that are continuously differentiable, which may limit their application for a more general class of functions. Moreover , their proposed solutions are not optimal, and can incur high control overhead and unpredictable running time, thus potentially limiting their practical implementation within resource-constrained WSN systems. "
    [Show abstract] [Hide abstract]
    ABSTRACT: There is currently tremendous interest in deploying energy harvesting wireless sensor networks. Engineering such systems requires striking a careful balance between sensing performance and energy management. Our work addresses this problem through the design and analysis of a harvesting aware utility-based sensing rate allocation algorithm. Based on a network utility formulation, we show that our algorithm is optimal in terms of assigning rates to individual nodes to maximize overall utility, while ensuring energy-neutral operation. To our knowledge, our work is the first optimal solution that maximizes network utility through rate assignments for tree-structured energy harvesting sensor networks. Our algorithm is fast and efficient with running time O(N3), where N is the number of nodes. We evaluate the performance, scalability, and overhead of our algorithm for various utility functions and network sizes, underlining its significant advantages.
    Preview · Conference Paper · Jan 2011
  • 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.
    Full-text · Article ·
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The main challenge of designing classification algorithms for sensor networks is the lack of labeled sensory data, due to the high cost of manual labeling in the harsh locales where a sensor network is normally deployed. Moreover, delivering all the sensory data to the sink would cost enormous energy. Therefore, although some classification techniques can deal with limited label information, they cannot be directly applied to sensor networks since they are designed for centralized databases. To address these challenges, we propose a hierarchical aggregate classification (HAC) protocol which can reduce the amount of data sent by each node while achieving accurate classification in the face of insufficient label information. In this protocol, each sensor node locally makes cluster analysis and forwards only its decision to the parent node. The decisions are aggregated along the tree, and eventually the global agreement is achieved at the sink node. In addition, to control the tradeoff between the communication energy and the classification accuracy, we design an extended version of HAC, called the constrained hierarchical aggregate classification (cHAC) protocol. cHAC can achieve more accurate classification results compared with HAC, at the cost of more energy consumption. The advantages of our schemes are demonstrated through the experiments on not only synthetic data but also a real testbed.
    Full-text · Conference Paper · Jan 2011
Show more