Efficient data collection for wireless networks: delay and energy tradeoffs

Authors:
Chao Ren;XuFei Mao;Xiang-Yang Li;Ping Xu;GuoJun Dai
Affiliations:
Northwestern Polytechnical University, Xi'an, China;Illinois Institute of Technology, Chicago;Hangzhou Dianzi University, Hangzhou, PRC;Illinois Institute of Technology, Chicago;Hangzhou Dianzi University, Hangzhou, PRC
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 12
Cited 1

Message-optimal connected dominating sets in mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Geometric Spanners for Wireless Ad Hoc Networks

IEEE Transactions on Parallel and Distributed Systems
The design of an acquisitional query processor for sensor networks

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Gossip-Based Computation of Aggregate Information

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Approximate Aggregation Techniques for Sensor Databases

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Synopsis diffusion for robust aggregation in sensor networks

SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks

OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Tributaries and deltas: efficient and robust aggregation in sensor network streams

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Approximate Data Collection in Sensor Networks using Probabilistic Models

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Fast distributed algorithm for convergecast in ad hoc geometric radio networks

Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Efficient gossip-based aggregate computation

Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Distributed Minimal Time Convergecast Scheduling in Wireless Sensor Networks

ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems

Utilizing elevator for wireless sensor data collection in high-rise structure monitoring

Proceedings of the Nineteenth International Workshop on Quality of Service

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study efficient data collection in wireless sensor networks. We present efficient distributed algorithms with approximately the minimum delay, or the minimum number of messages to be sent by all nodes, or the minimum total energy costs by all nodes. We analytically prove that all proposed methods are either optimum or within constants factor of the optimum. We then investigate the possibility of designing one universal method such that the delay, the messages sent by nodes, and the total energy costs by all nodes are all optimum or within constants factor of optimum. Given a method A for data collection let ϱT, ϱM, and ϱE be the approximation ratios of A in terms of time complexity, message complexity, and energy complexity respectively. We show that, for data collection, there are networks of n nodes and maximum degree Δ, such that ϱM ϱE = Ω(Δ) for any algorithm.