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":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":"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.1613560
M. Watfa, S. Commuri
Wireless sensor networks (WSNs) made up of many small sensing devices equipped with memory, processors, and short-range wireless communication provides an unprecedented amount of detailed measurements over wide geographic areas. Communication between nodes requires the expenditure of energy, a scarce commodity in most WSNs. Thus, making effective use of data require scalable, self organizing, and energy-efficient data dissemination algorithms. In this paper, contrary to existing techniques, the coverage problem in a three dimensional space is analyzed. The "coverage hole" problem is also analyzed and a substitute plan is proposed where sensor nodes that are almost out of energy or already dead, are substituted by nodes that covers their sensing region and have more energy supply.
{"title":"A coverage algorithm in 3D wireless sensor networks","authors":"M. Watfa, S. Commuri","doi":"10.1109/ISWPC.2006.1613560","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613560","url":null,"abstract":"Wireless sensor networks (WSNs) made up of many small sensing devices equipped with memory, processors, and short-range wireless communication provides an unprecedented amount of detailed measurements over wide geographic areas. Communication between nodes requires the expenditure of energy, a scarce commodity in most WSNs. Thus, making effective use of data require scalable, self organizing, and energy-efficient data dissemination algorithms. In this paper, contrary to existing techniques, the coverage problem in a three dimensional space is analyzed. The \"coverage hole\" problem is also analyzed and a substitute plan is proposed where sensor nodes that are almost out of energy or already dead, are substituted by nodes that covers their sensing region and have more energy supply.","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":"128564079","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.1613566
Yih-Fuh Wang, Mao-Jie Huang
A novel Orthogonal Expanded Walsh Code (OEWC) suited in DS-CDMA spreading is presented in this paper. Although some processing gain increased, the OEWC can increase channel anti-interference and transmission security since of its elongated horizontal length. Moreover, it can be applied with MPSK to modulate one of M signal units expressed with a chip of OEWC. This plus the higher security and anti-interference abilities make OEWC of interest to designers of next-generation CDMA systems.
{"title":"New Orthogonal Code with MPSK for Next-Generation CDMA Systems","authors":"Yih-Fuh Wang, Mao-Jie Huang","doi":"10.1109/ISWPC.2006.1613566","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613566","url":null,"abstract":"A novel Orthogonal Expanded Walsh Code (OEWC) suited in DS-CDMA spreading is presented in this paper. Although some processing gain increased, the OEWC can increase channel anti-interference and transmission security since of its elongated horizontal length. Moreover, it can be applied with MPSK to modulate one of M signal units expressed with a chip of OEWC. This plus the higher security and anti-interference abilities make OEWC of interest to designers of next-generation CDMA systems.","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":"123957867","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":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":"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.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":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":"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.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":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":"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.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":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":"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.1613605
M. Do, W. Chin, Y. Wu
In this paper we study a hybrid space time block coded system with four transmit antennas. The system consists of one Alamouti space time block coded stream, and two spatial multiplexing streams which are transmitted using two antennas each. The paper also describes and analyze the merits and performance of several detection schemes for a hybrid space time block coded system. These systems are interesting as they allow for both diversity and multiplexing gains in a MIMO system. Most multiantenna systems exploit either diversity or spatial multiplexing gains, but not both. Simulation results comparing the performance of different detection schemes and their performance relative to other transmission schemes such as Alamouti space time block codes and conventional spatial multiplexing are shown.
{"title":"Performance study of a hybrid space time block coded system","authors":"M. Do, W. Chin, Y. Wu","doi":"10.1109/ISWPC.2006.1613605","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613605","url":null,"abstract":"In this paper we study a hybrid space time block coded system with four transmit antennas. The system consists of one Alamouti space time block coded stream, and two spatial multiplexing streams which are transmitted using two antennas each. The paper also describes and analyze the merits and performance of several detection schemes for a hybrid space time block coded system. These systems are interesting as they allow for both diversity and multiplexing gains in a MIMO system. Most multiantenna systems exploit either diversity or spatial multiplexing gains, but not both. Simulation results comparing the performance of different detection schemes and their performance relative to other transmission schemes such as Alamouti space time block codes and conventional spatial multiplexing are shown.","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":"122825319","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":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":"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}
Pub Date : 2006-04-10DOI: 10.1109/ISWPC.2006.1613659
A. Gyasi-Agyei, Seong-Lyun Kim
We consider scheduling schemes which exploit the random variability in wireless channels to maximize wireless throughput. We survey ten of such opportunistic scheduling policies, namely, PFS, OCASD, TAOS-1, I-OCASD, CASTI, EXP, M-LWDF, FIFO, RR and MaxC/I and compare them in terms of system throughput, fairness (user isolation) and the distributions of user starvation periods (packet delays) in a time-slotted wireless network like CDMA/HDR using adaptive modulation and coding (AMC). The results aids in determining the suitability of any of the ten policies in a wireless network depending on which metric is considered critical.
{"title":"Comparison of opportunistic scheduling policies in time-slotted AMC wireless networks","authors":"A. Gyasi-Agyei, Seong-Lyun Kim","doi":"10.1109/ISWPC.2006.1613659","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613659","url":null,"abstract":"We consider scheduling schemes which exploit the random variability in wireless channels to maximize wireless throughput. We survey ten of such opportunistic scheduling policies, namely, PFS, OCASD, TAOS-1, I-OCASD, CASTI, EXP, M-LWDF, FIFO, RR and MaxC/I and compare them in terms of system throughput, fairness (user isolation) and the distributions of user starvation periods (packet delays) in a time-slotted wireless network like CDMA/HDR using adaptive modulation and coding (AMC). The results aids in determining the suitability of any of the ten policies in a wireless network depending on which metric is considered critical.","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":"115449547","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
扫码关注我们
求助内容：
应助结果提醒方式：