Due to the high percentage of mobile devices thefts and the financial loss that it causes, this paper aims to develop an inexpensive framework to identify a user to his/her mobile device. In case the user is not successfully identified the mobile devices' manager blocks the device completely, avoiding use of any service, including calls, browsing the Internet, sending SMS and accessing personal data, such as contacts, last calls made and received, among others. Experiments using PDAs are presented to demonstrate the feasibility of this project.
{"title":"Towards a User Identification Framework for Mobile Devices","authors":"Alessandro Brawerman, L. Albini","doi":"10.1109/CCNC08.2007.67","DOIUrl":"https://doi.org/10.1109/CCNC08.2007.67","url":null,"abstract":"Due to the high percentage of mobile devices thefts and the financial loss that it causes, this paper aims to develop an inexpensive framework to identify a user to his/her mobile device. In case the user is not successfully identified the mobile devices' manager blocks the device completely, avoiding use of any service, including calls, browsing the Internet, sending SMS and accessing personal data, such as contacts, last calls made and received, among others. Experiments using PDAs are presented to demonstrate the feasibility of this project.","PeriodicalId":183858,"journal":{"name":"2008 5th IEEE Consumer Communications and Networking Conference","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127763252","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}
Jaewoon Kim, Sekwon Kim, Youngjin Park, Soonwoo Lee, Y. Shin
We propose a selective detection scheme based on pulse repetition considering Bit Error Rate (BER) performance and complexity of noncoherent Ultra Wide Band (UWB) systems. To consider system complexity, the proposed scheme transmits the UWB signals by pulse repetition at the transmitter, like the conventional Pulse Repetition Coding (PRC). However, to effectively improve BER performance of the system, the proposed scheme performs selective detection by estimating the Signal-to-Noise Ratio (SNR) of the received pulse-repeated signal at the UWB receiver. Hence, the proposed scheme effectively improves BER performance of the noncoherent UWB systems without increase of the system complexity, as compared to the conventional PRC algorithm.
{"title":"A Selective Detection Scheme Based on Pulse Repetition for Noncoherent UWB Systems","authors":"Jaewoon Kim, Sekwon Kim, Youngjin Park, Soonwoo Lee, Y. Shin","doi":"10.1109/CCNC08.2007.27","DOIUrl":"https://doi.org/10.1109/CCNC08.2007.27","url":null,"abstract":"We propose a selective detection scheme based on pulse repetition considering Bit Error Rate (BER) performance and complexity of noncoherent Ultra Wide Band (UWB) systems. To consider system complexity, the proposed scheme transmits the UWB signals by pulse repetition at the transmitter, like the conventional Pulse Repetition Coding (PRC). However, to effectively improve BER performance of the system, the proposed scheme performs selective detection by estimating the Signal-to-Noise Ratio (SNR) of the received pulse-repeated signal at the UWB receiver. Hence, the proposed scheme effectively improves BER performance of the noncoherent UWB systems without increase of the system complexity, as compared to the conventional PRC algorithm.","PeriodicalId":183858,"journal":{"name":"2008 5th IEEE Consumer Communications and Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129074535","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}
Orthogonal frequency division multiple access (OFDMA) provides possibilities to exploit diversity of a frequency selective fading channel by appropriate resource scheduling strategies. This paper presents the performance comparison of different strategies with fair allocation of transmission capacity in a typical multiuser scenario. The analyzed performance metrics comprise both throughput and delay, which are required for a comprehensive analysis regarding quality of service (QoS). The evaluation has been conducted by means of stochastic event-driven simulations of a WiMAX based OFDMA system. Therefore, the developed simulation tool provides a detailed implementation of both medium access control (MAC) and physical layer (PHY). The presented results clarify the significant impact of different scheduling strategies on the tradeoff between throughput and delay.
{"title":"Comparison of OFDMA Resource Scheduling Strategies with Fair Allocation of Capacity","authors":"M. Einhaus, O. Klein, B. Walke","doi":"10.1109/CCNC08.2007.97","DOIUrl":"https://doi.org/10.1109/CCNC08.2007.97","url":null,"abstract":"Orthogonal frequency division multiple access (OFDMA) provides possibilities to exploit diversity of a frequency selective fading channel by appropriate resource scheduling strategies. This paper presents the performance comparison of different strategies with fair allocation of transmission capacity in a typical multiuser scenario. The analyzed performance metrics comprise both throughput and delay, which are required for a comprehensive analysis regarding quality of service (QoS). The evaluation has been conducted by means of stochastic event-driven simulations of a WiMAX based OFDMA system. Therefore, the developed simulation tool provides a detailed implementation of both medium access control (MAC) and physical layer (PHY). The presented results clarify the significant impact of different scheduling strategies on the tradeoff between throughput and delay.","PeriodicalId":183858,"journal":{"name":"2008 5th IEEE Consumer Communications and Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129020715","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}
J. Wikman, J. Nurminen, H. Kokkinen, P. Muilu, M. Heikela
We will demonstrate how a common mainstream web application development stack, the so-called AMP stack, can be installed on a mobile phone and used for creating a mobile website that utilize the unique characteristics of a mobile personal device. By providing a widely used web application development environment also on the mobile phone, we foresee that the threshold for developing mobile Web sites effectively can be removed.
{"title":"Mobile Web Application Development Stack","authors":"J. Wikman, J. Nurminen, H. Kokkinen, P. Muilu, M. Heikela","doi":"10.1109/CCNC08.2007.291","DOIUrl":"https://doi.org/10.1109/CCNC08.2007.291","url":null,"abstract":"We will demonstrate how a common mainstream web application development stack, the so-called AMP stack, can be installed on a mobile phone and used for creating a mobile website that utilize the unique characteristics of a mobile personal device. By providing a widely used web application development environment also on the mobile phone, we foresee that the threshold for developing mobile Web sites effectively can be removed.","PeriodicalId":183858,"journal":{"name":"2008 5th IEEE Consumer Communications and Networking Conference","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132300052","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}
Sang-Bum Suh, J. Hwang, Joon-Young Shim, Jae-Min Ryu, Sung-kwan Heo, Chan-Ju Park, Chul-Ryun Kim, Jae-Ra Lee, I. Park, Hosoo Lee
Stateless computing is a new computing service focused on migrating user's computing contexts among different devices. In the near future, seamless computing will make computing environment easier to use and human centric. Users will not have spend time doing computing environment setup such as installation and upgrade. They will bring their own computing contexts, which consist of programs, files, and execution states, inside their pockets as saved in a small memory stick. The computing contexts will be restored on various devices, e.g. TV, desktops, mobile phone, PDA, etc. Our demonstration will show the early step to the seamless computing vision. We will demonstrate a seamless computing prototype which migrates computing contexts among different mobile embedded devices. The core technology inside the prototype which enables this computing state capability is the embedded virtual machine monitor (VMM), named as Secure Xen on ARM. We will migrate the whole state of a virtual machine between two HW platforms. Secure Xen on ARM run on the two platforms. A virtual machine running under the VMM on one platform is saved during its execution to USB memory stick, then the memory stick is plugged in to the other platform and the saved context is restored and continue execution of the virtual machine.
{"title":"Computing State Migration Between Mobile Platforms for Seamless Computing Environments","authors":"Sang-Bum Suh, J. Hwang, Joon-Young Shim, Jae-Min Ryu, Sung-kwan Heo, Chan-Ju Park, Chul-Ryun Kim, Jae-Ra Lee, I. Park, Hosoo Lee","doi":"10.1109/CCNC08.2007.274","DOIUrl":"https://doi.org/10.1109/CCNC08.2007.274","url":null,"abstract":"Stateless computing is a new computing service focused on migrating user's computing contexts among different devices. In the near future, seamless computing will make computing environment easier to use and human centric. Users will not have spend time doing computing environment setup such as installation and upgrade. They will bring their own computing contexts, which consist of programs, files, and execution states, inside their pockets as saved in a small memory stick. The computing contexts will be restored on various devices, e.g. TV, desktops, mobile phone, PDA, etc. Our demonstration will show the early step to the seamless computing vision. We will demonstrate a seamless computing prototype which migrates computing contexts among different mobile embedded devices. The core technology inside the prototype which enables this computing state capability is the embedded virtual machine monitor (VMM), named as Secure Xen on ARM. We will migrate the whole state of a virtual machine between two HW platforms. Secure Xen on ARM run on the two platforms. A virtual machine running under the VMM on one platform is saved during its execution to USB memory stick, then the memory stick is plugged in to the other platform and the saved context is restored and continue execution of the virtual machine.","PeriodicalId":183858,"journal":{"name":"2008 5th IEEE Consumer Communications and Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130604370","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}
We design an architecture of distributed certification authority (MeCA) for wireless mesh networks (WMNs). In MeCA, the secret key and functions of certification authority are distributed over several mesh routers. For secret sharing and redistribution, we develop the fast verifiable share redistribution (FVSR) scheme. MeCA adopts the multicasting based on Ruiz tree, which is optimal in reducing the operation overhead. It can update, revoke, and verify certificates of WMN nodes in a secure and efficient manner. Simulation results show that MeCA does not disclose its secret key even under severe attacks while incurring low overhead compared to other existing schemes in mobile ad hoc networks.
{"title":"MeCA: Distributed Certification Authority in Wireless Mesh Networks","authors":"Jongtack Kim, S. Bahk","doi":"10.1109/CCNC08.2007.66","DOIUrl":"https://doi.org/10.1109/CCNC08.2007.66","url":null,"abstract":"We design an architecture of distributed certification authority (MeCA) for wireless mesh networks (WMNs). In MeCA, the secret key and functions of certification authority are distributed over several mesh routers. For secret sharing and redistribution, we develop the fast verifiable share redistribution (FVSR) scheme. MeCA adopts the multicasting based on Ruiz tree, which is optimal in reducing the operation overhead. It can update, revoke, and verify certificates of WMN nodes in a secure and efficient manner. Simulation results show that MeCA does not disclose its secret key even under severe attacks while incurring low overhead compared to other existing schemes in mobile ad hoc networks.","PeriodicalId":183858,"journal":{"name":"2008 5th IEEE Consumer Communications and Networking Conference","volume":"71 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130695949","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}
We propose efficient buffer-accounting algorithms that achieve edge-based max-min and proportional fairness in a multi-hop (MH), multi-bottleneck network environment by extending and generalizing an existing proactive queue-management scheme called GREEN. We call our scheme GREEN-MH. We envision deploying GREEN-MH at an institutional gateway in the context of a larger multi-hop and multi-bottleneck network environment. GREEN-MH uses a dynamic buffer-accounting algorithm on a per-flow basis such that certain edge-based fairness policies (e.g., max-min and proportional) are enforced among the competing TCP flows.
{"title":"Achieving Edge-Based Fairness in a Multi-Hop Environment","authors":"M. Arisoylu, Wu-chun Feng","doi":"10.1109/CCNC08.2007.99","DOIUrl":"https://doi.org/10.1109/CCNC08.2007.99","url":null,"abstract":"We propose efficient buffer-accounting algorithms that achieve edge-based max-min and proportional fairness in a multi-hop (MH), multi-bottleneck network environment by extending and generalizing an existing proactive queue-management scheme called GREEN. We call our scheme GREEN-MH. We envision deploying GREEN-MH at an institutional gateway in the context of a larger multi-hop and multi-bottleneck network environment. GREEN-MH uses a dynamic buffer-accounting algorithm on a per-flow basis such that certain edge-based fairness policies (e.g., max-min and proportional) are enforced among the competing TCP flows.","PeriodicalId":183858,"journal":{"name":"2008 5th IEEE Consumer Communications and Networking Conference","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130785208","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 digitalization of home multimedia brings with it increased numbers of different kind of new devices. Although adding new user experiences, this will significantly increase energy consumption at home and globally. In this article we present one potential solution to enable more aggressive power management in networked home devices. This solution is based on UPnP Low power which allows devices in power save modes to be discovered and waken up. It is also shown based on implemented prototype that efficient power management system can be built on top of UPnP low power, particularly if home router manufacturers support the UPnP low power proxy service in their devices.
{"title":"Networked Power Management for Home Multimedia","authors":"Antti Virolainen, M. Saaranen","doi":"10.1109/CCNC08.2007.80","DOIUrl":"https://doi.org/10.1109/CCNC08.2007.80","url":null,"abstract":"The digitalization of home multimedia brings with it increased numbers of different kind of new devices. Although adding new user experiences, this will significantly increase energy consumption at home and globally. In this article we present one potential solution to enable more aggressive power management in networked home devices. This solution is based on UPnP Low power which allows devices in power save modes to be discovered and waken up. It is also shown based on implemented prototype that efficient power management system can be built on top of UPnP low power, particularly if home router manufacturers support the UPnP low power proxy service in their devices.","PeriodicalId":183858,"journal":{"name":"2008 5th IEEE Consumer Communications and Networking Conference","volume":"59 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117221219","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}
Younghwan Choi, Soochang Park, Euisin Lee, Fucai Yu, Sang-Ha Kim
Typical wireless sensor networks consist of sensor nodes and base-stations (sinks). The sensors, sinks, and user nodes can orthogonally provide their own mobility environments. The existing studies take only sensor mobility, sink mobility, and event mobility into account. Inquirer mobility, however, can be possibly suggested as one of the mobility models. An inquirer is one of the existing entity for sensor networks as a user. Inquirer mobility and routing mechanism to support it are proposed in this paper. For that, possible mobility environment and characteristics are also analyzed. At the end of this paper, excellence of the proposed routing model is proved through simulation results.
{"title":"Passive Data Dissemination Scheme for Supporting Inquirer Mobility in Wireless Sensor Networks","authors":"Younghwan Choi, Soochang Park, Euisin Lee, Fucai Yu, Sang-Ha Kim","doi":"10.1109/CCNC08.2007.81","DOIUrl":"https://doi.org/10.1109/CCNC08.2007.81","url":null,"abstract":"Typical wireless sensor networks consist of sensor nodes and base-stations (sinks). The sensors, sinks, and user nodes can orthogonally provide their own mobility environments. The existing studies take only sensor mobility, sink mobility, and event mobility into account. Inquirer mobility, however, can be possibly suggested as one of the mobility models. An inquirer is one of the existing entity for sensor networks as a user. Inquirer mobility and routing mechanism to support it are proposed in this paper. For that, possible mobility environment and characteristics are also analyzed. At the end of this paper, excellence of the proposed routing model is proved through simulation results.","PeriodicalId":183858,"journal":{"name":"2008 5th IEEE Consumer Communications and Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131035426","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 study the topic of distributed and optimal congestion control for scalable video streams in application-layer multicast (ALM). We propose a TCP-friendly, fully distributed synchronous algorithm based on the utility-price model which maximizes the global utilities for the streams in the application-layer multicast tree. With the help of numerical study, we show that our proposed algorithm optimizes the overall video quality for fine-grained scalable streams, while minimizing the messaging overhead in the application-layer multicast channel.
{"title":"Distributed and Optimal Congestion Control for Application-Layer Multicast: A Synchronous Dual Algorithm","authors":"Jinyao Yan, M. May, B. Plattner","doi":"10.1109/CCNC08.2007.69","DOIUrl":"https://doi.org/10.1109/CCNC08.2007.69","url":null,"abstract":"In this paper, we study the topic of distributed and optimal congestion control for scalable video streams in application-layer multicast (ALM). We propose a TCP-friendly, fully distributed synchronous algorithm based on the utility-price model which maximizes the global utilities for the streams in the application-layer multicast tree. With the help of numerical study, we show that our proposed algorithm optimizes the overall video quality for fine-grained scalable streams, while minimizing the messaging overhead in the application-layer multicast channel.","PeriodicalId":183858,"journal":{"name":"2008 5th IEEE Consumer Communications and Networking Conference","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131398328","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
扫码关注我们
求助内容：
应助结果提醒方式：