Pub Date : 2009-01-11DOI: 10.1109/CCNC.2009.4784983
Yanying Gu, R. V. Prasad, I. Niemegeers
User centered Personal Network (PN) interconnects various devices belonging to a user in different geographic locations, such as home, office, car, etc., to form one network to improve the quality of life of the user. In PNs, the user's devices move in different groups, where these groups merge and split. A PN Mobility Model (PNMM) has been proposed to model the devices' movements in PNs. In this paper, PNMM has been evaluated: stability evaluation proves that PNMM maintains a long-term steady state. The impact of PNMM on the performance of protocols designed for PNs has been discussed in this paper. Simulation results give insights of the performance of the PN Clustering Protocol, and provide guidelines for future design of clustering in PNs.
{"title":"Mobility Modeling for Personal Networks: Properties and its Impact","authors":"Yanying Gu, R. V. Prasad, I. Niemegeers","doi":"10.1109/CCNC.2009.4784983","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784983","url":null,"abstract":"User centered Personal Network (PN) interconnects various devices belonging to a user in different geographic locations, such as home, office, car, etc., to form one network to improve the quality of life of the user. In PNs, the user's devices move in different groups, where these groups merge and split. A PN Mobility Model (PNMM) has been proposed to model the devices' movements in PNs. In this paper, PNMM has been evaluated: stability evaluation proves that PNMM maintains a long-term steady state. The impact of PNMM on the performance of protocols designed for PNs has been discussed in this paper. Simulation results give insights of the performance of the PN Clustering Protocol, and provide guidelines for future design of clustering in PNs.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133647151","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 novel Trojan detection and defense system. The prototype searches the important files which contain users' confidential information on the disk. And then, these files will be monitored to find which processes will access them by capturing and analyzing the IRPs (I/O Request Packets). The processes of Trojans will be distinguished from regular ones by evaluating their API-calls with several machine-learning models, rather than traditional signature-based mechanism. Testing results show that this prototype could detect and defend the unknown Trojans quickly and accurately.
{"title":"Prototype Demonstration: Trojan Detection and Defense System","authors":"Ting Liu, X. Guan, Q. Zheng, Ke Lu, Yuanfeng Song, Weizhan Zhang","doi":"10.1109/CCNC.2009.4785028","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4785028","url":null,"abstract":"This paper presents a novel Trojan detection and defense system. The prototype searches the important files which contain users' confidential information on the disk. And then, these files will be monitored to find which processes will access them by capturing and analyzing the IRPs (I/O Request Packets). The processes of Trojans will be distinguished from regular ones by evaluating their API-calls with several machine-learning models, rather than traditional signature-based mechanism. Testing results show that this prototype could detect and defend the unknown Trojans quickly and accurately.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116502089","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}
Pub Date : 2009-01-11DOI: 10.1109/CCNC.2009.4784922
G. Heiser
Virtualization, well established in enterprise computing, is finding its way into embedded systems. However, the use cases differ dramatically between the domains, and this results in significant differences in the requirements on the virtual-machine technology. This paper examines a number of typical virtualization use cases from the CE domain, and the resulting requirements imposed on the hypervisor. We find that enterprise-style hypervisors are ill-matched to the requirements of the embedded domain, which are characterised by low-overhead communication, real-time capability, small memory footprint, small trusted computing base, and fine-grained control over security. We present the OKL4 hypervisor, a member of the L4 microkernel family, designed for embedded-systems use. We outline OKL4's relevant properties with an emphasis on its security mechanisms, and compare its performance to a version of Xen that has recently been promoted for CE use. We conclude that OKL4 is superior to enterprise-style hypervisors for use in CE devices.
{"title":"Hypervisors for Consumer Electronics","authors":"G. Heiser","doi":"10.1109/CCNC.2009.4784922","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784922","url":null,"abstract":"Virtualization, well established in enterprise computing, is finding its way into embedded systems. However, the use cases differ dramatically between the domains, and this results in significant differences in the requirements on the virtual-machine technology. \u0000 \u0000This paper examines a number of typical virtualization use cases from the CE domain, and the resulting requirements imposed on the hypervisor. We find that enterprise-style hypervisors are ill-matched to the requirements of the embedded domain, which are characterised by low-overhead communication, real-time capability, small memory footprint, small trusted computing base, and fine-grained control over security. We present the OKL4 hypervisor, a member of the L4 microkernel family, designed for embedded-systems use. We outline OKL4's relevant properties with an emphasis on its security mechanisms, and compare its performance to a version of Xen that has recently been promoted for CE use. We conclude that OKL4 is superior to enterprise-style hypervisors for use in CE devices.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116969714","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}
Pub Date : 2009-01-11DOI: 10.1109/CCNC.2009.4784843
Z. Khan, J. Thiriet, D. Genon-Catalot
This paper describes a distributed wireless network architecture for remote diagnosis and monitoring. A windmill farm is considered as a target application, which is further grouped into small clusters of windmills communicating with each other for the purpose of distributed diagnosis. Wireless links are commonly used for long-range communication in SCADA systems. In order to extend wireless networks for remote diagnosis applications, strict requirements on availability, robustness, reliability and performance have to be satisfied in order to meet industrial standards. This paper is intended to present a wireless network architecture for tele-operation of large industrial applications.
{"title":"Wireless Network Architecture for Diagnosis and Monitoring Applications","authors":"Z. Khan, J. Thiriet, D. Genon-Catalot","doi":"10.1109/CCNC.2009.4784843","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784843","url":null,"abstract":"This paper describes a distributed wireless network architecture for remote diagnosis and monitoring. A windmill farm is considered as a target application, which is further grouped into small clusters of windmills communicating with each other for the purpose of distributed diagnosis. Wireless links are commonly used for long-range communication in SCADA systems. In order to extend wireless networks for remote diagnosis applications, strict requirements on availability, robustness, reliability and performance have to be satisfied in order to meet industrial standards. This paper is intended to present a wireless network architecture for tele-operation of large industrial applications.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116607418","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}
Pub Date : 2009-01-11DOI: 10.1109/CCNC.2009.4784811
Seung-Ik Lee, Y. Ko, Dongman Lee, S. Hyun
In this paper, we propose QoS-constrained peer selection and nondisruptive rate adaptation schemes with considering shared bottleneck problem to provide a stable peer-to-peer live video streaming service during vertical handoff. In the proposed scheme, a QoS-constrained peer is selected by estimating bandwidth with active probing, and a reception rate converges to a stable state without any QoS degradation with help of multi-path handoff. The shared bottleneck problem is addressed by adjusting the estimated bandwidth and yielding the redundant bandwidth usage.
{"title":"A Nondisruptive Adaptation Scheme for Peer-to-Peer Live Video Streaming during Vertical Handoff","authors":"Seung-Ik Lee, Y. Ko, Dongman Lee, S. Hyun","doi":"10.1109/CCNC.2009.4784811","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784811","url":null,"abstract":"In this paper, we propose QoS-constrained peer selection and nondisruptive rate adaptation schemes with considering shared bottleneck problem to provide a stable peer-to-peer live video streaming service during vertical handoff. In the proposed scheme, a QoS-constrained peer is selected by estimating bandwidth with active probing, and a reception rate converges to a stable state without any QoS degradation with help of multi-path handoff. The shared bottleneck problem is addressed by adjusting the estimated bandwidth and yielding the redundant bandwidth usage.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115260065","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}
Pub Date : 2009-01-11DOI: 10.1109/CCNC.2009.4784751
Jinglong Zhou, M. Jacobsson, E. Onur, I. Niemegeers
Accurate and fast wireless link quality assessment (LQA) for wireless channels would bring huge benefits for mobile multi-hop and multi-rate wireless ad hoc and sensor networks in the form of improved end-to-end performance. In this paper, we propose a novel LQA method based on cross-layer information. The method is implemented in a real test-bed, which is based on IEEE 802.11b/g, and achieved a significant LQA improvement up to 50% in mobile scenarios without introducing overhead. The effectiveness of accurate and fast LQA is demonstrated by feeding it into the routing layer to enable the route decisions to adapt faster during changing situations, especially in mobile scenarios. The experiment results show that the proposed LQA method can lead to faster and smarter routing decisions and higher end-to-end throughput compared to traditional methods, which only use hello packets to determine the link quality in mobile scenario.
{"title":"A Novel Link Quality Assessment Method for Mobile Multi-Rate Multi-Hop Wireless Networks","authors":"Jinglong Zhou, M. Jacobsson, E. Onur, I. Niemegeers","doi":"10.1109/CCNC.2009.4784751","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784751","url":null,"abstract":"Accurate and fast wireless link quality assessment (LQA) for wireless channels would bring huge benefits for mobile multi-hop and multi-rate wireless ad hoc and sensor networks in the form of improved end-to-end performance. In this paper, we propose a novel LQA method based on cross-layer information. The method is implemented in a real test-bed, which is based on IEEE 802.11b/g, and achieved a significant LQA improvement up to 50% in mobile scenarios without introducing overhead. The effectiveness of accurate and fast LQA is demonstrated by feeding it into the routing layer to enable the route decisions to adapt faster during changing situations, especially in mobile scenarios. The experiment results show that the proposed LQA method can lead to faster and smarter routing decisions and higher end-to-end throughput compared to traditional methods, which only use hello packets to determine the link quality in mobile scenario.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116035076","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}
Pub Date : 2009-01-11DOI: 10.1109/CCNC.2009.4784860
Joseph C. H. So, P. Wong
In content delivery services, quality of service is greatly affected by the resources provided by the underlying overlay P2P. In order to maintain the level of resources acquired, soliciting peers' resources contributions by giving explicit remunerations is a feasible solution. From the service providers' perspectives, the remuneration should be minimized as long as the guaranteed services are fulfilled for all users. We consider a model defining the objective function to minimize this cost in service provision and a distributed and cost-efficient resource acquisition algorithm. Our results show that, in a network of the heterogeneous peers with limited local information, the service availability can be enhanced by appropriate resource acquisition schemes even in a heavily loaded network and the number of resource providers can be controlled by applying appropriate cost model.
{"title":"Remuneration Aware Resource Acquisition in P2P Overlay","authors":"Joseph C. H. So, P. Wong","doi":"10.1109/CCNC.2009.4784860","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784860","url":null,"abstract":"In content delivery services, quality of service is greatly affected by the resources provided by the underlying overlay P2P. In order to maintain the level of resources acquired, soliciting peers' resources contributions by giving explicit remunerations is a feasible solution. From the service providers' perspectives, the remuneration should be minimized as long as the guaranteed services are fulfilled for all users. We consider a model defining the objective function to minimize this cost in service provision and a distributed and cost-efficient resource acquisition algorithm. Our results show that, in a network of the heterogeneous peers with limited local information, the service availability can be enhanced by appropriate resource acquisition schemes even in a heavily loaded network and the number of resource providers can be controlled by applying appropriate cost model.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114892219","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}
Pub Date : 2009-01-11DOI: 10.1109/CCNC.2009.4785011
Baek-Gyu Kim, Tae-Hyon Kim, Soon-Ju Kang, Jae Shin Lee, Jin Ho Shon, Sang Chul Go
We introduce a ubiquitous sensor network system, called U-FIPI, to monitor the early symptom of fire and intruder in indoor environment. Especially, this system adapts a novel approach to provide bidirectional location-awareness service between various mobile nodes and U-FIPI fixture nodes making it suitable for total service as a new concept of building management system.
{"title":"U-FIPI: Ubiquitous Sensor Network Service Infra Supporting Bidirectional Location-Awareness between Mobile Nodes and Fixture Nodes","authors":"Baek-Gyu Kim, Tae-Hyon Kim, Soon-Ju Kang, Jae Shin Lee, Jin Ho Shon, Sang Chul Go","doi":"10.1109/CCNC.2009.4785011","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4785011","url":null,"abstract":"We introduce a ubiquitous sensor network system, called U-FIPI, to monitor the early symptom of fire and intruder in indoor environment. Especially, this system adapts a novel approach to provide bidirectional location-awareness service between various mobile nodes and U-FIPI fixture nodes making it suitable for total service as a new concept of building management system.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"242 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115018816","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}
Pub Date : 2009-01-11DOI: 10.1109/CCNC.2009.4785020
A. Fasbender, Martin Gerdes, Takeshi Matsumura, Andreas Häber, F. Reichert
In today's content delivery solutions, service delivery and control are still tightly coupled, a service typically being delivered to the same device that controls the session. We present a solution that was designed with the goal to decouple service control and delivery. Using our approach, multimedia streaming services can be delivered to off-the-shelf DLNA devices in visited networks. The service provider receives information about the remote media player and access environment via a mobile phone. Proximity technologies (e.g. barcodes, NFC) of the control device are used for the exchange of required credentials. This paper describes a typical scenario and our prototype implementation.
{"title":"Media Delivery to Remote Renderers Controlled by the Mobile Phone","authors":"A. Fasbender, Martin Gerdes, Takeshi Matsumura, Andreas Häber, F. Reichert","doi":"10.1109/CCNC.2009.4785020","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4785020","url":null,"abstract":"In today's content delivery solutions, service delivery and control are still tightly coupled, a service typically being delivered to the same device that controls the session. We present a solution that was designed with the goal to decouple service control and delivery. Using our approach, multimedia streaming services can be delivered to off-the-shelf DLNA devices in visited networks. The service provider receives information about the remote media player and access environment via a mobile phone. Proximity technologies (e.g. barcodes, NFC) of the control device are used for the exchange of required credentials. This paper describes a typical scenario and our prototype implementation.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121171832","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}
Pub Date : 2009-01-11DOI: 10.1109/CCNC.2009.4784911
Jing-Kai Lou, Kuan-Ta Chen, C. Lei
For current Web 2.0 services, manual examination of user uploaded content is normally required to ensure its legitimacy and appropriateness, which is a substantial burden to service providers. To reduce labor costs and the delays caused by content censoring, social moderation has been proposed as a front-line mechanism, whereby user moderators are encouraged to examine content before system moderation is required. Given the immerse amount of new content added to the Web each day, there is a need for automation schemes to facilitate rear system moderation. This kind of mechanism is expected to automatically summarize reports from user moderators and ban misbehaving users or remove inappropriate content whenever possible. However, the accuracy of such schemes may be reduced by collusion attacks, where some work together to mislead the automatic summarization in order to obtain shared benefits. In this paper, we propose a collusion-resistant automation scheme for social moderation systems. Because some user moderators may collude and dishonestly claim that a user misbehaves, our scheme detects whether an accusation from a user moderator is fair or malicious based on the structure of mutual accusations of all users in the system. Through simulations we show that collusion attacks are likely to succeed if an intuitive count-based automation scheme is used. The proposed scheme, which is based on the community structure of the user accusation graph, achieves a decent performance in most scenarios.
{"title":"A Collusion-Resistant Automation Scheme for Social Moderation Systems","authors":"Jing-Kai Lou, Kuan-Ta Chen, C. Lei","doi":"10.1109/CCNC.2009.4784911","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784911","url":null,"abstract":"For current Web 2.0 services, manual examination of user uploaded content is normally required to ensure its legitimacy and appropriateness, which is a substantial burden to service providers. To reduce labor costs and the delays caused by content censoring, social moderation has been proposed as a front-line mechanism, whereby user moderators are encouraged to examine content before system moderation is required. Given the immerse amount of new content added to the Web each day, there is a need for automation schemes to facilitate rear system moderation. This kind of mechanism is expected to automatically summarize reports from user moderators and ban misbehaving users or remove inappropriate content whenever possible. However, the accuracy of such schemes may be reduced by collusion attacks, where some work together to mislead the automatic summarization in order to obtain shared benefits. \u0000 \u0000In this paper, we propose a collusion-resistant automation scheme for social moderation systems. Because some user moderators may collude and dishonestly claim that a user misbehaves, our scheme detects whether an accusation from a user moderator is fair or malicious based on the structure of mutual accusations of all users in the system. Through simulations we show that collusion attacks are likely to succeed if an intuitive count-based automation scheme is used. The proposed scheme, which is based on the community structure of the user accusation graph, achieves a decent performance in most scenarios.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128350832","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
扫码关注我们
求助内容：
应助结果提醒方式：