Recently there has been increasing interest in building networks with Ambient Intelligence (AmI), which incorporates the user-centricity and context awareness. However, both the Internet TCP/IP protocol stack and the seven-layer OSI reference model are not suitable for AmI networks, because they do not specifically take the end-user requirements into consideration in their architecture design. Under the client-server architecture, we propose to explicitly take the end-user into account by defining a new layer called User Layer above the traditional application layer. The User Layer empowers the end-users to influence network performance based on their interaction activities with the networks. We adopt the Model Human Processor (MHP) approach for building the User Model. After that we present an exemplary User Layer implementation to illustrate how the User Layer interacts with the underlying protocol stack and improves end-user's satisfaction with network performance.
{"title":"When Ambient Intelligence Meets Internet Protocol Stack: User Layer Design","authors":"Yu Lu, M. Motani, L. Wong","doi":"10.1109/EUC.2010.66","DOIUrl":"https://doi.org/10.1109/EUC.2010.66","url":null,"abstract":"Recently there has been increasing interest in building networks with Ambient Intelligence (AmI), which incorporates the user-centricity and context awareness. However, both the Internet TCP/IP protocol stack and the seven-layer OSI reference model are not suitable for AmI networks, because they do not specifically take the end-user requirements into consideration in their architecture design. Under the client-server architecture, we propose to explicitly take the end-user into account by defining a new layer called User Layer above the traditional application layer. The User Layer empowers the end-users to influence network performance based on their interaction activities with the networks. We adopt the Model Human Processor (MHP) approach for building the User Model. After that we present an exemplary User Layer implementation to illustrate how the User Layer interacts with the underlying protocol stack and improves end-user's satisfaction with network performance.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127172057","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Recently, Wireless Sensor and Actor Networks have been receiving a growing attention from the research community because of their suitability for critical applications. Maintaining inter-actor connectivity becomes extremely crucial in such situations where actors have to quickly plan optimal coordinated response to detected events. Failure of critical actor partitions the inter-actor network into disjoint segments, and thus hinders the network operation. Autonomous detection and rapid recovery procedures are highly desirable in such case. This paper presents PCR, a novel distributed partitioning detection and connectivity restoration algorithm. PCR proactively identifies critical actors based on local topological information and designate appropriate backup nodes (preferably non-critical) to handle their failure. A backup actor detects the failure and initiates a recovery process that may involve coordinated multi-actor relocation. The purpose is to avoid procrastination, localize the scope of recovery process and minimize the movement overhead. Simulation results validate the performance of PCR that outperforms contemporary schemes found in literature.
{"title":"Partitioning Detection and Connectivity Restoration Algorithm for Wireless Sensor and Actor Networks","authors":"M. Imran, M. Younis, A. Said, H. Hasbullah","doi":"10.1109/EUC.2010.37","DOIUrl":"https://doi.org/10.1109/EUC.2010.37","url":null,"abstract":"Recently, Wireless Sensor and Actor Networks have been receiving a growing attention from the research community because of their suitability for critical applications. Maintaining inter-actor connectivity becomes extremely crucial in such situations where actors have to quickly plan optimal coordinated response to detected events. Failure of critical actor partitions the inter-actor network into disjoint segments, and thus hinders the network operation. Autonomous detection and rapid recovery procedures are highly desirable in such case. This paper presents PCR, a novel distributed partitioning detection and connectivity restoration algorithm. PCR proactively identifies critical actors based on local topological information and designate appropriate backup nodes (preferably non-critical) to handle their failure. A backup actor detects the failure and initiates a recovery process that may involve coordinated multi-actor relocation. The purpose is to avoid procrastination, localize the scope of recovery process and minimize the movement overhead. Simulation results validate the performance of PCR that outperforms contemporary schemes found in literature.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116825446","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Security is an important issue for sensor networks deployed in hostile environments, such as military battlefields. The low cost requirement precludes the use of tamper resistant hardware on tiny sensor nodes. Hence, sensor nodes deployed in open areas can be compromised and used to carry out various attacks on the network. In this paper, we consider the collision attack that can be easily launched by a compromised (or hostile) node: a compromised node does not follow the medium access control protocol and cause collisions with neighbor transmissions by sending a short noise packet. This attack does not consume much energy of the attacker but can cause a lot of disruptions to the network operation. Due to the wireless broadcast nature, it is not trivial to identify the attacker. In this paper, we propose a distributed scheme that is based on low-cost hardware and can effectively identify the source of a collision attack. Our scheme is based on analyzing physical-layer Received Signal Strength Index (RSSI) readings. We show that correct identification of an adversarial node can be achieved with greater than 85% accuracy. We further present a technique that degrades gracefully as the background noise increases.
{"title":"Defending Malicious Collision Attacks in Wireless Sensor Networks","authors":"Phillip Reindl, K. Nygard, Xiaojiang Du","doi":"10.1109/EUC.2010.121","DOIUrl":"https://doi.org/10.1109/EUC.2010.121","url":null,"abstract":"Security is an important issue for sensor networks deployed in hostile environments, such as military battlefields. The low cost requirement precludes the use of tamper resistant hardware on tiny sensor nodes. Hence, sensor nodes deployed in open areas can be compromised and used to carry out various attacks on the network. In this paper, we consider the collision attack that can be easily launched by a compromised (or hostile) node: a compromised node does not follow the medium access control protocol and cause collisions with neighbor transmissions by sending a short noise packet. This attack does not consume much energy of the attacker but can cause a lot of disruptions to the network operation. Due to the wireless broadcast nature, it is not trivial to identify the attacker. In this paper, we propose a distributed scheme that is based on low-cost hardware and can effectively identify the source of a collision attack. Our scheme is based on analyzing physical-layer Received Signal Strength Index (RSSI) readings. We show that correct identification of an adversarial node can be achieved with greater than 85% accuracy. We further present a technique that degrades gracefully as the background noise increases.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116825521","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Interference minimization problem in wireless sensor and ad-hoc networks are considered. That is to assign a transmission radius to each node of a network, to make it connected and at the same time to minimize the maximum number of overlapping transmission ranges on each node of a network. Additional means of topology control besides the connectivity is blocking the long line connections at the receiver level. We propose a polynomial time approximation algorithm which finds a connected network with at most $O((optln{n})^{2})$ interference where $opt$ is the minimal interference of the given network of $n$ nodes. The lower bound for this problem, where a general distance function is considered, has been proven to be $O(ln{n})$. The algorithm is known which finds a network where the maximum interference is bounded by $O(sqrt{n})$.
{"title":"Interference Minimization in Wireless Networks","authors":"H. Aslanyan, J. Rolim","doi":"10.1109/EUC.2010.73","DOIUrl":"https://doi.org/10.1109/EUC.2010.73","url":null,"abstract":"Interference minimization problem in wireless sensor and ad-hoc networks are considered. That is to assign a transmission radius to each node of a network, to make it connected and at the same time to minimize the maximum number of overlapping transmission ranges on each node of a network. Additional means of topology control besides the connectivity is blocking the long line connections at the receiver level. We propose a polynomial time approximation algorithm which finds a connected network with at most $O((optln{n})^{2})$ interference where $opt$ is the minimal interference of the given network of $n$ nodes. The lower bound for this problem, where a general distance function is considered, has been proven to be $O(ln{n})$. The algorithm is known which finds a network where the maximum interference is bounded by $O(sqrt{n})$.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123935422","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Peijie Yu, Mingyuan Xia, Qian Lin, Min Zhu, Shang Gao, Zhengwei Qi, Kai Chen, Haibing Guan
System virtualization, which provides good isolation, is now widely used in server consolidation. Meanwhile, one of the hot topics in this field is to extend virtualization for embedded systems. However, current popular virtualization platforms do not support real-time operating systems such as embedded Linux well because the platform is not real-time ware, which will bring low-performance I/O and high scheduling latency. The goal of this paper is to optimize the Xen virtualization platform to be real-time operating system friendly. We improve two aspects of the Xen virtualization platform. First, we improve the xen scheduler to manage the scheduling latency and response time of the real-time operating system. Second, we import multiple real-time operating systems balancing method. Our experiment demonstrates that our enhancement to the Xen virtualization platform support real-time operating system well and the improvement to the real-time performance is about 20%.
{"title":"Real-time Enhancement for Xen Hypervisor","authors":"Peijie Yu, Mingyuan Xia, Qian Lin, Min Zhu, Shang Gao, Zhengwei Qi, Kai Chen, Haibing Guan","doi":"10.1109/EUC.2010.14","DOIUrl":"https://doi.org/10.1109/EUC.2010.14","url":null,"abstract":"System virtualization, which provides good isolation, is now widely used in server consolidation. Meanwhile, one of the hot topics in this field is to extend virtualization for embedded systems. However, current popular virtualization platforms do not support real-time operating systems such as embedded Linux well because the platform is not real-time ware, which will bring low-performance I/O and high scheduling latency. The goal of this paper is to optimize the Xen virtualization platform to be real-time operating system friendly. We improve two aspects of the Xen virtualization platform. First, we improve the xen scheduler to manage the scheduling latency and response time of the real-time operating system. Second, we import multiple real-time operating systems balancing method. Our experiment demonstrates that our enhancement to the Xen virtualization platform support real-time operating system well and the improvement to the real-time performance is about 20%.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126570060","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Junqi Zhang, R. Shankaran, M. Orgun, V. Varadharajan, A. Sattar
In this paper, we present a trust establishment and management framework for hierarchical wireless sensor networks. The wireless sensor network architecture we consider consists of a collection of sensor nodes, cluster heads and a base station arranged hierarchically. The framework encompasses schemes for establishing and managing trust between these different entities. We demonstrate that the proposed framework helps to minimize the memory, computation and communication overheads involved in trust management in wireless sensor networks. Our framework takes into account direct and indirect (group) trust in trust evaluation as well as the energy associated with sensor nodes in service selection. It also considers the dynamic aspect of trust by introducing a trust varying function which could be adjusted to give greater weight to the most recently obtained trust values in the trust calculation. The architecture also has the ability to deal with the inter-cluster movement of sensor nodes using a combination of certificate based trust and behaviour based trust.
{"title":"A Dynamic Trust Establishment and Management Framework for Wireless Sensor Networks","authors":"Junqi Zhang, R. Shankaran, M. Orgun, V. Varadharajan, A. Sattar","doi":"10.1109/EUC.2010.80","DOIUrl":"https://doi.org/10.1109/EUC.2010.80","url":null,"abstract":"In this paper, we present a trust establishment and management framework for hierarchical wireless sensor networks. The wireless sensor network architecture we consider consists of a collection of sensor nodes, cluster heads and a base station arranged hierarchically. The framework encompasses schemes for establishing and managing trust between these different entities. We demonstrate that the proposed framework helps to minimize the memory, computation and communication overheads involved in trust management in wireless sensor networks. Our framework takes into account direct and indirect (group) trust in trust evaluation as well as the energy associated with sensor nodes in service selection. It also considers the dynamic aspect of trust by introducing a trust varying function which could be adjusted to give greater weight to the most recently obtained trust values in the trust calculation. The architecture also has the ability to deal with the inter-cluster movement of sensor nodes using a combination of certificate based trust and behaviour based trust.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115813532","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Solar energy harvesting gains more and more attention in the field of wireless sensor networks. In situations, where these sensor systems are deployed outdoors, powering sensor nodes by solar energy becomes a suitable alternative to the traditional way of battery power supplies. Since solar energy, opposed to batteries, can be considered as an inexhaustible energy source, scavenging this source allows longer system lifetimes and brings wireless sensor networks closer to be an autonomous system with perpetual lifetime. Despite the possibility of designing and constructing these harvesting system, dimensioning becomes a crucial task to fit implemented components to application and load system demands. In this paper we present a way of dimensioning solar harvesting systems based on simulation. Method and implementation of component and system models are described on the basis of an example architecture that has been used in prior work. Furthermore we evaluate the model in comparison to deployment of the same architecture and show the suitability of using the simulation as a support to optimize choices for system parameters.
{"title":"A Method for Dimensioning Micro-Scale Solar Energy Harvesting Systems Based on Energy Level Simulations","authors":"S. Bader, Torsten Schölzel, B. Oelmann","doi":"10.1109/EUC.2010.62","DOIUrl":"https://doi.org/10.1109/EUC.2010.62","url":null,"abstract":"Solar energy harvesting gains more and more attention in the field of wireless sensor networks. In situations, where these sensor systems are deployed outdoors, powering sensor nodes by solar energy becomes a suitable alternative to the traditional way of battery power supplies. Since solar energy, opposed to batteries, can be considered as an inexhaustible energy source, scavenging this source allows longer system lifetimes and brings wireless sensor networks closer to be an autonomous system with perpetual lifetime. Despite the possibility of designing and constructing these harvesting system, dimensioning becomes a crucial task to fit implemented components to application and load system demands. In this paper we present a way of dimensioning solar harvesting systems based on simulation. Method and implementation of component and system models are described on the basis of an example architecture that has been used in prior work. Furthermore we evaluate the model in comparison to deployment of the same architecture and show the suitability of using the simulation as a support to optimize choices for system parameters.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132002988","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The continuous growth of the users pool of Social Networking web sites such as Face book and My Space, and their incessant augmentation of services and capabilities will in the future, meet and compare in contrast with today's Content distribution Networks (CDN) and Peer-to-Peer File sharing applications such as Kazaa and Bit Torrent, but how can these two main streams applications, that already encounter their own security problems cope with the combined issues, trust for Social Networks, content and index poisoning in CDN? We will address the problems of Social Trust and File Sharing with an overlay level of trust model based on social activity and transactions, this can be an answer to enable users to increase the reliability of their online social life and also enhance the content distribution and create a better file sharing example. The aim of this research is to lower the risk of malicious activity on a given Social Network by applying a correlated trust model, to guarantee the validity of someone's identity, privacy and trustfulness in sharing content.
{"title":"OST: A Transaction Based Online Social Trust Model for Social Network and File Sharing Security","authors":"Ming Li, A. Bonti, Wanlei Zhou","doi":"10.1109/EUC.2010.128","DOIUrl":"https://doi.org/10.1109/EUC.2010.128","url":null,"abstract":"The continuous growth of the users pool of Social Networking web sites such as Face book and My Space, and their incessant augmentation of services and capabilities will in the future, meet and compare in contrast with today's Content distribution Networks (CDN) and Peer-to-Peer File sharing applications such as Kazaa and Bit Torrent, but how can these two main streams applications, that already encounter their own security problems cope with the combined issues, trust for Social Networks, content and index poisoning in CDN? We will address the problems of Social Trust and File Sharing with an overlay level of trust model based on social activity and transactions, this can be an answer to enable users to increase the reliability of their online social life and also enhance the content distribution and create a better file sharing example. The aim of this research is to lower the risk of malicious activity on a given Social Network by applying a correlated trust model, to guarantee the validity of someone's identity, privacy and trustfulness in sharing content.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131162482","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Qian Zhu, Ruicong Wang, Qi Chen, Yan Liu, Weijun Qin
With the development of sensor, wireless mobile communication, embedded system and cloud computing, the technologies of Internet of Things have been widely used in logistics, Smart Meter, public security, intelligent building and so on. Because of its huge market prospects, Internet of Things has been paid close attention by several governments all over the world, which is regarded as the third wave of information technology after Internet and mobile communication network. Bridging between wireless sensor networks with traditional communication networks or Internet, IOT Gateway plays an important role in IOT applications, which facilitates the seamless integration of wireless sensor networks and mobile communication networks or Internet, and the management and control with wireless sensor networks. In this paper, we proposed an IOT Gateway system based on Zigbee and GPRS protocols according to the typical IOT application scenarios and requirements from telecom operators, presented the data transmission between wireless sensor networks and mobile communication networks, protocol conversion of different sensor network protocols, and control functionalities for sensor networks, and finally gave an implementation of prototyping system and system validation.
{"title":"IOT Gateway: BridgingWireless Sensor Networks into Internet of Things","authors":"Qian Zhu, Ruicong Wang, Qi Chen, Yan Liu, Weijun Qin","doi":"10.1109/EUC.2010.58","DOIUrl":"https://doi.org/10.1109/EUC.2010.58","url":null,"abstract":"With the development of sensor, wireless mobile communication, embedded system and cloud computing, the technologies of Internet of Things have been widely used in logistics, Smart Meter, public security, intelligent building and so on. Because of its huge market prospects, Internet of Things has been paid close attention by several governments all over the world, which is regarded as the third wave of information technology after Internet and mobile communication network. Bridging between wireless sensor networks with traditional communication networks or Internet, IOT Gateway plays an important role in IOT applications, which facilitates the seamless integration of wireless sensor networks and mobile communication networks or Internet, and the management and control with wireless sensor networks. In this paper, we proposed an IOT Gateway system based on Zigbee and GPRS protocols according to the typical IOT application scenarios and requirements from telecom operators, presented the data transmission between wireless sensor networks and mobile communication networks, protocol conversion of different sensor network protocols, and control functionalities for sensor networks, and finally gave an implementation of prototyping system and system validation.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130936102","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Joel Gonçalves, L. Ferreira, L. M. Pinho, Guilherme D. Silva
Mobile applications are becoming increasingly more complex and making heavier demands on local system resources. Moreover, mobile systems are nowadays more open, allowing users to add more and more applications, including third-party developed ones. In this perspective, it is increasingly expected that users will want to execute in their devices applications which supersede currently available resources. It is therefore important to provide frameworks which allow applications to benefit from resources available on other nodes, capable of migrating some or all of its services to other nodes, depending on the user needs. These requirements are even more stringent when users want to execute Quality of Service (QoS) aware applications, such as voice or video. The required resources to guarantee the QoS levels demanded by an application can vary with time, and consequently, applications should be able to reconfigure themselves. This paper proposes a QoS-aware service-based framework able to support distributed, migration-capable, QoS-enabled applications on top of the Android Operating system.
{"title":"Handling Mobility on a QoS-Aware Service-based Framework for Mobile Systems","authors":"Joel Gonçalves, L. Ferreira, L. M. Pinho, Guilherme D. Silva","doi":"10.1109/EUC.2010.24","DOIUrl":"https://doi.org/10.1109/EUC.2010.24","url":null,"abstract":"Mobile applications are becoming increasingly more complex and making heavier demands on local system resources. Moreover, mobile systems are nowadays more open, allowing users to add more and more applications, including third-party developed ones. In this perspective, it is increasingly expected that users will want to execute in their devices applications which supersede currently available resources. It is therefore important to provide frameworks which allow applications to benefit from resources available on other nodes, capable of migrating some or all of its services to other nodes, depending on the user needs. These requirements are even more stringent when users want to execute Quality of Service (QoS) aware applications, such as voice or video. The required resources to guarantee the QoS levels demanded by an application can vary with time, and consequently, applications should be able to reconfigure themselves. This paper proposes a QoS-aware service-based framework able to support distributed, migration-capable, QoS-enabled applications on top of the Android Operating system.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133421603","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：