Pub Date : 2006-04-10DOI: 10.1109/ISWPC.2006.1613578
M. Ulema, M. Waldman, B. Kozbe
We propose a framework architecture for a personal mobile agent that can be used in a wireless pervasive computing environment to help the user to access the relevant information/services. Challenges and approaches for making mobile agents functional in this type of environment are discussed. Primary focus of the paper is in maintaining and using models of the user, environment, and other agents. Also covered are the performance and security related areas.
{"title":"A framework for personal mobile agents in wireless pervasive computing environment","authors":"M. Ulema, M. Waldman, B. Kozbe","doi":"10.1109/ISWPC.2006.1613578","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613578","url":null,"abstract":"We propose a framework architecture for a personal mobile agent that can be used in a wireless pervasive computing environment to help the user to access the relevant information/services. Challenges and approaches for making mobile agents functional in this type of environment are discussed. Primary focus of the paper is in maintaining and using models of the user, environment, and other agents. Also covered are the performance and security related areas.","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":"124286822","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.1613596
S. S. Ara, A.M. Shah, M. Matsumoto
Indoor infrared links are anticipated to reach 100Mbit/s or even higher data rates in the future. At this high data rate, the existing Go-Back-N automatic repeat request (ARQ) scheme requires window and frame size adaptation to the corresponding optimum values for the correspondent Bit Error Rate (BER). But adaptive approaches always add a significant amount of complexity to the system. The aim of this paper is to present a new Automatic Repeat Request (ARQ) scheme, Block Window Retransmission (BWR) ARQ scheme, for achieving higher throughput efficiency over a wide range of BERs without adaptation of parameters. Simulation results show that it significantly outperforms the existing Go-Back-N ARQ scheme for next generation high speed IrDA links. We also examine the effect of window size, frame data length and minimum turn around time on the performance of the BWR ARQ scheme.
{"title":"Block Window Retransmission ARQ Scheme for Next Generation High Speed IrDA Links","authors":"S. S. Ara, A.M. Shah, M. Matsumoto","doi":"10.1109/ISWPC.2006.1613596","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613596","url":null,"abstract":"Indoor infrared links are anticipated to reach 100Mbit/s or even higher data rates in the future. At this high data rate, the existing Go-Back-N automatic repeat request (ARQ) scheme requires window and frame size adaptation to the corresponding optimum values for the correspondent Bit Error Rate (BER). But adaptive approaches always add a significant amount of complexity to the system. The aim of this paper is to present a new Automatic Repeat Request (ARQ) scheme, Block Window Retransmission (BWR) ARQ scheme, for achieving higher throughput efficiency over a wide range of BERs without adaptation of parameters. Simulation results show that it significantly outperforms the existing Go-Back-N ARQ scheme for next generation high speed IrDA links. We also examine the effect of window size, frame data length and minimum turn around time on the performance of the BWR ARQ scheme.","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":"122058494","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.1613587
Hsin-Mu Tsai, N. Wisitpongphan, O. Tonguz
Current ad hoc wireless routing protocols typically select the route with the shortest-path or minimum hop count to the destination. However, routes chosen according to such criteria tend to include longer hop-length links with possibly bad signal quality. It is expected that the routing protocol can be improved by eliminating the usage of routes with bad links. In this work, we modify the ad hoc on-demand distance vector (AODV) routing protocol to avoid routing through bad quality links. We also integrate the "hand-off" concept into our protocol to prevent link breakages during route maintenance. The herein reported OPNET simulation results seem very promising and they show that our protocol introduces a much lower routing overhead while still providing equal or better performance than the original AODV protocol in terms of throughput and delay.
{"title":"Link-quality aware ad hoc on-demand distance vector routing protocol","authors":"Hsin-Mu Tsai, N. Wisitpongphan, O. Tonguz","doi":"10.1109/ISWPC.2006.1613587","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613587","url":null,"abstract":"Current ad hoc wireless routing protocols typically select the route with the shortest-path or minimum hop count to the destination. However, routes chosen according to such criteria tend to include longer hop-length links with possibly bad signal quality. It is expected that the routing protocol can be improved by eliminating the usage of routes with bad links. In this work, we modify the ad hoc on-demand distance vector (AODV) routing protocol to avoid routing through bad quality links. We also integrate the \"hand-off\" concept into our protocol to prevent link breakages during route maintenance. The herein reported OPNET simulation results seem very promising and they show that our protocol introduces a much lower routing overhead while still providing equal or better performance than the original AODV protocol in terms of throughput and delay.","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":"128269475","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.1613666
H Zhao, H. Long, Wenbo Wang
For BLAST system, the optimal ML detection is infeasible when antenna number and modulation level is high, there have been some attempts to find more efficient algorithm to replace ML detection, such as sphere decoding (SD). Whereas the bad channel with large condition number still aggravates the computation complexity of SD. In this paper, we firstly explain the reason why the condition number influences the performance and the complexity of detection algorithm. Secondly, an algorithm of combining weight at high layer is proposed for SD, aiming to reduce the probability of accessing into the high layer of the tree in the searching process of SD so as to decrease the complexity. According to whether the magnitude of condition number is distinguished or not, there are two types, i.e. the partially combined-weight SD and the fully combined weight SD. The simulation results prove that the proposed algorithm can cut down the complexity distinctly, even to more than 20% at low SNR and high condition number.
{"title":"Combined-Weight Sphere Decoder in Bad Channel","authors":"H Zhao, H. Long, Wenbo Wang","doi":"10.1109/ISWPC.2006.1613666","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613666","url":null,"abstract":"For BLAST system, the optimal ML detection is infeasible when antenna number and modulation level is high, there have been some attempts to find more efficient algorithm to replace ML detection, such as sphere decoding (SD). Whereas the bad channel with large condition number still aggravates the computation complexity of SD. In this paper, we firstly explain the reason why the condition number influences the performance and the complexity of detection algorithm. Secondly, an algorithm of combining weight at high layer is proposed for SD, aiming to reduce the probability of accessing into the high layer of the tree in the searching process of SD so as to decrease the complexity. According to whether the magnitude of condition number is distinguished or not, there are two types, i.e. the partially combined-weight SD and the fully combined weight SD. The simulation results prove that the proposed algorithm can cut down the complexity distinctly, even to more than 20% at low SNR and high condition number.","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":"129378605","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.1613630
S. Miura, Yi-ju Zhan, T. Kuroda
A new parking search system using wireless sensor network is described, and simulated with a C++ based microscopic simulator. With the proposed system, information of the real time parking state, vacant or occupied can be obtained through the deployed network. For propagating useful information, a new network system "information exchanging system" is proposed which realizes ad hoc network in inter vehicle communication by using only single hops. For more useful information propagation, some more arrangements are proposed. As a result of the simulation, average searching time decreases 50% in crowded condition.
{"title":"Evaluation of parking search using sensor network","authors":"S. Miura, Yi-ju Zhan, T. Kuroda","doi":"10.1109/ISWPC.2006.1613630","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613630","url":null,"abstract":"A new parking search system using wireless sensor network is described, and simulated with a C++ based microscopic simulator. With the proposed system, information of the real time parking state, vacant or occupied can be obtained through the deployed network. For propagating useful information, a new network system \"information exchanging system\" is proposed which realizes ad hoc network in inter vehicle communication by using only single hops. For more useful information propagation, some more arrangements are proposed. As a result of the simulation, average searching time decreases 50% in crowded condition.","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":"130079184","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.1613608
Heungsoon Rim, Seonggun Kim, Youil Kim, Hwansoo Han
Mobile users frequently want mobile devices as powerful as desk top PCs, but still in a small and light form factor. The level of users' demand is yet too high to satisfy with current technology. Available resources such as CPU, memory, and battery power are still insufficient for current mobile devices. One way to overcome these limitations is to offload heavy methods to nearby powerful servers. In this paper, we propose a transparent code transformation to achieve method offloading within the domain of Java. Our Java bytecode transformer called Distributed Execution Transformer (DiET) takes the original bodies of heavy methods out and implants remote procedure calls to surrogate servers. Mobile devices download the modified Java bytecode and cooperatively execute the application with surrogate servers. Experimenting with SciMark 2.0, we could improve the performance by 43% and reduce the code size on mobile devices by 18% on average. Through our early implementation and experiments, we believe our transparent method off loading will relieve mobile devices of resource limitations.
{"title":"Transparent Method Offloading for Slim Execution","authors":"Heungsoon Rim, Seonggun Kim, Youil Kim, Hwansoo Han","doi":"10.1109/ISWPC.2006.1613608","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613608","url":null,"abstract":"Mobile users frequently want mobile devices as powerful as desk top PCs, but still in a small and light form factor. The level of users' demand is yet too high to satisfy with current technology. Available resources such as CPU, memory, and battery power are still insufficient for current mobile devices. One way to overcome these limitations is to offload heavy methods to nearby powerful servers. In this paper, we propose a transparent code transformation to achieve method offloading within the domain of Java. Our Java bytecode transformer called Distributed Execution Transformer (DiET) takes the original bodies of heavy methods out and implants remote procedure calls to surrogate servers. Mobile devices download the modified Java bytecode and cooperatively execute the application with surrogate servers. Experimenting with SciMark 2.0, we could improve the performance by 43% and reduce the code size on mobile devices by 18% on average. Through our early implementation and experiments, we believe our transparent method off loading will relieve mobile devices of resource limitations.","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":"132418742","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.1613658
Bin Guo, Hai-Hsing Lin, K. Yamashita
In this paper,a novel method for signal recovery in multiuser multiple-input multiple-output(MIMO) orthogonal frequency division multiplex(OFDM) systems with known partial channel state information(CSI) is proposed. The effect of the dispersive channel in a multiuser MIMO-OFDM system can be treated as a set of instantaneous mixtures from the viewpoint of frequency bin(FB). Upon the arrival of a new user,the new interferences are introduced which results an expanding mixture. If the CSI before the arrival of new user is known, it can be employed to recover the transmitted signals, rather than the bandwidth waste pilot symbols. In the proposed method, from the second order statistics of the received signals, the parameters of the mixture caused by the new user are extracted. Then the signals belong to different users are separated at each FB, where the new joined user's signals still retain a phase distortion. This distortion can be removed by the existing non-coherent detection method.
{"title":"Multiuser Detection for MIMO-OFDM Systems Based on Known Partial CSI","authors":"Bin Guo, Hai-Hsing Lin, K. Yamashita","doi":"10.1109/ISWPC.2006.1613658","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613658","url":null,"abstract":"In this paper,a novel method for signal recovery in multiuser multiple-input multiple-output(MIMO) orthogonal frequency division multiplex(OFDM) systems with known partial channel state information(CSI) is proposed. The effect of the dispersive channel in a multiuser MIMO-OFDM system can be treated as a set of instantaneous mixtures from the viewpoint of frequency bin(FB). Upon the arrival of a new user,the new interferences are introduced which results an expanding mixture. If the CSI before the arrival of new user is known, it can be employed to recover the transmitted signals, rather than the bandwidth waste pilot symbols. In the proposed method, from the second order statistics of the received signals, the parameters of the mixture caused by the new user are extracted. Then the signals belong to different users are separated at each FB, where the new joined user's signals still retain a phase distortion. This distortion can be removed by the existing non-coherent detection method.","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":"129032859","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.1613640
Te-Neng Liu, Shyh-In Hwang
Many geographic routing protocols have been proposed to aid routing path discovery. They can help to reduce the cost of broadcasting, and increase the battery life time of the whole system. However, most such protocols made a strong assumption that the position of the destination node is easy to know or is readily available. In reality, the assumption does not hold by itself. A mechanism is required to derive the position information about the destination node. In this paper, we present an algorithm, called Hierarchical Location Service (HLS), which can efficiently provide position information about nodes in ad hoc networks. The position information can not only aid routing discovery, but also saves the resource of the whole system. HLS is a hierarchical architecture to maintain the location information of nodes. We also mention some update/query problem of location service would be happened in hierarchical manner, and we discuss how HLS can solve these problems when providing the location service.
{"title":"On Design of an Efficient Hierarchical Location Service for Ad Hoc Network","authors":"Te-Neng Liu, Shyh-In Hwang","doi":"10.1109/ISWPC.2006.1613640","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613640","url":null,"abstract":"Many geographic routing protocols have been proposed to aid routing path discovery. They can help to reduce the cost of broadcasting, and increase the battery life time of the whole system. However, most such protocols made a strong assumption that the position of the destination node is easy to know or is readily available. In reality, the assumption does not hold by itself. A mechanism is required to derive the position information about the destination node. In this paper, we present an algorithm, called Hierarchical Location Service (HLS), which can efficiently provide position information about nodes in ad hoc networks. The position information can not only aid routing discovery, but also saves the resource of the whole system. HLS is a hierarchical architecture to maintain the location information of nodes. We also mention some update/query problem of location service would be happened in hierarchical manner, and we discuss how HLS can solve these problems when providing the location service.","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":"125368688","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.1613644
J. Costa-Requena, T. Vadar, R. Kantola, N. Beijar
Ad hoc networking is a technology still under development and there are several proposals for defining the most suitable routing protocol. The dynamic conditions of ad hoc networks do not allow having a single routing protocol that fits all possible environments. This paper presents the design of a scalable ad hoc routing protocol. The analysis of existing routing protocols is presented, and a novel routing algorithm is proposed and analyzed. The implementation of the proposed algorithm is based on well-known routing protocols such as AODV and OLSR. Moreover, we propose to extend AODV with a new broadcast algorithm to replace OLSR and implement the proposed scalable ad hoc routing protocol using AODV.
{"title":"AODV-OLSR scalable ad hoc routing proposal","authors":"J. Costa-Requena, T. Vadar, R. Kantola, N. Beijar","doi":"10.1109/ISWPC.2006.1613644","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613644","url":null,"abstract":"Ad hoc networking is a technology still under development and there are several proposals for defining the most suitable routing protocol. The dynamic conditions of ad hoc networks do not allow having a single routing protocol that fits all possible environments. This paper presents the design of a scalable ad hoc routing protocol. The analysis of existing routing protocols is presented, and a novel routing algorithm is proposed and analyzed. The implementation of the proposed algorithm is based on well-known routing protocols such as AODV and OLSR. Moreover, we propose to extend AODV with a new broadcast algorithm to replace OLSR and implement the proposed scalable ad hoc routing protocol using AODV.","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":"121616126","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.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":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":"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：