Pub Date : 2006-04-10DOI: 10.1109/ISWPC.2006.1613604
H. Yoshida, T. Kuriyama, F. Maehara, F. Takahata
This paper presents the periodic spectrum transmission for single-carrier frequency-domain equalization (SC-FDE) employing space-time transmit diversity (STTD). The proposed scheme utilizes only even-numbered samples within a time domain data block to createa periodical spectrum which provides frequency redundancy. Frequency redundancy is used for sub-channel combining before FDE, which alleviates the loss of orthogonality caused by FDE under frequency selective fading channels. Therefore, the proposed scheme has an advantage of enhancing the overall frequency diversity benefit while keeping the space diversity benefit achieved by STTD. Computer simulation results show that the proposed scheme outperforms the typical SC-FDE using full samples over relatively severe frequency selective fading channels when applying 1-bit/sample transmission.
{"title":"Periodic Spectrum Transmission for Single-Carrier Frequency-Domain Equalization Employing Space-Time Transmit Diversity","authors":"H. Yoshida, T. Kuriyama, F. Maehara, F. Takahata","doi":"10.1109/ISWPC.2006.1613604","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613604","url":null,"abstract":"This paper presents the periodic spectrum transmission for single-carrier frequency-domain equalization (SC-FDE) employing space-time transmit diversity (STTD). The proposed scheme utilizes only even-numbered samples within a time domain data block to createa periodical spectrum which provides frequency redundancy. Frequency redundancy is used for sub-channel combining before FDE, which alleviates the loss of orthogonality caused by FDE under frequency selective fading channels. Therefore, the proposed scheme has an advantage of enhancing the overall frequency diversity benefit while keeping the space diversity benefit achieved by STTD. Computer simulation results show that the proposed scheme outperforms the typical SC-FDE using full samples over relatively severe frequency selective fading channels when applying 1-bit/sample transmission.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114489773","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 : 2006-04-10DOI: 10.1109/ISWPC.2006.1613643
F. Velez, V. Carvalho, D. Santos, R. P. Marcos, R. Costa, P. Sebastião, A. Rodrigues
This work addresses cellular planning aspects for a WiMax (worldwide interoperability for microwave access) point-to-multipoint wireless network to be developed in the region of Beira Interior. It is concentrated in more detail in the district of Covilha, and, particularly, in the urban area of the city, in order to guarantee communications from the Health Science Faculty of University of Beira Interior (HSF/UBI)/ Hospital Pero da Covilha to all central urban area of the city. By having aspects related with the carrier-to-noise and carrier-to-interference ratios into account, one concluded that it is necessary to consider a cellular structure with sectorisation, and cell coverage distances around 3 km. Because this zone is very hilly, the optimization of the choice of the location for base stations is essential; the potentialities of the GIS (geographic information systems) tools were explored to optimise the existence of line of sight coverage in coverage. Future research directions regarding architectures for interoperability and mobile IP, security, and the impact of multimedia applications are also addressed.
{"title":"Aspects of cellular planning for emergency and safety services in mobile WiMax networks","authors":"F. Velez, V. Carvalho, D. Santos, R. P. Marcos, R. Costa, P. Sebastião, A. Rodrigues","doi":"10.1109/ISWPC.2006.1613643","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613643","url":null,"abstract":"This work addresses cellular planning aspects for a WiMax (worldwide interoperability for microwave access) point-to-multipoint wireless network to be developed in the region of Beira Interior. It is concentrated in more detail in the district of Covilha, and, particularly, in the urban area of the city, in order to guarantee communications from the Health Science Faculty of University of Beira Interior (HSF/UBI)/ Hospital Pero da Covilha to all central urban area of the city. By having aspects related with the carrier-to-noise and carrier-to-interference ratios into account, one concluded that it is necessary to consider a cellular structure with sectorisation, and cell coverage distances around 3 km. Because this zone is very hilly, the optimization of the choice of the location for base stations is essential; the potentialities of the GIS (geographic information systems) tools were explored to optimise the existence of line of sight coverage in coverage. Future research directions regarding architectures for interoperability and mobile IP, security, and the impact of multimedia applications are also addressed.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126823520","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 : 2006-04-10DOI: 10.1109/ISWPC.2006.1613561
J. Neander, E. Hansen, M. Nolin, M. Bjorkman
With the growing interest in wireless sensor networks, energy efficient communication infrastructures for such networks are becoming increasingly important. In this paper, we compare and simulate asymmetric and symmetric communication in sensor networks. We do this by extending LEACH, a well-known TDMA cluster-based sensor network architecture, to use asymmetric communication. The extension makes it possible to scale up the network size beyond what is feasible with LEACH and its variants LEACH-C and LEACH-F.
{"title":"Asymmetric multihop communication in large sensor networks","authors":"J. Neander, E. Hansen, M. Nolin, M. Bjorkman","doi":"10.1109/ISWPC.2006.1613561","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613561","url":null,"abstract":"With the growing interest in wireless sensor networks, energy efficient communication infrastructures for such networks are becoming increasingly important. In this paper, we compare and simulate asymmetric and symmetric communication in sensor networks. We do this by extending LEACH, a well-known TDMA cluster-based sensor network architecture, to use asymmetric communication. The extension makes it possible to scale up the network size beyond what is feasible with LEACH and its variants LEACH-C and LEACH-F.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121705383","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 : 2006-04-10DOI: 10.1109/ISWPC.2006.1613595
D. Yuan
Ad hoc networking is one of the enabling technologies for wireless pervasive computing. We study the issue of constructing an energy-efficient virtual backbone for broadcast communication in wireless ad hoc networks. When nodes use constant and identical transmission power, energy-efficient broadcasting amounts to minimizing the backbone size. Typically, algorithms for backbone construction rely on either adding nodes to the backbone, or pruning nodes from the backbone. We present a distributed hybrid algorithm in which a node is allowed to join the backbone as well as to prune itself from the backbone. In addition, a node may perform these two types of operations repeatedly, if necessary. We present numerical experiments in which we evaluate the performance of the distributed hybrid algorithm and several other algorithms. The experiments show that our algorithm performs well in terms of constructing a backbone of small size. Moreover, the number of times that the algorithm repeats its steps before converging to a stable backbone is small in relation to backbone size.
{"title":"A distributed hybrid algorithm for broadcasting through a virtual backbone in wireless ad hoc networks","authors":"D. Yuan","doi":"10.1109/ISWPC.2006.1613595","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613595","url":null,"abstract":"Ad hoc networking is one of the enabling technologies for wireless pervasive computing. We study the issue of constructing an energy-efficient virtual backbone for broadcast communication in wireless ad hoc networks. When nodes use constant and identical transmission power, energy-efficient broadcasting amounts to minimizing the backbone size. Typically, algorithms for backbone construction rely on either adding nodes to the backbone, or pruning nodes from the backbone. We present a distributed hybrid algorithm in which a node is allowed to join the backbone as well as to prune itself from the backbone. In addition, a node may perform these two types of operations repeatedly, if necessary. We present numerical experiments in which we evaluate the performance of the distributed hybrid algorithm and several other algorithms. The experiments show that our algorithm performs well in terms of constructing a backbone of small size. Moreover, the number of times that the algorithm repeats its steps before converging to a stable backbone is small in relation to backbone size.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121904539","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 : 2006-04-10DOI: 10.1109/ISWPC.2006.1613667
S. Kitajima, Jing Cai, T. Terada, T. Hara, S. Nishio
In recent years, there has been an increasing interest in the broadcast database system, where the server periodically broadcasts contents of a database to mobile clients such as PDAs. There are three query processing methods in the broadcast database system: (i) the server processes a query and then broadcasts the query result to the client; (ii) the client stores all data that are necessary in processing the query and then processes it locally; and (iii) the server and the client collaborate in processing the query. Since the performance of each method changes according to the situation, such as the interval of query generation and the size of query results, it is difficult to decide the optimal method among them statically. In this paper, we propose a new query processing method which dynamically changes the order of queries submitted in the queue at the server and also changes processing methods for the queries according to the deadline of queries and the system situation. Our method not only improves the response time but also increases the success rate of query processing compared with the traditional methods.
{"title":"A Query Processing Mechanism Based on the Broadcast Queue for Broadcast Database Systems","authors":"S. Kitajima, Jing Cai, T. Terada, T. Hara, S. Nishio","doi":"10.1109/ISWPC.2006.1613667","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613667","url":null,"abstract":"In recent years, there has been an increasing interest in the broadcast database system, where the server periodically broadcasts contents of a database to mobile clients such as PDAs. There are three query processing methods in the broadcast database system: (i) the server processes a query and then broadcasts the query result to the client; (ii) the client stores all data that are necessary in processing the query and then processes it locally; and (iii) the server and the client collaborate in processing the query. Since the performance of each method changes according to the situation, such as the interval of query generation and the size of query results, it is difficult to decide the optimal method among them statically. In this paper, we propose a new query processing method which dynamically changes the order of queries submitted in the queue at the server and also changes processing methods for the queries according to the deadline of queries and the system situation. Our method not only improves the response time but also increases the success rate of query processing compared with the traditional methods.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123798864","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 : 2006-04-10DOI: 10.1109/ISWPC.2006.1613584
Seung-Hun Oh, Young Han Kim, Jong Hwa Lee
In this paper, we propose a fast layer-3 (L3) handover (HO) scheme optimized for the layer-2 (L2) triggers, which are proposed to represent the more detailed HO state of the wireless access system. Especially we define the more than one trigger which can arise during L2 HO procedure according to the dynamic state of the wireless environment, and design the new fast L3 HO scheme where the appropriate behaviors (fast HO components) are mapped into the proposed triggers reasonably. Then we combine these components in the order of occurring triggers. The analytic results show that the proposed scheme is able to be more adaptable to dynamic wireless state than the previous fast HO schemes.
{"title":"Enhanced layer-3 handover using the layer-2 triggers","authors":"Seung-Hun Oh, Young Han Kim, Jong Hwa Lee","doi":"10.1109/ISWPC.2006.1613584","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613584","url":null,"abstract":"In this paper, we propose a fast layer-3 (L3) handover (HO) scheme optimized for the layer-2 (L2) triggers, which are proposed to represent the more detailed HO state of the wireless access system. Especially we define the more than one trigger which can arise during L2 HO procedure according to the dynamic state of the wireless environment, and design the new fast L3 HO scheme where the appropriate behaviors (fast HO components) are mapped into the proposed triggers reasonably. Then we combine these components in the order of occurring triggers. The analytic results show that the proposed scheme is able to be more adaptable to dynamic wireless state than the previous fast HO schemes.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124958891","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 : 2006-04-10DOI: 10.1109/ISWPC.2006.1613650
T. Ploysuwan, P. Teekaput
We consider the problem of iterative blind multiuser detection for multi-input-multi-output (MIMO) systems, which consist of K uplink asynchronous DS-CDMA users and n/sub R/ receive antennae, in presence of both intra- and intercell interference. The proposed receiver typically has only the knowledge of the first spreading codes of K/sub in/ /spl les/ K users inside the cell and ignore unknown interference of K - K/sub in/ users outside the cell. The proposed schemes in this paper present two types of iterative blind receivers motivated from the concept of generalized sidelobe canceller (GSC) to separate the problem into two components one in constrained subspace (inner cell space : H/sub in/) and one orthogonal to it (unknown interference plus noise space). The knowledge of intracell channel matrix H/sub in/ is required for our algorithms. So, two types of blind channel estimation both subspace and POR (power of R) methods are used for comparative performances as channel estimation and bit error rate (BER) of iterative receiver. The proposed detectors utilize the computation of log likelihood ratios (LLRs) fed from their turbo decoders at previous iteration to blindly suppress intracell interferences and residuals interferences left by iterative process. The computations of LLRs from iterative blind multiuser detector are refined to their turbo decoders by iterative fashions.
{"title":"Blind turbo multiuser detector with unknown intercell interferences","authors":"T. Ploysuwan, P. Teekaput","doi":"10.1109/ISWPC.2006.1613650","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613650","url":null,"abstract":"We consider the problem of iterative blind multiuser detection for multi-input-multi-output (MIMO) systems, which consist of K uplink asynchronous DS-CDMA users and n/sub R/ receive antennae, in presence of both intra- and intercell interference. The proposed receiver typically has only the knowledge of the first spreading codes of K/sub in/ /spl les/ K users inside the cell and ignore unknown interference of K - K/sub in/ users outside the cell. The proposed schemes in this paper present two types of iterative blind receivers motivated from the concept of generalized sidelobe canceller (GSC) to separate the problem into two components one in constrained subspace (inner cell space : H/sub in/) and one orthogonal to it (unknown interference plus noise space). The knowledge of intracell channel matrix H/sub in/ is required for our algorithms. So, two types of blind channel estimation both subspace and POR (power of R) methods are used for comparative performances as channel estimation and bit error rate (BER) of iterative receiver. The proposed detectors utilize the computation of log likelihood ratios (LLRs) fed from their turbo decoders at previous iteration to blindly suppress intracell interferences and residuals interferences left by iterative process. The computations of LLRs from iterative blind multiuser detector are refined to their turbo decoders by iterative fashions.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125443311","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 : 2006-04-10DOI: 10.1109/ISWPC.2006.1613559
D. Gavalas, G. Pantziou, C. Konstantopoulos, B. Mamalis
Clustering is a promising approach for building hierarchies and simplifying the routing process in mobile ad-hoc network environments. The main objective of clustering is to identify suitable node representatives, i.e. cluster heads (CHs), to store routing and topology information and maximize clusters stability. Traditional clustering algorithms suggest CH election exclusively based on node IDs or location information and involve frequent broadcasting of control packets, even when network topology remains unchanged. More recent works take into account additional metrics (such as energy and mobility) and optimize initial clustering. However, in many situations (e.g. in relatively static topologies) re-clustering procedure is hardly ever invoked; hence initially elected CHs soon reach battery exhaustion. Herein, we introduce an efficient distributed clustering algorithm that uses both mobility and energy metrics to provide stable cluster formations. CHs are initially elected based on the time and cost-efficient lowest-ID method. During clustering maintenance phase though, node IDs are re-assigned according to nodes mobility and energy status, ensuring that nodes with low-mobility and sufficient energy supply are assigned low IDs and, hence, are elected as CHs. Our algorithm also reduces control traffic volume since broadcast period is adjusted according to the nodes mobility pattern: we employ infrequent broadcasting for relative static network topologies, and increase broadcast frequency for highly mobile network configurations. Simulation results verify that energy consumption is uniformly distributed among network nodes and that signaling overhead is significantly decreased.
{"title":"Lowest-ID with adaptive ID reassignment: a novel mobile ad-hoc networks clustering algorithm","authors":"D. Gavalas, G. Pantziou, C. Konstantopoulos, B. Mamalis","doi":"10.1109/ISWPC.2006.1613559","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613559","url":null,"abstract":"Clustering is a promising approach for building hierarchies and simplifying the routing process in mobile ad-hoc network environments. The main objective of clustering is to identify suitable node representatives, i.e. cluster heads (CHs), to store routing and topology information and maximize clusters stability. Traditional clustering algorithms suggest CH election exclusively based on node IDs or location information and involve frequent broadcasting of control packets, even when network topology remains unchanged. More recent works take into account additional metrics (such as energy and mobility) and optimize initial clustering. However, in many situations (e.g. in relatively static topologies) re-clustering procedure is hardly ever invoked; hence initially elected CHs soon reach battery exhaustion. Herein, we introduce an efficient distributed clustering algorithm that uses both mobility and energy metrics to provide stable cluster formations. CHs are initially elected based on the time and cost-efficient lowest-ID method. During clustering maintenance phase though, node IDs are re-assigned according to nodes mobility and energy status, ensuring that nodes with low-mobility and sufficient energy supply are assigned low IDs and, hence, are elected as CHs. Our algorithm also reduces control traffic volume since broadcast period is adjusted according to the nodes mobility pattern: we employ infrequent broadcasting for relative static network topologies, and increase broadcast frequency for highly mobile network configurations. Simulation results verify that energy consumption is uniformly distributed among network nodes and that signaling overhead is significantly decreased.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129709461","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 : 2006-04-10DOI: 10.1109/ISWPC.2006.1613649
A. Baumgart, H. Knapp, M. Schader
Collecting relevant information from a heterogeneous set of data resources is a challenging problem. Moreover, the storage and search for semantic data is even more complex in mobile environments. In this paper we present an approach how to collect semantic information by underlying profile settings. We define several profile types and levels where the user's interests are stored. Information retrieval is then executed according to the profile settings. Distributed profiles for mobile semantic data exchange can personalize the exchanged information in business settings. This leads to effective data transmission with regard to the mobile (device) context and the business environment, the user is exposed to. Our realization of a prototype confirms the effective semantic data exchange. The evaluation of dynamic profile settings in ad hoc network scenarios verifies our approach experimentally.
{"title":"Mobile semantic data exchange in ad hoc networks using distributed profiles","authors":"A. Baumgart, H. Knapp, M. Schader","doi":"10.1109/ISWPC.2006.1613649","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613649","url":null,"abstract":"Collecting relevant information from a heterogeneous set of data resources is a challenging problem. Moreover, the storage and search for semantic data is even more complex in mobile environments. In this paper we present an approach how to collect semantic information by underlying profile settings. We define several profile types and levels where the user's interests are stored. Information retrieval is then executed according to the profile settings. Distributed profiles for mobile semantic data exchange can personalize the exchanged information in business settings. This leads to effective data transmission with regard to the mobile (device) context and the business environment, the user is exposed to. Our realization of a prototype confirms the effective semantic data exchange. The evaluation of dynamic profile settings in ad hoc network scenarios verifies our approach experimentally.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121496004","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 : 2006-04-10DOI: 10.1109/ISWPC.2006.1613660
Ju-Han Kim, Howon Kim
EPC Class-1 Generation-2 UHF tags, one of radio frequency identification or RFID tag types, is expected that most companies are planning to use it in the supply chain in the short term and in consumer packaging in the long term due to its inexpensive cost. Because of the very cost, however, its resources are extremely scarce and it is hard to have any valuable security algorithms in it. It causes security vulnerabilities, in particular cloning the tags for counterfeits. In this paper, we propose design of a wireless service for product authentication which is anti-counterfeiting at application level and which can be applied to both the supply chain and forthcoming mobile RFID environment. It aims to become aware of distribution of spurious products with fake RFID tags and to provide a product authentication service to general consumers with mobile RFID devices like mobile phone or PDA which has a mobile RFID reader. We will discuss anti-counterfeiting mechanisms which are required to our proposed service and address requirements that the mechanisms should have.
{"title":"A wireless service for product authentication in mobile RFID environment","authors":"Ju-Han Kim, Howon Kim","doi":"10.1109/ISWPC.2006.1613660","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613660","url":null,"abstract":"EPC Class-1 Generation-2 UHF tags, one of radio frequency identification or RFID tag types, is expected that most companies are planning to use it in the supply chain in the short term and in consumer packaging in the long term due to its inexpensive cost. Because of the very cost, however, its resources are extremely scarce and it is hard to have any valuable security algorithms in it. It causes security vulnerabilities, in particular cloning the tags for counterfeits. In this paper, we propose design of a wireless service for product authentication which is anti-counterfeiting at application level and which can be applied to both the supply chain and forthcoming mobile RFID environment. It aims to become aware of distribution of spurious products with fake RFID tags and to provide a product authentication service to general consumers with mobile RFID devices like mobile phone or PDA which has a mobile RFID reader. We will discuss anti-counterfeiting mechanisms which are required to our proposed service and address requirements that the mechanisms should have.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124494837","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
扫码关注我们
求助内容：
应助结果提醒方式：