Pub Date : 2006-04-10DOI: 10.1109/ISWPC.2006.1613625
S. Tachaphetpiboon, T. Amornraksa
In this paper, a feature extraction method based on the fast Fourier transform (FFT) is proposed for the use of fingerprint matching. The performance of our approach is evaluated by the amount of time required in the features extracting and feature matching processes. The recognition rate obtained from the proposed method is also evaluated by the k-NN classifier. The experimental results show that, by using our approach, the processing time in the features extraction and searching & matching processes is reduced by up to 34.95 times, and decreased by up to 0.39 milliseconds, respectively, compared to the method proposed in [6]. Furthermore, with our proposed method, the fingerprint recognition rate can be improved by 1.1% to 13.19%.
{"title":"Applying FFT Features for Fingerprint Matching","authors":"S. Tachaphetpiboon, T. Amornraksa","doi":"10.1109/ISWPC.2006.1613625","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613625","url":null,"abstract":"In this paper, a feature extraction method based on the fast Fourier transform (FFT) is proposed for the use of fingerprint matching. The performance of our approach is evaluated by the amount of time required in the features extracting and feature matching processes. The recognition rate obtained from the proposed method is also evaluated by the k-NN classifier. The experimental results show that, by using our approach, the processing time in the features extraction and searching & matching processes is reduced by up to 34.95 times, and decreased by up to 0.39 milliseconds, respectively, compared to the method proposed in [6]. Furthermore, with our proposed method, the fingerprint recognition rate can be improved by 1.1% to 13.19%.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126464931","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.1613602
Seyeong Choi, Hong-Chuan Yang, Young-Chai Ko
We propose a new closed-loop transmit diversity scheme for MIMO systems based on orthogonal space-time block coding (OSTBC). The receiver of the proposed scheme checks the output signal-to-noise ratio (SNR) of the space-time decoder against an output threshold and requests the transmitter to replace the antenna corresponding to the weakest path with an unused one if the output SNR is below the threshold. We provide some interesting statistical analysis and obtain closed-form expressions for the cumulative distribution function (CDF), the probability density function (PDF), and the moment generating function (MGF) of the received SNR. We show through numerical examples that the proposed scheme offers significant performance gain with very minimal feedback load over existing open-loop MIMO diversity systems and its performance is commensurate with more complicated systems such as transmit generalized selection combining (GSC).
{"title":"Transmit diversity systems with antenna replacement and its application to space time block coding transmission","authors":"Seyeong Choi, Hong-Chuan Yang, Young-Chai Ko","doi":"10.1109/ISWPC.2006.1613602","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613602","url":null,"abstract":"We propose a new closed-loop transmit diversity scheme for MIMO systems based on orthogonal space-time block coding (OSTBC). The receiver of the proposed scheme checks the output signal-to-noise ratio (SNR) of the space-time decoder against an output threshold and requests the transmitter to replace the antenna corresponding to the weakest path with an unused one if the output SNR is below the threshold. We provide some interesting statistical analysis and obtain closed-form expressions for the cumulative distribution function (CDF), the probability density function (PDF), and the moment generating function (MGF) of the received SNR. We show through numerical examples that the proposed scheme offers significant performance gain with very minimal feedback load over existing open-loop MIMO diversity systems and its performance is commensurate with more complicated systems such as transmit generalized selection combining (GSC).","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115284988","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.1613638
Sangook Moon
In Bluetooth version 1.0, the frequency to be shared has been resolved by the specific part of the digits of the Device clock and the Bluetooth address in the given piconet. Basic pattern was a kind of pseudo-random fashion using 79 frequencies in the ISM band. At this point, a problem might occur if there were more than two devices using the same frequency within the shared range. In this paper, we proposed a software-based adaptive frequency hopping method so that more than two wireless devices can stay connected without frequency collision. Suggested method was implemented with HDL (Hardware Description Language) and automatically synthesized and laid out. The adaptive frequency hopping circuit was implemented in a prototype and showed its operation at 24mHz correctly.
{"title":"An Adaptive Frequency Hopping Method in the Bluetooth Baseband","authors":"Sangook Moon","doi":"10.1109/ISWPC.2006.1613638","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613638","url":null,"abstract":"In Bluetooth version 1.0, the frequency to be shared has been resolved by the specific part of the digits of the Device clock and the Bluetooth address in the given piconet. Basic pattern was a kind of pseudo-random fashion using 79 frequencies in the ISM band. At this point, a problem might occur if there were more than two devices using the same frequency within the shared range. In this paper, we proposed a software-based adaptive frequency hopping method so that more than two wireless devices can stay connected without frequency collision. Suggested method was implemented with HDL (Hardware Description Language) and automatically synthesized and laid out. The adaptive frequency hopping circuit was implemented in a prototype and showed its operation at 24mHz correctly.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124955295","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.1613593
N. Wisitpongphan, O. Tonguz
In ad hoc wireless networks, routes are discovered either by means of a periodic update between 1-hop neighbors or by using a reactive routing protocol which relies on an explicit route discovery process. Although the major advantage of a reactive protocol is the reduction in the routing overhead, the conventional flooding mechanism used to propagate the route request (RREQ) message during the route discovery process does not scale well to large networks. In addition to the overhead problem, the way in which the route request gets propagated across the network affects the network performance in two different ways: (i) it determines how fast the route can be acquired; (ii) it is also an important factor in determining the availability and quality of the route. In this paper, we propose three novel RREQ broadcast techniques, i.e., weighted p-persistence, slotted p-persistence, and slotted p-persistence schemes. Our simulation results show that the proposed schemes can achieve up to 75% routing overhead reduction while keeping the route acquisition delay close or equal to the conventional flooding scheme.
{"title":"Scalable broadcast strategies for ad hoc routing protocols","authors":"N. Wisitpongphan, O. Tonguz","doi":"10.1109/ISWPC.2006.1613593","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613593","url":null,"abstract":"In ad hoc wireless networks, routes are discovered either by means of a periodic update between 1-hop neighbors or by using a reactive routing protocol which relies on an explicit route discovery process. Although the major advantage of a reactive protocol is the reduction in the routing overhead, the conventional flooding mechanism used to propagate the route request (RREQ) message during the route discovery process does not scale well to large networks. In addition to the overhead problem, the way in which the route request gets propagated across the network affects the network performance in two different ways: (i) it determines how fast the route can be acquired; (ii) it is also an important factor in determining the availability and quality of the route. In this paper, we propose three novel RREQ broadcast techniques, i.e., weighted p-persistence, slotted p-persistence, and slotted p-persistence schemes. Our simulation results show that the proposed schemes can achieve up to 75% routing overhead reduction while keeping the route acquisition delay close or equal to the conventional flooding scheme.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116520393","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.1613572
P. Israsena, I. Kale
This paper presents a new trace-back memory structure for Viterbi decoders that reduces power consumption by 63% compared to the conventional RAM based design. Instead of the intensive read and write operations as required in RAM based designs, the new memory is based on an array of registers connected with trace-back signals that decode the output bits on the fly. The structure is used together with appropriate clock and power-aware control signals. Based on a 0.35 /spl mu/m CMOS implementation the trace-back back memory consumes energy of 182 pJ.
{"title":"A Viterbi decoder with low-power trace-back memory structure for wireless pervasive communications","authors":"P. Israsena, I. Kale","doi":"10.1109/ISWPC.2006.1613572","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613572","url":null,"abstract":"This paper presents a new trace-back memory structure for Viterbi decoders that reduces power consumption by 63% compared to the conventional RAM based design. Instead of the intensive read and write operations as required in RAM based designs, the new memory is based on an array of registers connected with trace-back signals that decode the output bits on the fly. The structure is used together with appropriate clock and power-aware control signals. Based on a 0.35 /spl mu/m CMOS implementation the trace-back back memory consumes energy of 182 pJ.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115973176","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.1613620
H. Asaeda, M. Rahma, Y. Toyama
Threshold cryptography is a novel cryptographic technique sharing secret among members. It divides a secret key into multiple shares by a cryptographic operation. This technique is useful to provide a shared secret key to legitimate nodes in a infrastructure-less mobile ad-hoc network (MANET). As an additional component, proactive secret sharing (PSS) allows a set of nodes holding shares to refresh all shares by generating a new set of shares for the same secret key from the old shares without reconstructing the secret key. It is necessary to reasonably escape from threats of exposing the secret key when threshold cryptography is used. In this paper, we design the PSS protocol implementation specification in a MANET environment. In our scheme all share holder nodes synchronize the PSS procedure in a well-managed fashion to keep the protocol consistency. We then introduce our actual implementation and evaluate the behavior and its performance criteria.
{"title":"Structuring proactive secret sharing in mobile ad-hoc networks","authors":"H. Asaeda, M. Rahma, Y. Toyama","doi":"10.1109/ISWPC.2006.1613620","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613620","url":null,"abstract":"Threshold cryptography is a novel cryptographic technique sharing secret among members. It divides a secret key into multiple shares by a cryptographic operation. This technique is useful to provide a shared secret key to legitimate nodes in a infrastructure-less mobile ad-hoc network (MANET). As an additional component, proactive secret sharing (PSS) allows a set of nodes holding shares to refresh all shares by generating a new set of shares for the same secret key from the old shares without reconstructing the secret key. It is necessary to reasonably escape from threats of exposing the secret key when threshold cryptography is used. In this paper, we design the PSS protocol implementation specification in a MANET environment. In our scheme all share holder nodes synchronize the PSS procedure in a well-managed fashion to keep the protocol consistency. We then introduce our actual implementation and evaluate the behavior and its performance criteria.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116463996","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.1613592
E. Yanmaz, O. Tonguz, S. Dixit
Scale-free property, or what is more commonly referred to as power law node degree distribution, has been observed within several natural and man-made self-organizing complex systems such as the Internet, World Wide Web (WWW), social networks, biological systems, etc. While reasons behind the power law degree distribution, especially in the context of the topology of the Internet, have been explored extensively, and several models to generate topologies that govern the power law property have been proposed, the relationship between the scale-free property and the self-organizing nature of these complex systems has not been clarified yet. In this paper, we explore if scale-free property (also known as power law) is a necessary condition for self-organization, and as a case study, we investigate if the topology of self-organizing wireless networks follow a power law.
{"title":"Power law property and self-organization in hybrid ad hoc wireless networks","authors":"E. Yanmaz, O. Tonguz, S. Dixit","doi":"10.1109/ISWPC.2006.1613592","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613592","url":null,"abstract":"Scale-free property, or what is more commonly referred to as power law node degree distribution, has been observed within several natural and man-made self-organizing complex systems such as the Internet, World Wide Web (WWW), social networks, biological systems, etc. While reasons behind the power law degree distribution, especially in the context of the topology of the Internet, have been explored extensively, and several models to generate topologies that govern the power law property have been proposed, the relationship between the scale-free property and the self-organizing nature of these complex systems has not been clarified yet. In this paper, we explore if scale-free property (also known as power law) is a necessary condition for self-organization, and as a case study, we investigate if the topology of self-organizing wireless networks follow a power law.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"256 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116059258","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.1613569
Peng Gong, Peng Xue, Jae Sung Lee, D. Kim
In this paper, we propose a new transmission scheme to support multiple simultaneously operating piconets (SOPs) in an ultra wideband (UWB) system based on multi-band orthogonal frequency division multiplexing (MB/spl I.bar/OFDM), where the code division technique is combined with the MB/spl I.bar/OFDM. When there are 2 or 3 SOPs, the collision between different piconets is increased and the average probabilities of symbol collision increase up to nearly 55.7% and 70.7%, respectively. Hence, the previous scheme using symbol repeater and erasure can't effectively reduce the co-channel interference (CCI). We propose to use the MC/spl I.bar/CDMA to mitigate the CCI from 2 and 3 SOPs. Our simulation results demonstrate that the proposed scheme is effective in multiple SOPs.
{"title":"Performance enhancement of an MB/spl I.bar/OFDM based UWB system in multiple SOPs environments","authors":"Peng Gong, Peng Xue, Jae Sung Lee, D. Kim","doi":"10.1109/ISWPC.2006.1613569","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613569","url":null,"abstract":"In this paper, we propose a new transmission scheme to support multiple simultaneously operating piconets (SOPs) in an ultra wideband (UWB) system based on multi-band orthogonal frequency division multiplexing (MB/spl I.bar/OFDM), where the code division technique is combined with the MB/spl I.bar/OFDM. When there are 2 or 3 SOPs, the collision between different piconets is increased and the average probabilities of symbol collision increase up to nearly 55.7% and 70.7%, respectively. Hence, the previous scheme using symbol repeater and erasure can't effectively reduce the co-channel interference (CCI). We propose to use the MC/spl I.bar/CDMA to mitigate the CCI from 2 and 3 SOPs. Our simulation results demonstrate that the proposed scheme is effective in multiple SOPs.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115655719","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.1613603
Haitao Liu, Hanbing Zhou, Daoben Li
In this paper, we study the error performance of Vertical Bell Labs Layered Space-Time (V-BLAST) using maximum likelihood (ML) receiver in the presence of receive correlated fading channel. The squared Euclidean distance is observed to be weighted Chi-square distributed random variable. Based on the observation, we present a new exact expression of the pairwise error probability (PEP) and the union bound of the BER. The asymptotic result is used to quantify the loss of the diversity order and the penalty of SNR. It is shown the loss of diversity order equals to the difference of the number of receiver antennas and the rank of receive correlation matrix, and, in the case of full rank of correlation matrix, the penalty of SNR is determined by the determinant of the receive correlation matrix. Simulation results are given to corroborate the theoretical analysis.
{"title":"Impact of receive correlation on the performance of V-BLAST system","authors":"Haitao Liu, Hanbing Zhou, Daoben Li","doi":"10.1109/ISWPC.2006.1613603","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613603","url":null,"abstract":"In this paper, we study the error performance of Vertical Bell Labs Layered Space-Time (V-BLAST) using maximum likelihood (ML) receiver in the presence of receive correlated fading channel. The squared Euclidean distance is observed to be weighted Chi-square distributed random variable. Based on the observation, we present a new exact expression of the pairwise error probability (PEP) and the union bound of the BER. The asymptotic result is used to quantify the loss of the diversity order and the penalty of SNR. It is shown the loss of diversity order equals to the difference of the number of receiver antennas and the rank of receive correlation matrix, and, in the case of full rank of correlation matrix, the penalty of SNR is determined by the determinant of the receive correlation matrix. Simulation results are given to corroborate the theoretical analysis.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125298249","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.1613654
Ashish Shukla, Neeraj Tyagi
Mobile ad-hoc network (MANET) is infrastructureless, self-organizable, multi hop packet switched network. A number of routing protocols for MANETs have been proposed in recent years. Dynamic source routing (DSR) protocol is one of the most popular routing protocol for ad hoc networks. This paper presents a novel method to enhance route maintenance part of DSR protocol. Our proposed route maintenance significantly increases the efficiency of the protocol at the time of route failures.
{"title":"A new route maintenance in dynamic source routing protocol","authors":"Ashish Shukla, Neeraj Tyagi","doi":"10.1109/ISWPC.2006.1613654","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613654","url":null,"abstract":"Mobile ad-hoc network (MANET) is infrastructureless, self-organizable, multi hop packet switched network. A number of routing protocols for MANETs have been proposed in recent years. Dynamic source routing (DSR) protocol is one of the most popular routing protocol for ad hoc networks. This paper presents a novel method to enhance route maintenance part of DSR protocol. Our proposed route maintenance significantly increases the efficiency of the protocol at the time of route failures.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121408948","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
扫码关注我们
求助内容：
应助结果提醒方式：