Optimal Physical Diversity Algorithms and Survivable Networks
ISCC '97 Proceedings of the 2nd IEEE Symposium on Computers and Communications (ISCC '97)
Understanding packet delivery performance in dense wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Fine-grained network time synchronization using reference broadcasts
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
Wakeup scheduling in wireless sensor networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Networking Wireless Sensors
Low-energy fault-tolerant bounded-hop broadcast in wireless networks
IEEE/ACM Transactions on Networking (TON)
Joint duty cycle scheduling, resource allocation and multi-constrained QoS routing algorithm
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
Many-to-one communication protocol for wireless sensor networks
International Journal of Sensor Networks
| Hi-index | 0.00 |
Wireless sensor networks are expected to be used in a wide range of applications from environment monitoring to event detection. The key challenge is to provide energy efficient communication; however, latency remains an important concern for many applications that require fast response. In this paper, we address the important problem of minimizing average communication latency for the active flows while providing energy-efficiency in wireless sensor networks. As the flows in some wireless sensor network can be long-lived and predictable, it is possible to design schedules for sensor nodes so that nodes can wake up only when it is necessary and asleep during other times. Clearly, the routing layer decision is closely coupled to the wakeup/sleep schedule of the sensor nodes. We formulate a joint scheduling and routing problem with the objective of finding the schedules and routes for current active flows with minimum average latency. By constructing a novel delay graph, the problem can be solved optimally by employing the M node-disjoint paths algorithm under FDMA channel model. We further present extensions of the algorithm to handle dynamic traffic changes and topology changes in wireless sensor networks.