This paper proposes a novel quality of service (QoS) guaranteed power-efficient management scheme for IEEE 802.15.3 HR-WPAN, coined Hierarchical MAC Scheduling Scheme (HMSS). The design objectives of HMSS are to guarantee the QoS of multimedia services and minimize the power consumption of energy-sensitive DEVs. By classifying traffics into layers with different priorities, HMSS schedules the traffic layer with high priority preferentially. The order of intra- layer traffics is scheduled to minimize the wakeup times. In addition, a sharing common DEV scheme (SCDS) is proposed to reduce the number of the patches caused by classifying traffics. Simulation results show that HMSS guarantees the QoS requirements of multimedia services in IEEE 802.15.3 HR- WPAN, while the Min-Degree Searching (MDS) Scheme proposed in IEEE 802.15.3 does not consider the QoS requirements at all.
{"title":"A Novel QoS-Guaranteed Power-Efficient Management Scheme for IEEE 802.15.3 HR-WPAN","authors":"Yi-Feng Guo, G. Kuo","doi":"10.1109/CCNC.2007.130","DOIUrl":"https://doi.org/10.1109/CCNC.2007.130","url":null,"abstract":"This paper proposes a novel quality of service (QoS) guaranteed power-efficient management scheme for IEEE 802.15.3 HR-WPAN, coined Hierarchical MAC Scheduling Scheme (HMSS). The design objectives of HMSS are to guarantee the QoS of multimedia services and minimize the power consumption of energy-sensitive DEVs. By classifying traffics into layers with different priorities, HMSS schedules the traffic layer with high priority preferentially. The order of intra- layer traffics is scheduled to minimize the wakeup times. In addition, a sharing common DEV scheme (SCDS) is proposed to reduce the number of the patches caused by classifying traffics. Simulation results show that HMSS guarantees the QoS requirements of multimedia services in IEEE 802.15.3 HR- WPAN, while the Min-Degree Searching (MDS) Scheme proposed in IEEE 802.15.3 does not consider the QoS requirements at all.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125073766","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}
Shintaro Mizuno, Takahiro Haruyama, Kohji Yamada, O. Mizuno
We demonstrate a prototype of a mobile phone based authentication service that can easily be used by home appliance users. The system employs the mobile phone's strong user identification capabilities such as UIMs, device identifiers or digital certificates to authenticate users over the mobile phone network while services are delivered to their appliances via the Internet. The authentication method is targeted to be used on home appliances such as digital televisions with web browsers which do not have rich interfaces. Therefore it is designed not to require users to enter any user information or to install any hardware and/or software into the appliance. This is achieved by binding a service session on the Internet and mobile network session using a barcode scanner on a mobile phone terminal. The prototype also provides an alternative method for mobile phone terminals which does not have a barcode scanner function to complement user availability.
{"title":"A Mobile Phone Based Authentication Service for Home Appliances","authors":"Shintaro Mizuno, Takahiro Haruyama, Kohji Yamada, O. Mizuno","doi":"10.1109/CCNC.2007.236","DOIUrl":"https://doi.org/10.1109/CCNC.2007.236","url":null,"abstract":"We demonstrate a prototype of a mobile phone based authentication service that can easily be used by home appliance users. The system employs the mobile phone's strong user identification capabilities such as UIMs, device identifiers or digital certificates to authenticate users over the mobile phone network while services are delivered to their appliances via the Internet. The authentication method is targeted to be used on home appliances such as digital televisions with web browsers which do not have rich interfaces. Therefore it is designed not to require users to enter any user information or to install any hardware and/or software into the appliance. This is achieved by binding a service session on the Internet and mobile network session using a barcode scanner on a mobile phone terminal. The prototype also provides an alternative method for mobile phone terminals which does not have a barcode scanner function to complement user availability.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120964142","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 show the main characteristics of both the AIDA auction service and a client for that service running on a mobile device. The AIDA system supports responsive and available auction services in a large scale distributed environment, such as the Internet. The AIDA service allows for fast evolving auctions on the In- ternet. In this paper we present the main architectural challenges to implement a mobile client for AIDA. We propose the design of a client that can run on a mobile device, such as a smartphone. Moreover, our system provides the auctioneers with a simple mechanism to switch between computing platforms, such as mobile devices and desktop computers. The auctioneer can switch between several devices as long as those those can exchange a single and small file. I. INTRODUCTION These years the auction services over the Internet are gaining increasing popularity, e.g. WWW.EBAY.COM and WWW.AMAZON.COM. Commonly, the duration of those auc- tions has an order of magnitude of several days. This char- acteristic is a consequence of the asynchronous nature of the Internet, based on a best-effort communication service (1)-(4). Additionally, it seems that the current Internet-based auction services rely, in general, on centralized architectures that are prone to scalability and availability drawbacks. Server's overloading may occur, if an arbitrary large number of users concurrently access the service. In absence, or insufficient, server replication, a failure can halt the system, or deteriorate its performance. The most common Internet auctions, i.e. those that end at a predefined time, exhibit an interesting users behavior, called last-minute bidding (5): the users tend to submit their bid as close as possible to the end of the auction, reducing the probability that someone else might submit a better bid. This phenomenon exacerbates the scalability requirements of the auction system. Owing to the above observations, we proposed an ar- chitecture for supporting auction services over the Internet that is based on replicated services across a number of servers distributed over this network. The architecture, named AIDA (Architecture for Internet-based Distributed Auctions), is based on both hierarchical lightweight communications, and coordinator-cohort computation (6). Our architecture offers advantages with respect to both the auction service provider and to the user. Specifically, from the service provider perspective, our distributed architectures can accommodate an arbitrary number of users by balancing the work load among all the servers implementing the auction service. From the user perspective, our architecture can support a responsive auction service, provided that the client is bound to the "most responsive" server, i.e. the server with the lower sum of workload and congested path to the client. Moreover, the auctions implemented with AIDA could be "fast", i.e. could have a duration of few minutes. This characteristic is currently uncommon i
{"title":"Design of a Mobile Client for the AIDA Auction Service","authors":"A. Amoroso, Daniele Borsaro","doi":"10.1109/CCNC.2007.216","DOIUrl":"https://doi.org/10.1109/CCNC.2007.216","url":null,"abstract":"We show the main characteristics of both the AIDA auction service and a client for that service running on a mobile device. The AIDA system supports responsive and available auction services in a large scale distributed environment, such as the Internet. The AIDA service allows for fast evolving auctions on the In- ternet. In this paper we present the main architectural challenges to implement a mobile client for AIDA. We propose the design of a client that can run on a mobile device, such as a smartphone. Moreover, our system provides the auctioneers with a simple mechanism to switch between computing platforms, such as mobile devices and desktop computers. The auctioneer can switch between several devices as long as those those can exchange a single and small file. I. INTRODUCTION These years the auction services over the Internet are gaining increasing popularity, e.g. WWW.EBAY.COM and WWW.AMAZON.COM. Commonly, the duration of those auc- tions has an order of magnitude of several days. This char- acteristic is a consequence of the asynchronous nature of the Internet, based on a best-effort communication service (1)-(4). Additionally, it seems that the current Internet-based auction services rely, in general, on centralized architectures that are prone to scalability and availability drawbacks. Server's overloading may occur, if an arbitrary large number of users concurrently access the service. In absence, or insufficient, server replication, a failure can halt the system, or deteriorate its performance. The most common Internet auctions, i.e. those that end at a predefined time, exhibit an interesting users behavior, called last-minute bidding (5): the users tend to submit their bid as close as possible to the end of the auction, reducing the probability that someone else might submit a better bid. This phenomenon exacerbates the scalability requirements of the auction system. Owing to the above observations, we proposed an ar- chitecture for supporting auction services over the Internet that is based on replicated services across a number of servers distributed over this network. The architecture, named AIDA (Architecture for Internet-based Distributed Auctions), is based on both hierarchical lightweight communications, and coordinator-cohort computation (6). Our architecture offers advantages with respect to both the auction service provider and to the user. Specifically, from the service provider perspective, our distributed architectures can accommodate an arbitrary number of users by balancing the work load among all the servers implementing the auction service. From the user perspective, our architecture can support a responsive auction service, provided that the client is bound to the \"most responsive\" server, i.e. the server with the lower sum of workload and congested path to the client. Moreover, the auctions implemented with AIDA could be \"fast\", i.e. could have a duration of few minutes. This characteristic is currently uncommon i","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122489988","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 a novel two-stage non-coherent SFH/BFSK detection scheme when the environment is interfered by an uncoordinated FH system. The first stage detects user number and power level of uncoordinated FH signals. Based on knowledge of detected side information from the first stage, the second stage performs SFH/BFSK maximum likelihood detection. When user number and power level of uncoordinated FH signals are unknown, the proposed two-stage detection scheme outperforms existing multilevel FSK conventional detectors and two-user multiuser detectors. In this scenario, simulation results demonstrate a critical role of the first-stage detector in the overall scheme when it provides the above side information. On the other hand, when knowledge of uncoordinated user number and power level is available to the desired user's receiver, simulation results also show superiority of the proposed second- stage detector over equal-gain receivers and self-normalized receivers.
{"title":"Non-Coherent Detection for SFH/BFSK Interfered by An Uncoordinated FH System","authors":"Yi-Chen Chen, Kwang-Cheng Chen, Jenq-Neng Hwang","doi":"10.1109/CCNC.2007.92","DOIUrl":"https://doi.org/10.1109/CCNC.2007.92","url":null,"abstract":"We propose a novel two-stage non-coherent SFH/BFSK detection scheme when the environment is interfered by an uncoordinated FH system. The first stage detects user number and power level of uncoordinated FH signals. Based on knowledge of detected side information from the first stage, the second stage performs SFH/BFSK maximum likelihood detection. When user number and power level of uncoordinated FH signals are unknown, the proposed two-stage detection scheme outperforms existing multilevel FSK conventional detectors and two-user multiuser detectors. In this scenario, simulation results demonstrate a critical role of the first-stage detector in the overall scheme when it provides the above side information. On the other hand, when knowledge of uncoordinated user number and power level is available to the desired user's receiver, simulation results also show superiority of the proposed second- stage detector over equal-gain receivers and self-normalized receivers.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130551378","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 method is provided for parallelizing overlay operations in an overlay network. The method includes: identifying an overlay operation having a parallel messaging scheme; determining a destination address for each parallel message in the messaging scheme; encoding each destination address into a data packet; and transmitting the data packet over the overlay network using a multi-destination, multicast routing protocol.
{"title":"Parallelizing Peer-to-Peer Overlays with Multi-Destination Routing","authors":"J. Buford, A. Brown, M. Kolberg","doi":"10.1109/CCNC.2007.112","DOIUrl":"https://doi.org/10.1109/CCNC.2007.112","url":null,"abstract":"A method is provided for parallelizing overlay operations in an overlay network. The method includes: identifying an overlay operation having a parallel messaging scheme; determining a destination address for each parallel message in the messaging scheme; encoding each destination address into a data packet; and transmitting the data packet over the overlay network using a multi-destination, multicast routing protocol.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130998094","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 ontology-based video content annotation and recommendation tools. Our system is able to perform automatic shot detection and supports users during the annotation phase in a collaborative framework by providing suggestions on the basis of actual user needs as well as modifiable user behaviour and interests. Annotations are based on domain ontologies expressing hierarchical links between entities and guarantying interoperability of resources. Examples to verify the effectiveness of both the shot detection and the frame matching modules are analyzed.
{"title":"Ontology-Based Video Annotation in Multimedia Entertainment","authors":"A. Carbonaro, R. Ferrini","doi":"10.1109/CCNC.2007.219","DOIUrl":"https://doi.org/10.1109/CCNC.2007.219","url":null,"abstract":"In this paper we propose ontology-based video content annotation and recommendation tools. Our system is able to perform automatic shot detection and supports users during the annotation phase in a collaborative framework by providing suggestions on the basis of actual user needs as well as modifiable user behaviour and interests. Annotations are based on domain ontologies expressing hierarchical links between entities and guarantying interoperability of resources. Examples to verify the effectiveness of both the shot detection and the frame matching modules are analyzed.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130315170","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 to use two link adaptation strategies together in order to find energy-efficient routing paths in an ad-hoc network: exploiting different modulation techniques supported by the physical layer and the fragmentation size of the packets. Our proposed mechanism finds the best (modulation technique, fragmentation size) pair for a given link and uses this information for finding the minimum energy routing paths. We provide a modified version of the well known AODV protocol and show that our proposed mechanism performs better than the two mechanisms deployed individually and much better than the original protocol.
{"title":"Data Rate and Fragmentation Aware Ad hoc Routing","authors":"T. Nadeem, N. Tas","doi":"10.1109/CCNC.2007.57","DOIUrl":"https://doi.org/10.1109/CCNC.2007.57","url":null,"abstract":"We propose to use two link adaptation strategies together in order to find energy-efficient routing paths in an ad-hoc network: exploiting different modulation techniques supported by the physical layer and the fragmentation size of the packets. Our proposed mechanism finds the best (modulation technique, fragmentation size) pair for a given link and uses this information for finding the minimum energy routing paths. We provide a modified version of the well known AODV protocol and show that our proposed mechanism performs better than the two mechanisms deployed individually and much better than the original protocol.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129508458","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}
Peer-to-Peer (P2P) streaming mechanism is a promising approach to offer one-to-many distribution of live streaming content to large number of residential users across the Internet. While a few P2P streaming mechanisms have been recently proposed, the behavior of these mechanisms in sessions where a large fraction of uasers are residential peers have not been examined. Several characteristics of residential users could affect the behavior of P2P streaming sessions including (i) the heterogeneity of access link bandwidth, (ii) the limitation of available resources due to asymmetric nature of access link bandwidth (for DSL and cable modem), and (iii) the participation of free-loaders. In this paper, we examine the effect of these three character- istics of residential users on the performance of P2P streaming mechanisms using ns simulations. We show that these character- istics could adversely affect the performance of P2P streaming mechanisms as follows. First, the delivered quality to individual users is not correlated with their contributed resource to the system. Second, the presence of free-loaders could dramatically degrade the delivered quality to participating peers even when the amount of available resources in the system are adequate. Our findings suggest that P2P streaming has to address these issues in order to be successfully deployed among residential users.
{"title":"Issues in Offering Live P2P Streaming Service to Residential Users","authors":"Nazanin Magharei, Yang Guo, R. Rejaie","doi":"10.1109/CCNC.2007.154","DOIUrl":"https://doi.org/10.1109/CCNC.2007.154","url":null,"abstract":"Peer-to-Peer (P2P) streaming mechanism is a promising approach to offer one-to-many distribution of live streaming content to large number of residential users across the Internet. While a few P2P streaming mechanisms have been recently proposed, the behavior of these mechanisms in sessions where a large fraction of uasers are residential peers have not been examined. Several characteristics of residential users could affect the behavior of P2P streaming sessions including (i) the heterogeneity of access link bandwidth, (ii) the limitation of available resources due to asymmetric nature of access link bandwidth (for DSL and cable modem), and (iii) the participation of free-loaders. In this paper, we examine the effect of these three character- istics of residential users on the performance of P2P streaming mechanisms using ns simulations. We show that these character- istics could adversely affect the performance of P2P streaming mechanisms as follows. First, the delivered quality to individual users is not correlated with their contributed resource to the system. Second, the presence of free-loaders could dramatically degrade the delivered quality to participating peers even when the amount of available resources in the system are adequate. Our findings suggest that P2P streaming has to address these issues in order to be successfully deployed among residential users.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126442710","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}
Large-scale network applications are expected to be more autonomous and adaptive to dynamic changes in the net- work to improve user experience, expand applications' opera- tional longevity and reduce maintenance cost. Based on the ob- servation that various biological systems have already met the requirements (i.e., autonomy and adaptability), this paper de- scribes a biologically-inspired framework, called iNet, to design autonomous and adaptive network applications. iNet is designed after the mechanisms behind how the immune system works. iNet models a set of environment conditions (e.g., network traffic and resource availability) as an antigen and a behavior of network applications (e.g., migration and reproduction) as an antibody. iNet allows network applications to autonomously sense its sur- rounding environment conditions (i.e., antigens) and adaptively invoke a behavior (i.e., antibody) suitable for the conditions. The configuration of antibodies evolves via genetic operations (e.g., mutation and crossover). Simulation results show that iNet allows agents to autonomously adapt to changing environment condi- tions by invoking their behaviors suitable for the current envi- ronment condition and evolving their antibody configurations.
{"title":"An Immunologically-Inspired Adaptation Mechanism for Evolvable Network Applications","authors":"Chonho Lee, J. Suzuki","doi":"10.1109/CCNC.2007.91","DOIUrl":"https://doi.org/10.1109/CCNC.2007.91","url":null,"abstract":"Large-scale network applications are expected to be more autonomous and adaptive to dynamic changes in the net- work to improve user experience, expand applications' opera- tional longevity and reduce maintenance cost. Based on the ob- servation that various biological systems have already met the requirements (i.e., autonomy and adaptability), this paper de- scribes a biologically-inspired framework, called iNet, to design autonomous and adaptive network applications. iNet is designed after the mechanisms behind how the immune system works. iNet models a set of environment conditions (e.g., network traffic and resource availability) as an antigen and a behavior of network applications (e.g., migration and reproduction) as an antibody. iNet allows network applications to autonomously sense its sur- rounding environment conditions (i.e., antigens) and adaptively invoke a behavior (i.e., antibody) suitable for the conditions. The configuration of antibodies evolves via genetic operations (e.g., mutation and crossover). Simulation results show that iNet allows agents to autonomously adapt to changing environment condi- tions by invoking their behaviors suitable for the current envi- ronment condition and evolving their antibody configurations.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"21 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114028059","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}
E-Learning standard (SCORM) has been extensively devel- oped in recent years. It provides the direction of extending distance edu- cation to other mediums. Multimedia Home Platform (MHP) is a promis- ing interactive digital TV standard. In order to extend the re-use of the resource database in SCORM, this paper devises a new platform, which allows the use of SCORM resource to provide educational services on the MHP platform, i.e., T-Learning. Explicitly, we develop a SCORM compati- ble T-Learning system architecture named Resource-Reuseable T-Learning (RTL), which is capable of reusing the SCORM resource package. More- over, to enhance the efficiency of parsing the T-Learning documents, we also propose a two-phase parsing algorithm, denoted by TPP. Our system architecture and the parsing algorithm makes the DVB platform flexible, extensible, and easy to be integrated with the existing E-Learning SCORM materials. We demonstrate the prototype of RTL architecture in this paper and show the efficiency of the TPP algorithm via our experimental results.
{"title":"Designing a Resource-Reusable T-Learning System","authors":"Kai Chen, Hao-Ping Hung, Ming-Syan Chen","doi":"10.1109/CCNC.2007.139","DOIUrl":"https://doi.org/10.1109/CCNC.2007.139","url":null,"abstract":"E-Learning standard (SCORM) has been extensively devel- oped in recent years. It provides the direction of extending distance edu- cation to other mediums. Multimedia Home Platform (MHP) is a promis- ing interactive digital TV standard. In order to extend the re-use of the resource database in SCORM, this paper devises a new platform, which allows the use of SCORM resource to provide educational services on the MHP platform, i.e., T-Learning. Explicitly, we develop a SCORM compati- ble T-Learning system architecture named Resource-Reuseable T-Learning (RTL), which is capable of reusing the SCORM resource package. More- over, to enhance the efficiency of parsing the T-Learning documents, we also propose a two-phase parsing algorithm, denoted by TPP. Our system architecture and the parsing algorithm makes the DVB platform flexible, extensible, and easy to be integrated with the existing E-Learning SCORM materials. We demonstrate the prototype of RTL architecture in this paper and show the efficiency of the TPP algorithm via our experimental results.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"203 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123043090","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
扫码关注我们
求助内容：
应助结果提醒方式：