Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
Bounded diameter minimum spanning trees and related problems
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Approximating the minimum degree spanning tree to within one from the optimal degree
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Many birds with one stone: multi-objective approximation algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Does topology control reduce interference?
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 10th annual international conference on Mobile computing and networking
A wireless sensor network For structural monitoring
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
The worst-case capacity of wireless sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Approximating minimum bounded degree spanning trees to within one of optimal
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Distributed time-optimal scheduling for convergecast in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Rapid rumor ramification: approximating the minimum broadcast time
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
PermaDAQ: A scientific instrument for precision sensing and data recovery in environmental extremes
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
On the minimum diameter spanning tree problem
Information Processing Letters
On maximizing the throughput of convergecast in wireless sensor networks
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems
Two sides approximation algorithms for channel assignments in wireless network
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Bounded-degree minimum-radius spanning trees in wireless sensor networks
Theoretical Computer Science
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
We investigate the tradeoff between two mutually conflicting performance objectives--throughput and delay--for fast, periodic data collection in tree-based sensor networks arbitrarily deployed in 2-D. Two primary factors that affect the data collection rate (throughput) and timeliness (delay) are: 1) efficiency of the link scheduling protocol, and 2) structure of the routing tree in terms of its node degrees and radius. In this paper, we utilize multiple frequency channels and design an efficient link scheduling protocol that gives a constant factor approximation on the optimal throughput in delivering aggregated data from all the nodes to the sink. To minimize the maximum delay subject to a given throughput bound, we also design an (α, β)-bicriteria approximation algorithm to construct a Bounded-Degree Minimum-Radius Spanning Tree, with the radius of the tree at most β times the minimum possible radius for a given degree bound Δ*, and the degree of any node at most Δ* + α, where α and β are positive constants. Lastly, we evaluate the efficiency of our algorithms on different types of spanning trees and show that multichannel scheduling, combined with optimal routing topologies, can achieve the best of both worlds in terms of maximizing the aggregated data collection rate and minimizing the maximum packet delay.