An analysis of a large scale habitat monitoring application
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Energy-Efficient Wakeup Scheduling for Maximizing Lifetime of IEEE 802.15.4 Networks
WICON '05 Proceedings of the First International Conference on Wireless Internet
Wakeup scheduling in wireless sensor networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Efficient In-Network Moving Object Tracking in Wireless Sensor Networks
IEEE Transactions on Mobile Computing
ECRTS '07 Proceedings of the 19th Euromicro Conference on Real-Time Systems
Wireless Communications & Mobile Computing - Advances in Resource-Constrained Device Networking
Distributed time-optimal scheduling for convergecast in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Quick convergecast in ZigBee beacon-enabled tree-based wireless sensor networks
Computer Communications
Emergency guiding and monitoring applications in indoor 3D environments by wireless sensor networks
International Journal of Sensor Networks
Distributed wake-up scheduling for data collection in tree-based wireless sensor networks
IEEE Communications Letters
Aggregation convergecast scheduling in wireless sensor networks
Wireless Networks
Fast Data Collection in Tree-Based Wireless Sensor Networks
IEEE Transactions on Mobile Computing
Sleep Scheduling for Critical Event Monitoring in Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Risk-Aware Distributed Beacon Scheduling for Tree-Based ZigBee Wireless Networks
IEEE Transactions on Mobile Computing
| Hi-index | 0.24 |
Broadcast and convergecast are two fundamental operations which often happen simultaneously in a wireless sensor network. Previous works have addressed energy-efficient, low-latency scheduling but they only try to optimize the traffic in one direction (broadcast or convergecast). This work defines a low-latency two-way beacon scheduling (LTBS) problem for ZigBee tree-based networks, where beacons stand for timing for nodes to deliver broadcast and convergecast traffics. We formulate the problem as a slot assignment problem where each node needs to obtain slots for upstream and downstream transmissions while avoiding interferences. We propose two efficient slot assignment algorithms based on the concept of sequencing nodes' slots to facilitate two-way traffics. We show the advantages of these schemes through extensive simulations. The results indicate that these two slot assignment algorithms can indeed achieve low-latency in ZigBee networks.