Pub Date : 2008-12-08DOI: 10.1109/PIMRC.2008.4699719
R. Giuliano, P. Loreti, F. Mazzenga
Planning procedures for multi-carrier wireless systems based on the SINR evaluated over one sub-carrier do not allow to account for multi-carrier transmissions features where coded bits in the same block are spread over different sub-carriers. Due to channel frequency selectivity, sub-carriers can be subjected to different propagation conditions. The decoder in the receiver can compensate for errors even when some sub-carriers are received below the SINR target level. This fact should be accounted for during cell planning so to avoid wrong dimensioning of network parameters. In order to extend the classical planning approach to the multi-carrier systems we adopt the effective exponential SINR parameter for planning. The proposed procedure is general and it is based on the simulated statistics of the effective SINR. For evaluation purposes the two cell interference scenario is considered and the variability of the reuse distance with respect to the number of transmitted sub-carriers per block is investigated.
{"title":"Planning of multi-carrier broadband wireless systems with ideal power control over frequency selective channels","authors":"R. Giuliano, P. Loreti, F. Mazzenga","doi":"10.1109/PIMRC.2008.4699719","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699719","url":null,"abstract":"Planning procedures for multi-carrier wireless systems based on the SINR evaluated over one sub-carrier do not allow to account for multi-carrier transmissions features where coded bits in the same block are spread over different sub-carriers. Due to channel frequency selectivity, sub-carriers can be subjected to different propagation conditions. The decoder in the receiver can compensate for errors even when some sub-carriers are received below the SINR target level. This fact should be accounted for during cell planning so to avoid wrong dimensioning of network parameters. In order to extend the classical planning approach to the multi-carrier systems we adopt the effective exponential SINR parameter for planning. The proposed procedure is general and it is based on the simulated statistics of the effective SINR. For evaluation purposes the two cell interference scenario is considered and the variability of the reuse distance with respect to the number of transmitted sub-carriers per block is investigated.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114204720","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-12-08DOI: 10.1109/PIMRC.2008.4699913
G. Alfano, A. Aubry, Howard C. Huang, A. Tulino
Coordinating the reception and transmission of signals across spatially distributed base stations has been shown to improve sum-rate performance by mitigating the effects of intercell interference in Multiple-Input-Multiple-Output (MIMO) cellular networks. Relying on recent results on the freeness of certain non-Gaussian random matrices, we provide an information theoretic analysis of cooperative MIMO networks. This analysis applies to the case where full channel state information is known at a subset of the bases and where statistical information is known at all others. Tools for evaluating random matrix transforms traditionally exploited in Mean Square Error (MSE) and mutual information analysis are provided, and the general model formulation paves the way for future work, where specific scheduling and/or power assignment schemes could be embodied in the newly presented framework.
{"title":"Analysis of cooperative MIMO networks with incomplete channel state information","authors":"G. Alfano, A. Aubry, Howard C. Huang, A. Tulino","doi":"10.1109/PIMRC.2008.4699913","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699913","url":null,"abstract":"Coordinating the reception and transmission of signals across spatially distributed base stations has been shown to improve sum-rate performance by mitigating the effects of intercell interference in Multiple-Input-Multiple-Output (MIMO) cellular networks. Relying on recent results on the freeness of certain non-Gaussian random matrices, we provide an information theoretic analysis of cooperative MIMO networks. This analysis applies to the case where full channel state information is known at a subset of the bases and where statistical information is known at all others. Tools for evaluating random matrix transforms traditionally exploited in Mean Square Error (MSE) and mutual information analysis are provided, and the general model formulation paves the way for future work, where specific scheduling and/or power assignment schemes could be embodied in the newly presented framework.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116243911","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-12-08DOI: 10.1109/PIMRC.2008.4699805
Yanchuan Huang, P. Brennan, A. Seeds
This paper introduces a new method for estimating location of radio frequency identification (RFID) tags for application in indoor environments. The proposed positioning scheme employs a time-difference of arrival (TDOA) range estimation algorithm. The time-difference measurement is performed by taking advantage of the de-ramp properties of a linear frequency modulation (LFM) chirp. The paper provides details of the mechanism of this LFM-TDOA scheme from the system point of view. Compared to other popular radio technologies in the indoor positioning field, this new scheme is easy to design and requires only moderate computation ability. According to the experiment results summarized in the paper, the LFM-TDOA system shows good range estimation accuracy and thus has the potential to be used in accurate indoor location application.
{"title":"Active RFID location system based on time-difference measurement using a linear FM chirp tag signal","authors":"Yanchuan Huang, P. Brennan, A. Seeds","doi":"10.1109/PIMRC.2008.4699805","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699805","url":null,"abstract":"This paper introduces a new method for estimating location of radio frequency identification (RFID) tags for application in indoor environments. The proposed positioning scheme employs a time-difference of arrival (TDOA) range estimation algorithm. The time-difference measurement is performed by taking advantage of the de-ramp properties of a linear frequency modulation (LFM) chirp. The paper provides details of the mechanism of this LFM-TDOA scheme from the system point of view. Compared to other popular radio technologies in the indoor positioning field, this new scheme is easy to design and requires only moderate computation ability. According to the experiment results summarized in the paper, the LFM-TDOA system shows good range estimation accuracy and thus has the potential to be used in accurate indoor location application.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121007489","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-12-08DOI: 10.1109/PIMRC.2008.4699588
T. Lim, Tieyan Li
In this paper, we expose a denial of information attack that is possible due to the misuse of the kill password (specified under the EPC Class-1 Gen-2 standard [1]) in a previously proposed RFID tag-reader mutual authentication scheme [2]. We show how a passive eavesdropper can obtain useful information by monitoring the authentication session involving a target tag and correlating the information received. By repeating the process over a few authentication sessions, the eavesdropper can collect enough information about the kill password to launch a successful attack to kill and disable the tag. From our simulation analysis, we find that the attack can be carried out effectively using only three to five eavesdropped sessions in most cases. In addition, we discuss the implications of this attack and describe a few other weaknesses that we have observed in the scheme.
{"title":"Exposing an effective denial of information attack from the misuse of EPCglobal standards in an RFID authentication scheme","authors":"T. Lim, Tieyan Li","doi":"10.1109/PIMRC.2008.4699588","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699588","url":null,"abstract":"In this paper, we expose a denial of information attack that is possible due to the misuse of the kill password (specified under the EPC Class-1 Gen-2 standard [1]) in a previously proposed RFID tag-reader mutual authentication scheme [2]. We show how a passive eavesdropper can obtain useful information by monitoring the authentication session involving a target tag and correlating the information received. By repeating the process over a few authentication sessions, the eavesdropper can collect enough information about the kill password to launch a successful attack to kill and disable the tag. From our simulation analysis, we find that the attack can be carried out effectively using only three to five eavesdropped sessions in most cases. In addition, we discuss the implications of this attack and describe a few other weaknesses that we have observed in the scheme.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123753649","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-12-08DOI: 10.1109/PIMRC.2008.4699442
M. Al-Rawi, R. Jäntti, J. Torsner, M. Sågfors
In this paper we study the performance of the heuristic localized gradient algorithm (HLGA) that was designed for uplink scheduling in 3G long term evolution (LTE) systems. The performance of the algorithm is examined when dynamic traffic models are assumed. With dynamic traffic, users will have different buffer occupancies. The amount of resources granted to a user need to be mapped to the size of those occupancies. We suggest for that, a procedure called dasiapruningpsila where resources are given to users who maximize a certain criteria and later on prune the extra resources and allocate them to other users. We also study the performance loss caused by more realistic assumptions on base station knowledge of the terminalpsilas buffer state. We first assume no delay in the reporting of the buffer occupancy but later evaluate the effect of buffer reporting delays and quantification of data used to report the status of a buffer.
{"title":"On the performance of Heuristic opportunistic scheduling in the uplink of 3G LTE networks","authors":"M. Al-Rawi, R. Jäntti, J. Torsner, M. Sågfors","doi":"10.1109/PIMRC.2008.4699442","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699442","url":null,"abstract":"In this paper we study the performance of the heuristic localized gradient algorithm (HLGA) that was designed for uplink scheduling in 3G long term evolution (LTE) systems. The performance of the algorithm is examined when dynamic traffic models are assumed. With dynamic traffic, users will have different buffer occupancies. The amount of resources granted to a user need to be mapped to the size of those occupancies. We suggest for that, a procedure called dasiapruningpsila where resources are given to users who maximize a certain criteria and later on prune the extra resources and allocate them to other users. We also study the performance loss caused by more realistic assumptions on base station knowledge of the terminalpsilas buffer state. We first assume no delay in the reporting of the buffer occupancy but later evaluate the effect of buffer reporting delays and quantification of data used to report the status of a buffer.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123868372","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-12-08DOI: 10.1109/PIMRC.2008.4699827
Mahin Torki, Atousa Hajshirmohammadi
Increasing demand for high-speed and efficient multimedia transmission over wireless networks has driven tremendous research on enhancing the performance of multimedia communications over noisy channels. Multimedia applications increasingly require efficient transmission of still and moving images over wireless channels. In response to the rapidly increasing demand of the data-rate requirements, of particular importance is the so-called multi-input multi-output (MIMO) antenna. In this paper, we simultaneously exploit spatial multiplexing, diversity, antenna selection, and unequal power allocation (UPA) techniques to transmit progressive JPEG2000 images over a MIMO downlink channel where communication occurs from a multi-antenna base station to multiple multi-antenna mobile terminals. We take advantage of the spatial diversity by utilizing a joint decoding in the JPEG2000 decoder. The aim is to reduce the average distortion among users. Simulation results show that our proposed algorithms provide significant image quality improvement when compared to schemes that do not consider antenna selection or UPA.
{"title":"Multicasting JPEG2000 images over MIMO systems","authors":"Mahin Torki, Atousa Hajshirmohammadi","doi":"10.1109/PIMRC.2008.4699827","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699827","url":null,"abstract":"Increasing demand for high-speed and efficient multimedia transmission over wireless networks has driven tremendous research on enhancing the performance of multimedia communications over noisy channels. Multimedia applications increasingly require efficient transmission of still and moving images over wireless channels. In response to the rapidly increasing demand of the data-rate requirements, of particular importance is the so-called multi-input multi-output (MIMO) antenna. In this paper, we simultaneously exploit spatial multiplexing, diversity, antenna selection, and unequal power allocation (UPA) techniques to transmit progressive JPEG2000 images over a MIMO downlink channel where communication occurs from a multi-antenna base station to multiple multi-antenna mobile terminals. We take advantage of the spatial diversity by utilizing a joint decoding in the JPEG2000 decoder. The aim is to reduce the average distortion among users. Simulation results show that our proposed algorithms provide significant image quality improvement when compared to schemes that do not consider antenna selection or UPA.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121504646","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-12-08DOI: 10.1109/PIMRC.2008.4699525
Hamed Shah-Mansouri, Sara Bahramian, Mohammadreza Pakravan
Flooding and its variants are the simplest and most widely used broadcasting methods. Therefore, analysis of its performance in an ad-hoc environment using realistic assumptions is an important research topic. In this article, deploying a rigorous theoretic analysis, an upper bound on the performance of probabilistic flooding running over CSMA as a real and suitable MAC layer protocol for broadcasting scenarios is derived in a static multi-hop ad-hoc network in saturated condition. This model reveals the relation between network parameters and the performance of flooding and thus, helps the designer to have a better understanding of the effect of different design parameters. Using this model, an upper bound on total network coverage and energy consumed to achieve this coverage level can be determined. Simulation results are also brought to validate the derived upper bound model, and give evidence of its tightness in real scenarios.
{"title":"Performance analysis of flooding over CSMA in wireless ad-hoc networks","authors":"Hamed Shah-Mansouri, Sara Bahramian, Mohammadreza Pakravan","doi":"10.1109/PIMRC.2008.4699525","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699525","url":null,"abstract":"Flooding and its variants are the simplest and most widely used broadcasting methods. Therefore, analysis of its performance in an ad-hoc environment using realistic assumptions is an important research topic. In this article, deploying a rigorous theoretic analysis, an upper bound on the performance of probabilistic flooding running over CSMA as a real and suitable MAC layer protocol for broadcasting scenarios is derived in a static multi-hop ad-hoc network in saturated condition. This model reveals the relation between network parameters and the performance of flooding and thus, helps the designer to have a better understanding of the effect of different design parameters. Using this model, an upper bound on total network coverage and energy consumed to achieve this coverage level can be determined. Simulation results are also brought to validate the derived upper bound model, and give evidence of its tightness in real scenarios.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125212774","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-12-08DOI: 10.1109/PIMRC.2008.4699674
Carri W. Chan, N. Bambos, J. Singh
Multimedia applications for mobile devices are increasing and growing more sophisticated. Many of these applications require computationally intensive processing, such as image processing, source coding, feature extraction and feature matching. If all of this processing were performed on the mobile device, its limited battery supply would quickly deplete. However, if the request must be transmitted through a network and processed at a remote application server large delays may be incurred due to communication latency-especially if the original size of the request message is very large. In this paper, we propose the use of mid-network processing on intermediary nodes in a multistage tandem network. We refer to this as ldquowireless network-Assisted computingrdquo. Allowing for mid-network processing can alleviate some of the processing burden on the mobile device, thereby extending its lifetime. It can also reduce communication latency by reducing the amount of information transmitted along each link. Certainly ldquoleasingrdquo processing power from these nodes comes at a price-in some cases it is beneficial to lease, in others it is not. We examine the core tradeoff between battery usage, latency, and usage of processing power at mid-network nodes. We identify some interesting properties of the optimal processing schedule. Through numerical analysis we study these properties and tradeoffs.
{"title":"Network-Assisted Wireless Computing","authors":"Carri W. Chan, N. Bambos, J. Singh","doi":"10.1109/PIMRC.2008.4699674","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699674","url":null,"abstract":"Multimedia applications for mobile devices are increasing and growing more sophisticated. Many of these applications require computationally intensive processing, such as image processing, source coding, feature extraction and feature matching. If all of this processing were performed on the mobile device, its limited battery supply would quickly deplete. However, if the request must be transmitted through a network and processed at a remote application server large delays may be incurred due to communication latency-especially if the original size of the request message is very large. In this paper, we propose the use of mid-network processing on intermediary nodes in a multistage tandem network. We refer to this as ldquowireless network-Assisted computingrdquo. Allowing for mid-network processing can alleviate some of the processing burden on the mobile device, thereby extending its lifetime. It can also reduce communication latency by reducing the amount of information transmitted along each link. Certainly ldquoleasingrdquo processing power from these nodes comes at a price-in some cases it is beneficial to lease, in others it is not. We examine the core tradeoff between battery usage, latency, and usage of processing power at mid-network nodes. We identify some interesting properties of the optimal processing schedule. Through numerical analysis we study these properties and tradeoffs.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125241562","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-12-08DOI: 10.1109/PIMRC.2008.4699569
H. Mansour, P. Nasiopoulos, V. Krishnamurthy
In this paper, we present a real-time joint bit-rate and error protection allocation scheme for multiple scalable video streams sharing a single downlink channel. High speed downlink packet access (HSDPA) systems allow for multiple live video streams to share a common downlink channel among multiple mobile users. However, the unreliable nature of the wireless link results in packet losses and fluctuations in the available channel capacity. This calls for flexible error protection and rate control strategies implemented at the video encoders that can respond to the variation in channel conditions. In this paper, we formulate a global optimization problem, which is solved at every frame transmission instant and minimizes the expected sum of the video frame distortions of all users by adjusting the encoding quality at the base- and enhancement-layers as well as the application layer error protection overhead used to combat packet losses. We consider frame-level unequal erasure protection (UXP) as the application layer forward error correction scheme. Performance evaluations show that compared with existing schemes our proposed scheme delivers far superior decoded video quality averaging 1.2 dB in PSNR.
{"title":"Real-time joint rate and protection allocation for multi-user scalable video streaming","authors":"H. Mansour, P. Nasiopoulos, V. Krishnamurthy","doi":"10.1109/PIMRC.2008.4699569","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699569","url":null,"abstract":"In this paper, we present a real-time joint bit-rate and error protection allocation scheme for multiple scalable video streams sharing a single downlink channel. High speed downlink packet access (HSDPA) systems allow for multiple live video streams to share a common downlink channel among multiple mobile users. However, the unreliable nature of the wireless link results in packet losses and fluctuations in the available channel capacity. This calls for flexible error protection and rate control strategies implemented at the video encoders that can respond to the variation in channel conditions. In this paper, we formulate a global optimization problem, which is solved at every frame transmission instant and minimizes the expected sum of the video frame distortions of all users by adjusting the encoding quality at the base- and enhancement-layers as well as the application layer error protection overhead used to combat packet losses. We consider frame-level unequal erasure protection (UXP) as the application layer forward error correction scheme. Performance evaluations show that compared with existing schemes our proposed scheme delivers far superior decoded video quality averaging 1.2 dB in PSNR.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122497205","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-12-08DOI: 10.1109/PIMRC.2008.4699455
L. Cheng, S. Hailes
In recent years, the use of inertial sensing for body motion recognition has been demonstrated. However, existing work generally focuses on upper-body movements, which involve smaller scale movements and are less rapid. In this paper, we present two distinctive types of demonstration that show how on-body wireless inertial sensing can be used to capture detail inertial information of the more rapidly moving lower-body segments (e.g. the foot). The first demonstration shows how useful coaching support information for a sprinting exercise are captured; the second demonstration shows how inertial information of the lower segments are used to support football computer game applications, through which the users may trigger the appropriate on-screen actions by their foot motion, instead of using the current hand-held inertial sensing controllers.
{"title":"On-body wireless inertial sensing foot control applications","authors":"L. Cheng, S. Hailes","doi":"10.1109/PIMRC.2008.4699455","DOIUrl":"https://doi.org/10.1109/PIMRC.2008.4699455","url":null,"abstract":"In recent years, the use of inertial sensing for body motion recognition has been demonstrated. However, existing work generally focuses on upper-body movements, which involve smaller scale movements and are less rapid. In this paper, we present two distinctive types of demonstration that show how on-body wireless inertial sensing can be used to capture detail inertial information of the more rapidly moving lower-body segments (e.g. the foot). The first demonstration shows how useful coaching support information for a sprinting exercise are captured; the second demonstration shows how inertial information of the lower segments are used to support football computer game applications, through which the users may trigger the appropriate on-screen actions by their foot motion, instead of using the current hand-held inertial sensing controllers.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122644264","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
扫码关注我们
求助内容：
应助结果提醒方式：