发布求助
文献互助 智能选刊 最新文献

2006 Asia-Pacific Conference on Communications最新文献

筛选
英文 中文
Start Wavelength Assignment Policy - A Wavelength Contention Resolution for Optical Burst Switching Networks 开始波长分配策略——用于光突发交换网络的波长争用解决方案
2006 Asia-Pacific Conference on Communications Pub Date : 2006-12-11 DOI: 10.1109/APCC.2006.255820
L. Shan, Linzhen Xie, Zhengbin Li, A. Xu
{"title":"Start Wavelength Assignment Policy - A Wavelength Contention Resolution for Optical Burst Switching Networks","authors":"L. Shan, Linzhen Xie, Zhengbin Li, A. Xu","doi":"10.1109/APCC.2006.255820","DOIUrl":"https://doi.org/10.1109/APCC.2006.255820","url":null,"abstract":"Most studies of optical burst switching (OBS) networks are under a fundamental assumption that full wavelength conversion is available throughout the network. In practice, however, economic and technical considerations are likely to dictate a more limited and sparse deployment of wavelength converters in the optical network. Therefore, we present a new start wavelength assignment policy for the absence of (full) wavelength conversion capabilities in the OBS networks. The performance study indicates that, our new scheme is robust under wavelength continuity constraint as well as Poisson and self-similar traffic","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131888041","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}
引用次数: 0
Low-Complexity Joint Channel Estimation and LDPC Decoding for Block Fading Channel 块衰落信道的低复杂度联合信道估计与LDPC译码
2006 Asia-Pacific Conference on Communications Pub Date : 2006-12-11 DOI: 10.1109/APCC.2006.255801
Zhichu Lin, Zhixing Yang, Changyong Pan
{"title":"Low-Complexity Joint Channel Estimation and LDPC Decoding for Block Fading Channel","authors":"Zhichu Lin, Zhixing Yang, Changyong Pan","doi":"10.1109/APCC.2006.255801","DOIUrl":"https://doi.org/10.1109/APCC.2006.255801","url":null,"abstract":"This paper presents a low-complexity iterative joint channel estimation and LDPC decoding algorithm for block-fading channel. Normalized min-sum algorithm, which has a much lower complexity than sum-product algorithm, is used as LDPC decoding algorithm. By choosing an optimal normalization factor, the performance of our algorithm can be as good as its counterpart using sum-product algorithm, and only 0.3-0.5 dB away from the case where perfect CSI is known","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"232 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133781525","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}
引用次数: 4
A Cost-Optimized Redundancy Scheme of Group Peer in P2P Grid 一种P2P网格中成本优化的组对等体冗余方案
2006 Asia-Pacific Conference on Communications Pub Date : 2006-12-11 DOI: 10.1109/APCC.2006.255841
Yong-Hyuk Moon, Chan-Hyun Youn, Youngjoo Han, J. Nah, J. Yoo, Bong-Hwan Lee
{"title":"A Cost-Optimized Redundancy Scheme of Group Peer in P2P Grid","authors":"Yong-Hyuk Moon, Chan-Hyun Youn, Youngjoo Han, J. Nah, J. Yoo, Bong-Hwan Lee","doi":"10.1109/APCC.2006.255841","DOIUrl":"https://doi.org/10.1109/APCC.2006.255841","url":null,"abstract":"Several aspects of today's grids are still based on centralized or hierarchical services. However, as grid sizes increase from tens to thousands of hosts, fault tolerance is becoming a key issue. In this paper, we propose a cost-optimized reliability using redundancy scheme in redundant group peers based P2P grid. Proposed finding optimum redundancy minimizes system cost and guarantees reliability which satisfies requirements of application under the dynamic behaviors in P2P grid environments","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115635124","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}
引用次数: 1
A Taxonomy of Electronic Funds Transfer Domain Intrusions and its Feasibility Converting into Ontology 电子资金转移领域入侵分类及其转化为本体的可行性
2006 Asia-Pacific Conference on Communications Pub Date : 2006-12-11 DOI: 10.1109/APCC.2006.255948
Pengcheng Liang, J. Bigham
{"title":"A Taxonomy of Electronic Funds Transfer Domain Intrusions and its Feasibility Converting into Ontology","authors":"Pengcheng Liang, J. Bigham","doi":"10.1109/APCC.2006.255948","DOIUrl":"https://doi.org/10.1109/APCC.2006.255948","url":null,"abstract":"Intrusion detection systems (IDSs) in network security area has been researched for a long time. But till now, very few works concentrate on specific domains (e.g. bank systems, health services, audit industry) from a higher perspective-application level. In this paper, we give the result of our effort in this field i.e. a taxonomy of hazards in electronic funds transfer (EFT) domain is presented. In this taxonomy, characteristics and classifications of EFT threats are described, which can be benefited by domain IDS directly or can be updated into some form of ontology (e.g. OWL). For generality purpose, in building the taxonomy, we considered to use an EFT specification-Bank Internet Payment System (BIPS). After the taxonomy, we give our analysis of converting the taxonomy into ontology","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114149012","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}
引用次数: 3
The Flexible Bound Admission Control Algorithm for Vertical Handover in Heterogeneous Wireless Networks 异构无线网络中垂直切换的柔性绑定接纳控制算法
2006 Asia-Pacific Conference on Communications Pub Date : 2006-12-11 DOI: 10.1109/APCC.2006.255936
Jong Min Lee, O. Yang, S. Choi, J. Choi
{"title":"The Flexible Bound Admission Control Algorithm for Vertical Handover in Heterogeneous Wireless Networks","authors":"Jong Min Lee, O. Yang, S. Choi, J. Choi","doi":"10.1109/APCC.2006.255936","DOIUrl":"https://doi.org/10.1109/APCC.2006.255936","url":null,"abstract":"In this paper, we present FBAC (flexible bound admission control) algorithm using softness profile to reduce handover blocking probability over WLAN and WAAN (Wide area access network). FBAC algorithm utilizes dynamic resource allocation scheme to decrease the blocking probability of vertical handover connections within the limited capacity of system. Based on FBAC algorithm, we derive the handover blocking probability as new traffic load and handover traffic load increase. In order to evaluate the performance, we compare FBAC algorithm against traditional non-bounded and fixed bound schemes. Numerical results show that the FBAC scheme improves handover blocking probability in heterogeneous wireless networks","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"189 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117323392","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}
引用次数: 0
An Efficient and Low Complex Hyperbolic Location Scheme for Cellular Mobile Communications 蜂窝移动通信中一种高效、低复杂度的双曲线定位方案
2006 Asia-Pacific Conference on Communications Pub Date : 2006-12-11 DOI: 10.1109/APCC.2006.255933
Bo-Chieh Liu, Ken-Huang Lin
{"title":"An Efficient and Low Complex Hyperbolic Location Scheme for Cellular Mobile Communications","authors":"Bo-Chieh Liu, Ken-Huang Lin","doi":"10.1109/APCC.2006.255933","DOIUrl":"https://doi.org/10.1109/APCC.2006.255933","url":null,"abstract":"In consequence of applications for the location of mobile subscriber (MS) of wireless services continue to expand, a simple and inexpensive method is needed by cellular mobile communications for locating MS. Many location technologies today use different signal measurements which have their limitation in accuracy and complexity. This paper proposes an effective estimation method for determining the MS location in a low implementation complexity and promising accuracy. The method is based on measuring a propagation delay, and then, the pseudo-distance-differences are available from the geometrical transformations between multiple base transceiver stations (BTSs). Accordingly, the MS location can be estimated from the hyperbolic location algorithm. Performing the field trial in a commercial cellular mobile network, accuracy of the proposed method shows promising results for the deployment of location-based services","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115781477","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}
引用次数: 0
A New Boundary Descriptor Based on the Directional Distance Histogram 一种基于方向距离直方图的边界描述符
2006 Asia-Pacific Conference on Communications Pub Date : 2006-12-11 DOI: 10.1109/APCC.2006.255913
Xiaodong Kong, Q. Luo, Ying-Chun Guo, Guihua Zeng
{"title":"A New Boundary Descriptor Based on the Directional Distance Histogram","authors":"Xiaodong Kong, Q. Luo, Ying-Chun Guo, Guihua Zeng","doi":"10.1109/APCC.2006.255913","DOIUrl":"https://doi.org/10.1109/APCC.2006.255913","url":null,"abstract":"A new boundary descriptor for shape-based image retrieval is presented, which is extracted from the directional distance histogram of a boundary. With the descriptor, the boundary of shapes can be clearly described and the similarity between shapes can be easily computed. Experiments prove that the shape-based image retrieval method using this descriptor is efficient and very close to human's sense","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124959019","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}
引用次数: 1
Beamforming Based MIMO-OFDMA System for Performance Improvement in Harsh Downlink Channels 基于波束形成的MIMO-OFDMA系统在恶劣下行信道中的性能改进
2006 Asia-Pacific Conference on Communications Pub Date : 2006-12-11 DOI: 10.1109/APCC.2006.255781
Daejin Park, Suckchel Yang, Y. Shin
{"title":"Beamforming Based MIMO-OFDMA System for Performance Improvement in Harsh Downlink Channels","authors":"Daejin Park, Suckchel Yang, Y. Shin","doi":"10.1109/APCC.2006.255781","DOIUrl":"https://doi.org/10.1109/APCC.2006.255781","url":null,"abstract":"We propose a MIMO-OFDMA (multi input multi output-orthogonal frequency division multiple access) system based on beamforming for harsh downlink channels with low CIR (carrier-to-interference ratio). In the proposed system, we consider an effective CSI (channel state information) calculation based on spatial resource grouping, which is adequate for a combination of MRT (maximum ratio transmission) beamforming in the BS (base station) and MRC (maximum ratio combining) in the MS (mobile station). In addition, to reduce feedback information for the beamforming, we apply the Grassmannian beamforming scheme. Furthermore, for fair and efficient resource allocation in multi-user environment, we propose a simple resource allocation algorithm composed of three steps. Simulation results reveal that the proposed MIMO-OFDMA system achieves significant improvement of spectral efficiency in low CIR region as compared to a typical open-loop MIMO-OFDMA system using pseudo-orthogonal space time block code","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122966787","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}
引用次数: 1
Centralized and Decentralized Channel Estimation for Multiuser MIMO-OFDM Systems 多用户MIMO-OFDM系统的集中和分散信道估计
2006 Asia-Pacific Conference on Communications Pub Date : 2006-12-11 DOI: 10.1109/APCC.2006.255790
Qinghai Yang, Huamin Zhu, Shaoyi Xu, K. Kwak
{"title":"Centralized and Decentralized Channel Estimation for Multiuser MIMO-OFDM Systems","authors":"Qinghai Yang, Huamin Zhu, Shaoyi Xu, K. Kwak","doi":"10.1109/APCC.2006.255790","DOIUrl":"https://doi.org/10.1109/APCC.2006.255790","url":null,"abstract":"This paper addresses pilot-aided multiuser least square (LS) channel estimation for the uplink of MIMO-OFDM systems. The systems under consideration allow all users use all available subcarriers independently and thus involve multiuser interference in the frequency domain. We develop the decentralized and centralized channel estimation algorithms according to different multiuser scenarios. Optimal multiuser pilots are proposed specially for centralized estimation methods with respect to the mean square error (MSE) of LS channel estimate","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"707 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122987833","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}
引用次数: 1
Stable On-demand Overlay Multicast in Mobile Ad Hoc Networks 移动Ad Hoc网络中稳定的按需覆盖组播
2006 Asia-Pacific Conference on Communications Pub Date : 2006-12-11 DOI: 10.1109/APCC.2006.255960
Fucai Yu, Younghwan Choi, Bongsu Kim, Kwansoo Jung, Hochoong Cho, Sang-Ha Kim
{"title":"Stable On-demand Overlay Multicast in Mobile Ad Hoc Networks","authors":"Fucai Yu, Younghwan Choi, Bongsu Kim, Kwansoo Jung, Hochoong Cho, Sang-Ha Kim","doi":"10.1109/APCC.2006.255960","DOIUrl":"https://doi.org/10.1109/APCC.2006.255960","url":null,"abstract":"Reactive overlay multicast approaches e.g. ODOMP, for mobile ad hoc networks (MANETs) have the advantages of low topology maintenance overhead and high stability. In this paper, we propose a reactive overlay multicasting approach based on delayed forwarding mechanism. This approach consists two parts: overlay multicasting and one-hop clustering. A reactive source rooted overlay multicast tree which only composes of source and one-hop cluster leaders will be created in case of source has to send data packets. While the one-hop clustering is a proactive mechanism and is performed throughout the multicast session. These seem to be incompatible. However, we propose a mechanism to syncretize them together and make the protocol achieves high performance. To enhance stability, the overlay tree creation follows the stability of each cluster leader. Data packets are transmitted via IP-in-IP tunnels in the overlay tree. An one-hop cluster leader takes charge of broadcasting data packets to its cluster members by utilizing capability of the wireless medium as well as delivering date packets to downstream cluster leaders","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129955417","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}
引用次数: 1
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信