An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
A randomized algorithm for finding a path subject to multiple QoS requirements
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Project Aura: Toward Distraction-Free Pervasive Computing
IEEE Pervasive Computing
An Architecture-Based Approach to Self-Adaptive Software
IEEE Intelligent Systems
Software Architecture-Based Adaptation for Pervasive Systems
ARCS '02 Proceedings of the International Conference on Architecture of Computing Systems: Trends in Network and Pervasive Computing
Dynamic Configuration of Resource-Aware Services
Proceedings of the 26th International Conference on Software Engineering
Interference-aware topology control and QoS routing in multi-channel wireless mesh networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Architecture-based self-adaptation in the presence of multiple objectives
Proceedings of the 2006 international workshop on Self-adaptation and self-managing systems
Finding a path subject to many additive QoS constraints
IEEE/ACM Transactions on Networking (TON)
Increasing system dependability through architecture-based self-repair
Architecting dependable systems
Energy efficient throughput optimization in multi-hop wireless networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
User mobility in pervasive computing makes it fundamentally different from traditional desktop computing. Accordingly, the system configurations, such as resource allocation and routing, are extremely dynamic since available resources and users' needs may change when users are moving around different locations. There have been extensive works on the resource allocation for the users' needs. However, previous works did not consider complex situations, such as conflicting relations between different applications. This paper models a pervasive computing system from three parts: available network resources, available applications, and conflicting relations of the applications. To configure the system according to the dynamical changes, our work focuses on how to find the best set of applications, under the network resource and QoS routing constraints, to achieve the maximum system benefit for the users. We first propose an optimal solution using Integer Linear Programming (ILP) scheme. Then a simple and effective heuristic is presented for better scalability. Extensive simulation results demonstrate that our ILP and heuristic achieve very good performance.