How to choose the best service provider (agent), which a service consumer can trust in terms of the quality and success rate of the service in an open and dynamic environment, is a challenging problem in many service-oriented applications such as Internet-based grid systems, e-trading systems, as well as service-oriented computing systems. This paper presents a Priority-Based Trust (PBTrust) model for service selection in general service-oriented environments. The PBTrust is robust and novel from several perspectives. (1) The reputation of a service provider is derived from referees who are third parties and had interactions with the provider in a rich context format, including attributes of the service, the priority distribution on attributes and a rating value for each attribute from a third party, (2) The concept of `Similarity' is introduced to measure the difference in terms of distributions of priorities on attributes between requested service and a refereed service in order to precisely predict the performance of a potential provider on the requested service, (3) The concept of general performance of a service provider on a service in history is also introduced to improve the success rate on the requested service. The experimental results can prove that PBtrust has a better performance than that of the CR model in a service-oriented environment.
{"title":"PBTrust: A Priority-Based Trust Model for Service Selection in General Service-Oriented Environments","authors":"Xing Su, Minjie Zhang, Y. Mu, K. Sim","doi":"10.1109/EUC.2010.129","DOIUrl":"https://doi.org/10.1109/EUC.2010.129","url":null,"abstract":"How to choose the best service provider (agent), which a service consumer can trust in terms of the quality and success rate of the service in an open and dynamic environment, is a challenging problem in many service-oriented applications such as Internet-based grid systems, e-trading systems, as well as service-oriented computing systems. This paper presents a Priority-Based Trust (PBTrust) model for service selection in general service-oriented environments. The PBTrust is robust and novel from several perspectives. (1) The reputation of a service provider is derived from referees who are third parties and had interactions with the provider in a rich context format, including attributes of the service, the priority distribution on attributes and a rating value for each attribute from a third party, (2) The concept of `Similarity' is introduced to measure the difference in terms of distributions of priorities on attributes between requested service and a refereed service in order to precisely predict the performance of a potential provider on the requested service, (3) The concept of general performance of a service provider on a service in history is also introduced to improve the success rate on the requested service. The experimental results can prove that PBtrust has a better performance than that of the CR model in a service-oriented environment.","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":"125812380","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}
Youngjun Jo, Jungyoungj Bae, Hyunjae Shin, Heungwoo Nam, Sae-Young Ahn, Sunshin An
Recently, the importance of a water resource is highly concerned. Therefore, Underwater Wireless Sensor Networks (UASNs) technologies are vigorously studied for monitoring underwater environment. The UASNs gather various underwater environmental data that should be delivered to a Monitoring Center where nearby or far from UASNs are deployed. To deliver data form underwater to the Monitoring Center or vice versa, a surface gateway should change acoustic signal to RF (Radio Frequency) signal. Depends on the service requirement, the surface gateway can adopt various wireless communication channels such as Cellular network, Zigbee and so on. In this paper, we propose the architecture of surface gateway that has several wireless communication channels and communication protocol.
{"title":"The Architecture of Surface Gateway for Underwater Acoustic Sensor Networks","authors":"Youngjun Jo, Jungyoungj Bae, Hyunjae Shin, Heungwoo Nam, Sae-Young Ahn, Sunshin An","doi":"10.1109/EUC.2010.50","DOIUrl":"https://doi.org/10.1109/EUC.2010.50","url":null,"abstract":"Recently, the importance of a water resource is highly concerned. Therefore, Underwater Wireless Sensor Networks (UASNs) technologies are vigorously studied for monitoring underwater environment. The UASNs gather various underwater environmental data that should be delivered to a Monitoring Center where nearby or far from UASNs are deployed. To deliver data form underwater to the Monitoring Center or vice versa, a surface gateway should change acoustic signal to RF (Radio Frequency) signal. Depends on the service requirement, the surface gateway can adopt various wireless communication channels such as Cellular network, Zigbee and so on. In this paper, we propose the architecture of surface gateway that has several wireless communication channels and communication protocol.","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":"130911785","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}
A distributed embedded system consists of different processing elements (PEs) communicating via communication links. PEs have various power characteristics and in turn, have different thermal profiles. With new technologies, processor power density is dramatically increased which results in high temperature. This alarming trend underscores the importance of temperature management methods in system design. The majority of proposed techniques to address thermal issues, impose severe penalties on performance and reliability. We present Schedule Swapping, a technique for reducing peak temperature in distributed embedded systems while satisfying real-time constraints. Contrary to many other approaches, our proposed technique does not use slack time for reducing power dissipation but leaves it to be used by recovery mechanisms (rollback re-execution). The more slack time, the more the number of possible recoveries and the more reliability. We also introduce a simple yet effective scheme to ensure that all the deadlines will be met if our technique is used. This scheme also determines the order in which tasks should transmit their data in Schedule Swapping. Our experimental results show up to 18.1C reduction in peak temperature. On average, Schedule Swapping achieves the peak temperature reduction of 11.13C.
{"title":"Schedule Swapping: A Technique for Temperature Management of Distributed Embedded Systems","authors":"Farzad Samie Ghahfarokhi, A. Ejlali","doi":"10.1109/EUC.2010.11","DOIUrl":"https://doi.org/10.1109/EUC.2010.11","url":null,"abstract":"A distributed embedded system consists of different processing elements (PEs) communicating via communication links. PEs have various power characteristics and in turn, have different thermal profiles. With new technologies, processor power density is dramatically increased which results in high temperature. This alarming trend underscores the importance of temperature management methods in system design. The majority of proposed techniques to address thermal issues, impose severe penalties on performance and reliability. We present Schedule Swapping, a technique for reducing peak temperature in distributed embedded systems while satisfying real-time constraints. Contrary to many other approaches, our proposed technique does not use slack time for reducing power dissipation but leaves it to be used by recovery mechanisms (rollback re-execution). The more slack time, the more the number of possible recoveries and the more reliability. We also introduce a simple yet effective scheme to ensure that all the deadlines will be met if our technique is used. This scheme also determines the order in which tasks should transmit their data in Schedule Swapping. Our experimental results show up to 18.1C reduction in peak temperature. On average, Schedule Swapping achieves the peak temperature reduction of 11.13C.","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":"130940364","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}
There has been a tremendous interest in recent years in the design of mobile ad hoc networks (MANETs) because of their dynamic topology, self-organization and ease of deployment. However, the lack of security in their routing protocols make MANETs vulnerable to a variety of routing intrusions that can compromise the data or the entire network itself. This paper presents a novel scheme for the detection and prevention of intrusions on the Optimized Link State Routing (OLSR) protocol for MANETs. This scheme is patched to the OLSR implementation and runs independently on each MANET node. The mechanism verifies specifications in control messages sent by intruder nodes in the network and addresses a unique vulnerability in the implementation of the OLSR protocol. Furthermore, this technique helps each MANET node maintain a reliable routing table which is very important to prevent intrusions. Keywords-mobile ad hoc networks, wireless security, routing protocol security, intrusion detection and prevention.
{"title":"Detection and Prevention of Routing Intrusions in Mobile Ad Hoc Networks","authors":"P. Moradiya, S. Sampalli","doi":"10.1109/EUC.2010.135","DOIUrl":"https://doi.org/10.1109/EUC.2010.135","url":null,"abstract":"There has been a tremendous interest in recent years in the design of mobile ad hoc networks (MANETs) because of their dynamic topology, self-organization and ease of deployment. However, the lack of security in their routing protocols make MANETs vulnerable to a variety of routing intrusions that can compromise the data or the entire network itself. This paper presents a novel scheme for the detection and prevention of intrusions on the Optimized Link State Routing (OLSR) protocol for MANETs. This scheme is patched to the OLSR implementation and runs independently on each MANET node. The mechanism verifies specifications in control messages sent by intruder nodes in the network and addresses a unique vulnerability in the implementation of the OLSR protocol. Furthermore, this technique helps each MANET node maintain a reliable routing table which is very important to prevent intrusions. Keywords-mobile ad hoc networks, wireless security, routing protocol security, intrusion detection and prevention.","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":"116122277","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}
This paper considers the problem of power/energy minimization for periodic real-time tasks that are scheduled over multiprocessor platforms that have dynamic power management (DPM) and dynamic voltage & frequency scaling (DVFS) capabilities. Early research reports that while both DPM and DVFS policies perform well individually for a specific set of conditions, they often outperform each other under different workload and/or architecture configuration. Thus, no single policy fits perfectly all operating conditions. Instead of designing new policies for specific operating conditions, this paper proposes a generic power management scheme, called the Hybrid Power Management (HyPowMan) scheme. This scheme takes a set of well-known existing (DPM and DVFS) policies, each of which performs well for a given set of conditions, and adapts at runtime to the best-performing policy for any given workload. We performed experiments with state-of the-art DPM and DVFS techniques and results show that HyPowMan scheme adapts well to the changing workload and always achieves overall energy savings comparable to the best-performing policy at any point in time.
{"title":"Power Management in Real Time Embedded Systems through Online and Adaptive Interplay of DPM and DVFS Policies","authors":"Muhammad Khurram Bhatti, C. Belleudy, M. Auguin","doi":"10.1109/EUC.2010.35","DOIUrl":"https://doi.org/10.1109/EUC.2010.35","url":null,"abstract":"This paper considers the problem of power/energy minimization for periodic real-time tasks that are scheduled over multiprocessor platforms that have dynamic power management (DPM) and dynamic voltage & frequency scaling (DVFS) capabilities. Early research reports that while both DPM and DVFS policies perform well individually for a specific set of conditions, they often outperform each other under different workload and/or architecture configuration. Thus, no single policy fits perfectly all operating conditions. Instead of designing new policies for specific operating conditions, this paper proposes a generic power management scheme, called the Hybrid Power Management (HyPowMan) scheme. This scheme takes a set of well-known existing (DPM and DVFS) policies, each of which performs well for a given set of conditions, and adapts at runtime to the best-performing policy for any given workload. We performed experiments with state-of the-art DPM and DVFS techniques and results show that HyPowMan scheme adapts well to the changing workload and always achieves overall energy savings comparable to the best-performing policy at any point in time.","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":"126813846","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}
This paper presents a bearings-only tracking (BOT) scheme based on distributed floating beacons in underwater sensor networks (UWSNs). Conventional BOT systems extract target-originated bearings in noisy measurements, locate and track targets based on the bearings in real time. We propose a tracking scheme by modifying BOT systems for UWSNs where a multidimensional assignment (MDA) method is used to extract target-originated bearings and to associate them with corresponding targets. In addition, a threshold-based decision in extracting bearings in MDA and a local Kalman filter is proposed to keep tracking information at a floating beacon even if a target is undetected. Simulation results show that the proposed scheme has advantage of tracking accuracy over recently known work under low detection probability.
{"title":"Bearings-only Tracking Systems with Distributed Floating Beacons in Underwater Sensor Networks","authors":"Eunchan Kim, Sangho Lee, Chungsan Kim, Kiseon Kim","doi":"10.1109/EUC.2010.51","DOIUrl":"https://doi.org/10.1109/EUC.2010.51","url":null,"abstract":"This paper presents a bearings-only tracking (BOT) scheme based on distributed floating beacons in underwater sensor networks (UWSNs). Conventional BOT systems extract target-originated bearings in noisy measurements, locate and track targets based on the bearings in real time. We propose a tracking scheme by modifying BOT systems for UWSNs where a multidimensional assignment (MDA) method is used to extract target-originated bearings and to associate them with corresponding targets. In addition, a threshold-based decision in extracting bearings in MDA and a local Kalman filter is proposed to keep tracking information at a floating beacon even if a target is undetected. Simulation results show that the proposed scheme has advantage of tracking accuracy over recently known work under low detection probability.","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":"116894408","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}
Yann-Hang Lee, Y. Song, Rohit Girme, Sagar Zaveri, Yan Chen
The non-deterministic behavior of multi-threaded embedded software makes cyclic debugging difficult. Even with the same input data, consecutive runs may result in different executions and reproducing the same bug is itself a challenge. Despite the fact that several approaches have been proposed for deterministic replay, none of them attends to the capabilities and functionalities that replay can comprise for better debugging. This paper introduces a practical replay mechanism for multi-threaded embedded software. The Replay Debugger, based on Lamport clock, offers a user controlled debugging environment in which the program execution follows the identical partially ordered happened-before dependency among threads and IO events as that of the recorded run. With the order of thread synchronizations assured, users can focus their debugging effort in the program behavior of any threads while having a comprehension of thread-level concurrency. Using a set of benchmark programs, experiment results of a prototyped implementation show that, in average, the software based approach incurs a small probe effect of 3.3% in its record stage.
{"title":"Replay Debugging for Multi-threaded Embedded Software","authors":"Yann-Hang Lee, Y. Song, Rohit Girme, Sagar Zaveri, Yan Chen","doi":"10.1109/EUC.2010.13","DOIUrl":"https://doi.org/10.1109/EUC.2010.13","url":null,"abstract":"The non-deterministic behavior of multi-threaded embedded software makes cyclic debugging difficult. Even with the same input data, consecutive runs may result in different executions and reproducing the same bug is itself a challenge. Despite the fact that several approaches have been proposed for deterministic replay, none of them attends to the capabilities and functionalities that replay can comprise for better debugging. This paper introduces a practical replay mechanism for multi-threaded embedded software. The Replay Debugger, based on Lamport clock, offers a user controlled debugging environment in which the program execution follows the identical partially ordered happened-before dependency among threads and IO events as that of the recorded run. With the order of thread synchronizations assured, users can focus their debugging effort in the program behavior of any threads while having a comprehension of thread-level concurrency. Using a set of benchmark programs, experiment results of a prototyped implementation show that, in average, the software based approach incurs a small probe effect of 3.3% in its record stage.","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":"131155559","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}
In this paper we propose an efficient heuristic for solving the Distance-1 Edge Coloring problem (D1EC) for the on-the-fly assignment of orthogonal wireless channels in wireless as soon as a topology change occurs. The coloring algorithm exploits the simulated annealing paradigm, i.e., a generalization of Monte Carlo methods for solving combinatorial problems. We show that the simulated annealing-based coloring converges fast to a sub optimal coloring scheme even for the case of dynamic channel allocation. However, a stateful implementation of the D1EC scheme is needed in order to speed-up the network coloring upon topology changes. In fact, a stateful D1EC reduces the algorithm’s convergence time by more than 60% in comparison to stateless algorithms.
{"title":"A Fast Heuristic for Solving the D1EC Coloring Problem","authors":"F. Campoccia, V. Mancuso","doi":"10.1109/EUC.2010.71","DOIUrl":"https://doi.org/10.1109/EUC.2010.71","url":null,"abstract":"In this paper we propose an efficient heuristic for solving the Distance-1 Edge Coloring problem (D1EC) for the on-the-fly assignment of orthogonal wireless channels in wireless as soon as a topology change occurs. The coloring algorithm exploits the simulated annealing paradigm, i.e., a generalization of Monte Carlo methods for solving combinatorial problems. We show that the simulated annealing-based coloring converges fast to a sub optimal coloring scheme even for the case of dynamic channel allocation. However, a stateful implementation of the D1EC scheme is needed in order to speed-up the network coloring upon topology changes. In fact, a stateful D1EC reduces the algorithm’s convergence time by more than 60% in comparison to stateless algorithms.","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":"131254372","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}
Reyhaneh Changiz, H. Halabian, F. Yu, I. Lambadaris, Helen Tang
Cooperative communication makes use of the broadcast nature of the wireless medium where adjacent nodes overhear the message transmitted by the source and assist in the transmission by relaying the overheard message to the destination. Although cooperative communication brings in significant benefits, it also raises serious security issues to wireless mobile networks. For example, there exists a possibility that a node refuses to cooperate when it is selected for cooperation or deliberately drop the received packets. In wireless mobile networks with cooperative communication, trust management is an important mechanism to monitor such networks for violations of security. In this paper, we propose a trust management method for wireless mobile networks with cooperative communications. Conventional Bayesian methodology is insufficient for the cooperative communication paradigm, as it is biased by the channel conditions and relay selection decision processes. Therefore, we modify the conventional trust management method by incorporating not only the relay selection policy but also the dynamic wireless channel conditions among the source, relays and destination. Simulation results are presented to show the effectiveness of the proposed scheme.
{"title":"Trust Management in Wireless Mobile Networks with Cooperative Communications","authors":"Reyhaneh Changiz, H. Halabian, F. Yu, I. Lambadaris, Helen Tang","doi":"10.1109/EUC.2010.82","DOIUrl":"https://doi.org/10.1109/EUC.2010.82","url":null,"abstract":"Cooperative communication makes use of the broadcast nature of the wireless medium where adjacent nodes overhear the message transmitted by the source and assist in the transmission by relaying the overheard message to the destination. Although cooperative communication brings in significant benefits, it also raises serious security issues to wireless mobile networks. For example, there exists a possibility that a node refuses to cooperate when it is selected for cooperation or deliberately drop the received packets. In wireless mobile networks with cooperative communication, trust management is an important mechanism to monitor such networks for violations of security. In this paper, we propose a trust management method for wireless mobile networks with cooperative communications. Conventional Bayesian methodology is insufficient for the cooperative communication paradigm, as it is biased by the channel conditions and relay selection decision processes. Therefore, we modify the conventional trust management method by incorporating not only the relay selection policy but also the dynamic wireless channel conditions among the source, relays and destination. Simulation results are presented to show the effectiveness of the proposed scheme.","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":"132911640","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}
N. Kuntze, R. Rieke, Günther Diederich, R. Sethmann, K. Sohr, Tanveer Mustafa, Kai-Oliver Detken
An ever increasing amount of functionality is incorporated into mobile phones—this trend will continue as new mobile phone platforms are more widely used such as the iPhone or Android. Along with this trend, however, new risks arise, especially for enterprises using mobile phones for security-critical applications such as business intelligence (BI). Although platforms like Android have implemented sophisticated security mechanisms, security holes have been reported. In addition, different stakeholders have access to mobile phones such as different enterprises, service providers, operators, or manufacturers. In order to protect security-critical business applications, a trustworthy mobile phone platform is needed. Starting with typical attack scenarios, we describe a security architecture for Android mobile phones based on the concepts of Trusted Computing. In particular, this architecture allows for a dynamic policy change to reflect the current environment the phone is being used in.
{"title":"Secure Mobile Business Information Processing","authors":"N. Kuntze, R. Rieke, Günther Diederich, R. Sethmann, K. Sohr, Tanveer Mustafa, Kai-Oliver Detken","doi":"10.1109/EUC.2010.107","DOIUrl":"https://doi.org/10.1109/EUC.2010.107","url":null,"abstract":"An ever increasing amount of functionality is incorporated into mobile phones—this trend will continue as new mobile phone platforms are more widely used such as the iPhone or Android. Along with this trend, however, new risks arise, especially for enterprises using mobile phones for security-critical applications such as business intelligence (BI). Although platforms like Android have implemented sophisticated security mechanisms, security holes have been reported. In addition, different stakeholders have access to mobile phones such as different enterprises, service providers, operators, or manufacturers. In order to protect security-critical business applications, a trustworthy mobile phone platform is needed. Starting with typical attack scenarios, we describe a security architecture for Android mobile phones based on the concepts of Trusted Computing. In particular, this architecture allows for a dynamic policy change to reflect the current environment the phone is being used in.","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":"128685506","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
扫码关注我们
求助内容：
应助结果提醒方式：