A channel assignment algorithm via conflict shifting for distributed cognitive networks

Channel assignment is a challenge for distributed cognitive networks due to spectrum mobility and lack of centralized entity. We present a dynamic and efficient algorithm via conflict shifting, referred as Shifting-based Channel Assignment (SCA). In this algorithm, the system was modeled with a conflict graph, and users cannot assign the channels that primary users (legacy users) and neighbors already occupied. In order to eliminate the conflicts between neighbors efficiently, secondary users (unlicensed users) try to transfer them through a straight path to the boundary, where conflicts are easier to solve as there are less neighbors for boundary users. Actions in one shift are executed in slots, and users act in a synchronous and separated manner. As a result, some of the conflicting channels are avoid from directly abandoned, and for this, utility of the entire network can be improved. Simulation results show that the proposed algorithm can provide similar utility performance while obviously reducing the communication cost than bargaining-base algorithms. In small scale networks with low user mobility (under 20%), it reduces 50% of the communication overhead than the later.     

Algorithm design for a class of base station location problems in sensor networks

Base station placement has significant impact on sensor network performance. Despite its significance, results on this problem remain limited, particularly theoretical results that can provide performance guarantee. This paper proposes a set of procedure to design (1− ε) approximation algorithms for base station placement problems under any desired small error bound ε > 0. It offers a general framework to transform infinite search space to a finite-element search space with performance guarantee. We apply this procedure to solve two practical problems. In the first problem where the objective is to maximize network lifetime, an approximation algorithm designed through this procedure offers 1/ε² complexity reduction when compared to a state-of-the-art algorithm. This represents the best known result to this problem. In the second problem, we apply the design procedure to address base station placement problem when the optimization objective is to maximize network capacity. Our (1− ε) approximation algorithm is the first theoretical result on this problem. Yi Shi received his B.S. degree from University of Science and Technology of China, Hefei, China, in 1998, a M.S. degree from Institute of Software, Chinese Academy of Science, Beijing, China, in 2001, and a second M.S. degree from Virginia Tech, Blacksburg, VA, in 2003, all in computer science. He is currently working toward his Ph.D. degree in electrical and computer engineering at Virginia Tech. While in undergraduate, he was a recipient of Meritorious Award in International Mathematical Contest in Modeling and 1997 and 1998, respectively. His current research focuses on algorithms and optimizations for wireless sensor networks, wireless ad hoc networks, UWB-based networks, and SDR-based networks. His work has appeared in journals and highly selective international conferences (ACM Mobicom, ACM Mobihoc, and IEEE Infocom). Y. Thomas Hou received the B.E. degree from the City College of New York in 1991, the M.S. degree from Columbia University in 1993, and the Ph.D. degree from Polytechnic University, Brooklyn, New York, in 1998, all in Electrical Engineering. Since Fall 2002, he has been an Assistant Professor at Virginia Tech, the Bradley Department of Electrical and Computer Engineering, Blacksburg, VA. His current research interests are radio resource (spectrum) management and networking for software-defined radio wireless networks, optimization and algorithm design for wireless ad hoc and sensor networks, and video communications over dynamic ad hoc networks. From 1997 to 2002, Dr. Hou was a Researcher at Fujitsu Laboratories of America, Sunnyvale, CA, where he worked on scalable architectures, protocols, and implementations for differentiated services Internet, service overlay networking, video streaming, and network bandwidth allocation policies and distributed flow control algorithms. Prof. Hou is a recipient of an Office of Naval Research (ONR) Young Investigator Award (2003) and a National Science Foundation (NSF) CAREER Award (2004). He is a Co-Chair of Technical Program Committee of the Second International Conference on Cognitive Radio Oriented Wireless Networks and Communications (CROWNCOM 2007), Orlando, FL, August 1–3, 2007. He also was the Chair of the First IEEE Workshop on Networking Technologies for Software Defined Radio Networks, September 25, 2006, Reston, VA. Prof. Hou holds two U.S. patents and has three more pending. Alon Efrat earned his Bachelor in Applied Mathematics from the Technion (Israel’s Institute of Technology) in 1991, his Master in Computer Science from the Technion in 1993, and his Ph.D in Computer Science from Tel-Aviv University in 1998. During 1998–2000 he was a Post Doctorate Research Associate at the Computer Science Department of Stanford University, and at IBM Almaden Research Center. Since 2000, he is an assistant professor at the Computer Science Department of the University of Arizona. His main research areas are Computational Geometry, and its applications to sensor networks and medical imaging.     

Power optimization for maximum channel capacity in MIMO relay system

Introducing multiple-input multiple-output (MIMO) relay channel could offer significant capacity gain.And it is of great importance to develop effective power allocation strategies to achieve power efficiency and improve channel capacity in amplify-and-forward relay system.This article investigates a two-hop MIMO relay system with multiple antennas in relay node (RN) and receiver (RX).Maximizing capacity with antenna selection (MCAS) and maximizing capacity with eigen-decomposition (MCED) schemes are proposed to efficiently allocate power among antennas in RN under first and second hop limited scenarios.The analysis and simulation results show that both MCED and MCAS can improve the channel capacity compared with uniform power allocation (UPA) scheme in most of the studied areas.The MCAS bears comparison with MCED with an acceptable capacity loss, but lowers the complexity by saving channel state information (CSI) feedback to the transmitter (TX).Moreover, when the RN is close to RX, the performance of UPA is also close to the upper bound as the performance of first hop is limited.     

一种基于多Agent的Web数据挖掘方法

基于多Agent的数据挖掘技术,不仅能够针对不同的Web数据综合采用不同的挖掘算法,而且可以在各站点进行并行挖掘,避免Web通信量过载。在简述Agent技术和Web数据挖掘技术的基础上,结合多Agent和Web数据挖掘,设计出一种新型数据挖掘模型,且进一步阐述了该模型,并做了一些分析测试。结果证明,该方法能有效提高Web数据挖掘的速度、准确率和覆盖率,提高了数据利用率。     

宽带无线TDMA系统的自适应调制技术

无线多媒体业务的快速增长促进了宽带无线ＴＤＭＡ通信系统的研究和开发,宽带无线ＴＤＭＡ通信系统方面出现了一些新的技术和系统设计概念。讨论宽带无线ＴＤＭＡ系统中采用的自适应调制技术。     

ATM支持中低速话音业务的新方案

时延和效率问题是ＡＴＭ不能很好地支持中、低速话音业务的关键,因此,ＩＴＵ－Ｔ提出了新型ＡＡＬ２规程－组合信元技术。ＡＡＬ２规程的基本思想是用一个ＡＴＭ连接支持多个ＡＡＬ２用户信息流,从而减少时延。ＡＡＬ２由公共部分子层（ＣＰＳ）和业务特定会聚子层（ＳＳＣＳ）组成,其中面向话音应用的ＳＳＣＳ是中、低速话音业务解决方案的核心,文中对其功能、业务、等时同步问题的解决等作了详细介绍。最后,还介绍了有关标准     

三网融合技术值得注意的几个问题

三网融合正在积极推进,其技术选择受到各方关注,为此而探讨几个主要问题：借助三网融合,展开适度竞争,有利于改善我国的网络环境,有线电视业参与三网融合竞争的基本条件;非对称DOC-SIS/HFC网络结构更有利于三网融合增值业务开发,Cable Modem和ADSL是当前宽带接入的主流技术,Cable Modem接入技术将在宽带市场竞争中胜出,而EPON＋EoC并非网络双向改造的最佳方案。针对有关的指导性文件,阐述相对固定的信道带宽更有利于有线电视联网和用户接入,提出两种技术与经济效益更好的方法,以增加传输容量,较8n（MHz）方式变更信道带宽更先进更合理。     

Exploiting cooperative diversity with non-orthogonal multiple access over slow fading channel

Non-orthogonal multiple access (NOMA) has attracted a significant attention to the research community as a potential candidate for 5G or future radio access. This article presents a NOMA-based cooperative network where a transmitter considered as a base station communicates simultaneously with two users treating as a far user and a near user via the help of a half-duplex decode-and-forward relay. We investigate the outage probability and the outage capacity of the proposed network over independent Rayleigh slow fading channels. Closed-form expressions of the outage probabilities are derived for both users. Approximate outage capacity of the users are also investigated at high signal to noise ratio regime. It has been shown that the proposed cooperative NOMA can achieve superior performance compared to the non-cooperative NOMA in terms of outage probability. The tightness between the simulation and theoretical results confirms the efficiency of the proposed protocol.     

有线电视机房UPS电源的配置

有线电视分机房在配置UPS电源时,要根据设备要求和负载大小确定UPS电源的类型和容量;再根据后备延时时间计算电池的容量和数量。同时介绍了UPS电源在安装时的注意事项、运行环境、日常维护以及远程监控。     

半速率优化策略研究

论述了使用半速率技术解决突发性话务量时可能碰到的一些问题,北京联通半速率信道的分配原则、使用策略及一些经验设置,以及结合网优支撑系统如何进行半速率策略的优化,同时,给出了北京联通半速率策略优化后的效果。