A stop-and-go queueing framework for congestion management
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Making transmission schedules immune to topology changes in multi-hop packet radio networks
IEEE/ACM Transactions on Networking (TON)
A new approach to channel access scheduling for Ad Hoc networks
Proceedings of the 7th annual international conference on Mobile computing and networking
An Energy-Aware QoS Routing Protocol for Wireless Sensor Networks
ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Energy-efficient collision-free medium access control for wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Distributed Data Aggregation in Multi-sink Sensor Networks Using a Graph Coloring Algorithm
AINAW '08 Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops
Mitigating Performance Degradation in Congested Sensor Networks
IEEE Transactions on Mobile Computing
| Hi-index | 0.00 |
A hybrid sensor network can be utilized to transfer multiple traffics with diverse delay and loss requirements. To satisfy the worst-case delay and loss requirements the network has to service each category of traffic according to its characteristics and quality of service (QoS) requirements. The proposed algorithm in this paper combines a specific time framing pattern, to prevent congestion, with a medium access scheduling method. This method assigns timeslots proportionally to the importance and QoS requirements of the traffic, to differentiate between the traffics. Simulation results show that packets of a specific source are delivered to the sink with a bounded delay and that delay bounds are proportional to the priority levels. These extensive simulation results approve the effectiveness of this method for satisfying QoS requirements in sensor networks.