Pub Date : 2008-04-22DOI: 10.1109/ICACT.2008.4493913
M. Kasper, N. Kuntze, A. Schmidt
The primary goal of this paper is to design a software replacement for a Subscriber Identity Module (SIM) based on the TCG MPWG Reference Architecture in order to access a mobile cellular network and its offered services. Therefor, we introduce a virtual software SIM (vSIM) with comparable usage and security characteristics like the traditional smartcard-based solution. Additionally, running a virtual SIM as a trusted and protected software on a mobile device allow significant expansion of services by introducing new usage scenarios and business models, cost reduction and more flexibility. Our approach demonstrates the substitutability of a SIM card with an adequate trusted software module supported and protected by a trustworthy operating system. In particular we propose several methods for authentication and enrollment of a subscriber.
{"title":"Subscriber Authentication in Cellular Networks with Trusted Virtual SIMs","authors":"M. Kasper, N. Kuntze, A. Schmidt","doi":"10.1109/ICACT.2008.4493913","DOIUrl":"https://doi.org/10.1109/ICACT.2008.4493913","url":null,"abstract":"The primary goal of this paper is to design a software replacement for a Subscriber Identity Module (SIM) based on the TCG MPWG Reference Architecture in order to access a mobile cellular network and its offered services. Therefor, we introduce a virtual software SIM (vSIM) with comparable usage and security characteristics like the traditional smartcard-based solution. Additionally, running a virtual SIM as a trusted and protected software on a mobile device allow significant expansion of services by introducing new usage scenarios and business models, cost reduction and more flexibility. Our approach demonstrates the substitutability of a SIM card with an adequate trusted software module supported and protected by a trustworthy operating system. In particular we propose several methods for authentication and enrollment of a subscriber.","PeriodicalId":448615,"journal":{"name":"2008 10th International Conference on Advanced Communication Technology","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128880704","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 memory-efficient CAVLC decoding architecture for H.264/AVC. In the proposed architecture, not only the memory space is reduced for decoding the syntax elements such as coeff token, total zero, and run before, but also the decode efficiency is improved. After the analysis of the decoding principle of the CAVLC, we simplify the coeff-token VLD table and propose a new coeff-token VLD based on arithmetic operation and the look-up table combination architecture. The run-before VLD can used the same principle as the proposed coeff-token VLD. Otherwise, the proposed scheme also adope the zero block skipping technique and multiple symbols decoding scheme when decoding SignTrail. The simulation results show that our system can run at I68MHz clock frequency and the average cycles for decoding one macro-block is 136 cycles. The proposed architecture can achieves an approximate 39-53% savings in memory access without video quality degrading.
{"title":"A Memory-Efficient CAVLC Decoding Scheme for H.264/AVC","authors":"Yanling Chen, Xixin Cao, Xiaoming Peng, Chungan Peng, Dunshan Yu, Xing Zhang","doi":"10.1109/ICACT.2008.4493966","DOIUrl":"https://doi.org/10.1109/ICACT.2008.4493966","url":null,"abstract":"This paper presents a memory-efficient CAVLC decoding architecture for H.264/AVC. In the proposed architecture, not only the memory space is reduced for decoding the syntax elements such as coeff token, total zero, and run before, but also the decode efficiency is improved. After the analysis of the decoding principle of the CAVLC, we simplify the coeff-token VLD table and propose a new coeff-token VLD based on arithmetic operation and the look-up table combination architecture. The run-before VLD can used the same principle as the proposed coeff-token VLD. Otherwise, the proposed scheme also adope the zero block skipping technique and multiple symbols decoding scheme when decoding SignTrail. The simulation results show that our system can run at I68MHz clock frequency and the average cycles for decoding one macro-block is 136 cycles. The proposed architecture can achieves an approximate 39-53% savings in memory access without video quality degrading.","PeriodicalId":448615,"journal":{"name":"2008 10th International Conference on Advanced Communication Technology","volume":"88 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128883938","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 : 2008-04-22DOI: 10.1109/ICACT.2008.4493931
Hyo-Jin Park, Jinhong Yang, Juyoung Park, S. Kang, J. Choi
With the growing popularity of multimedia services such as IPTV, these P2P network overlay schemes are in the limelight and actively under studied as a good alternative or complementary solution for internet multimedia service systems. Therefore, in this paper, we review and compare the P2P overlay network schemes that have been introduced and researched recently by categorizing into two groups, i.e., "structured" and "unstructured".
{"title":"A Survey on Peer-to-Peer Overlay Network Schemes","authors":"Hyo-Jin Park, Jinhong Yang, Juyoung Park, S. Kang, J. Choi","doi":"10.1109/ICACT.2008.4493931","DOIUrl":"https://doi.org/10.1109/ICACT.2008.4493931","url":null,"abstract":"With the growing popularity of multimedia services such as IPTV, these P2P network overlay schemes are in the limelight and actively under studied as a good alternative or complementary solution for internet multimedia service systems. Therefore, in this paper, we review and compare the P2P overlay network schemes that have been introduced and researched recently by categorizing into two groups, i.e., \"structured\" and \"unstructured\".","PeriodicalId":448615,"journal":{"name":"2008 10th International Conference on Advanced Communication Technology","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127828930","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 : 2008-04-22DOI: 10.1109/ICACT.2008.4493768
Wenjie Liao, Weifeng Lv, T. Zhu, Dongdong Wu
The traditional map matching algorithms consider little about the complicated structure of the road network, and regard all roads as the same. However, in the transportation information system using the floating car data (FCD), the GPS sampling rate is low, and it is probable to figure out the incorrect result when the vehicle is in the intersection area. To solve this problem, this paper proposes a bidirectional heuristic map matching algorithm for intersections based on a data structure for intersections. This algorithm apply the data structure of intersections to separates the intersection part from common map matching, decreases the FCD map matching mistakes that caused by the complicated road network and the GPS errors, and increases the accuracy of map matching.
{"title":"A map matching algorithm for intersections based on Floating Car Data","authors":"Wenjie Liao, Weifeng Lv, T. Zhu, Dongdong Wu","doi":"10.1109/ICACT.2008.4493768","DOIUrl":"https://doi.org/10.1109/ICACT.2008.4493768","url":null,"abstract":"The traditional map matching algorithms consider little about the complicated structure of the road network, and regard all roads as the same. However, in the transportation information system using the floating car data (FCD), the GPS sampling rate is low, and it is probable to figure out the incorrect result when the vehicle is in the intersection area. To solve this problem, this paper proposes a bidirectional heuristic map matching algorithm for intersections based on a data structure for intersections. This algorithm apply the data structure of intersections to separates the intersection part from common map matching, decreases the FCD map matching mistakes that caused by the complicated road network and the GPS errors, and increases the accuracy of map matching.","PeriodicalId":448615,"journal":{"name":"2008 10th International Conference on Advanced Communication Technology","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127907557","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 : 2008-04-22DOI: 10.1109/ICACT.2008.4494231
Byeong-Thaek Oh, Sang-Bong Lee, Ho-Jin Park
In this paper, we suggest a strong peer authentication algorithm that authorizes the peer which requests a service usage of the other peer in super peer based P2P network environment. The proposed peer authentication method, at which public key certificate (PKC) and Kerberos authentication mechanism is applied, enables each peer to perform strong mutual authentication in P2P network environment. The peer mutual authentication is performed by getting authentication ticket and verification it by other peer. Also, the lifetime of a ticket can be controlled by the peer providing services according to each service.
{"title":"A Peer Mutual Authentication Method using PKI on Super Peer based Peer-to-Peer Systems","authors":"Byeong-Thaek Oh, Sang-Bong Lee, Ho-Jin Park","doi":"10.1109/ICACT.2008.4494231","DOIUrl":"https://doi.org/10.1109/ICACT.2008.4494231","url":null,"abstract":"In this paper, we suggest a strong peer authentication algorithm that authorizes the peer which requests a service usage of the other peer in super peer based P2P network environment. The proposed peer authentication method, at which public key certificate (PKC) and Kerberos authentication mechanism is applied, enables each peer to perform strong mutual authentication in P2P network environment. The peer mutual authentication is performed by getting authentication ticket and verification it by other peer. Also, the lifetime of a ticket can be controlled by the peer providing services according to each service.","PeriodicalId":448615,"journal":{"name":"2008 10th International Conference on Advanced Communication Technology","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125481095","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 : 2008-04-22DOI: 10.1109/ICACT.2008.4493831
S. Elnoubi, S. Shaaban, S. Elbadawy
Orthogonal frequency division multiplexing (OFDM) combines the advantage of high achievable rates and relatively easy implementation. In this paper we present an evaluation of the combined use of the turbo codes (TC) and the orthogonal frequency division multiplexing with pilot-aided data in Rayleigh fading channel with compensation the phase error and perfect compensation. The system is called TC-QPSK-OFDM. The simulation results of TC-QPSK-OFDM at three iterations are sufficient to provide good BER performance with phase error and perfect compensation. The gain factor is 7 dB compared with un-coded QPSK-OFDM with perfect compensation at BER 2*10-4 and 8 dB at 3*10-4 with phase error compensation. The proposed system can be used in several wireless standard such as 802-11a.
{"title":"Performance of TC-QPSK-OFDM System with Phase Error and Perfect Compensation in Rayleigh Fading Channel","authors":"S. Elnoubi, S. Shaaban, S. Elbadawy","doi":"10.1109/ICACT.2008.4493831","DOIUrl":"https://doi.org/10.1109/ICACT.2008.4493831","url":null,"abstract":"Orthogonal frequency division multiplexing (OFDM) combines the advantage of high achievable rates and relatively easy implementation. In this paper we present an evaluation of the combined use of the turbo codes (TC) and the orthogonal frequency division multiplexing with pilot-aided data in Rayleigh fading channel with compensation the phase error and perfect compensation. The system is called TC-QPSK-OFDM. The simulation results of TC-QPSK-OFDM at three iterations are sufficient to provide good BER performance with phase error and perfect compensation. The gain factor is 7 dB compared with un-coded QPSK-OFDM with perfect compensation at BER 2*10-4 and 8 dB at 3*10-4 with phase error compensation. The proposed system can be used in several wireless standard such as 802-11a.","PeriodicalId":448615,"journal":{"name":"2008 10th International Conference on Advanced Communication Technology","volume":"370 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126709821","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 : 2008-04-22DOI: 10.1109/ICACT.2008.4494044
Soohyung Kim, Sangrae Cho, Seunghun Jin
This paper presents context-aware service system architecture based on identity interchange layer. We will also introduce context-aware agent named mobile digital identity wallet (MDIW). MDIW is a personalized agent being operated on a personal device which has a main key function to provide user's identity information to an entity that requests. Digital identity interchange mechanism of MIDW employs the concept of digital identity wallet that can control the interchange of digital identity. MIDW can also provide a transparent identity interchange link to facilitate identity interchange between entities and to give a user full control to enforce her/his security and privacy policies over the process of service. Finally, MIDW based on a wide spectrum of user information can be a basic layer to get rid of ambiguity, which has been introduced by previous works based on only sensed information in ubiquitous computing research area.
{"title":"Context-Aware Service System Architecture based on Identity Interchange Layer","authors":"Soohyung Kim, Sangrae Cho, Seunghun Jin","doi":"10.1109/ICACT.2008.4494044","DOIUrl":"https://doi.org/10.1109/ICACT.2008.4494044","url":null,"abstract":"This paper presents context-aware service system architecture based on identity interchange layer. We will also introduce context-aware agent named mobile digital identity wallet (MDIW). MDIW is a personalized agent being operated on a personal device which has a main key function to provide user's identity information to an entity that requests. Digital identity interchange mechanism of MIDW employs the concept of digital identity wallet that can control the interchange of digital identity. MIDW can also provide a transparent identity interchange link to facilitate identity interchange between entities and to give a user full control to enforce her/his security and privacy policies over the process of service. Finally, MIDW based on a wide spectrum of user information can be a basic layer to get rid of ambiguity, which has been introduced by previous works based on only sensed information in ubiquitous computing research area.","PeriodicalId":448615,"journal":{"name":"2008 10th International Conference on Advanced Communication Technology","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123107898","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 : 2008-04-22DOI: 10.1109/ICACT.2008.4493752
Seong-Soon Joo, Sang Joon Park, C. Pyo, Jong-suk Chae
In this paper, to avoid additional measurements and calculation for finding the connectivity and the local position when deploying wireless sensor nodes randomly with no prior information on environments, we propose a new decentralized WSN configuration algorithm which can provide relative location of sensor nodes to the sink node. Instead of concerning about sensing coverage of the network, at the initial stage of forming a network, a simple and fast procedure to obtain data for configuring the framework of the network is designed. We suggest a virtual network formed with the equivalent energy level of received signals, the Energy Level Projected Network (ELPN), which distance is defined as the diminution of the reference signal power. To collect data related to the wireless sensor nodes connectivity, localization, and uniformity of nodes deployment, the concept of the position sensing signal and relative direction finding algorithm are introduced.
{"title":"Configuration of Randomly Deployed WSN with the Estimation of Node Density","authors":"Seong-Soon Joo, Sang Joon Park, C. Pyo, Jong-suk Chae","doi":"10.1109/ICACT.2008.4493752","DOIUrl":"https://doi.org/10.1109/ICACT.2008.4493752","url":null,"abstract":"In this paper, to avoid additional measurements and calculation for finding the connectivity and the local position when deploying wireless sensor nodes randomly with no prior information on environments, we propose a new decentralized WSN configuration algorithm which can provide relative location of sensor nodes to the sink node. Instead of concerning about sensing coverage of the network, at the initial stage of forming a network, a simple and fast procedure to obtain data for configuring the framework of the network is designed. We suggest a virtual network formed with the equivalent energy level of received signals, the Energy Level Projected Network (ELPN), which distance is defined as the diminution of the reference signal power. To collect data related to the wireless sensor nodes connectivity, localization, and uniformity of nodes deployment, the concept of the position sensing signal and relative direction finding algorithm are introduced.","PeriodicalId":448615,"journal":{"name":"2008 10th International Conference on Advanced Communication Technology","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121059031","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 : 2008-04-22DOI: 10.1109/ICACT.2008.4494222
Ki-Hyuk Nam, Ki-Seok Bang, W. Choi
Web has influenced the form of software applications. These web applications are generally difficult to distribute by novice users since their usage was restricted to the network based massive servers which has many server modules requiring difficult configurations. However, web applications became widespread and used in daily basis from simple utility programs to PIMS. This paper proposes a web application model and distribution method for portable web applications to adapt to current trends. The most salient features of the method are click & run interface for installing, configuring, and executing web applications, and offline execution by providing a web server, a DBMS on movable disks such as USB memory sticks. The method has been verified by developing a simple application platform and package builder supporting applications written in Ruby and PHP.
{"title":"A Method for Distributing Web Applications","authors":"Ki-Hyuk Nam, Ki-Seok Bang, W. Choi","doi":"10.1109/ICACT.2008.4494222","DOIUrl":"https://doi.org/10.1109/ICACT.2008.4494222","url":null,"abstract":"Web has influenced the form of software applications. These web applications are generally difficult to distribute by novice users since their usage was restricted to the network based massive servers which has many server modules requiring difficult configurations. However, web applications became widespread and used in daily basis from simple utility programs to PIMS. This paper proposes a web application model and distribution method for portable web applications to adapt to current trends. The most salient features of the method are click & run interface for installing, configuring, and executing web applications, and offline execution by providing a web server, a DBMS on movable disks such as USB memory sticks. The method has been verified by developing a simple application platform and package builder supporting applications written in Ruby and PHP.","PeriodicalId":448615,"journal":{"name":"2008 10th International Conference on Advanced Communication Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116082368","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 : 2008-04-22DOI: 10.1109/ICACT.2008.4493790
Cheolhyo Lee, Jae-Young Kim
The ranging functions for the low rate WPAN have been one of the attractive issues to provide diverse applications. The IEEE 802.15.4a Task Group has specified alternative PHY and partially modified MAC using UWB signals to support more precise ranging accuracy. Based on the standard PHY and MAC of IEEE, this paper describes the implementation of the IEEE 802.15.4a MAC and for ranging and data communication functions. Also we suggest the location application system implemented with the indoor positioning algorithm and data processing functions, as well as data acquisition procedure from the end devices in the WPAN1.
{"title":"The Implementation of the IEEE 802.15.4a MAC and Location Application System for Low Rate WPAN","authors":"Cheolhyo Lee, Jae-Young Kim","doi":"10.1109/ICACT.2008.4493790","DOIUrl":"https://doi.org/10.1109/ICACT.2008.4493790","url":null,"abstract":"The ranging functions for the low rate WPAN have been one of the attractive issues to provide diverse applications. The IEEE 802.15.4a Task Group has specified alternative PHY and partially modified MAC using UWB signals to support more precise ranging accuracy. Based on the standard PHY and MAC of IEEE, this paper describes the implementation of the IEEE 802.15.4a MAC and for ranging and data communication functions. Also we suggest the location application system implemented with the indoor positioning algorithm and data processing functions, as well as data acquisition procedure from the end devices in the WPAN1.","PeriodicalId":448615,"journal":{"name":"2008 10th International Conference on Advanced Communication Technology","volume":"362 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115940368","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
扫码关注我们
求助内容：
应助结果提醒方式：