Pub Date : 2006-04-10DOI: 10.1109/ISWPC.2006.1613573
R. Wu, T. Ristaniemi
In this paper, an efficient method is proposed for joint time delay and direction-of-arrival (DOA) estimation, called two-dimensional code acquisition here, in direct-sequence code division multiple access (DS-CDMA) systems. Meanwhile, we present a rigorous statistical analysis for this method. Through performance comparison with traditional MUSIC, we see the proposed method is robust in highly correlated and coherent multi-path propagation environment. It is effective against channel interferences, and its performance increases with the length of the space-time response vector.
{"title":"Performance comparison of EV-t and MUSIC for two-dimensional code acquisition","authors":"R. Wu, T. Ristaniemi","doi":"10.1109/ISWPC.2006.1613573","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613573","url":null,"abstract":"In this paper, an efficient method is proposed for joint time delay and direction-of-arrival (DOA) estimation, called two-dimensional code acquisition here, in direct-sequence code division multiple access (DS-CDMA) systems. Meanwhile, we present a rigorous statistical analysis for this method. Through performance comparison with traditional MUSIC, we see the proposed method is robust in highly correlated and coherent multi-path propagation environment. It is effective against channel interferences, and its performance increases with the length of the space-time response vector.","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":"125765147","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.1613656
K. Kwong, P. L. Hiew
This paper proposes a seamless handover scheme for RSVP over 3G networks. An Address Proxy Agent (APA) is proposed to be implemented in the radio network controllers (RNC) to provide a residual address for the mobile host (MH) with RSVP reservation during the handover process. The principle of this approach is to provide a residual address for MH that is valid in radio network sub-system (RNS) and traceable back to MH latest location. W hen MH send a packet upstream the APA will replace the packet source address with the residual address before releasing the packet to the rest of its RSVP path. And when RNC receives a return RSVP packet destined to this residual address the APA will replace this residual address back to the source address and forward this packet to the current location. This approach confines the impacts of a handover to the local RNS yet maintain PSVP path as MH moves from one cell to another.
{"title":"A Seamless Handover Scheme for RSVP over 3G Networks","authors":"K. Kwong, P. L. Hiew","doi":"10.1109/ISWPC.2006.1613656","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613656","url":null,"abstract":"This paper proposes a seamless handover scheme for RSVP over 3G networks. An Address Proxy Agent (APA) is proposed to be implemented in the radio network controllers (RNC) to provide a residual address for the mobile host (MH) with RSVP reservation during the handover process. The principle of this approach is to provide a residual address for MH that is valid in radio network sub-system (RNS) and traceable back to MH latest location. W hen MH send a packet upstream the APA will replace the packet source address with the residual address before releasing the packet to the rest of its RSVP path. And when RNC receives a return RSVP packet destined to this residual address the APA will replace this residual address back to the source address and forward this packet to the current location. This approach confines the impacts of a handover to the local RNS yet maintain PSVP path as MH moves from one cell to another.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"75 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":"121037268","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.1613590
A. Gopalan, T. Znati
Ad-hoc networks are an emerging technology with immense potential. Providing support for large-scale service and application deployment in these networks, however is crucial to make them a viable alternative. The lack of infrastructure, coupled with the time-varying characteristics of ad-hoc networks, brings about new challenges to the design and deployment of applications on a large-scale. This paper addresses these challenges and presents PeerNet, a unified, overlay-based service architecture to support large-scale service and application deployment in MANETs. We discuss the main functionalities of PeerNet, describe the algorithms for resource registration and discovery, and present PILOT, a novel power-aware, location-driven traffic forwarding algorithm to enable node interaction. We conclude the paper by comparing PILOT to LAR and AODV for a network of mobile nodes.
{"title":"PeerNet: a peer-to-peer framework for service and application deployment in MANETs","authors":"A. Gopalan, T. Znati","doi":"10.1109/ISWPC.2006.1613590","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613590","url":null,"abstract":"Ad-hoc networks are an emerging technology with immense potential. Providing support for large-scale service and application deployment in these networks, however is crucial to make them a viable alternative. The lack of infrastructure, coupled with the time-varying characteristics of ad-hoc networks, brings about new challenges to the design and deployment of applications on a large-scale. This paper addresses these challenges and presents PeerNet, a unified, overlay-based service architecture to support large-scale service and application deployment in MANETs. We discuss the main functionalities of PeerNet, describe the algorithms for resource registration and discovery, and present PILOT, a novel power-aware, location-driven traffic forwarding algorithm to enable node interaction. We conclude the paper by comparing PILOT to LAR and AODV for a network of mobile nodes.","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":"121654620","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.1613639
H. Kim, K. Ahn, H. Baik
In this paper, we investigate the OFDM-based wireless local area networks (WLANs) operating in the 60 GHz frequency band. The performance of OFDM system is severely degraded by the local oscillator phase noise, which causes both common phase error (CPE) and inter-carrier interference (ICI). We analyze the impact of phase noise on OFDM systems. Moreover, in order to reduce the phase noise problem, we consider the phase noise suppression (PNS) algorithm. Some numerical results are presented to illustrate the effectiveness of the PNS algorithm for OFDM-based 60 GHz WLANs.
{"title":"Phase noise suppression algorithm for OFDM-based 60 GHz WLANs","authors":"H. Kim, K. Ahn, H. Baik","doi":"10.1109/ISWPC.2006.1613639","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613639","url":null,"abstract":"In this paper, we investigate the OFDM-based wireless local area networks (WLANs) operating in the 60 GHz frequency band. The performance of OFDM system is severely degraded by the local oscillator phase noise, which causes both common phase error (CPE) and inter-carrier interference (ICI). We analyze the impact of phase noise on OFDM systems. Moreover, in order to reduce the phase noise problem, we consider the phase noise suppression (PNS) algorithm. Some numerical results are presented to illustrate the effectiveness of the PNS algorithm for OFDM-based 60 GHz WLANs.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"2 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":"131222721","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.1613646
Dong-Wook Seo, Jongsoo Seo
We present a chip-level equalization technique for a DS-CDMA forward link receiver. The proposed equalization algorithm estimates the dominant taps of equalizer, and then partitions the equalizer tap into a Kalman partition and LMS partition according to the dominant power criteria. The tap positions assigned as the Kalman partition are updated using the reduced-complexity Kalman filtering adaptive algorithm, and the tap positions assigned as the LMS partition are updated using the LMS adaptive algorithm. The proposed tap-partitioned, chip-level equalizer exhibits fast convergence speed and is less complex than the conventional Kalman filtering-based equalization algorithm. In addition, while the performance of the conventional reduced-rank chip-equalizer degraded significantly when the tap selection was not optimal, that of the proposed algorithm is robust even when the tap partitioning is not ideal.
{"title":"Tap-partitioned Kalman and LMS chip-level equalization for a DS-CDMA receiver","authors":"Dong-Wook Seo, Jongsoo Seo","doi":"10.1109/ISWPC.2006.1613646","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613646","url":null,"abstract":"We present a chip-level equalization technique for a DS-CDMA forward link receiver. The proposed equalization algorithm estimates the dominant taps of equalizer, and then partitions the equalizer tap into a Kalman partition and LMS partition according to the dominant power criteria. The tap positions assigned as the Kalman partition are updated using the reduced-complexity Kalman filtering adaptive algorithm, and the tap positions assigned as the LMS partition are updated using the LMS adaptive algorithm. The proposed tap-partitioned, chip-level equalizer exhibits fast convergence speed and is less complex than the conventional Kalman filtering-based equalization algorithm. In addition, while the performance of the conventional reduced-rank chip-equalizer degraded significantly when the tap selection was not optimal, that of the proposed algorithm is robust even when the tap partitioning is not ideal.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"1 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":"132685621","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.1613600
D. Lee, K. Kyamakya, Jean Paul Umondi
IEEE 802.16e wireless metropolitan area networks refers to the new standard for broadband wireless access (BWA), which targets to support wireless Internet service up to 2 Mbps. Existing draft version of standard proposes OFDM(A)-based handover process system, which consists of network topology acquisition, scanning, initial ranging, authorization, and registration. Since various researcher groups and companies have done each part of standardization work, there exist some unclear parts and redundant processes, especially in HO process. For instance, HO initiation timing is not clearly defined and unnecessary neighboring base station (BS) scanning and association are performed before and during HO process. These redundant processes causes a long HO operation time, which makes severe degradation in system performance. In this paper, fast HO algorithm is proposed to reduce HO operation delay. Target BS estimation algorithm using mean CINR and arrival time difference reduces unnecessary neighboring BS scanning. And some redundant work during network topology acquisition and scanning process is abbreviated as well. The performance analysis validates the efficiency of the proposed algorithm.
{"title":"Fast handover algorithm for IEEE 802.16e broadband wireless access system","authors":"D. Lee, K. Kyamakya, Jean Paul Umondi","doi":"10.1109/ISWPC.2006.1613600","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613600","url":null,"abstract":"IEEE 802.16e wireless metropolitan area networks refers to the new standard for broadband wireless access (BWA), which targets to support wireless Internet service up to 2 Mbps. Existing draft version of standard proposes OFDM(A)-based handover process system, which consists of network topology acquisition, scanning, initial ranging, authorization, and registration. Since various researcher groups and companies have done each part of standardization work, there exist some unclear parts and redundant processes, especially in HO process. For instance, HO initiation timing is not clearly defined and unnecessary neighboring base station (BS) scanning and association are performed before and during HO process. These redundant processes causes a long HO operation time, which makes severe degradation in system performance. In this paper, fast HO algorithm is proposed to reduce HO operation delay. Target BS estimation algorithm using mean CINR and arrival time difference reduces unnecessary neighboring BS scanning. And some redundant work during network topology acquisition and scanning process is abbreviated as well. The performance analysis validates the efficiency of the proposed algorithm.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"1 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":"129887197","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.1613623
Chih Chang, J. Lin, F. Lai
In recent years, mobile ad hoc networks have received more attention, because of their easy deployment. However, the characteristics of mobile ad hoc networks are more prone to physical security threats than the wired network environments. Therefore, it has become a primary concern of securing mobile ad hoc networks. In this paper, we address the problem of authentication in mobile ad hoc networks. Public-key based mechanisms are ideal to provide the authentication services. Although this is already mature in a fixed network, providing public key based authentication is still very challenging in mobile ad-hoc networks because of shared wireless medium, energy constrains, dynamic network topology. Here, we present a more efficient public key management system, like self-organized scheme (S. Capkun et al., 2003), and include the concept of trust group for mobile ad hoc networks.
近年来，移动自组织网络因其易于部署而受到越来越多的关注。然而，移动自组织网络的特点比有线网络环境更容易受到物理安全威胁。因此，它已成为确保移动自组织网络安全的首要问题。本文主要研究移动自组织网络中的身份验证问题。基于公钥的机制是提供身份验证服务的理想选择。尽管这在固定网络中已经很成熟，但由于无线介质共享、能量限制、网络拓扑动态等原因，在移动自组织网络中提供基于公钥的身份验证仍然是非常具有挑战性的。在这里，我们提出了一个更有效的公钥管理系统，如自组织方案(S. Capkun et al.， 2003)，并包括移动自组织网络信任组的概念。
{"title":"Trust-group-based authentication services for mobile ad hoc networks","authors":"Chih Chang, J. Lin, F. Lai","doi":"10.1109/ISWPC.2006.1613623","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613623","url":null,"abstract":"In recent years, mobile ad hoc networks have received more attention, because of their easy deployment. However, the characteristics of mobile ad hoc networks are more prone to physical security threats than the wired network environments. Therefore, it has become a primary concern of securing mobile ad hoc networks. In this paper, we address the problem of authentication in mobile ad hoc networks. Public-key based mechanisms are ideal to provide the authentication services. Although this is already mature in a fixed network, providing public key based authentication is still very challenging in mobile ad-hoc networks because of shared wireless medium, energy constrains, dynamic network topology. Here, we present a more efficient public key management system, like self-organized scheme (S. Capkun et al., 2003), and include the concept of trust group for mobile ad hoc networks.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"1 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":"130948639","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.1613645
N. Taing, S. Thipchaksurat, R. Varakulsiripunth, H. Ishii
All mobile nodes participating in a group communicate with one another in the group through a shared radio link without cable or backbone composes an infrastructureless network, called mobile ad hoc network (MANET). Because network topology may be changed at any time as result of mobility of nodes and the failure of available routes, quality-of-service (QoS) of real-time multimedia application may have difficulty in satisfying their services. In this paper, we propose a routing scheme for multimedia services called modified dynamic source routing (MDSR) protocol. The MDSR selects the shortest path by using power level. Our proposed scheme provides lower average delay and mean number of hop path from source to destination than DSR protocol can provide.
{"title":"Performance improvement of dynamic source routing protocol for multimedia services in mobile ad hoc network","authors":"N. Taing, S. Thipchaksurat, R. Varakulsiripunth, H. Ishii","doi":"10.1109/ISWPC.2006.1613645","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613645","url":null,"abstract":"All mobile nodes participating in a group communicate with one another in the group through a shared radio link without cable or backbone composes an infrastructureless network, called mobile ad hoc network (MANET). Because network topology may be changed at any time as result of mobility of nodes and the failure of available routes, quality-of-service (QoS) of real-time multimedia application may have difficulty in satisfying their services. In this paper, we propose a routing scheme for multimedia services called modified dynamic source routing (MDSR) protocol. The MDSR selects the shortest path by using power level. Our proposed scheme provides lower average delay and mean number of hop path from source to destination than DSR protocol can provide.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"57 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":"123052352","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.1613661
Doo-Ho Choi, Tae Sung Kim, H. Kim
Widespread deployment of radio frequency identification (RFID) tags may create new threats to user privacy due to the automated tracking capability. Recently, RFID technology shows a convergence tendency. RFID reader is contained in a mobile phone. User privacy problem is a prior consideration for mobile RFID service deployment, since most mobile RFID service scenario is based on end-user service. In this paper, we propose a new solution for user privacy protection, which is a modification of EPC Class-1 Generation-2 protocol. Furthermore, we introduce a privacy protection scenario for mobile RFID service using this proposed scheme.
{"title":"Privacy protection for secure mobile RFID service","authors":"Doo-Ho Choi, Tae Sung Kim, H. Kim","doi":"10.1109/ISWPC.2006.1613661","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613661","url":null,"abstract":"Widespread deployment of radio frequency identification (RFID) tags may create new threats to user privacy due to the automated tracking capability. Recently, RFID technology shows a convergence tendency. RFID reader is contained in a mobile phone. User privacy problem is a prior consideration for mobile RFID service deployment, since most mobile RFID service scenario is based on end-user service. In this paper, we propose a new solution for user privacy protection, which is a modification of EPC Class-1 Generation-2 protocol. Furthermore, we introduce a privacy protection scenario for mobile RFID service using this proposed scheme.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"54 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":"128612891","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.1613599
J. Cano, J. Cano, P. Manzoni, Dongkyun Kim
As an example of implementing the pervasive computing, we developed an application framework to deploy an easy, spontaneous, and infrastructureless network. We selected the Bluetooth technology with the peer-to-peer (P2P) concept to develop an experimental application which enables peers to exchange their resources. Overall network architecture and the prototype application are presented. We selected a small test-bed and simulation to evaluate the overall performance and system behaviour. We measured and present our findings in term of the duration of inquiry procedure and the throughput, according to various experimental parameters such as physical distance between nodes and their speeds.
{"title":"On the design of pervasive computing applications based on Bluetooth and a P2P concept","authors":"J. Cano, J. Cano, P. Manzoni, Dongkyun Kim","doi":"10.1109/ISWPC.2006.1613599","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613599","url":null,"abstract":"As an example of implementing the pervasive computing, we developed an application framework to deploy an easy, spontaneous, and infrastructureless network. We selected the Bluetooth technology with the peer-to-peer (P2P) concept to develop an experimental application which enables peers to exchange their resources. Overall network architecture and the prototype application are presented. We selected a small test-bed and simulation to evaluate the overall performance and system behaviour. We measured and present our findings in term of the duration of inquiry procedure and the throughput, according to various experimental parameters such as physical distance between nodes and their speeds.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"221 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":"121307426","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
扫码关注我们
求助内容：
应助结果提醒方式：