Heartbeat-driven medium-access control for body sensor networks
IEEE Transactions on Information Technology in Biomedicine
Limiting end-to-end delays in long-lasting sensor networks
Proceedings of the 8th ACM international workshop on Mobility management and wireless access
Computer Networks: The International Journal of Computer and Telecommunications Networking
The distributed wireless gathering problem
Theoretical Computer Science
Cross-Layer duty cycle scheduling with data aggregation routing in wireless sensor networks
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
ILA: idle listening avoidance in scheduled wireless sensor networks
WWIC'10 Proceedings of the 8th international conference on Wired/Wireless Internet Communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
A survey of adaptive services to cope with dynamics in wireless self-organizing networks
ACM Computing Surveys (CSUR)
Computer Networks: The International Journal of Computer and Telecommunications Networking
Tight analysis of shortest path convergecast in wireless sensor networks
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Tight analysis of shortest path convergecast in wireless sensor networks
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Beacon scheduling for broadcast and convergecast in ZigBee wireless sensor networks
Computer Communications
Journal of Network and Computer Applications
Hi-index | 0.00 |
A specific characteristic of sensor network applications is that the major traffic consists of data collection from various sensor source nodes to a sink via a unidirectional tree. In this paper, we propose DMAC, an energy efficient and low latency MAC that is designed and optimized for such data gathering trees in wireless sensor networks. We first show that previously proposed MAC protocols for sensor networks that utilize activation/sleep duty cycles suffer from a data forwarding interruption problem, whereby not all nodes on a multihop path to the sink can be notified of data delivery in progress, resulting in significant sleep delay. DMAC is designed to solve the interruption problem, by giving the active/sleep schedule of a node an offset that depends upon its depth on the tree. This scheme allows continuous packet forwarding because all nodes on the multihop path can be notified of the data delivery in progress. DMAC also adjusts node duty cycles adaptively according to the traffic load in the network by varying the number of active slots in an schedule interval. We further propose a data prediction mechanism and the use of more to send (MTS) packets in order to alleviate problems pertaining to channel contention and collisions. Our simulation results as well as experimental results with the Mote platform show that by exploiting the application-specific structure of data gathering trees in sensor networks, DMAC provides significant energy savings and latency reduction while ensuring high data reliability. Copyright © 2007 John Wiley & Sons, Ltd.