Transitions in geometric minimum spanning trees (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Many birds with one stone: multi-objective approximation algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Low degree spanning trees of small weight
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The Impact of Data Aggregation in Wireless Sensor Networks
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Approximating k-hop minimum-spanning trees
Operations Research Letters
MVSink: Incrementally Building In-Network Aggregation Trees
EWSN '09 Proceedings of the 6th European Conference on Wireless Sensor Networks
Delay-constraint topology control in wireless sensor networks format
Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
Topology control for delay-constraint data collection in wireless sensor networks
Computer Communications
Polynomial area bounds for MST embeddings of trees
GD'07 Proceedings of the 15th international conference on Graph drawing
Efficient algorithm for maximum lifetime many-to-one data aggregation in wireless sensor networks
International Journal of Sensor Networks
Polynomial area bounds for MST embeddings of trees
Computational Geometry: Theory and Applications
Testing of heuristic methods: a case study of greedy algorithm
CEE-SET'08 Proceedings of the Third IFIP TC 2 Central and East European conference on Software engineering techniques
Energy efficient cross-layer MAC protocol for wireless sensor networks
VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
A real-time data aggregation method for fault-tolerant wireless sensor networks
Proceedings of the 27th Annual ACM Symposium on Applied Computing
| Hi-index | 0.02 |
In sensor networks, energy efficiency is crucial to achieving satisfactory network life. Using the strategy of data aggregation and the technology of smart radio with adjustable transmission power, energy can be saved significantly. In this work we model the real-time requirement in sensor networks as two constraints with the data aggregation tree: node degree bounded and tree height bounded. We state with energy model as the FIRST ORDER RADIO MODEL [4], the maximum node degree of the MST for any graph in a plane is six, and it can be transformed into a MST with maximum node degree as five. Then, we propose three heuristic algorithms to build a MST with hop and degree constraints, namely Node-First Heuristic (NFH), Tree-First Heuristic (TFH), and Hop-Bounded Heuristic (HBH). Simulation results reveal that they are all suitable to solve the real-time data aggregation problem and the performance of NFH is the best.