M. Nabhan, S. A. Masri, V. Garaj, W. Balachandran, Z. Hunaiti
This work presents a new efficient positioning module that operates over client-server LBS architectures. The aim of the proposed module is to fulfil the position information requirements for LBS pedestrian applications by ensuring the availability of reliable, highly accurate and precise position solutions based on GPS single frequency L1 positioning service. The positioning module operates at both LBS architecture sides; the client mobile device, and the server positioning server. At the server side, the positioning module is responsible for correcting user's location information based on WADGPS corrections. In addition, at the mobile side, the positioning module is continually in charge for monitoring the integrity and available of the position solutions as well as managing the communication with the server. The integrity monitoring was based on EGNOS integrity methods. A prototype of the proposed module was developed and used in experimental trials to evaluate the efficiency of the module in terms of the achieved positioning performance. The positioning module was capable of achieving a horizontal accuracy of less than 2 meters with a 95% confidence level with integrity improvement of more than 30% from existing GPS/EGNOS services.
{"title":"Client-Server Based LBS Architecture: A Novel Positioning Module for Improved Positioning Performance","authors":"M. Nabhan, S. A. Masri, V. Garaj, W. Balachandran, Z. Hunaiti","doi":"10.4018/jhcr.2010070101","DOIUrl":"https://doi.org/10.4018/jhcr.2010070101","url":null,"abstract":"This work presents a new efficient positioning module that operates over client-server LBS architectures. The aim of the proposed module is to fulfil the position information requirements for LBS pedestrian applications by ensuring the availability of reliable, highly accurate and precise position solutions based on GPS single frequency L1 positioning service. The positioning module operates at both LBS architecture sides; the client mobile device, and the server positioning server. At the server side, the positioning module is responsible for correcting user's location information based on WADGPS corrections. In addition, at the mobile side, the positioning module is continually in charge for monitoring the integrity and available of the position solutions as well as managing the communication with the server. The integrity monitoring was based on EGNOS integrity methods. A prototype of the proposed module was developed and used in experimental trials to evaluate the efficiency of the module in terms of the achieved positioning performance. The positioning module was capable of achieving a horizontal accuracy of less than 2 meters with a 95% confidence level with integrity improvement of more than 30% from existing GPS/EGNOS services.","PeriodicalId":265963,"journal":{"name":"Int. J. Handheld Comput. Res.","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133490995","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}
Mobile games and graphics are popular because un-tethered computing is convenient and ubiquitous entertainment is compelling. However, rendering graphics on mobile devices faces challenges due to limited system resources, such as battery energy, and low memory and disk space. Real time frame rates, low energy consumption and high image quality are all desirable attributes of interactive mobile graphics; however, achieving these objectives is conflicting. For instance, increasing mesh resolutions improves rendered image quality but consumes more battery energy. Therefore, the authors propose a mobile graphics heuristic to minimize energy consumption while maintaining acceptable image quality and interactive frame rates. Over the lifetime of a mobile graphics application, scene complexity, animation paths, user interactivity and other elements all change its CPU and resource demands. In this regard, a heuristic that dynamically changes scene mesh LoDs and amount of CPU timeslices allotted to the mobile graphics application is presented to select optimal operating conditions that balance rendering speed, energy conservation and image quality. Additionally, a workload predict model is proposed so that the heuristic can monitor both application workload and the availability of resources of mobile devices periodically, while adaptively determining how much resources will be allocated to applications.
{"title":"On Balancing Energy Consumption, Rendering Speed, and Image Quality on Mobile Devices","authors":"Fan Wu, E. Agu, Clifford Lindsay, Chung-Han Chen","doi":"10.4018/jhcr.2010070104","DOIUrl":"https://doi.org/10.4018/jhcr.2010070104","url":null,"abstract":"Mobile games and graphics are popular because un-tethered computing is convenient and ubiquitous entertainment is compelling. However, rendering graphics on mobile devices faces challenges due to limited system resources, such as battery energy, and low memory and disk space. Real time frame rates, low energy consumption and high image quality are all desirable attributes of interactive mobile graphics; however, achieving these objectives is conflicting. For instance, increasing mesh resolutions improves rendered image quality but consumes more battery energy. Therefore, the authors propose a mobile graphics heuristic to minimize energy consumption while maintaining acceptable image quality and interactive frame rates. Over the lifetime of a mobile graphics application, scene complexity, animation paths, user interactivity and other elements all change its CPU and resource demands. In this regard, a heuristic that dynamically changes scene mesh LoDs and amount of CPU timeslices allotted to the mobile graphics application is presented to select optimal operating conditions that balance rendering speed, energy conservation and image quality. Additionally, a workload predict model is proposed so that the heuristic can monitor both application workload and the availability of resources of mobile devices periodically, while adaptively determining how much resources will be allocated to applications.","PeriodicalId":265963,"journal":{"name":"Int. J. Handheld Comput. Res.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131053092","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 an indoor positioning system based on FM radio. The system is built on commercially available short-range FM transmitters. This is the first experimental study of FM performance for indoor localisation. FM radio possesses a number of features, which make it distinct from other localisation technologies. Despite the low cost and off-the-shelf components, this FM positioning system reaches a high performance, comparable to other positioning technologies such as Wi-Fi. The authors' experiments have yielded a median accuracy of 1.0 m and in 95% of cases the error is below 5 m.
{"title":"Indoor Positioning Using FM Radio","authors":"Andrei Papliatseyeu, V. Osmani, O. Mayora-Ibarra","doi":"10.4018/jhcr.2010070102","DOIUrl":"https://doi.org/10.4018/jhcr.2010070102","url":null,"abstract":"This paper presents an indoor positioning system based on FM radio. The system is built on commercially available short-range FM transmitters. This is the first experimental study of FM performance for indoor localisation. FM radio possesses a number of features, which make it distinct from other localisation technologies. Despite the low cost and off-the-shelf components, this FM positioning system reaches a high performance, comparable to other positioning technologies such as Wi-Fi. The authors' experiments have yielded a median accuracy of 1.0 m and in 95% of cases the error is below 5 m.","PeriodicalId":265963,"journal":{"name":"Int. J. Handheld Comput. Res.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122009537","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 Mobile Ad hoc Network MANET is a collection of connected mobile nodes without any centralized administration. Proactive routing approach is one of those categories of proposed routing protocol which is not suitable for larger network due to their high overhead to maintain routing table for each and every node. The novelty of this approach is to form a binary tree structure of several independent sub-networks by decomposing a large network to sub-networks. Each sub-network is monitored by an agent node which is selected by several broadcasted regulations. Agent node maintains two routing information; one for local routing within the sub-network and another for routing through all other agent node. In routing mechanism first source node checks for destination within sub-network then source sends destination address to respective parent agent node if destination is not available in local routing, this process follows up to the destination node using agent mode. This approach allowed any proactive routing protocol with scalability for every routing mechanism. The proposed approach is thoroughly analyzed and its justification for the connectivity through sub-networks, routing between each source to destination pair, scalability, etc., are given, which show expected performance.
{"title":"Design and Implementation of Binary Tree Based Proactive Routing Protocols for Large MANETS","authors":"Pavan Kumar Pandey, G. P. Biswas","doi":"10.4018/jhcr.2011100105","DOIUrl":"https://doi.org/10.4018/jhcr.2011100105","url":null,"abstract":"The Mobile Ad hoc Network MANET is a collection of connected mobile nodes without any centralized administration. Proactive routing approach is one of those categories of proposed routing protocol which is not suitable for larger network due to their high overhead to maintain routing table for each and every node. The novelty of this approach is to form a binary tree structure of several independent sub-networks by decomposing a large network to sub-networks. Each sub-network is monitored by an agent node which is selected by several broadcasted regulations. Agent node maintains two routing information; one for local routing within the sub-network and another for routing through all other agent node. In routing mechanism first source node checks for destination within sub-network then source sends destination address to respective parent agent node if destination is not available in local routing, this process follows up to the destination node using agent mode. This approach allowed any proactive routing protocol with scalability for every routing mechanism. The proposed approach is thoroughly analyzed and its justification for the connectivity through sub-networks, routing between each source to destination pair, scalability, etc., are given, which show expected performance.","PeriodicalId":265963,"journal":{"name":"Int. J. Handheld Comput. Res.","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116061180","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 widely deployment of wireless networks and mobile technologies and the significant increase in the number of mobile device users have created a very strong demand for emerging mobile commerce applications and services Barcode-based identification and validation solutions have been considered as an important part of electronic commerce systems, particularly in electronic supply chain systems This paper reports a mobile-based 2D barcode validation system as a part of mobile commerce systems This barcode-based validation solution is developed based on the Data Matrix 2D-Barcode standard to support barcode-based validation in mobile commerce systems on mobile devices Furthermore, the paper also demonstrates its application by building a mobile movie ticketing system.
{"title":"A 2D Barcode Validation System for Mobile Commerce","authors":"David Kuo, Daniel Wong, J. Gao, Lee Chang","doi":"10.4018/jhcr.2011040101","DOIUrl":"https://doi.org/10.4018/jhcr.2011040101","url":null,"abstract":"The widely deployment of wireless networks and mobile technologies and the significant increase in the number of mobile device users have created a very strong demand for emerging mobile commerce applications and services Barcode-based identification and validation solutions have been considered as an important part of electronic commerce systems, particularly in electronic supply chain systems This paper reports a mobile-based 2D barcode validation system as a part of mobile commerce systems This barcode-based validation solution is developed based on the Data Matrix 2D-Barcode standard to support barcode-based validation in mobile commerce systems on mobile devices Furthermore, the paper also demonstrates its application by building a mobile movie ticketing system.","PeriodicalId":265963,"journal":{"name":"Int. J. Handheld Comput. Res.","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121702204","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}
Recent mobile computing applications try to automatically identify the places visited by the user from a log of GPS readings. Such applications reverse geocode the GPS data to discover the actual places shops, restaurants, etc. where the user has been. Unfortunately, because of GPS errors, the actual addresses and businesses being visited cannot be extracted unambiguously and often only a list of candidate places can be obtained. Commonsense reasoning can notably help the disambiguation process by invalidating some unlikely findings e.g., a user visiting a cinema in the morning. This paper illustrates the use of Cyc-an artificial intelligence system comprising a database of commonsense knowledge-to improve automatic place identification. Cyc allows to probabilistically rank the list of candidate places in consideration of the commonsense likelihood of that place being actually visited on the basis of the user profile, the time of the day, what happened before, and so forth. The system has been evaluated using real data collected from a mobile computing application.
{"title":"Applying Commonsense Reasoning to Place Identification","authors":"M. Mamei","doi":"10.4018/jhcr.2010040103","DOIUrl":"https://doi.org/10.4018/jhcr.2010040103","url":null,"abstract":"Recent mobile computing applications try to automatically identify the places visited by the user from a log of GPS readings. Such applications reverse geocode the GPS data to discover the actual places shops, restaurants, etc. where the user has been. Unfortunately, because of GPS errors, the actual addresses and businesses being visited cannot be extracted unambiguously and often only a list of candidate places can be obtained. Commonsense reasoning can notably help the disambiguation process by invalidating some unlikely findings e.g., a user visiting a cinema in the morning. This paper illustrates the use of Cyc-an artificial intelligence system comprising a database of commonsense knowledge-to improve automatic place identification. Cyc allows to probabilistically rank the list of candidate places in consideration of the commonsense likelihood of that place being actually visited on the basis of the user profile, the time of the day, what happened before, and so forth. The system has been evaluated using real data collected from a mobile computing application.","PeriodicalId":265963,"journal":{"name":"Int. J. Handheld Comput. Res.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132904926","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}
Energy saving has been studied widely in both of computing and communication research communities. For handheld devices, energy is becoming a more and more critical issue because lots of applications running on handhelds today are computation or communication intensive and take a long time to finish. Unlike previous work that proposes computing or communication energy solutions alone, this paper proposes a novel energy savings approach through mobile collaborative systems, which jointly consider computing and communication energy cost. In this work, the authors use streaming video as investigated application scenario and propose multi-hop pipelined wireless collaborative system to decode video frames with a requirement for maximum inter-frame time. To finish a computing task with such a requirement, this paper proposes a control policy that can dynamically adapt processor frequency and communication transmission rate at the collaborative devices. The authors build a mathematical energy model for collaborative computing systems. Results show that the collaborative system helps save energy, and the transmission rate between collaborators is a key parameter for maximizing energy savings. The energy saving algorithm in computing devices is implemented and the experimental results show the same trend.
{"title":"A Novel Energy Saving Approach through Mobile Collaborative Computing Systems","authors":"Xiaoxin Wu, Huan Chen, Yaoda Liu, Wenwu Zhu","doi":"10.4018/jhcr.2010040101","DOIUrl":"https://doi.org/10.4018/jhcr.2010040101","url":null,"abstract":"Energy saving has been studied widely in both of computing and communication research communities. For handheld devices, energy is becoming a more and more critical issue because lots of applications running on handhelds today are computation or communication intensive and take a long time to finish. Unlike previous work that proposes computing or communication energy solutions alone, this paper proposes a novel energy savings approach through mobile collaborative systems, which jointly consider computing and communication energy cost. In this work, the authors use streaming video as investigated application scenario and propose multi-hop pipelined wireless collaborative system to decode video frames with a requirement for maximum inter-frame time. To finish a computing task with such a requirement, this paper proposes a control policy that can dynamically adapt processor frequency and communication transmission rate at the collaborative devices. The authors build a mathematical energy model for collaborative computing systems. Results show that the collaborative system helps save energy, and the transmission rate between collaborators is a key parameter for maximizing energy savings. The energy saving algorithm in computing devices is implemented and the experimental results show the same trend.","PeriodicalId":265963,"journal":{"name":"Int. J. Handheld Comput. Res.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116099213","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}
Supporting reliable and secure multimedia streaming service is a challenging task in the environment of wireless Mobile Ad hoc Networks MANETs where radio signals are prone to security attacks and the quality of media streaming is degraded by signal strength loss and interference. The mobility of mobile devices makes streaming even more difficult as communication links are often broken when the devices move out of the transmission range of their neighbors. This paper proposes a stable multipath routing algorithm and an intelligent secure data distribution scheme for multimedia streaming in MANETs. The multipath Neighbor Stability Routing is able to find more stable and long-lasting paths than traditional ad hoc routing algorithms. The secure data distribution takes historical data-path distribution into consideration and maximally disperses new multimedia data to reduce the possibility of information leakage to unauthorized parties. The authors' simulation and analysis indicate that the combination of these two mechanisms can provide high quality paths to achieve secure multimedia streaming.
{"title":"Mobile Multimedia Streaming Using Secure Multipath in Wireless Ad Hoc Networks","authors":"Lei Chen, Chung-wei Lee","doi":"10.4018/jhcr.2010040104","DOIUrl":"https://doi.org/10.4018/jhcr.2010040104","url":null,"abstract":"Supporting reliable and secure multimedia streaming service is a challenging task in the environment of wireless Mobile Ad hoc Networks MANETs where radio signals are prone to security attacks and the quality of media streaming is degraded by signal strength loss and interference. The mobility of mobile devices makes streaming even more difficult as communication links are often broken when the devices move out of the transmission range of their neighbors. This paper proposes a stable multipath routing algorithm and an intelligent secure data distribution scheme for multimedia streaming in MANETs. The multipath Neighbor Stability Routing is able to find more stable and long-lasting paths than traditional ad hoc routing algorithms. The secure data distribution takes historical data-path distribution into consideration and maximally disperses new multimedia data to reduce the possibility of information leakage to unauthorized parties. The authors' simulation and analysis indicate that the combination of these two mechanisms can provide high quality paths to achieve secure multimedia streaming.","PeriodicalId":265963,"journal":{"name":"Int. J. Handheld Comput. Res.","volume":"57 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114046196","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 proposes CADRE Collaborative Allocation and De-allocation of Replicas with Efficiency, which is a dynamic replication scheme for improving the typically low data availability in dedicated and cooperative mobile ad-hoc peer-to-peer M-P2P networks. In particular, replica allocation and de-allocation are collaboratively performed in tandem to facilitate effective replication. Such collaboration is facilitated by a hybrid super-peer architecture in which some of the mobile hosts act as the 'gateway nodes' GNs in a given region. GNs facilitate both search and replication. The main contributions of CADRE are as follows. First, it facilitates the prevention of 'thrashing' conditions due to its collaborative replica allocation and de-allocation mechanism. Second, it considers the replication of images at different resolutions to optimize the usage of the generally limited memory space of the mobile hosts MHs. Third, it addresses fair replica allocation across the MHs. Fourth, it facilitates the optimization of the limited energy resources of MHs during replication. The authors' performance evaluation demonstrates that CADRE is indeed effective in improving data availability in M-P2P networks with significant reduction in query response times and low communication traffic during replication as compared to a recent existing scheme as well as a baseline approach, which does not consider any replication.
{"title":"A Collaborative Replication Approach for Mobile-P2P Networks","authors":"Anirban Mondal, S. Madria, M. Kitsuregawa","doi":"10.4018/jhcr.2010040105","DOIUrl":"https://doi.org/10.4018/jhcr.2010040105","url":null,"abstract":"This paper proposes CADRE Collaborative Allocation and De-allocation of Replicas with Efficiency, which is a dynamic replication scheme for improving the typically low data availability in dedicated and cooperative mobile ad-hoc peer-to-peer M-P2P networks. In particular, replica allocation and de-allocation are collaboratively performed in tandem to facilitate effective replication. Such collaboration is facilitated by a hybrid super-peer architecture in which some of the mobile hosts act as the 'gateway nodes' GNs in a given region. GNs facilitate both search and replication. The main contributions of CADRE are as follows. First, it facilitates the prevention of 'thrashing' conditions due to its collaborative replica allocation and de-allocation mechanism. Second, it considers the replication of images at different resolutions to optimize the usage of the generally limited memory space of the mobile hosts MHs. Third, it addresses fair replica allocation across the MHs. Fourth, it facilitates the optimization of the limited energy resources of MHs during replication. The authors' performance evaluation demonstrates that CADRE is indeed effective in improving data availability in M-P2P networks with significant reduction in query response times and low communication traffic during replication as compared to a recent existing scheme as well as a baseline approach, which does not consider any replication.","PeriodicalId":265963,"journal":{"name":"Int. J. Handheld Comput. Res.","volume":"319 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116772739","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 discusses conceptual definitions of mobile service users. These concepts reflect the domains of end-users having an intention to use the service or using the service in practice. This study also defines metrics that measure the adoption of mobile services. In addition, the paper investigates the estimation of costs due to mobile service adoption gaps. The paper demonstrates the use of the invented metrics with a data set collected from a sample of Finnish early-adopter smartphone users in 2007. Based on this data set, a ranking of mobile services is presented based on adoption-related success factors. In addition, the potential loss of perceived end-user value, that is due to adoption gaps, is estimated. The notable conclusion is that though most new mobile services experience significant adoption gaps, the value loss is only 10% in the long-term and 3% in the short-term, relative to the use of existing services.
{"title":"A Measurement Framework of Mobile Service Adoption","authors":"H. Verkasalo","doi":"10.4018/jhcr.2010040102","DOIUrl":"https://doi.org/10.4018/jhcr.2010040102","url":null,"abstract":"This paper discusses conceptual definitions of mobile service users. These concepts reflect the domains of end-users having an intention to use the service or using the service in practice. This study also defines metrics that measure the adoption of mobile services. In addition, the paper investigates the estimation of costs due to mobile service adoption gaps. The paper demonstrates the use of the invented metrics with a data set collected from a sample of Finnish early-adopter smartphone users in 2007. Based on this data set, a ranking of mobile services is presented based on adoption-related success factors. In addition, the potential loss of perceived end-user value, that is due to adoption gaps, is estimated. The notable conclusion is that though most new mobile services experience significant adoption gaps, the value loss is only 10% in the long-term and 3% in the short-term, relative to the use of existing services.","PeriodicalId":265963,"journal":{"name":"Int. J. Handheld Comput. Res.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117129384","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
扫码关注我们
求助内容：
应助结果提醒方式：