Criticality- and QoS-Based Multiresource Negotiation andAdaptation
Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Hierarchial architecture for real-time adaptive resource management
IFIP/ACM International Conference on Distributed systems platforms
On Quality of Service Optimization with Discrete QoS Options
RTAS '99 Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium
GRMS: A Global Resource Management System for Distributed QoS and Criticality Support
ICMCS '97 Proceedings of the 1997 International Conference on Multimedia Computing and Systems
Hierarchical Feedback Adaptation for Real Time Sensor-Based Distributed Applications
ISORC '00 Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
Quality of Service guarantees and fault-tolerant TCP services in mobile wireless optical networks
International Journal of Ad Hoc and Ubiquitous Computing
On the importance of composability of ad hoc mobile middleware and trust management
ISAS'05 Proceedings of the Second international conference on Service Availability
Hi-index | 0.00 |
Boosted by technology advancements, government and commercial interest, ad-hoc wireless networks are emerging as a serious platform for distributed mission-critical applications. Guaranteeing QoS in this environment is a hard problem because several applications may share the same resources in the network, and mobile ad-hoc wireless networks (MANETs) typically exhibit high variability in network topology and communication quality. In this paper we introduce DYNAMIQUE, a resource management infrastructure for MANETs. We present a resource model for multi-application admission control that optimizes the application admission utility, defined as a combination of the QoS satisfaction ratio. A method based on external adaptation (shrinking QoS for existing applications and later QoS expansion) is introduced as a way to reduce computation complexity by reducing the search space. We designed an application admission protocol that uses a greedy heuristic to improve application utility. For this, the admission control considers network topology information from the routing layer. Specifically, the admission protocol takes benefit from a cluster network organization, as defined by ad-hoc routing protocols such as CBRP and LANMAR. Information on cluster membership and cluster head elections allows the admission protocol to minimize control signaling and to improve application quality by localizing task mapping.