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.

0 Bookmarks
 · 
52 Views
  • 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.
    Proceedings of the 9th International Conference on Embedded Networked Sensor Systems, SenSys 2011, Seattle, WA, USA, November 1-4, 2011; 01/2011
  • [Show abstract] [Hide abstract]
    ABSTRACT: Wireless Sensor Network (WSN) is highly budgeted by energy since sensor nodes are mostly battery-powered and deployed in hard-to-reach area for prolonged duration. Moreover radio communication is very expensive for WSN. At the same time, a substantial portion WSN applications require periodic data collection. In this paper we investigate this issue in depth and present a solution architecture: 2PDA, that eliminates repeated transmission. The solution is founded upon temporal linear correlation among sensor data. Instead of sending each data packet we model them using method of least square that exploits temporal correlation among sensor data. 2PDA observes sensor data and performs operation parameterized by application-precision. After successful computation only the parameters of the model are sent over the radio to the application-end or sink. 2PDA was implemented in TinyOS. Implementation showed a significant improvement (i.e. 80%) for the node's life-time. Rigorous numerical analysis was done on various sensor data which indicated its modest efficiency under different scenario. Effects of various parameters such as type of sensory information, time and place of data collection were assessed. Finally a network simulation was carried out to evaluate its scalability.
    Ad Hoc Networks. 11/2013; 11(8):2470-2483.
  • Source
    [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.
    Proceedings of the 14th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2011, Miami, Florida, USA, October 31 - November 4, 2011; 01/2011

Full-text (2 Sources)

Download
60 Downloads
Available from
May 27, 2014