Smallest-last ordering and clustering and graph coloring algorithms
Journal of the ACM (JACM)
On the performance of ad hoc networks with beamforming antennas
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Approximation algorithms for longest-lived directional multicast communications in WANETs
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Energy Efficient Broadcast Routing in Ad Hoc Sensor Networks with Directional Antennas
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Minimum-latency aggregation scheduling in multihop wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Minimum-Latency Schedulings for Group Communications in Multi-channel Multihop Wireless Networks
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Minimum data aggregation time problem in wireless sensor networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
IEEE Communications Magazine
Efficient Broadcasting Using Network Coding and Directional Antennas in MANETs
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 5.23 |
Real-time data aggregation is one of the most important issues in wireless sensor networks. Using directional antenna to transmit data can save energy and reduce interference. In this paper, we study the minimum latency data aggregation problem with the given two directional antenna models (the steering beam and the switch beam) under protocol interference model. We propose an approximation directional data aggregation algorithm to schedule data transmissions under two directional antenna models, respectively. At last, we evaluate the proposed schedule algorithms through simulations, and simulation results show that the proposed schedule's latency is close to the depth of BFS tree, which is the lower bound of schedule latency, and the proposed schedules achieve extremely good performance.