2006 First International Conference on Communications and Electronics最新文献

Performance of Periodic Spectrum Transmission for Single-Carrier with Frequency-Domain Equalization using Channel Coding 基于信道编码的频域均衡单载波周期频谱传输性能研究

2006 First International Conference on Communications and Electronics Pub Date : 2006-12-01 DOI: 10.1109/CCE.2006.350852

T. Kuriyama, H. Yoshida, A. Taira, F. Maehara, F. Takahata

引用次数: 0

Link Scheduling, Power Control, and Routing in Ad Hoc Wireless Networks: A Joint Optimization 自组织无线网络中的链路调度、功率控制和路由:一种联合优化

2006 First International Conference on Communications and Electronics Pub Date : 2006-10-01 DOI: 10.1109/CCE.2006.350846

R. Casaquite, W. Hwang

{"title":"Link Scheduling, Power Control, and Routing in Ad Hoc Wireless Networks: A Joint Optimization","authors":"R. Casaquite, W. Hwang","doi":"10.1109/CCE.2006.350846","DOIUrl":"https://doi.org/10.1109/CCE.2006.350846","url":null,"abstract":"Ad hoc network is an extensive research area in wireless communications nowadays, and is particularly studied under energy constraints, since energy consumption of the network should be minimized. The physical layer (power control), link layer (scheduling), and network layer (routing) are known to have great impact on network performance as well as on power consumption. In this paper, we present an optimization problem that there may exist a power vector that minimizes the overall transmission power of the network which at the same time supports a particular data rate on each link and satisfies the SINR and maximum transmission power constraints at each node. We also formulate an optimization problem where we use both the energy consumed of each node in the routing path and the delay associated on each link as link costs. We provide numerical examples for our schemes and relationships between the parameters. An overview of our intended routing algorithm for ad hoc networks is also given as a preliminary step towards our distributed joint scheduling, power control and routing algorithm for ad hoc networks using cross layer approach.","PeriodicalId":148533,"journal":{"name":"2006 First International Conference on Communications and Electronics","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117278130","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

Novel 2-D Wavelength Hopping/Time Spreading OCDM System using Heterodyne Detection Receiver and PPM Signaling 利用外差探测接收机和PPM信号的新型二维跳波/扩频OCDM系统

2006 First International Conference on Communications and Electronics Pub Date : 2006-10-01 DOI: 10.1109/CCE.2006.350821

A. Pham, H. Yashima

引用次数: 0

A Flow Control Algorithm Achieving Application Level Fairness 实现应用层公平性的流量控制算法

2006 First International Conference on Communications and Electronics Pub Date : 2006-10-01 DOI: 10.1109/CCE.2006.350831

B. Moon, Jeonghoon Mo, J. Ryoo, S. Chong, Hoyoung Song

引用次数: 1

Hierarchically distributed PCE for backup strategies on an optical network 分层分布的PCE用于光网络备份策略

2006 First International Conference on Communications and Electronics Pub Date : 2006-10-01 DOI: 10.1109/CCE.2006.350841

H. Matsuura, N. Morita, T. Murakami, K. Takami

{"title":"Hierarchically distributed PCE for backup strategies on an optical network","authors":"H. Matsuura, N. Morita, T. Murakami, K. Takami","doi":"10.1109/CCE.2006.350841","DOIUrl":"https://doi.org/10.1109/CCE.2006.350841","url":null,"abstract":"The application of path computation elements (PCEs) has been widely discussed to reduce route calculation burden from GMPLS nodes. Current PCE proposals, however, have not yet covered path backup schemes, which is prerequisite for providing tremendous capacity such as core optical networks. We already presented a hierarchically distributed path computation element (HDPCE) architecture to improve existing PCE techniques. In this paper, we describe detailed path backup methods performed by HDPCEs to demonstrate the promising potential of HDPCE architecture. The key idea is the interdomain HDPCE, which manages the bridging optical domains, stores shared risk link group (SRLG) information, and discovers accurate disjointed SRLG backups. The proposed technique is sufficiently flexible to allow three variants of path backup methods that are commonly required in commercial networks. We analyze the features and performance of three types of path-backup methods. We also show the superiority of the proposed HDPCE-based backup methods compared to legacy OSPF-based backup methods in terms of path accommodation and processing time.","PeriodicalId":148533,"journal":{"name":"2006 First International Conference on Communications and Electronics","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129768711","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

A study on the architecture and voice dialog scheme for a personal Web service in a ubiquitous communication environment 泛在通信环境下个人Web服务的体系结构和语音对话方案研究

2006 First International Conference on Communications and Electronics Pub Date : 2006-10-01 DOI: 10.1109/CCE.2006.350883

K. Takami, T. Yamaguchi, K. Unno

引用次数: 3

The Architecture of Mobile Multimedia Metropolitan Area Network towards the Future of the 4G Mobile System 面向未来4G移动系统的移动多媒体城域网架构

2006 First International Conference on Communications and Electronics Pub Date : 2006-10-01 DOI: 10.1109/CCE.2006.350859

P. T. Hoa, M. Eusuf, T. Yamada

{"title":"The Architecture of Mobile Multimedia Metropolitan Area Network towards the Future of the 4G Mobile System","authors":"P. T. Hoa, M. Eusuf, T. Yamada","doi":"10.1109/CCE.2006.350859","DOIUrl":"https://doi.org/10.1109/CCE.2006.350859","url":null,"abstract":"One of objectives of the future 4G mobile network is to provide broadband connection to mobile users regardless of their speed. Microcellular-based mobile networks must be an essential one in the 4G mobile generation from the view of rich radio resource for multimedia communications. This paper presents the architecture of MM-MAN (mobile multimedia metropolitan area network) network of which target is to become one of mobile network candidates for the 4G systems. In this mobile network, high-bit rate packet transfer is stably guaranteed even to FMTs (fast moving terminals) by the operation of an LMC (logical macro cell) and parallel polling. The mechanism easily allows 5Mbps packet transfer to terminals with speed of 100km/h. To enable synchronization of parallel polling, ACK of polling is multicast to BSs in the same LMC through the backbone network. The time the polling ACK multicast transmitted in the terrestrial network is a significant factor that will decide the throughput of mobile terminals. Owing to PON (passive optical network), which constructs the terrestrial network of MM-MAN, parallel polling and LMC can be done easily. A key advantage of PON over MM-MAN is its high bandwidth broadcast functionality that can turn into multicast without vulnerability to its bandwidth is used to enable parallel polling and the LMC operation. In the case of EPON with static slot allocation scheme, ACK multicast time depends on the grant time for each ONU and the number of ONUs connected to an OLT on one fiber. From our evaluation, if the ACK multicast delivered in PON from 0.5 to 4ms, the throughput that a mobile terminal can get is from 25Mbps to 5Mbps for the case of 1500bytes of packet size. The PON system can work adaptively to fasten ACK multicast if the number of ONUs on which a base station stands connected to an optical line terminal (OLT) is 16.","PeriodicalId":148533,"journal":{"name":"2006 First International Conference on Communications and Electronics","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128709909","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 Hashing-Based Scheme for RIB Management 一种高效的基于哈希的RIB管理方案

2006 First International Conference on Communications and Electronics Pub Date : 2006-10-01 DOI: 10.1109/CCE.2006.350885

Feng Zhao, Yaping Liu, Baosheng Wang, Zexin Lu

{"title":"An Efficient Hashing-Based Scheme for RIB Management","authors":"Feng Zhao, Yaping Liu, Baosheng Wang, Zexin Lu","doi":"10.1109/CCE.2006.350885","DOIUrl":"https://doi.org/10.1109/CCE.2006.350885","url":null,"abstract":"In consideration of the exact matching characteristic of RIB lookups, we explore the applicability of hashing-based approaches for RIB management and evaluate their performance. Using real routing prefixes, we compare the efficiency of six different hash approaches mentioned in some papers about IP lookups: bit extraction from the routing prefix, CRC16 (cyclic redundancy checking polynomials), CRC32, Fletcher checksum, folding of prefix octets for using the exclusive-or operation and multiplication. This is the first comprehensive study of their performance using real core routing tables. We find that extracting the least significant bits from the routing prefix is a very efficient hash approach for RIB management. Then a RIB management scheme based on this hash approach is proposed. We use separate chaining as the collision resolution strategy, while not suffering from malloc/free overhead for frequent insertion or deletion. To keep the memory storage moderate, we set the hash table sizes based on the distribution of prefix lengths because it is not expected to change significantly with time. Through simulation, we find that this scheme can achieve very fast updates and fast lookups for routing prefixes while keep the memory storage moderate.","PeriodicalId":148533,"journal":{"name":"2006 First International Conference on Communications and Electronics","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130379392","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

Support Vector Classification Strategies for Localization in Sensor Networks 传感器网络定位的支持向量分类策略

2006 First International Conference on Communications and Electronics Pub Date : 2006-10-01 DOI: 10.1109/CCE.2006.350857

D. Tran, T. Nguyen

引用次数: 12

An Interative Joint Channel Estimation and Symbol Detection Algorithm Based on Prediction for OFDM Systems 一种基于预测的OFDM系统交互式联合信道估计和符号检测算法

2006 First International Conference on Communications and Electronics Pub Date : 2006-10-01 DOI: 10.1109/CCE.2006.350805

Zhang Peng, Bi Guangguo, Jin Xiu-feng, Yu Xiaohui

引用次数: 0