System architecture directions for networked sensors
ACM SIGPLAN Notices
Highly-resilient, energy-efficient multipath routing in wireless sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Approximate Aggregation Techniques for Sensor Databases
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Versatile low power media access for wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Synopsis diffusion for robust aggregation in sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Distributed Cross-Layer Scheduling for In-Network Sensor Query Processing
PERCOM '06 Proceedings of the Fourth Annual IEEE International Conference on Pervasive Computing and Communications
Distributed Minimal Time Convergecast Scheduling in Wireless Sensor Networks
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
TIGRA: Timely Sensor Data Collection Using Distributed Graph Coloring
PERCOM '08 Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications
Minimum-latency aggregation scheduling in multihop wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Efficient data aggregation in multi-hop WSNs
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
MSN '10 Proceedings of the 2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks
Minimum data aggregation time problem in wireless sensor networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
| Hi-index | 0.00 |
Multi-path routing is essential to improve the robustness of sensor data collection in error-prone wireless communication environments. Besides the robustness against communication failures, both the energy efficiency and time efficiency are also of primary importance in sensor data collection due to the limited energy supplies of sensor nodes and the real-time nature of sensor network applications. Contention-free time division multiple access (TDMA) protocols have the potential to reduce the energy consumption and the latency of sensor data collection. To collect sensor data using a TDMA protocol, sensor nodes need to be assigned appropriate time slots for transmitting and receiving data prior to the data collection process. We note that the distributed TDMA scheduling process for sensor data collection incurs overhead costs of energy consumption and time latency. However, these overhead costs are usually overlooked, especially when multi-path routing is used to collect sensor data. In this paper, we propose an efficient scheduling algorithm for data collection through multi-path routing structures in wireless sensor networks. The objective of our scheduling algorithm is to reduce both the message complexity and running time of the scheduling process as much as possible. In addition, we also develop a method for deriving a lower bound on the shortest possible length of the data collection schedule that can be generated by any algorithm. The lower bound latency estimation offers a practical method to evaluate the efficiency of data collection schedules produced by scheduling algorithms. Extensive experimental results show that the proposed scheduling algorithm significantly reduces the number of messages transmitted during the scheduling process and the running time compared to an existing scheduling algorithm. The length of the data collection schedule produced by our algorithm is normally within 1.9 times of the lower bound estimate across a wide range of network settings.